scispace - formally typeset
Search or ask a question
Book ChapterDOI

A Novel Watermarking Technique for Multimedia Security

TL;DR: This chapter presents a robust and secure framework for multimedia security using digital watermarking based on dynamic stochastic resonance (DSR), which effectively utilizes the noise introduced during the attacks to enhance the robustness and authenticity of the watermark.
Abstract: This chapter presents a robust and secure framework for multimedia security using digital watermarking. In the proposed scheme, a cover image is transformed into frequency domain based on all phase discrete bi-orthogonal transform (APDBT) followed by singular value decomposition. A gray-scale watermark is then embedded by modifying the singular values. For watermark extraction, a new procedure based on dynamic stochastic resonance (DSR) is employed. The proposed DSR based extraction effectively utilizes the noise introduced during the attacks to enhance the robustness and authenticity of the watermark. A detailed experimental analysis is finally conducted to demonstrate the robustness and efficiency of the proposed scheme against a variety of attacks.
References
More filters
Journal ArticleDOI
TL;DR: It is argued that insertion of a watermark under this regime makes the watermark robust to signal processing operations and common geometric transformations provided that the original image is available and that it can be successfully registered against the transformed watermarked image.
Abstract: This paper presents a secure (tamper-resistant) algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to audio, video, and multimedia data. We advocate that a watermark should be constructed as an independent and identically distributed (i.i.d.) Gaussian random vector that is imperceptibly inserted in a spread-spectrum-like fashion into the perceptually most significant spectral components of the data. We argue that insertion of a watermark under this regime makes the watermark robust to signal processing operations (such as lossy compression, filtering, digital-analog and analog-digital conversion, requantization, etc.), and common geometric transformations (such as cropping, scaling, translation, and rotation) provided that the original image is available and that it can be successfully registered against the transformed watermarked image. In these cases, the watermark detector unambiguously identifies the owner. Further, the use of Gaussian noise, ensures strong resilience to multiple-document, or collusional, attacks. Experimental results are provided to support these claims, along with an exposition of pending open problems.

6,194 citations

Book
01 Jan 1984

5,597 citations

Journal ArticleDOI
TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Abstract: A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering. Its performance is compared with that of a class of orthogonal transforms and is found to compare closely to that of the Karhunen-Loeve transform, which is known to be optimal. The performances of the Karhunen-Loeve and discrete cosine transforms are also found to compare closely with respect to the rate-distortion criterion.

4,481 citations

Journal ArticleDOI
TL;DR: In this paper, the problem of approximating one matrix by another of lower rank is formulated as a least-squares problem, and the normal equations cannot be immediately written down, since the elements of the approximate matrix are not independent of one another.
Abstract: The mathematical problem of approximating one matrix by another of lower rank is closely related to the fundamental postulate of factor-theory. When formulated as a least-squares problem, the normal equations cannot be immediately written down, since the elements of the approximate matrix are not independent of one another. The solution of the problem is simplified by first expressing the matrices in a canonic form. It is found that the problem always has a solution which is usually unique. Several conclusions can be drawn from the form of this solution. A hypothetical interpretation of the canonic components of a score matrix is discussed.

3,576 citations

Journal ArticleDOI
TL;DR: This work explores both traditional and novel techniques for addressing the data-hiding process and evaluates these techniques in light of three applications: copyright protection, tamper-proofing, and augmentation data embedding.
Abstract: Data hiding, a form of steganography, embeds data into digital media for the purpose of identification, annotation, and copyright. Several constraints affect this process: the quantity of data to be hidden, the need for invariance of these data under conditions where a "host" signal is subject to distortions, e.g., lossy compression, and the degree to which the data must be immune to interception, modification, or removal by a third party. We explore both traditional and novel techniques for addressing the data-hiding process and evaluate these techniques in light of three applications: copyright protection, tamper-proofing, and augmentation data embedding.

3,037 citations