Data Hiding with Tree Based Parity Check
In this paper, we propose a novel algorithm namely tree based parity check (TBPC) that can be applied to most of the existing data hiding algorithms to achieve improvement in visual quality. In data hiding process, distortion is created when the original image is modified. Most existing data hiding algorithms try to minimize the visual artifacts introduced by the modifications. The proposed algorithm tries to reduce the probability of modifying the original host image. Theoretical analysis and experimental results are given in this paper. Both measures suggest that an improvement in visual quality is achieved in the watermarked image.