Abstract
In this paper, we propose an efficient method for image tamper detection and recovery. We separate the image into several blocks, and share a block information to two other blocks. It means, there have two copies of one block information for each non-overlapping block. In implementing, we improve Lee's algorithm of watermark embedding, especially when the tampered area is a rounded region or a text field, and our scheme has higher PSNR value than Lee's method. During image recovery, we use the image inpainting approach to fill the tampered region of whole image. The experimental result shows that our scheme is effective than Lee's interpolation method.
Highlights
In the last decade, there has been a rapid growth in using digital image data
We use the Dilation algorithm to define the tampered region as invalid blocks. This approach replaces the general hierarchical detection [4], and effective to detect tampered from a rounded region or a text field
In (b), we provided of tamper detection method that described as follows: First, we check the last two bit of 12-bit watermark for each block that we embedded from previous flowchart (a), and marks those fault blocks as the invalid region
Summary
People can modify a copyrighted image data by an image-processing program For this reason, how to efficiently and accurately detection of tampered region has more focus on this research. In [3], it proposed a method that uses different number of space to embed non-smooth and smooth blocks Another different way in image recovery that uses hierarchical image tamper detection, it proposes in [4]. We use the Dilation algorithm to define the tampered region as invalid blocks This approach replaces the general hierarchical detection [4], and effective to detect tampered from a rounded region or a text field. If a large tampered region has coming and could not be recovered by watermark In this case, we use the texture synthesis method to overcome this problem. The rest of paper is organized as follows: Section 2 described the proposed scheme; Section 3 shows the experimental results; Section 4 summarizes this paper
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.