Correlation-based Robust Blind Watermarking


The KIPS Transactions:PartB , Vol. 10, No. 5, pp. 479-484, Aug. 2003
10.3745/KIPSTB.2003.10.5.479,   PDF Download:

Abstract

We propose a blind watermarking method that embeds a binary pseudo-random sequence (watermarks), {-1, 1}, into wavelet dc components, while most watermarking techniques embed watermarks in the middle frequency range for robustness and fidelity. In our scheme, the watermarks are embedded into particular locations to be selected by a key, where some watermark embeddings are skipped to avoid severe degradation in quality. Our robustness is compared to some results registered to the ChechMark [1] that is one of the most popular benchmarking tools.,


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. S. Hyeon and S. Y. Seog, "Correlation-based Robust Blind Watermarking," The KIPS Transactions:PartB , vol. 10, no. 5, pp. 479-484, 2003. DOI: 10.3745/KIPSTB.2003.10.5.479.

[ACM Style]
Ju Sang Hyeon and Seo Yong Seog. 2003. Correlation-based Robust Blind Watermarking. The KIPS Transactions:PartB , 10, 5, (2003), 479-484. DOI: 10.3745/KIPSTB.2003.10.5.479.