TY - GEN
T1 - Toward blind logo watermarking in JPEG-compressed images
AU - Gong, Qing
AU - Shen, Hong
PY - 2005
Y1 - 2005
N2 - A novel blind logo-watermarking algorithm for copyright protection of JPEG-compressed images is proposed. A visually meaningful grayscale logo is encoded by the (255, 9) BCH code into a codeword that is embedded as the watermark into the wavelet domain of the host image using a pixel-wise masking model. A trellis is generated with a specific path corresponding to that codeword. At the receiving end where the watermarked image is stored in a JPEG file, the codeword is recovered approximately through running the viterbi decoder on the trellis even without reference to the original host data, and then decoded back to the embedded logo by the (255, 9) BCH codec. Thanks to the BCH code's powerful error correction capability and human vision system's great tolerance to image noise, the extracted logo, possibly degraded, contains much more convincing information than that of a randomly-generated numerical sequence that is widely used in traditional watermarking strategies. Experimental results of successfully hiding a 32 × 32, grayscale logo into 512 × 512 JPEG-compressed images verify our algorithm's practical performance.
AB - A novel blind logo-watermarking algorithm for copyright protection of JPEG-compressed images is proposed. A visually meaningful grayscale logo is encoded by the (255, 9) BCH code into a codeword that is embedded as the watermark into the wavelet domain of the host image using a pixel-wise masking model. A trellis is generated with a specific path corresponding to that codeword. At the receiving end where the watermarked image is stored in a JPEG file, the codeword is recovered approximately through running the viterbi decoder on the trellis even without reference to the original host data, and then decoded back to the embedded logo by the (255, 9) BCH codec. Thanks to the BCH code's powerful error correction capability and human vision system's great tolerance to image noise, the extracted logo, possibly degraded, contains much more convincing information than that of a randomly-generated numerical sequence that is widely used in traditional watermarking strategies. Experimental results of successfully hiding a 32 × 32, grayscale logo into 512 × 512 JPEG-compressed images verify our algorithm's practical performance.
UR - https://www.scopus.com/pages/publications/33745181637
U2 - 10.1109/PDCAT.2005.240
DO - 10.1109/PDCAT.2005.240
M3 - Conference contribution
AN - SCOPUS:33745181637
SN - 0769524052
SN - 9780769524054
T3 - Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings
SP - 1058
EP - 1061
BT - Proceedings - Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
T2 - 6th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2005
Y2 - 5 December 2005 through 8 December 2005
ER -