Stereo image coding via digital watermarking
01 Jul 2009-Journal of Electronic Imaging (International Society for Optics and Photonics)-Vol. 18, Iss: 3, pp 033012
TL;DR: A robust stereo-image coding algorithm using digital watermarking in fractional Fourier transform (FrFT) and singular value decomposition (SVD) to achieve stereo image security is presented.
Abstract: We present a robust stereo-image coding algorithm using digital watermarking in fractional Fourier transform (FrFT) and singular value decomposition (SVD). For the purpose of the security, the original (left stereo) image has been degraded and watermark (right disparity map) is embedded in the degraded image. This watermarked degraded stereo image is processed in an insecure channel. At the receiver's end, both the watermarked image (left stereo image) and watermark images are found by the decoding process. The use of the FrFT, SVD, and degradation process of the stereo image add much more complexity to decode the information about the stereo images and disparity map extraction. Moreover, processing of the watermarked image only provides the stereo as well as 3-D information of the scene/object. Experimental results show that the proposed algorithm is efficient to achieve stereo image security.
Citations
More filters
TL;DR: Experimental results show that the proposed algorithm can not only detect and locate tampers in stereoscopic image more accurately but also recover the tampered regions better, compared with other algorithms.
Abstract: We propose a new watermarking algorithm for stereoscopic image tamper detection and self-recovery in three-dimensional multimedia services. Initially, left and right views of stereoscopic image are divided into nonoverlapping 2×2 blocks in order to improve the accuracy of tamper localization in an image. As the left and right views of a stereoscopic image are not independent from each other but have an inter-view relationship, every block of a stereoscopic image is classified into matching block or nonmatching block and then block disparities are obtained. Both matching blocks in the left and right views have similar pixel values, so that fewer bits are allocated for recovery watermark generation, which can increase the quality of watermarked stereoscopic images. A hierarchical tamper-detection strategy with a four-level checkup is presented to improve the accuracy of tamper localization. Additionally, two copies of block (matching block and nonmatching block) information are embedded into the stereoscopic image, and it assures the quality of tampered recovery. For the nonmatching block recovery, two copies of the partner block are embedded into their chaotic mapping blocks, which supply the second chance for tamper recovery. For the matching block recovery, the inter-view relationship between tampers of left and right views supplies the third chance for tamper recovery. Experimental results show that the proposed algorithm can not only detect and locate tampers in stereoscopic image more accurately but also recover the tampered regions better, compared with other algorithms.
4 citations
01 Oct 2015
TL;DR: This work exploits binocular suppression by inserting watermark bits into different portions of the left and right image views, so that high quality in a region on one view suppresses the visibility of the watermark in the corresponding region of the other view.
Abstract: Digital watermarking algorithms for stereo image and video have been simple extensions of monoscopic watermarking methods to two views, and have not considered the aspects of the human visual system which are particular to stereo perception. One key aspect is binocular suppression, which says that high quality image data (for example with sharp edges) presented to one eye can suppress low quality information (for example, blurriness) which is simultaneously presented to the other eye, so that the combined subjective visual effect is one of high quality. We exploit this phenomenon by inserting watermark bits into different portions of the left and right image views, so that high quality in a region on one view suppresses the visibility of the watermark in the corresponding region of the other view. Tests with human observers confirm the visual superiority of the approach.
2 citations
Cites methods from "Stereo image coding via digital wat..."
...For 3D images, existing techniques are either view-based [1]-[8] or disparity-based [9]-[16]....
[...]
02 Dec 2013
TL;DR: A contourlet transform based watermarking scheme is proposed, which is robust against DIBR-based 2D-3D conversion and achieves better robustness and invisibility, which demonstrates that it is promising in 2D and 3D conversion applications.
Abstract: Nowadays with the success of 2D-3D applications, the copyright protection for such cases is becoming increasing important. In this paper, a contourlet transform based watermarking scheme is proposed, which is robust against DIBR-based 2D-3D conversion. In the proposed scheme, the contourlet transform is performed on the center image. Considering that the DIBR transform can be regarded as the horizontal direction movement, coefficients of the low-frequency after contourlet transform are quantized to embed the watermark. Experimental results show that the watermark can be extracted from the virtual left and right image correctly and stably. The proposed scheme achieves better robustness and invisibility, which demonstrates that it is promising in 2D-3D conversion applications.
1 citations
09 Jun 2011
TL;DR: The results show improvements due to the integration of the 3D visual mask in terms of Structural Similarity Metric (SSM) and Bit Error Rate (BER).
Abstract: In this paper, a watermarking scheme for 3D stereo images is presented. The target application is 3D Digital Cinema. The watermarking is based on a dependent stereo image coding scheme, where the watermark is embedded in the JPEG2000 decoding pipeline after the inverse quantization and prior to the inverse discrete wavelet transform (IDWT). A perceptual mask is designed to cope with the particularity of the 3D perception and is tuned by the disparity map and the wavelet properties related to the Human Visual System (HVS). In this scheme, the watermark is inherited in the target image during the decoding process and hence, both the reference and the target image in the stereo pair are watermarked. Our results show improvements due to the integration of the 3D visual mask in terms of Structural Similarity Metric (SSM) and Bit Error Rate (BER).
1 citations
Cites methods from "Stereo image coding via digital wat..."
...In [4, 12], stereo and disparity information are jointly used to adapt a 2D watermarking method to a specific scenario in the stereo case....
[...]
References
More filters
Book•
31 Jan 2001
TL;DR: The fractional Fourier transform (FFT) as discussed by the authors has been used in a variety of applications, such as matching filtering, detection, and pattern recognition, as well as signal recovery.
Abstract: Preface. Acknowledgments. Introduction. Signals, Systems, and Transformations. Wigner Distributions and Linear Canonical Transforms. The Fractional Fourier Transform. Time-Order and Space-Order Representations. The Discrete Fractional Fourier Transform. Optical Signals and Systems. Phase-Space Optics. The Fractional Fourier Transform in Optics. Applications of the Fractional Fourier Transform to Filtering, Estimation, and Signal Recovery. Applications of the Fractional Fourier Transform to Matched Filtering, Detection, and Pattern Recognition. Bibliography on the Fractional Fourier Transform. Other Cited Works. Credits. Index.
1,287 citations
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 definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of Hermite-Gaussian functions, and is exactly unitary, index additive, and reduces to the D FT for unit order.
Abstract: We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform. This definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of Hermite-Gaussian functions. The definition is exactly unitary, index additive, and reduces to the DFT for unit order. The fact that this definition satisfies all the desirable properties expected of the discrete fractional Fourier transform supports our confidence that it will be accepted as the definitive definition of this transform.
604 citations
01 Sep 2001
TL;DR: An overview of applications which have so far received interest are given and some potential application areas remaining to be explored are noted.
Abstract: A brief introduction to the fractional Fourier transform and its properties is given. Its relation to phase-space representations (time- or space-frequency representations) and the concept of fractional Fourier domains are discussed. An overview of applications which have so far received interest are given and some potential application areas remaining to be explored are noted.
481 citations
TL;DR: 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, which biases the false positive detection rate.
Abstract: 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.
186 citations