a fragile watermarking by hamming code on distributed pixels with perfect recovery for small tampers

Fragile watermarking is the task of embedding a watermark in a media (an image in this paper) such that even small changes, called tamper, can be detected or even recovered to prevent unauthorized alteration. a well-known category of spatial fragile watermarking methods is based on embedding the watermark in the least significant bits of the image to preserve the quality. in addition, hamming code is a coding algorithm in communication that transmits the data-bits by augmenting some check-bits in order to exactly detect and recover single-bit modifications. this property is previously used to detect and perfectly recover the images modified by small tampers less than a quarter of the image in diameter. to achieve this goal, the hamming code is applied on a distributed pixel, bits of which are gathered from sufficient far pixels in the image. it guarantees that such tampers can toggle at most one bit of each distributed hamming code that is recoverable. it was the only guaranteed perfect reconstruction method of small tampers, based on our knowledge. in this paper, the method has been extended to support distortion in two bits of a hamming code by use of common structures of distributed codes. it leads to guarantee recovery of tampers less than half of the image in width and height. according to the experimental results, the proposed method achieved better performance, in terms of recovering the tampered areas, in comparison to state-of-the-art.