Abstract

In 2007, Chan and Chang proposed an image authentication method using the Hamming code technique. The parity check bits were produced from pixels by using the Hamming code technique, and the produced bits were embedded in other pixels. When recovering, the method had to predict the value of the most-significant bit of each tampered pixel first. Then, the tampered pixel was able to be recovered by referring to the predicted bit and its parity check bits. However, using the most-significant bit is unsuitable because of the risk of making an incorrect prediction. In this paper, the parity check bits are produced from pixels whose bits have been rearranged. This way, the value of the most-significant bit of each tampered pixel can be determined according to its parity check bits. The recovery procedure is also modified to accommodate the rearranging procedure. The experimental results show that the proposed method has a better ability to recover the tampered areas, compared with Chan and Chang’s method. Moreover, the quality of the authenticated images of the proposed method is also higher than that of Chan and Chang’s method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.