A real time watermarking of grayscale images without altering it's content
02 Mar 2015-pp 1-6
TL;DR: This paper proposes a new spatial domain watermarking of grayscale images and has shown its VLSI Implementation without altering its content in real time using a secret key and evaluated the robustness of the algorithm against several signal processing attacks using MATLAB.
Abstract: This paper proposes a new spatial domain watermarking of grayscale images and has also shown its VLSI Implementation without altering its content in real time using a secret key. The secret key is generated by searching the watermark pixel values in host image content and the location maps are marked in secret key. Therefore this algorithm is called PVSA- Pixel Value Search Algorithm. The proposed algorithm does not make any change in the host image. Thus it shows high robustness to signal processing attacks. The watermark extraction process is simple as the host content is extracted based on key. We have evaluated the robustness of the algorithm against several signal processing attacks using MATLAB. Finally we have implemented the same algorithm in verilog HDL using Altera Quartus-II.
Citations
More filters
TL;DR: A novel and efficient hardware implementation of an image watermarking system based on the Haar Discrete Wavelet Transform (DWT) that shows the effectiveness of the developed architecture in terms of visibility and robustness against several attacks.
Abstract: In this paper we propose a novel and efficient hardware implementation of an image watermarking system based on the Haar Discrete Wavelet Transform (DWT). DWT is used in image watermarking to hide secret pieces of information into a digital content with a good robustness. The main advantage of Haar DWT is the frequencies separation into four subbands (LL, LH, HL, and HH) which can be treated independently. This permits ensuring a better compromise between robustness and visibility factors. A Field Programmable Gate Array (FPGA) that is based on a very large scale integration architecture of the watermarking algorithm is developed to accelerate media authentication. A hardware cosimulation strategy using the Matlab-Xilinx system generator (XSG) was applied to prove the validity of the suggested implementation. The hardware cosimulation results show the effectiveness of the developed architecture in terms of visibility and robustness against several attacks. The proposed hardware system presents also a high performance in terms of the operating speed.
30 citations
Cites background from "A real time watermarking of graysca..."
...Method Device Number of Slice LUT Number of Slice Register Max Frequency (MHz) Proposed algorithm Xilinx Virtex-5 2092 1536 224 Ref [18] Altera Flex 10K 1477 45 58....
[...]
...In presence of attacks JPEG-2000 Q=80 Ref [18] 32....
[...]
TL;DR: This paper describes the generation process of the SIFT algorithm in detail and obtains a series of scale-invariant feature points and proposes a digital watermarking algorithm based on SIFT, singular value decomposition, and all phase biorthogonal transform.
Abstract: Watermarking techniques can be applied in digital images to maintain the authenticity and integrity for copyright protection. In this paper, scale-invariant feature transform (SIFT) is combined with local digital watermarking and a digital watermarking algorithm based on SIFT, singular value decomposition (SVD), and all phase biorthogonal transform (APBT) is proposed. It describes the generation process of the SIFT algorithm in detail and obtains a series of scale-invariant feature points. A large amount of candidate feature points are selected to obtain the neighborhood which can be used to embed the watermark. For these selected feature points, block-based APBT is carried out on their neighborhoods. Moreover, a coefficients matrix of certain APBT coefficients is generated for SVD to embed the encrypted watermark. Experimental results demonstrate that the proposed watermarking algorithm has stronger robustness than some previous schemes. In addition, APBT-based digital watermarking algorithm has good imperceptibility and is more robust to different combinations of attacks, which can be applied for the purpose of copyright protection.
19 citations
Cites background from "A real time watermarking of graysca..."
...watermarking [6], and frequency or transform domain watermarking [7]....
[...]
01 Dec 2015
TL;DR: A dual purpose spatial domain robust algorithm for both image cryptography and digital image watermarking where a key is generated using `Extended Hamming Code' to make the code self-correcting.
Abstract: The tremendous growth of internet in the recent years has made possible easier copying, manipulation and redistribution of digital media. As a result, the problem of security and copyright violation has greatly increased. To combat this problem, mechanisms like watermarking and cryptography are required. In this paper we have proposed a dual purpose spatial domain robust algorithm for both image cryptography and digital image watermarking where a key is generated using ‘Extended Hamming Code’ to make the code self-correcting. A comparative study of the proposed algorithm with other spatial domain algorithms in terms of Peak Signal to Noise Ratio (PSNR) and Normalized Correlation (NC) claims better performance in terms of robustness and imperceptibility. Cryptographic performance analysis shows that the algorithm is secure, consistent and fast to perform transmission of binary messages.
11 citations
TL;DR: A new watermarking algorithm based on All phase discrete cosine biorthogonal transform (APDCBT), which has stronger robustness in embedding and extracting the watermark and is tested against four kinds of attacks.
Abstract: Watermarking technique provides the possibility for copyright protection. Discrete cosine transform (DCT) is the most popular tool used in watermarking algorithm. But the watermarking algorithm based on DCT is not the most ideal choice in terms of the complexity and robustness. All phase discrete cosine biorthogonal transform (APDCBT) owns the characteristics of high frequency attenuation and good applications in image coding, image denoising and other fields of digital image processing, which provides an efficient method for watermarking. In this paper, a new watermarking algorithm based on APDCBT is proposed. Besides, the binary image watermark is scrambled by Arnold transform to enhance its privacy and robustness greatly in our algorithm. The watermark information is embedded in direct-current (DC) components considering DC components have much larger perceptual capacity. Compared with the DCT algorithm, the proposed algorithm has stronger robustness in embedding and extracting the watermark. Experimental results show that our algorithm can satisfy the imperceptibility and robustness very well. Furthermore, our algorithm is tested against four kinds of attacks: JPEG compression, Gaussian noise, salt & pepper noise and rotation.
7 citations
Cites background from "A real time watermarking of graysca..."
...There are two kinds of digital image watermarking techniques [1]: spatial domain technique [2] and frequency domain technique [3] [4]....
[...]
TL;DR: The secret watermark bits are inserted in the DCT low-frequency coefficients using a mean adaptive threshold value, which not only results in a minimum degradation to the host image quality but also increases the robustness of the proposed algorithm.
7 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
TL;DR: A new adaptive least-significant- bit (LSB) steganographic method using pixel-value differencing (PVD) that provides a larger embedding capacity and imperceptible stegoimages and when compared to the past study of Wu et al.'s PVD and LSB replacement method, the experimental results show that the proposed approach provides both larger embeding capacity and higher image quality.
Abstract: This paper proposes a new adaptive least-significant- bit (LSB) steganographic method using pixel-value differencing (PVD) that provides a larger embedding capacity and imperceptible stegoimages. The method exploits the difference value of two consecutive pixels to estimate how many secret bits will be embedded into the two pixels. Pixels located in the edge areas are embedded by a k-bit LSB substitution method with a larger value of k than that of the pixels located in smooth areas. The range of difference values is adaptively divided into lower level, middle level, and higher level. For any pair of consecutive pixels, both pixels are embedded by the k-bit LSB substitution method. However, the value k is adaptive and is decided by the level which the difference value belongs to. In order to remain at the same level where the difference value of two consecutive pixels belongs, before and after embedding, a delicate readjusting phase is used. When compared to the past study of Wu et al.'s PVD and LSB replacement method, our experimental results show that our proposed approach provides both larger embedding capacity and higher image quality.
429 citations
"A real time watermarking of graysca..." refers background in this paper
...Alternatively an equivalent VLSI hardware implementation can perform better even at higher image sizes....
[...]
TL;DR: This paper is an overview of the work done for protecting content owners' investment in intellectual property through encryption and watermarking.
Abstract: A digital home network is a cluster of digital audio/visual (A/V) devices including set-top boxes, TVs, VCRs, DVD players, and general-purpose computing devices such as personal computers. The network may receive copyrighted digital multimedia content from a number of sources. This content maybe broadcast via satellite or terrestrial systems, transmitted bycable operators, or made available as prepackaged media (e.g., a digital tape or a digital video disc). Before releasing their content for distribution, the content owners mayrequire protection byspecifying access conditions. Once the content is delivered to the consumer, it moves across the home network until it reaches its destination where it is stored or displayed. A copy protection system is needed to prevent unauthorized access to bit streams in transmission from one A/V device to another or while it is in storage on magnetic or optical media. Recently, two fundamental groups of technologies, encryption and watermarking, have been identi"ed for protecting copyrighted digital multimedia content. This paper is an overview of the work done for protecting content owners' investment in intellectual property. 2001 Elsevier Science B.V. All rights reserved.
226 citations
01 Dec 2004
TL;DR: A fragile watermarking scheme is proposed to implicitly watermark all the coefficients by registering the zero-valued coefficients with a key-generated binary sequence to create the watermark and involving the unwatermarkable coefficients during the embedding process of the embeddable ones.
Abstract: It is a common practice in transform-domain fragile watermarking schemes for authentication purposes to watermark some selected transform coefficients so as to minimise embedding distortion. The author points out that leaving most of the coefficients unmarked results in a wide-open security gap for attacks to be mounted on them. A fragile watermarking scheme is proposed to implicitly watermark all the coefficients by registering the zero-valued coefficients with a key-generated binary sequence to create the watermark and involving the unwatermarkable coefficients during the embedding process of the embeddable ones. Non-deterministic dependence is established by involving some of the unwatermarkable coefficients selected according to the watermark from a nine-neighbourhood system in order to thwart different attacks, such as cover-up, vector quantisation and transplantation. No hashing is needed in establishing the non-deterministic dependence.
104 citations
TL;DR: A new VLSI architecture that can insert invisible or visible watermarks in images in the discrete cosine transform domain is presented that incorporates low-power techniques such as dual voltage, dual frequency, and clock gating to reduce the power consumption and exploits pipelining and parallelism extensively in order to achieve high performance.
Abstract: In this brief, we present a new VLSI architecture that can insert invisible or visible watermarks in images in the discrete cosine transform domain. The proposed architecture incorporates low-power techniques such as dual voltage, dual frequency, and clock gating to reduce the power consumption and exploits pipelining and parallelism extensively in order to achieve high performance. The supply voltage level and the operating frequency are chosen for each module so as to maintain the required bandwidth and throughput match among the different modules. A prototype VLSI chip was designed and verified using various Cadence and Synopsys tools based on TSMC 0.25-/spl mu/m technology with 1.4 M transistors and 0.3 mW of estimated dynamic power.
63 citations