Digital watermarking and tree structure based image quality estimation

Authors:
Sha Wang;Dong Zheng;Jiying Zhao;Wa James Tam;Filippo Speranza
Affiliations:
University of Ottawa, Ottawa, Ontario, Canada;Advanced Video Systems, Communication Research Centre Canada, Ottawa, Ontario, Canada;University of Ottawa, Ottawa, Ontario, Canada;Advanced Video Systems, Communication Research Centre Canada, Ottawa, Ontario, Canada;Advanced Video Systems, Communication Research Centre Canada, Ottawa, Ontario, Canada
Venue:
Proceedings of the Third International Conference on Internet Multimedia Computing and Service
Year:
2011

Citing 4
Cited 0

JPEG 2000: Image Compression Fundamentals, Standards and Practice

JPEG 2000: Image Compression Fundamentals, Standards and Practice
RST invariant image watermarking algorithm with mathematical modeling and analysis of the watermarking processes

IEEE Transactions on Image Processing
A new, fast, and efficient image codec based on set partitioning in hierarchical trees

IEEE Transactions on Circuits and Systems for Video Technology
An Image Quality Evaluation Method Based on Digital Watermarking

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new semi-fragile-watermarking-based quality estimation scheme is proposed in this paper. The watermark is embedded into the tree structure of an image with proper embedding strength decided by statistically analyzing the characteristics of the image. In the watermark embedding, the bit-plane coding mechanism is used to simulate the general distortion that images will undergo. A universal "Ideal Mapping Curve" is generated using the SPIHT (Set Partitioning in Hierarchical Trees) algorithm with different BPP (Bits Per Pixel) settings. In the watermark extraction, the quality of the watermarked images will be estimated under different distortions, such as JPEG compression and Gaussian noise pollution. The "Ideal Mapping Curve" used for quality estimation against different distortions can be achieved by weighting the universal "Ideal Mapping Curve" using the empirical weighting factors. The experimental results suggest that the proposed algorithm works effectively and efficiently.