Fragile watermarking scheme exploiting non-deterministic block-wise dependency
UNSPECIFIED (2004) Fragile watermarking scheme exploiting non-deterministic block-wise dependency. In: 17th International Conference on Pattern Recognition (ICPR), AUG 23-26, 2004, British Machine Vis Assoc, Cambridge, ENGLAND.Full text not available from this repository.
Block-wise dependency is recognized as a key requirement in fragile watermarking schemes to thwart the vector quantization (VQ) attack. It has also been observed that deterministic dependency is still susceptible to transplantation at- tack or even simple cover-up attack. In this work, a new fragile watermarking scheme exploiting non-deterministic dependency is proposed. To watermark the original image, each pixel is adjusted according to the consistency between a key-dependent binary watermark bit, the information from the pixel itself and the non-deterministic secret dependency information calculated from a neighborhood centered at that pixel. Localization resolution is enhanced with a post-processing operation on the output difference map.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION|
|Journal or Publication Title:||PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 4|
|Publisher:||IEEE COMPUTER SOC|
|Editor:||Kittler, J and Petrou, M and Nixon, M|
|Number of Pages:||4|
|Page Range:||pp. 849-852|
|Title of Event:||17th International Conference on Pattern Recognition (ICPR)|
|Location of Event:||British Machine Vis Assoc, Cambridge, ENGLAND|
|Date(s) of Event:||AUG 23-26, 2004|
Actions (login required)