ScholarLens Back to search
2011•Unpublished venueOpen access

Zero-error watermarking on jpeg images by shuffling huffman tree nodes

Yongdong Wu, Robert H. Deng

Open full text 10 citations

Abstract

This paper proposes a full fidelity watermarking on JPEG bitstreams. That is, without a designated decoder/player, the watermarked bitstream can be decompressed to the original one. To this end, the scheme modifies the JPEG Huffman tables and the bitstream synchronically according to the watermark. Thus it is unnecessary for the JPEG decompressor to recover DCT coefficients because they are not modified at all. In addition, the present scheme is applicable to any JPEG bitstream even if its Huffman tables are optimized.

About this research paper

What this paper is about

This paper proposes a full fidelity watermarking on JPEG bitstreams. That is, without a designated decoder/player, the watermarked bitstream can be decompressed to the original one. To this end, the scheme modifies the JPEG Huffman tables and the bitstream synchronically according to the watermark. Thus it is unnecessary for the JPEG decompressor to recover DCT coefficients because they are not modified at all. In addition, the present scheme is applicable to any JPEG bitstream even if its Huffman tables are optimized.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper proposes a full fidelity watermarking on JPEG bitstreams. That is, without a designated decoder/player, the watermarked bitstream can be decompressed to the original one. To this end, the scheme modifies the JPEG Huffman tables and the bitstream synchronically according to the watermark. Thus it is unnecessary for the JPEG decompressor to recover DCT coefficients because they are not modified at all. In addition, the present scheme is applicable to any JPEG bitstream even if its Huffman tables are optimized.

Key concepts: Huffman coding, Bitstream, JPEG, Computer science, Watermark, Lossless JPEG, Digital watermarking, Shuffling

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Zero-error watermarking on jpeg images by shuffling huffman tree nodes — Research Paper | ScholarLens