2002 Fiscal Year Final Research Report Summary
Studies on digital watermarking for digital images using image generation function
Project/Area Number |
13650405
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
情報通信工学
|
Research Institution | Toyo University (2002) Nagoya University (2001) |
Principal Investigator |
KIMOTO Tadahiko Faculty of engineering, Professor, 工学部, 教授 (90186338)
|
Project Period (FY) |
2001 – 2002
|
Keywords | Digital watermark / Image generation function / Halftone image / Optical watermark / Fractal transform / Iteration function system / Block matching / Square error |
Research Abstract |
1. Digital watermarking in hard copy images using image generation function A digital image printed as a binary halftone image can have an optical watermark, which becomes visible only if the associated halftone image is superimposed on it. Such pair of images can be generated using different halftone cells on each image for a watermark dot. To make the watermark invisible on either image, a halftone cell should be randomly selected from those available for representing each level. This randomness, however, results in noisy appearance of the generated halftone images. In this research, to reduce the degradation of halftone quality those cells used for each level are limited to two, one of which is selected randomly. A set of two cells for each level which yields less noisy halftone quality has been obtained through computer simulation. 2. Fundamental study on information distribution using iteration function system An image can be generated using fractal transformation based on local iteration function system. In this research, property of information distribution in the image, location and amount, in the iteration of the transformation has been analyzed theoretically. Computer simulation showed the validity of the theoretical analysis. 3. Fast image block matching for fractal image transform An image block matching algorithm that uses a sum of square errors between blocks as an evaluation function can be accelerated by the indirect judgment scheme. In this research, this scheme is applied on the sequential similarity detection algorithm (SSDA), which is known as a fast block matching algorithm, to perform the faster block matching. By computer simulation the acceleration effect of indirect judgment has been evaluated in detail. Then, the conditions for achieving time reduction from the original SSDA scheme are derived. Also, the amount of operations for the preprocessing required in the proposed scheme was estimated theoretically.
|
Research Products
(18 results)