Distributed multiresolution discrete fourier transform and its application to watermarking
01 Mar 2010-International Journal of Wavelets, Multiresolution and Information Processing (World Scientific Publishing Company)-Vol. 08, Iss: 02, pp 225-241
TL;DR: This paper proposes a newer version of Fourier transform, namely, Distributed Multiresolution Discrete Fourier Transform (D-MR-DFT) and its application in digital watermarking and shows better visual imperceptibility and resiliency of the proposed scheme against intentional or unintentional variety of attacks.
Abstract: The Fourier transform is undoubtedly one of the most valuable and frequently used tools in signal processing and analysis but it has some limitations. In this paper, we rectify these limitations by proposing a newer version of Fourier transform, namely, Distributed Multiresolution Discrete Fourier Transform (D-MR-DFT) and its application in digital watermarking. The core idea of the proposed watermarking scheme is to decompose an image into four frequency sub-bands using D-MR-DFT and then singular values of every sub-band are modified with the singular values of the watermark. The experimental results show better visual imperceptibility and resiliency of the proposed scheme against intentional or unintentional variety of attacks.
Citations
More filters
TL;DR: A novel biometrically generated keys in the embedding process of a gray-scale watermark using a newly proposed mathematical transform, namely the fractional dual tree complex wavelet transform (FrDT-CWT), and singular value decomposition (SVD) are used.
67 citations
TL;DR: A novel, yet simple, watermarking algorithm for image authentication is proposed using fractional wavelet packet transform (FRWPT) via singular value decomposition (SVD), based on embedding in the singular values (luminance) of the host image.
44 citations
TL;DR: A novel image fusion algorithm based on framelet transform based on texture while exploiting the human visual system characteristics can preserve more details in source images and further improve the quality of fused image.
Abstract: In this paper, a novel image fusion algorithm based on framelet transform is presented. The core idea is to decompose all the images to be fused into low and high-frequency bands using framelet transform. For fusion, two different selection strategies are developed and used for low and high-frequency bands. The first strategy is adaptive weighted average based on local energy and is applied to fuse the low-frequency bands. In order to fuse high-frequency bands, a new strategy is developed based on texture while exploiting the human visual system characteristics, which can preserve more details in source images and further improve the quality of fused image. Experimental results demonstrate the efficiency and better performance than existing image fusion methods both in visual inspection and objective evaluation criteria.
29 citations
TL;DR: Experimental results and comparison with existing algorithms show the robustness and the better performance of the proposed algorithm.
Abstract: In this paper, a wavelet packet transform (WPT)-based robust video watermarking algorithm is proposed. A visible meaningful binary image is used as the watermark. First, sequent frames are extracted from the video clip. Then, WPT is applied on each frame and from each orientation one sub-band is selected based on block mean intensity value called robust sub-band. Watermark is embedded in the robust sub-bands based on the relationship between wavelet packet coefficient and its 8-neighbour (D
8) coefficients considering the robustness and invisibility. Experimental results and comparison with existing algorithms show the robustness and the better performance of the proposed algorithm.
23 citations
Cites background from "Distributed multiresolution discret..."
...According to human visual system, a watermarking scheme is good and effective if we cannot differentiate the original and watermarked video (or images) histogram (Shannon 1949; Bhatnagar & Raman 2010)....
[...]
TL;DR: The definition and implementation of redundant fractional wavelet transform is proposed followed by its use in watermark embedding and a reliable extraction process is developed for the extraction of both the watermarks from the possibly distorted image.
22 citations
References
More filters
TL;DR: A novel watermarking algorithm based on singular value decomposition (SVD) is proposed and results show that the newwatermarking method performs well in both security and robustness.
Abstract: Digital watermarking has been proposed as a solution to the problem of copyright protection of multimedia documents in networked environments. There are two important issues that watermarking algorithms need to address. First, watermarking schemes are required to provide trustworthy evidence for protecting rightful ownership. Second, good watermarking schemes should satisfy the requirement of robustness and resist distortions due to common image manipulations (such as filtering, compression, etc.). In this paper, we propose a novel watermarking algorithm based on singular value decomposition (SVD). Analysis and experimental results show that the new watermarking method performs well in both security and robustness.
978 citations
TL;DR: This paper proposes a wavelet-tree-based blind watermarking scheme for copyright protection that embeds each watermark bit in perceptually important frequency bands, which renders the mark more resistant to frequency based attacks.
Abstract: This paper proposes a wavelet-tree-based blind watermarking scheme for copyright protection. The wavelet coefficients of the host image are grouped into so-called super trees. The watermark is embedded by quantizing super trees. The trees are so quantized that they exhibit a large enough statistical difference, which will later be used for watermark extraction. Each watermark bit is embedded in perceptually important frequency bands, which renders the mark more resistant to frequency based attacks. Also, the watermark is spread throughout large spatial regions. This yields more robustness against time domain geometric attacks. Examples of various attacks will be given to demonstrate the robustness of the proposed technique.
329 citations
Additional excerpts
...(4) Perform inverse SVD, f new = Uθ S∗ θ V T θ ....
[...]
...(4) Obtain the extracted watermark as: W θ ext = UW S θ ext V T W ....
[...]
TL;DR: An overview of wavelet-based watermarking techniques available today can be found in this paper, where the authors provide an overview of the wavelet wavelet transform domain and its application in image compression.
Abstract: In this paper, we will provide an overview of the wavelet-based watermarking techniques available today. We will see how previously proposed methods such as spread-spectrum watermarking have been applied to the wavelet transform domain in a variety of ways and how new concepts such as the multi-resolution property of the wavelet image decomposition can be exploited. One of the main advantages of watermarking in the wavelet domain is its compatibility with the upcoming image coding standard, JPEG2000. Although many wavelet-domain watermarking techniques have been proposed, only few fit the independent block coding approach of JPEG2000. We will illustrate how different watermarking techniques relate to image compression and examine the robustness of selected watermarking algorithms against image compression.
302 citations
TL;DR: A chaos-based watermarking algorithm is developed in the wavelet domain for still images that can gain high fidelity and high robustness, especially under the typical attack of geometric operations.
Abstract: In this paper, a chaos-based watermarking algorithm is developed in the wavelet domain for still images. The wavelet transform is commonly applied for watermarking, where the whole image is transformed in the frequency domain. In contrast to this conventional approach, we apply the wavelet transform only locally. We transform the subimage, which is extracted from the original image, in the frequency domain by using DWT and then embed the chaotic watermark into part of the subband coefficients. As usual, the watermark is detected by computing the correlation between the watermarked coefficients and the watermarking signal, where the watermarking threshold is chosen according to the Neyman–Pearson criterion based on some statistical assumptions. Watermark detection is accomplished without using the original image. Simulation results show that we can gain high fidelity and high robustness, especially under the typical attack of geometric operations.
234 citations
"Distributed multiresolution discret..." refers methods in this paper
...(5) Perform inverse D-MR-DFT to construct the watermarked image, denoted by Fnew....
[...]
TL;DR: A hybrid nonblind scheme based on DWT and singular value decomposition (SVD) is presented, and it is shown that it is considerably more robust and reliable than a pure SVD-based scheme.
Abstract: Protection of digital multimedia content has become an increasingly important issue for content owners and service providers. As watermarking is identified as a major technology to achieve copyright protection, the relevant literature includes several distinct approaches for embedding data into a multimedia element. Because of its growing popularity, the discrete wavelet transform (DWT) is commonly used in recent watermarking schemes. In a DWT-based scheme, the DWT coefficients are modified with the data that represents the watermark. We present a hybrid nonblind scheme based on DWT and singular value decomposition (SVD). After decomposing the cover image into four bands (LL, HL, LH, and HH, where L stands for lowpass and H stands for highpass), we apply the SVD to each band, and modify the singular values of the cover image with the singular values of the visual watermark. Modification in all frequencies enables the development of a watermarking scheme that is robust to a wide range of attacks. We compare our hybrid algorithm with a pure SVD-based scheme, and show that it is considerably more robust and reliable.
185 citations