A Semi-Fragile Watermarking Scheme with Tamper Recovery or High Tolerance

碩士 === 南台科技大學 === 資訊工程系 === 94 === Internet can be used to distribute digital media inexpensively and efficiently. However, the distribution of digital media grew fast on the internet and led to endanger to the copyright and integrity protection, because digital media can be easily replicated and mo...

Full description

Bibliographic Details
Main Authors: Che-Chia Ho, 何哲嘉
Other Authors: Ten-Chuan Hsiao
Format: Others
Language:zh-TW
Published: 2006
Online Access:http://ndltd.ncl.edu.tw/handle/91694728850504097928
Description
Summary:碩士 === 南台科技大學 === 資訊工程系 === 94 === Internet can be used to distribute digital media inexpensively and efficiently. However, the distribution of digital media grew fast on the internet and led to endanger to the copyright and integrity protection, because digital media can be easily replicated and modified. The existing methods for the intellectual property right protection are to embed robust digital watermark into the multimedia data. But the robust watermark methods can only verify their ownership but can not identify illegal tamper of image. Image authentication techniques can be classified into two categories: fragile and semi-fragile. Fragile authentication schemes are able to detect any modification. Semi-fragile authentication schemes are unaffected by legitimated modifications, such as JPEG compression, but sensitive to illegitimate manipulation, such as cutting, pasting and filter processing, etc. In this thesis, we provide two semi-fragile schemes. The first scheme is based on frequency domain and picks some DCT coefficients from each block. Then the DCT coefficient distance between each block is computed and recorded. An image feature consists of DCT distance between all blocks. This image feature can used to distinguish effectively if the image has been processed through image compression (such as JPEG compression) or other image processing. If image is suffered the tamper attacks, we can recover them up to as close as the original image. The second scheme is based on spatial domain. We divide image into fix number blocks and compute each block feature by our proposed method. This scheme not only accepts conventional image compression (such as JPEG and JPEG2000) but also accepts image scaling, and rejects unacceptable image processing (such as cut contrast process, etc.) and can locate suspect blocks.