Hardcopy watermarking

Image analysis – Applications

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

06775393

ABSTRACT:

BACKGROUND
The fast development of digital information technology, combined with the simplicity of duplicating and distributing data across communications networks such as the Internet, has exposed content providers to a real challenge of protecting their content. This challenge has resulted in research and development of sophisticated watermarking and information-hiding methodologies.
Hardcopy watermarking involves modifying a digital image such that secret information is embedded in a hardcopy (e.g., a printed version) of the digital image. The secret information might be information about the image, information about the owner of the image, anti-counterfeit information, etc. The secret information is not visible or it is perceived as noise. However, the secret information can be detected by converting the hardcopy back to a digital image, and decoding the digital image.
Design parameters for hardcopy watermarking include robustness of decoding in view of image quality degradation inflicted by printing, scanning, and other affects (e.g., cropping, misalignment, stains and scratches); visual quality of the hardcopy; and coding rate. The coding rate—the relative amount of secret information that can be reliably embedded in the digital image—typically involves a tradeoff with visual quality and robustness. A higher coding rate allows more information to be embedded in the image, but tends to reduce the visual quality of the image and robustness in decoding the message. Conversely, a lower coding rate tends to provide less information, but the image has a higher visual quality and the decoding is more robust. It would be desirable to perform hardcopy watermarking that is robust, has a high coding rate and does not degrade the visual quality of the hardcopy.
Decoding the watermarked image typically requires access to the original image. In some instances, however, the original image is not available. In other instances, it might be desirable to perform the decoding without access to the original image.
SUMMARY
According to one aspect of the present invention, a digital image is hardcopy watermarked by modifying transform coefficients in a transform domain representation of the digital image, the transform coefficients being modified according to bit values of a message. According to another aspect of the present invention, a message in a hardcopy watermarked image is identified by statistically decoding a transform domain representation of the watermarked image. Other aspects and advantages of the present invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating by way of example the principles of the present invention.


REFERENCES:
patent: 5809139 (1998-09-01), Girod et al.
patent: 5848155 (1998-12-01), Cox
patent: 5859920 (1999-01-01), Daly et al.
patent: 6208735 (2001-03-01), Cox et al.
patent: 6523114 (2003-02-01), Barton
patent: 0766468 (1997-04-01), None
patent: 0991279 (2000-04-01), None
Chen et al., “Dither modulation: a new approach to digital watermarking and information embedding,” SPIE Col. 3657, Jan. 1999.
Cox et al., “Secured spread spectrum watermarking for multimedia,” NEC Research Institute, Technical Report 95-10.
XP-000921838 “Digital Watermarking Using Inter-Block Correlation” by Yoonki Choi and Kiyoharu Aizawdated Oct. 24, 1999 the whole document.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Hardcopy watermarking does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Hardcopy watermarking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hardcopy watermarking will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3335573

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.