scholarly journals An Efficient Image Watermarking Method Based on Fast Discrete Cosine Transform Algorithm

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
S. E. Tsai ◽  
K. C. Liu ◽  
S. M. Yang
Keyword(s):  
Discrete Cosine Transform ◽  
Digital Signal Processor ◽  
Transmission Loss ◽  
Image Watermarking ◽  
Digital Signal ◽  
Random Permutation ◽  
Cosine Transform ◽  
Two Dimensional Image ◽  
Host Image

This paper proposes an image watermarking method based on the fast discrete cosine transform (DCT) algorithm for implementation in digital signal processor. A digital watermark can be effectively embedded and efficiently extracted without the host image. The keys in watermarking process include four frequency coefficients in DCT, two random permutation vectors, and a quantization matrix for normalizing the watermark and the host image. The fast DCT algorithm has been shown to reduce the complexity of two-dimensional image transformation so that embedding/decoding an image watermark can be completed in real time within 0.33 seconds. The quality of both watermarked image and extracted (retrieved) watermark remains excellent. It is shown that the watermarking method is efficient in and robust to data cropping, transmission loss, and compression/decompression.

Research for Robust Watermarking Algorithm Using Least Significant Bit

2011 ◽  
Vol 268-270 ◽  
pp. 1697-1700
Author(s):  
Jun Jie Wang ◽  
Qian Mo ◽  
Dong Xia Mei ◽  
Su Li
Keyword(s):  
Discrete Cosine Transform ◽  
Image Watermarking ◽  
Chaotic Map ◽  
Least Significant Bit ◽  
Cosine Transform ◽  
Host Image ◽  
Original Host ◽  
Minimal Distortion ◽  
Logistic Chaotic Map

An image watermarking algorithm using Least Significant Bit is presented. Firstly, Logistic chaotic map is utilized to generate embedding bits for the watermark. Then, the discrete cosine transform is performed on the host image, and the hiding bit is embedded in the coefficient of discrete cosine transform by replacing Least Significant Bit, which causes minimal distortion of the host image.The original host image is not required when extracting the watermark . Experimental results show that the watermarked image almost has no difference from the original host image, and the quality of the extracted image is satisfying, the capacity of this algorithm is high. This algorithm is robust to many attacks, such as noise attack, JPEG Compression attack. Introduction

scholarly journals A Fast DCT Algorithm for Watermarking in Digital Signal Processor

2017 ◽  
Vol 2017 ◽  
pp. 1-7 ◽  
Author(s):  
S. E. Tsai ◽  
S. M. Yang
Keyword(s):  
Discrete Cosine Transform ◽  
Digital Image ◽  
Spatial Data ◽  
Digital Signal Processor ◽  
Block Size ◽  
Digital Signal ◽  
Outer Product ◽  
Cosine Transform ◽  
Digital Image Compression ◽  
Inverse Dct

Discrete cosine transform (DCT) has been an international standard in Joint Photographic Experts Group (JPEG) format to reduce the blocking effect in digital image compression. This paper proposes a fast discrete cosine transform (FDCT) algorithm that utilizes the energy compactness and matrix sparseness properties in frequency domain to achieve higher computation performance. For a JPEG image of8×8block size in spatial domain, the algorithm decomposes the two-dimensional (2D) DCT into one pair of one-dimensional (1D) DCTs with transform computation in only 24 multiplications. The 2D spatial data is a linear combination of the base image obtained by the outer product of the column and row vectors of cosine functions so that inverse DCT is as efficient. Implementation of the FDCT algorithm shows that embedding a watermark image of 32 × 32 block pixel size in a 256 × 256 digital image can be completed in only 0.24 seconds and the extraction of watermark by inverse transform is within 0.21 seconds. The proposed FDCT algorithm is shown more efficient than many previous works in computation.

LWT-DCT based Image Watermarking Scheme using Normalized SVD

2020 ◽  
Vol 13 ◽  
Author(s):  
Rahul Dixit ◽  
Amita Nandal ◽  
Arvind Dhaka ◽  
Vardan Agarwal ◽  
Yohan Varghese
Keyword(s):  
Wavelet Transform ◽  
Singular Value Decomposition ◽  
Discrete Cosine Transform ◽  
Image Watermarking ◽  
Singular Value ◽  
Cover Image ◽  
Lifting Wavelet Transform ◽  
Cosine Transform ◽  
Lifting Wavelet ◽  
Value Decomposition

Background: Nowadays information security is one of the biggest issues of social networks. The multimedia data can be tampered with, and the attackers can then claim its ownership. Image watermarking is a technique that is used for copyright protection and authentication of multimedia. Objective: We aim to create a new and more robust image watermarking technique to prevent illegal copying, editing and distribution of media. Method : The watermarking technique proposed in this paper is non-blind and employs Lifting Wavelet Transform on the cover image to decompose the image into four coefficient matrices. Then Discrete Cosine Transform is applied which separates a selected coefficient matrix into different frequencies and later Singular Value Decomposition is applied. Singular Value Decomposition is also applied to the watermarking image and it is added to the singular matrix of the cover image which is then normalized followed by the inverse Singular Value Decomposition, inverse Discrete Cosine Transform and inverse Lifting Wavelet Transform respectively to obtain an embedded image. Normalization is proposed as an alternative to the traditional scaling factor. Results: Our technique is tested against attacks like rotation, resizing, cropping, noise addition and filtering. The performance comparison is evaluated based on Peak Signal to Noise Ratio, Structural Similarity Index Measure, and Normalized Cross-Correlation. Conclusion: The experimental results prove that the proposed method performs better than other state-of-the-art techniques and can be used to protect multimedia ownership.

Integration of a Quantitative Feedback Theory (QFT)-Based Active Noise Canceller and 3D Audio Processor to Headsets

2007 ◽  
Vol 129 (5) ◽  
pp. 567-576 ◽  
Author(s):  
Mingsian R. Bai ◽  
Jianliang Lin
Keyword(s):  
Digital Signal Processor ◽  
Active Noise Control ◽  
Three Dimensional ◽  
Digital Signal ◽  
Quantitative Feedback Theory ◽  
Processing Technologies ◽  
3D Audio ◽  
Active Noise ◽  
Spatial Sound Reproduction

This paper seeks to enhance the quality of spatial sound reproduction by integrating two advanced signal processing technologies, active noise control (ANC) and three-dimensional (3D) audio, to a headset. The ANC module of the headset is designed based on the quantitative feedback theory (QFT), which is a unified theory that emphasizes the use of feedback for achieving the desired system performance tolerances in the face of plant uncertainties and plant disturbances. Performance, stability, and robustness of the closed-loop system have been taken into account in the loop-shaping procedure within a general framework of the QFT. On the other hand, 3D audio processing algorithms including the head-related-transfer-function and the reverberator are realized on the platform of a fixed-point digital signal processor. Listening tests were conducted to evaluate the proposed system in terms of various subjective performance indices. The experimental results revealed that the 3D headset is capable of delivering superior rendering quality of localization and spaciousness, with the aid of the ANC module.

BINARY IMAGE WATERMARKING THROUGH BLURRING AND BIASED BINARIZATION

2005 ◽  
Vol 05 (01) ◽  
pp. 67-87 ◽  
Author(s):  
HAIPING LU ◽  
YUN Q. SHI ◽  
ALEX C. KOT ◽  
LIHUI CHEN
Keyword(s):  
Discrete Cosine Transform ◽  
Digital Watermarking ◽  
Image Watermarking ◽  
Binary Image ◽  
Experimental Results ◽  
Cosine Transform ◽  
Binary Images ◽  
Blurred Image ◽  
Binarization Threshold

Digital watermarking has been proposed for the protection of digital medias. This paper presents two watermarking algorithms for binary images. Both algorithms involve a blurring preprocessing and a biased binarization. After the blurring, the first algorithm embeds a watermark by modifying the DC components of the Discrete Cosine Transform (DCT), followed by a biased binarization, and the second one embeds a watermark by directly biasing the binarization threshold of the blurred image, controlled by a loop. Experimental results show the imperceptibility and robustness aspects of both algorithms.

An Improve Image Watermarking using Random Spread Technique and Discrete Cosine Transform

2019 ◽  
Author(s):  
Ajib Susanto ◽  
De Rosal Ignatius Moses Setiadi ◽  
Eko Hari Rachmawanto ◽  
Ibnu Utomo Wahyu Mulyono ◽  
Christy Atika Sari
Keyword(s):  
Discrete Cosine Transform ◽  
Image Watermarking ◽  
Cosine Transform

A Novel Hybrid Discrete Cosine Transform Speeded Up Robust Feature-Based Secure Medical Image Watermarking Algorithm

2020 ◽  
Vol 10 (11) ◽  
pp. 2588-2599
Author(s):  
Saqib Ali Nawaz ◽  
Jingbing Li ◽  
Uzair Aslam Bhatti ◽  
Anum Mehmood ◽  
Raza Ahmed ◽  
...  
Keyword(s):  
Discrete Cosine Transform ◽  
Digital Watermarking ◽  
Copyright Protection ◽  
Image Watermarking ◽  
Image Feature ◽  
Feature Descriptor ◽  
Cosine Transform ◽  
Speeded Up Robust Features ◽  
Feature Based ◽  
Dct Coefficients

With the advancement of networks and multimedia, digital watermarking technology has received worldwide attention as an effective method of copyright protection. Improving the anti-geometric attack ability of digital watermarking algorithms using image feature-based algorithms have received extensive attention. This paper proposes a novel robust watermarking algorithm based on SURF-DCT perceptual hashing (Speeded Up Robust Features and Discrete Cosine Transform), namely blind watermarking. We design and implement a meaningful binary watermark embedding and extraction algorithm based on the SURF feature descriptor and discrete-cosine transform domain digital image watermarking algorithm. The algorithm firstly uses the affine transformation with a feature matrix and chaotic encryption technology to preprocess the watermark image, enhance the confidentiality of the watermark, and perform block and DCT coefficients extraction on the carrier image, and then uses the positive and negative quantization rules to modify the DCT coefficients. The embedding of the watermark is completed, and the blind extraction of the watermark realized. Correlation values are more than 90% in most of the attacks. It provides better results against different noise attacks and also better performance against rotation. Transparency and high computational efficiency, coupled with dual functions of copyright protection and content authentication, is the advantage of the proposed algorithm.

Sign in / Sign up

Export Citation Format

Share Document