Watermarking of Still Images in Wavelet Domain based on Entropy Masking Model

Akhbari, Bahareh; Ghaemmaghami, Shahrokh

doi:10.1109/tencon.2005.301060

Cited by 18 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 2004, Kim et al [3] proposed entropy masking based on DCT domain. In 2005, Akhbari et al [4] offered entropy masking based on the wavelet transform.…”

Section: Literature Surveymentioning

confidence: 99%

An Entropy Masking in Digital Images using FFT

Sharma¹,

Oberoi²

2014

IJCA

View full text Add to dashboard Cite

The essence of transmitting digital information in digital watermarking system and the dissymmetric digital watermarking framework lived on media content communication is being discussed in this paper. The protection and integrity of information during transmission is also discussed in this paper. Fast Fourier Transform (FFT) is applied for watermarking embedding algorithm to keep the balance between watermarks' imperceptibility and its robustness.

show abstract

“…In 2004, Kim et al [3] proposed entropy masking based on DCT domain. In 2005, Akhbari et al [4] offered entropy masking based on the wavelet transform.…”

Section: Literature Surveymentioning

confidence: 99%

An Entropy Masking in Digital Images using FFT

Sharma¹,

Oberoi²

2014

IJCA

View full text Add to dashboard Cite

show abstract

“…Embedding during compression generally hide information by modifying the DCT quantization coefficients [34], or DWT quantization coefficients [35][36][37][38]. However there are error accumulation and low-capacity with this strategy.…”

Section: ) Between Framesmentioning

confidence: 99%

“…However there are error accumulation and low-capacity with this strategy. When it comes to embedding after compression, the efficiency is increased without encoding and decoding process during embedding and extraction, such as the MP3 steganography algorithm based on Huffman coding [7] and digital watermark algorithm for MIDI [36] and so on.…”

Section: ) Between Framesmentioning

confidence: 99%

Exploring the Challenges of MP3 Audio Steganography

Atoum

Ibrahim

Sulong³

et al. 2013

2013 International Conference on Advanced Computer Science Applications and Technologies

View full text Add to dashboard Cite

This paper presents the issues and challenges faced for steganographic techniques that uses MP3 (Moving Picture Experts Group-1 "MPEG-1" Audio Layer 3) files as the cover or carrier file. The problem of steganographic techniques for MP3 is variety of MP3 states, where it exists at higher or lower bit rates, with higher or lower resulting quality. These have profound effects on strength of techniques that will be used for a different state of MP3 files. Several techniques have already been proposed for embedding data in MP3 files using steganography systems. Unfortunately, there are lacks of general emergence research on the issues and the challenges faced with the MP3 file in terms of steganography. Some techniques for embedding information in MP3 files were reviewed, and recommendations are being proposed for the best strategy of hide information in MP3 files and the possibility of finding other new techniques hiding information in MP3 files.

show abstract

“…[19] used entropy the HVS characteristics to design a non-blind DWT watermarking of gray images and demonstrated their robustness against attacks. Akhbari, B. and Ghaemmaghami, S. [20] proposed an image adaptive digital watermarking algorithm in wavelet transform domain. The method exploits human visual system (HVS) characteristics and entropy masking to determine image adaptive thresholds for selection of perceptually significant coefficients.…”

Section: Literature Reviewmentioning

confidence: 99%

Hiding Watermarks in Multi-Regions of Cover Images using the Wavelet Transform

Al-qdah¹,

Ahmad²,

Swamy

2013

Modelling and Simulation / 804: Signal and Image Processing

View full text Add to dashboard Cite

In this paper, we investigate the embedding of a copyright watermark in four non-overlapping regions of a standard image after partitioning the image into four equal parts (sub images). The entropy of the LH and HL detail components in each sub image is calculated and the maximum of the two components' (LH and HL) is chosen for embedding the watermark. The HH and LL components are not affected. The watermark is extracted using the correlation coefficient. The technique was tested using three standard images and the experimental results indicate that while a little visibility is compromised, the robustness is better than simple embedding of a single watermark. Various geometric and filtering attacks were applied on the watermarked image and the watermark was recovered successfully. Perceptual transparency was measured with PSNR while robustness was measured using the correlation coefficient (p). It is desired to have a value close to 1 for the correlation coefficient for maximum robustness. The PSNR of the extracted watermark after attack was in the range of 57 to 65 while the correlation coefficient values range of the extracted watermark was between 0.61 and 0.91, which is a very acceptable range.

show abstract

Watermarking of Still Images in Wavelet Domain based on Entropy Masking Model

Cited by 18 publications

References 7 publications

An Entropy Masking in Digital Images using FFT

An Entropy Masking in Digital Images using FFT

Exploring the Challenges of MP3 Audio Steganography

Hiding Watermarks in Multi-Regions of Cover Images using the Wavelet Transform

Contact Info

Product

Resources

About