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.
...read more
Citations
More filters
TL;DR: Experimental results indicate that the proposed stereo image zero- watermarking algorithm is strongly robust to various asymmetric and symmetric attacks and has superiority compared with other zero-watermarking algorithms.
Abstract: With the development and popularization of computer network technology, the copyright protection of stereo images is a serious problem to be solved. Based on ternary number theory and radial harmonic Fourier moments (RHFM), ternary radial harmonic Fourier moments (TRHFM) is proposed to deal with stereo images in a holistic manner, and based on this moment, this paper proposes a robust stereo image zero-watermarking algorithm. We first compute the TRHFM of the original stereo image, and we randomly select TRHFMs using logistic mapping; then, we obtain a binary feature image using the magnitudes of the selected TRHFMs, and finally, we apply a bitwise exclusive-or operation on permuted logo image and binary feature image to obtain the zero-watermark image. Experimental results indicate that the proposed stereo image zero-watermarking algorithm is strongly robust to various asymmetric and symmetric attacks and has superiority compared with other zero-watermarking algorithms.
104 citations
TL;DR: This paper presents a novel image encryption scheme using 3-D Arnold cat map and Fisher-Yates shuffling algorithm which demonstrates the high security and sensitivity of the scheme.
Abstract: This paper presents a novel image encryption scheme using 3-D Arnold cat map and Fisher-Yates shuffling algorithm. A plain image is divided into various slices of equal size and then the 3-D representation of the image is shuffled by the 3-D chaotic map. A fractional order system of nonlinear differential equations is used to implement the diffusion in the intensity values of the shuffled image pixels. The solution of this fractional order system develops a strange attractor which is the onset of the chaos. Fisher-Yates is used to make a chaotic matrix which is used for arranging the data points. Experimental results are given on various images with comprehensive analysis which demonstrates the high security and sensitivity of the scheme.
22 citations
TL;DR: A new zero-watermarking algorithm for copyright protection of color stereo images is proposed that uses the proposed ORTMs to build descriptors that are stable and robust against image processing attacks and invariant to geometric transformations.
Abstract: This paper proposes a new category of moments for color stereo image description, called Octonion Moments (OMs). These new descriptors are based on the octonion theory and the moment theory, they generalize the classical and quaternion moments. The octonion moments can be used for any six-layer image stack, allowing us to use them to characterize color stereo images in an efficient, compact and holistic way in both intra- and inter-channel color directions. As a result, redundancies between the six channels of a stereo color image can be well exploited. Tchebichef polynomials are used in this paper to construct the corresponding octonion moments called Octonion Radial Tchebichef Moments (ORTMs). Two applications, image reconstruction and image watermarking, are studied to validate the effectiveness of the proposed ORTMs. In the context of image watermarking, we propose a new zero-watermarking algorithm for copyright protection of color stereo images. The image watermarking requirements, namely imperceptibility, robustness, and security are ensured by the proposed algorithm. This algorithm uses the proposed ORTMs to build descriptors that are stable and robust against image processing attacks and invariant to geometric transformations. The experimental results demonstrate the effectiveness of the proposed ORTMs for reconstruction and image watermarking in a comparison to concurrent recent methods based on other types of moments.
11 citations
TL;DR: It was established that for a fixed size of the mark, a hybrid watermark insertion performed into a new disparity map representation is the only solution jointly featuring imperceptibility, robustness against the three classes of attacks, and nonprohibitive computational cost.
Abstract: Despite the sound theoretical, methodological, and experimental background inherited from 2D video, the stereoscopic video watermarking imposed itself as an open research topic. Paving the way towards practical deployment of such copyright protection mechanisms, the present paper is structured as a comparative study on the main classes of 2D watermarking methods (spread spectrum, side information, hybrid) and on their related optimal stereoscopic insertion domains (view or disparity based). The performances are evaluated in terms of transparency, robustness, and computational cost. First, the watermarked content transparency is assessed by both subjective protocols (according to ITU-R BT 500-12 and BT 1438 recommendations) and objective quality measures (five metrics based on differences between pixels and on correlation). Secondly, the robustness is objectively expressed by means of the watermark detection bit error rate against several classes of attacks, such as linear and nonlinear filtering, compression, and geometric transformations. Thirdly, the computational cost is estimated for each processing step involved in the watermarking chain. All the quantitative results are obtained out of processing two corpora of stereoscopic visual content: (1) the 3DLive corpus, summing up about 2 h of 3D TV content captured by French professionals, and (2) the MPEG 3D video reference corpus, composed of 17 min provided by both academic communities and industrials. It was thus established that for a fixed size of the mark, a hybrid watermark insertion performed into a new disparity map representation is the only solution jointly featuring imperceptibility (according to the subjective tests), robustness against the three classes of attacks, and nonprohibitive computational cost.
8 citations
01 Jan 2019
TL;DR: This chapter introduces a new and effective encryption technique to encrypt left and right stereo images simultaneously to produce a single encrypted image.
Abstract: To provide the security to image contents, most encryption techniques are designed for synthetic and real images which is, however, not applicable to stereo images. Stereo images generally consists of two views (left and right views) of a scene with known viewpoints. The only way is to encrypt both left and right images separately. To address this issue, this chapter introduces a new and effective encryption technique to encrypt left and right stereo images simultaneously to produce a single encrypted image. A decryption process is finally introduced to generate left and right stereo images from the final encrypted image. The extensive experiments on different stereo images demonstrate the efficiency and the robustness of the proposed encryption technique.
4 citations
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,254 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.
922 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.
572 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.
447 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.
177 citations