Reversible Watermarking Based On Advanced Histogram Shifting


The KIPS Transactions:PartC, Vol. 14, No. 1, pp. 39-44, Feb. 2007
10.3745/KIPSTC.2007.14.1.39,   PDF Download:

Abstract

In this paper, we propose a reversible watermarking method to recover an original image after the watermark has been extracted. Most watermarking algorithms cause degradation of image quality in original digital content in the process of embedding watermark. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed method, we utilize histogram shifting concept and Location Map structure. We could solve the Filp-Flop problem by using Location Map structure and enlarge the information embedding capacity by embedding recursively. Experimental results demonstrate that the embedding information as large as 120k bits can be realized while the invisibility as high as 41dB can be maintained.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Hwang, J. W. Kim, J. U. Choi, "Reversible Watermarking Based On Advanced Histogram Shifting," The KIPS Transactions:PartC, vol. 14, no. 1, pp. 39-44, 2007. DOI: 10.3745/KIPSTC.2007.14.1.39.

[ACM Style]
Jin Ha Hwang, Jong Weon Kim, and Jong Uk Choi. 2007. Reversible Watermarking Based On Advanced Histogram Shifting. The KIPS Transactions:PartC, 14, 1, (2007), 39-44. DOI: 10.3745/KIPSTC.2007.14.1.39.