Reversible Watermarking: A comparative Study
Nikhil Dalshania1, Anand Bora2, Aditya Bhongle3
1Nikhil Dalshania, Department of Electronics & Telecommicotion, Sinhgad academy of Engineering, Pune (M.H), India.
2Anand Bora, Department of Electronics & Telecommicotion, Sinhgad academy of Engineering, Pune (M.H), India.
3Adhitya Bhongle, Students, Department of Electronics & Telecommicotion, Sinhgad academy of Engineering, Pune (M.H), India.
Manuscript received on 18 June 2012 | Revised Manuscript received on 25 June 2012 | Manuscript published on 30 June 2012 | PP: 156-158 | Volume-1 Issue-2, June 2012 | Retrieval Number: B0186041212/2012©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Considering the age of reversible watermarking which is just a decade to count, it has fetched enormous attention of researchers to boast of. Due to many researches in this field, it has become very difficult to judge an algorithm for a specific application. So a definite need arises to compare these algorithms on some criteria. In this paper, we present a comprehensive and competitive study of three basic algorithms which are reversible watermarking using data compression, Tian’s difference expansion and histogram bin shifting. We have compared these algorithms based on criteria like PSNR, embedding capacity and processing time.
Keywords: Reversible Watermarking, Compression, Difference Expansion, Histogram Bin Shifting, PSNR, Embedding Capacity, Processing Time.
Scope of the Article: Study and Experience Reports