Abstract
In this paper the large-capacity dynamic multiple watermarking algorithm based on Sudoku was proposed with two bit/pixel embedding capacity.The original image was divided into M×N pixels non-overlapping areas.Different watermarks with size of 2 M×N pixels were embedded into the corresponding areas.If the watermarked area was tampered,the watermark in this area could not be extracted correctly.At any time,any watermarks can be embedded into any area as long as the areas are non-overlapping.The experimental results show that the proposed algorithm has a larger watermarking embedding capacity and higher accuracy of tampered localization.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
