A new aspect in robust digital watermarking
TL;DR: An attempt in which a new watermarking scheme is presented where the size of host image is very small when compare with watermark image and a reliable watermark extraction scheme is developed for extracting both the watermarks.
Abstract: Generally, in watermarking scheme the size of the watermark is very small when compare to host image. On the contrary, this is an attempt in which a new watermarking scheme is presented where the size of host image is very small when compare with watermark image. The core idea of the proposed scheme is to scale up the size of host image equal to the size of watermark via over-sampling and then decompose it using stationary wavelet transform. A gray scale watermark is embedded in the low frequency sub-band at the finest level using singular value decomposition. To prevent ambiguity and enhance the security, a binary watermark is also embedded in loss-less manner. Finally, a reliable watermark extraction scheme is developed for extracting both the watermarks. The experimental results demonstrate better visual imperceptibility and resiliency of the proposed scheme against intentional or un-intentional variety of attacks.
Citations
More filters
TL;DR: The experimental results demonstrate that the proposed DWT-SVD and DCT with Arnold Cat Map encryption based robust and blind watermarking scheme is robust, imperceptible and secure to several attacks and common signal processing operations.
Abstract: In this article, a new DWT-SVD and DCT with Arnold Cat Map encryption based robust and blind watermarking scheme is proposed for copyright protection. The proposed scheme solves the most frequently occurring watermarking security problems in Singular Value Decomposition (SVD) based schemes which are unauthorized reading and false-positive detection. This scheme also optimizes fidelity and robustness characteristics. The grey image watermark splits into two parts using four bits MSBs and four bits LSBs of each pixel. Discrete Cosine Transform (DCT) coefficients of these MSBs and LSBs values are embedded into the middle singular value of each block having size 4 × 4 of the host image's one level Discrete Wavelet Transform (DWT) sub-bands. The reason for incorporating Arnold Cat Map in the proposed scheme is to encode the watermark image before embedding it in the host image. The proposed scheme is a blind scheme and does not require the choice of scaling factor. Thus, the proposed scheme is secure as well as free from the false positive detection problem. The proposed watermarking scheme is tested for various malicious and non-malicious attacks. The experimental results demonstrate that the scheme is robust, imperceptible and secure to several attacks and common signal processing operations.
121 citations
Cites background from "A new aspect in robust digital wate..."
...In this type of watermarking, watermark is designed to resist intentional or unintentional manipulations in the host signal [9, 58]....
[...]
TL;DR: In this paper, the quadratic family has been used to define hyperbolicity in linear algebra and advanced calculus, including the Julia set and the Mandelbrot set.
Abstract: Part One: One-Dimensional Dynamics Examples of Dynamical Systems Preliminaries from Calculus Elementary Definitions Hyperbolicity An example: the quadratic family An Example: the Quadratic Family Symbolic Dynamics Topological Conjugacy Chaos Structural Stability Sarlovskiis Theorem The Schwarzian Derivative Bifurcation Theory Another View of Period Three Maps of the Circle Morse-Smale Diffeomorphisms Homoclinic Points and Bifurcations The Period-Doubling Route to Chaos The Kneeding Theory Geneaology of Periodic Units Part Two: Higher Dimensional Dynamics Preliminaries from Linear Algebra and Advanced Calculus The Dynamics of Linear Maps: Two and Three Dimensions The Horseshoe Map Hyperbolic Toral Automorphisms Hyperbolicm Toral Automorphisms Attractors The Stable and Unstable Manifold Theorem Global Results and Hyperbolic Sets The Hopf Bifurcation The Hnon Map Part Three: Complex Analytic Dynamics Preliminaries from Complex Analysis Quadratic Maps Revisited Normal Families and Exceptional Points Periodic Points The Julia Set The Geometry of Julia Sets Neutral Periodic Points The Mandelbrot Set An Example: the Exponential Function
104 citations
TL;DR: The experimental results demonstrate that the proposed DCT based effective self-recoverable fragile watermarking scheme not only outperforms high-quality restoration effectively, but also removes the blocking artifacts and improves the accuracy of tamper localization due to the use of very small size blocks, smoothing function and two levels tampering detection mechanisms.
100 citations
TL;DR: The experimental results demonstrate that the proposed DCT based quantization and Discrete Cosine Transform based self-embedding fragile watermarking scheme not only outperforms high quality restoration effectively, but also removes the blocking artifacts and improves the accuracy of tamper localization due to use of very small size blocks.
Abstract: Due to rapid development of Internet and computer technology, image authentication and restoration are very essential, especially when it is utilized in forensic science, medical imaging and evidence of court. A quantization and Discrete Cosine Transform(DCT) based self-embedding fragile watermarking scheme with effective image authentication and restoration quality is proposed in this paper. In this scheme, the cover image is divided in size of 2×2 non-overlapping blocks. For each block twelve bits watermark are generated from the five most significant bits (MSBs) of each pixel and are embedded into the three least significant bits (LSBs) of the pixels corresponding to the mapped block. The proposed scheme uses two levels encoding for content restoration bits generation. The restoration is achievable with high PSNR and NCC up to 50 % tampering rate. The experimental results demonstrate that the proposed scheme not only outperforms high quality restoration effectively, but also removes the blocking artifacts and improves the accuracy of tamper localization due to use of very small size blocks.
97 citations
Cites background from "A new aspect in robust digital wate..."
...A robust watermark should be able to resist intentional or unintentional manipulations and is used for ownership verification and copyright protection[1, 16, 17]....
[...]
TL;DR: A new robust and adaptive watermarking scheme in which both the host and watermark are the color images of the same size and dimension, which overcomes the major security problem of false positive error (FPE) that mostly occurs in existing SVD based water marking schemes.
63 citations
References
More filters
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 1986
TL;DR: In this article, the quadratic family has been used to define hyperbolicity in linear algebra and advanced calculus, including the Julia set and the Mandelbrot set.
Abstract: Part One: One-Dimensional Dynamics Examples of Dynamical Systems Preliminaries from Calculus Elementary Definitions Hyperbolicity An example: the quadratic family An Example: the Quadratic Family Symbolic Dynamics Topological Conjugacy Chaos Structural Stability Sarlovskiis Theorem The Schwarzian Derivative Bifurcation Theory Another View of Period Three Maps of the Circle Morse-Smale Diffeomorphisms Homoclinic Points and Bifurcations The Period-Doubling Route to Chaos The Kneeding Theory Geneaology of Periodic Units Part Two: Higher Dimensional Dynamics Preliminaries from Linear Algebra and Advanced Calculus The Dynamics of Linear Maps: Two and Three Dimensions The Horseshoe Map Hyperbolic Toral Automorphisms Hyperbolicm Toral Automorphisms Attractors The Stable and Unstable Manifold Theorem Global Results and Hyperbolic Sets The Hopf Bifurcation The Hnon Map Part Three: Complex Analytic Dynamics Preliminaries from Complex Analysis Quadratic Maps Revisited Normal Families and Exceptional Points Periodic Points The Julia Set The Geometry of Julia Sets Neutral Periodic Points The Mandelbrot Set An Example: the Exponential Function
3,589 citations
Book•
01 Jan 1993TL;DR: The fifth edition of this hugely successful textbook retains the quality of earlier editions while at the same time seeing numerous minor improvements and major additions as mentioned in this paper, including a new chapter on singular values and singular vectors, including ways to analyze a matrix of data.
Abstract: Linear algebra is something all mathematics undergraduates and many other students, in subjects ranging from engineering to economics, have to learn. The fifth edition of this hugely successful textbook retains the quality of earlier editions while at the same time seeing numerous minor improvements and major additions. The latter include: a new chapter on singular values and singular vectors, including ways to analyze a matrix of data; a revised chapter on computing in linear algebra, with professional-level algorithms and code that can be downloaded for a variety of languages; a new section on linear algebra and cryptography; and a new chapter on linear algebra in probability and statistics. A dedicated and active website also offers solutions to exercises as well as new exercises from many different sources (e.g. practice problems, exams, development of textbook examples), plus codes in MATLAB, Julia, and Python.
1,913 citations
[...]
TL;DR: The paper discusses the feasibility of coding an "undetectable" digital water mark on a standard 512/spl times/512 intensity image with an 8 bit gray scale, capable of carrying such information as authentication or authorisation codes, or a legend essential for image interpretation.
Abstract: The paper discusses the feasibility of coding an "undetectable" digital water mark on a standard 512/spl times/512 intensity image with an 8 bit gray scale. The watermark is capable of carrying such information as authentication or authorisation codes, or a legend essential for image interpretation. This capability is envisaged to find application in image tagging, copyright enforcement, counterfeit protection, and controlled access. Two methods of implementation are discussed. The first is based on bit plane manipulation of the LSB, which offers easy and rapid decoding. The second method utilises linear addition of the water mark to the image data, and is more difficult to decode, offering inherent security. This linearity property also allows some image processing, such as averaging, to take place on the image, without corrupting the water mark beyond recovery. Either method is potentially compatible with JPEG and MPEG processing. >
1,407 citations
01 Jan 1995
TL;DR: In this article, two different approaches to the construction of an inverse of the stationary wavelet transform are described, and a method of local spectral density estimation is developed, which involves extensions to the wavelet context of standard time series ideas such as the periodogram and spectrum.
Abstract: Wavelets are of wide potential use in statistical contexts. The basics of the discrete wavelet transform are reviewed using a filter notation that is useful subsequently in the paper. A ‘stationary wavelet transform’, where the coefficient sequences are not decimated at each stage, is described. Two different approaches to the construction of an inverse of the stationary wavelet transform are set out. The application of the stationary wavelet transform as an exploratory statistical method is discussed, together with its potential use in nonparametric regression. A method of local spectral density estimation is developed. This involves extensions to the wavelet context of standard time series ideas such as the periodogram and spectrum. The technique is illustrated by its application to data sets from astronomy and veterinary anatomy.
1,124 citations