Histogram-oriented watermarking algorithm: colour image watermarking scheme robust against geometric attacks and signal processing

Lin, Chang‐Hua; Chan, Din-Yuen; Su, Hsin-Hsiang; Hsieh, Wen-Shyong

doi:10.1049/ip-vis:20050107

Cited by 39 publications

(31 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most widely studied approach to histogram-based watermarking is so-called exact histogram specification [4]- [6], where the histogram of the original image or a (randomly and secretly selected) sub-region of it is modified toward a target histogram, which is then used as the signature for watermark detection. However, exact histogram specification does not involve a secret embedding/detection key, and there are few other histogram-based watermarking algorithms which do.…”

Section: Related Workmentioning

confidence: 99%

Towards More Robust Commutative Watermarking-Encryption of Images

Schmitz

Grecos

et al. 2013

2013 IEEE International Symposium on Multimedia

View full text Add to dashboard Cite

Abstract-Histogram-based watermarking schemes are invariant against pixel permutations and can be combined with permutation-based ciphers. However, typical histogram-based watermarking schemes based on comparison of histogram bins are prone to de-synchronization attacks, where the whole histogram is shifted by a certain amount. In this paper we investigate the possibility of avoiding this kind of attacks by synchronizing the embedding and detection processes, using the mean of the histogram as a calibration point. The resulting watermarking scheme is resistant to three common types of shifts of the histogram, while the advantages of previous histogrambased schemes, especially commutativity of watermarking and permutation-based encryption, are preserved. I. INTRODUCTIONIt is well known that histogram-based watermarking schemes are resistant to permutations of image pixels. In particular, this implies robustness against rotation, scaling and translation (RST) of images. Recently, this fact has been utilized to devise a commutative watermarking-encryption (CWE) scheme by choosing a permutation cipher for encryption and a histogram-based scheme for watermarking [1]. However, typical histogram-based watermarking schemes like [1], [2] work by comparing selected histogram bins, where the selection process is controlled by a watermarking key. If the whole histogram is shifted by a small amount, i.e. by adding a small number to each pixel's value, the detector will use different bin pairs for extracting the embedded watermark and will produce wrong results. To overcome this problem, in the present paper, we extend the scheme described in [1] by deploying a synchronization process between embedder and detector that is based on the global mean of the histogram. A similar approach is used in the scheme [3], but this watermarking scheme does not use a sufficiently long secret watermarking key and has a limited capacity.The rest of the paper is organized as follows: In Section II we briefly summarize previous histogram-based watermarking algorithms. Section III describes the three types

show abstract

Section: Related Workmentioning

confidence: 99%

Towards More Robust Commutative Watermarking-Encryption of Images

Schmitz

Grecos

et al. 2013

2013 IEEE International Symposium on Multimedia

View full text Add to dashboard Cite

show abstract

“…The most widely studied approach to histogram based watermarking is so-called exact histogram specification [8][9][10][11], where the histogram of the original image or a (randomly and secretly selected) sub-region of it is modified toward a target histogram, which is then used as the signature for watermark detection. The histogram is not limited to be the one built from pixel values, but can also be a 2-D or 3-D histogram built from other features of the image [9][10][11].…”

Section: Histogram Based Watermarking Schemesmentioning

confidence: 99%

“…The histogram is not limited to be the one built from pixel values, but can also be a 2-D or 3-D histogram built from other features of the image [9][10][11]. To minimize visual quality distortion caused by the histogram manipulation, an optimization model can be used to find a globally optimum solution as demonstrated in [10].…”

Section: Histogram Based Watermarking Schemesmentioning

confidence: 99%

Communications and Multimedia Security

Chadwick

Decker

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We propose a new approach to commutative watermarkingencryption (CWE). A permutation cipher is used to encrypt the multimedia data, which leaves the global statistics of the multimedia data intact. Therefore, any non-localized watermarking scheme that depends only on global statistics of the multimedia data can be combined with the permutation cipher to form a CWE scheme. We demonstrate this approach by giving a concrete implementation, which manipulates the global histogram to achieve watermark embedding/detection.

show abstract

“…Xiang et al [2] propose an invariant image watermarking by using the histogram shape and mean in the Gaussian filtered low-frequency component of images. Lin et al [3] present a histogramoriented blind watermarking algorithm to resist various attacks. However, they cannot resist local transformations.…”

Section: Introductionmentioning

confidence: 99%

A localized geometric-distortion resilient digital watermarking scheme using two kinds of complementary feature points

Wang

2013

2013 IEEE International Conference on Multimedia and Expo Workshops (ICMEW)

View full text Add to dashboard Cite

We propose a novel localized geometric-distortion resilient digital watermarking scheme to embed two invisible messages to images. Our scheme utilizes local circular region-(LCR) based and block DCT-based techniques to hide two watermarks in two kinds of regions and extract these two embedding sequences from their individual regions. Specifically, we use the histogram and mean statistically independent of pixel positions to embed one watermark in LCRs, whose centers are SIFT feature points that are robust against various attacks. We also use Watson's DCT-based visual model to embed the other watermark in several rich textured regions not covered by any embedding LCR. Our experimental results demonstrate the proposed system achieves better performance than several peer systems in the literature.Index Terms-Digital watermarking scheme, local circular region, Watson's DCT-based visual model

show abstract

Histogram-oriented watermarking algorithm: colour image watermarking scheme robust against geometric attacks and signal processing

Cited by 39 publications

References 13 publications

Towards More Robust Commutative Watermarking-Encryption of Images

Towards More Robust Commutative Watermarking-Encryption of Images

Communications and Multimedia Security

A localized geometric-distortion resilient digital watermarking scheme using two kinds of complementary feature points

Contact Info

Product

Resources

About