An Adaptive Multi-objective Image Watermarking Scheme for QIM Using NSGA-II
3
Citation
14
Reference
10
Related Paper
Citation Trend
Abstract:
A new robust watermarking method, named QIM-NSGA-II, is proposed based on the non-dominated sorting genetic algorithm II (NSGA-II) and quantization index modulation (QIM). The NSGA-II algorithm is utilized to find out the optimal embedding position and adaptive quantization step for embedding watermark into a carrier image in the framework of QIM. In the process of searching an optimal solution, the trade-off between robustness and image fidelity of the watermarked image is represented by the Pareto-Front discovered by NSGA-II. Experiment results show that the proposed scheme has a good robustness against common attacks, such as amplitude scaling, noise, filtering, cropping, JPEG compression.Keywords:
Robustness
Digital Watermarking Alliance
Cite
Citations (8)
Digital watermarking is a well known technique used for copy rights protection of multimedia data. The biggest disadvantage of general watermarking schemes is that they permanently distort original data. Reversible watermarking techniques allow the restoration of original data, after watermark detection. A blind robust and reversible watermarking algorithm based on CDMA is proposed in this paper. Watermark is arithmetically added in the proposed CDMA based watermarking scheme. Therefore, it is not difficult to remove it after detection. In proposed algorithm, spreaded watermark is added to frequency coefficients in Discrete Wavelet domain. Watermark is extracted by using spreading codes only. After extraction, the watermark can be removed from watermarked data only by using same spreading codes. Furthermore, the original watermark is not required during watermark removal process.
Cite
Citations (5)
In this paper, a watermark pattern design approach is proposed to combat the general geometric attacks to watermarking systems. Geometric attacks pose a major threat to most existing watermarking systems by destroying the synchronization between the watermark patterns and the watermarked images. We propose to shape the watermark patterns so that the output of the correlation-type demodulator is in the shape of a specified function. Such a watermark pattern shaping can be used directly to combat moderate geometric attack, or used with other watermark schemes to improve decoding performance. A design example of the shaping filter is presented. Experiments show that the proposed watermarking scheme can survive survive (1999) bending attack to a wide range.
Watermarking attack
Cite
Citations (4)
In a recent paper by Tan and Liu , a watermarking algorithm for digital images based on singular value decomposition (SVD) is proposed. This comment demonstrates that this watermarking algorithm is fundamentally flawed in that the extracted watermark is not the embedded watermark but determined by the reference watermark. The reference watermark generates the pair of SVD matrices employed in the watermark detector. In the watermark detection stage, the fact that the employed SVD matrices depend on the reference watermark biases the false positive detection rate such that it has a probability of one. Hence, any reference watermark that is being searched for in an arbitrary image can be found. Both theoretical analysis and experimental results are given to support our conclusion.
Singular value
Value (mathematics)
Cite
Citations (187)
For most watermarking methods, preserving the synchronization between the watermark embedded in a digital data (image, audio or video) and the watermark detector is critical to the success of the watermark detection process. Many digital watermarking attacks exploit this fact by disturbing the synchronization of the watermark and the watermark detector, and thus disabling proper watermark detection without having to actually remove the watermark from the data. Some techniques have been proposed in the literature to deal with this problem. Most of these techniques employ methods to reverse the distortion caused by the attack and then try to detect the watermark from the repaired data. In this paper, we propose a watermarking technique that is not sensitive to synchronization. This technique uses a structured noise pattern and embeds the watermark payload into the geometrical structure of the embedded pattern.
Payload (computing)
Distortion (music)
Cite
Citations (15)
Presented a multipurpose image watermarking algorithm.The watermarking algorithm embedded both robust watermark and fragile watermark to achieve the goal of image content authentication and alteration hint simultaneously.The experimental results demonstrated that the robust watermark was robust to many attacks and the fragile watermark was fragile,so it has realized the image copyright protection and alteration hint.It also realized the blind detection of original watermarking effectively.
Realization (probability)
Cite
Citations (1)
A robust,restorable dual watermarking technology is proposed in this paper.It adopts two new technology of self-restoring and virtual watermark in dual watermarking technology.The new dual watermarking technology can effectively reinforce the watermark's robustness and improving watermark's transparency in the watermarked images.Self-restoring technology takes advantage of the characteristic of the dual watermarking algorithm to set up a mapping between two watermarks.The mapping enables the self-restoring technology to restore the damaged watermarks.Virtual watermark is a new type of watermark and it isn't embedded in images but can be detected.It can improve watermark's transparency in the watermarked images.
Robustness
Cite
Citations (0)
An improved watermarking algorithm is proposed to deal with public watermarking verification and large information reserves.This algorithm is based on two dimensional discrete Fourier transform(2DFT).The phase of the reference watermark is shifted randomly in the 2DFT domain to obtain many embedding watermarks.They are correlated with one another and have the same correlation with the reference one.To decide the presence of the watermark,the detector compares the correlation coefficient with the decision threshold.The simulation results show that with the proper threshold,the reference watermark can be used to detect the embedding watermark,but other embedding watermarks cannot.The publication of reference watermark does not compromise the embedding one.This algorithm realizes the public verification of watermark,and needs only one reference watermark for detecting embedding watermarks,which decreases the watermark storage.
Cite
Citations (0)
Distortion (music)
Robustness
Information protection policy
Cite
Citations (10)
Research in digital watermarking has progressed along two paths. While new watermarking technologies are being developed, some researchers are also investigating different ways of attacking digital watermarks. Common attacks to watermarks usually aim to destroy the embedded watermark or to impair its detection. In this paper we propose a conceptually new attack for digitally watermarked images. The proposed attack does not destroy an embedded watermark, but copies it from one image to a different image. Although this new attack does not destroy a watermark or impair its detection, it creates new challenges, especially when watermarks are used for copyright protection and identification. The process of copying the watermark requires neither algorithmic knowledge of the watermarking technology nor the watermarking key. The attack is based on an estimation of the embedded watermark in the spatial domain through a filtering process. The estimate of the watermark is then adapted and inserted into the target image. To illustrate the performance of the proposed attack we applied it to commercial and non-commercial watermarking schemes. The experiments showed that the attack is very effective in copying a watermark from one image to a different image. In addition, we have a closer look at application dependent implications of this new attack.
Copying
Watermarking attack
Copy protection
Cite
Citations (143)