&lt;title&gt;Image-feature-based robust digital watermarking scheme&lt;/title&gt;

Tang, Chih‐Wei; Hang, Hsueh-Ming

doi:10.1117/12.465318

Cited by 36 publications

(74 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Tang and Hang [13] use intensity-based feature extraction and image normalization for watermark synchronization. They first extract feature points using the Mexican Hat wavelet scale interaction method, which determines feature points by identifying changes in intensity in the image.…”

Section: Feature Point Based Synchronizationmentioning

confidence: 99%

Geometrically invariant watermarking: synchronization through circular Hough transform

Lee

2007

Multimed Tools Appl

View full text Add to dashboard Cite

This paper addresses a geometrically invariant watermarking method for digital images. Most previous watermarking algorithms perform weakly against geometric distortions, which desynchronize the location for the inserted watermark. Watermark synchronization, which is a process for finding the location for watermark insertion and detection, is crucial for robust watermarking. In this paper, we propose a watermarking method that is robust to geometric distortions. In order to synchronize the location for watermark insertion and detection, we use circular Hough transform, which extracts circular features that are invariant to geometric distortions. The circular features are then watermarked using additive way on the spatial domain. Our method belongs to the category of blind watermarking techniques, because we do not need the original image during detection. Experimental results support the contention that our method is useful and considerably robust against both geometric distortion attacks and signal processing attacks as listed in Stirmark 3.1.

show abstract

Section: Feature Point Based Synchronizationmentioning

confidence: 99%

Geometrically invariant watermarking: synchronization through circular Hough transform

Lee

2007

Multimed Tools Appl

View full text Add to dashboard Cite

show abstract

“…In this study, Voloshynovskiy et al's block-based image watermarking approach [14] was chosen as the benchmark due to its strong robustness and computational simplicity. However, we would like to particularly emphasize that the proposed scheme is readily applied to other watermarking algorithms that implement the similar principle of embedding multiple redundant watermarks [2], [9], [12]. Wiener filter was used to perform denoising-based blind watermark extraction.…”

Section: Resultsmentioning

confidence: 99%

“…Here, we shall take the block-based multiple self-reference watermarking method [14] as an example to explain the performance of our algorithm in removing the hidden watermarks. However, it should be noted that our algorithm can be extended to other methods [2], [9], [12] that adopt the similar concept of multiple redundant watermark embedding.…”

Section: A Near-perfect Cover Data Recovery Algorithmmentioning

confidence: 99%

“…In the past few years, image watermarking with resistance to geometrical attacks has received much attention because even a slight geometrical distortion may disorder the hidden watermark bits and disable watermark detection. In view of this fact, some researches [2], [12], [9], [14] inserted multiple redundant watermarks into an image in the hope that robustness could be maintained as long as partial watermarks existed. Commonly, various kinds of image units, such as blocks [14], meshes [2], or disks [12], are extracted as carriers for embedding.…”

Section: Introductionmentioning

confidence: 99%

“…In view of this fact, some researches [2], [12], [9], [14] inserted multiple redundant watermarks into an image in the hope that robustness could be maintained as long as partial watermarks existed. Commonly, various kinds of image units, such as blocks [14], meshes [2], or disks [12], are extracted as carriers for embedding. Taking advantage of this unique characteristic, we propose to treat each image unit in an image like a frame in a video; in this way, collusion attacks can be equally applied to those image watermarking methods that employ a multiple redundant watermark embedding strategy.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Near-Perfect Cover Image Recovery Anti-Multiple Watermark Embedding Approaches

Hsu

2005 IEEE International Symposium on Circuits and Systems

View full text Add to dashboard Cite

Abstract-Robustness is a critical requirement for a watermarking scheme to be practical. Especially, in order to resist geometric distortions a common way is to locally insert multipleredundant watermarks in the hope that partial watermarks could still be detected. However, there exist watermark-estimation attack (WEA), such as the collusion attack, that can remove watermarks while making the attacked data further transparent to its original. Another kind of attack is the copy attack, which can cause protocol ambiguity within a watermarking system. The aim of this paper is to propose an efficient cover data recovery attack, which is more powerful than the conventional collusion attack. To this end, we begin by gaining insight into the WEA, leading to formal definitions of optimal watermark estimation and near-perfect cover data recovery. Subject to these definitions, an exquisite collusion attack is derived. Experimental results verify the effectiveness of the proposed watermark estimation and recovery algorithm.

show abstract

Digital Watermarking Using Fractal Coding

Channapragada

Prasad

2015

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

This paper presents a watermarking method using fractals. In the method discussed here, the host image is encoded by the proposed fractal coding method. To embed the watermark evenly over the whole host image, specific Range blocks are selected. Then, the scrambled watermark is inserted into the selected Range blocks. Finally, the watermarked image is obtained by the fractal decoding method. Simulation results have proven the imperceptibility of the proposed scheme and shown the robustness against various attacks.

show abstract

<title>Image-feature-based robust digital watermarking scheme</title>

Cited by 36 publications

References 0 publications

Geometrically invariant watermarking: synchronization through circular Hough transform

Geometrically invariant watermarking: synchronization through circular Hough transform

Near-Perfect Cover Image Recovery Anti-Multiple Watermark Embedding Approaches

Digital Watermarking Using Fractal Coding

Contact Info

Product

Resources

About