Patent US6064764A successfully refreshed from Google Patents.
US6064764A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Fragile watermarks for detecting tampering in images
Assignee: Seiko Epson Corp
•
Filing: 1998-03-30
•
Granted: 2000-05-16
•
Expires: 2018-03-30
Abstract
Abstract A watermarking scheme for images which includes techniques for inserting and extracting fragile watermarks in the frequency domain and for determining whether an image so watermarked has been tampered with. Watermark insertion is accomplished by embedding the bits of a digital signature of a hash function of the image in the frequency coefficients of the image. Tamper detection is accomplished generally as follows: the fragile watermark which was embedded during the watermark insertion process is extracted from the image; the hash function of the image is computed as in the insertion process; it is verified using a public key whether the extracted watermark is a valid signature of the hash value. If so, then there is assurance that the image has not been tampered with. Otherwise, there is reason to conclude that the image has been tampered with.
Inventors
- 👤 Vasudev Bhaskaran
- 👤 Viresh Ratnakar
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 04:51
CPC Classifications
G; G06; G06T; G06T1/00; G06T1/0021; G06T1/0042; H; H04; H04N; H04N1/00; H04N1/32; H04N1/32101; H04N1/32144; H04N1/32149; H04N1/32154; H04N1/32187; H04N1/32267; H04N1/32277; H04N1/32283; G06T2201/00; G06T2201/005; G06T2201/0052; G06T2201/0061; H04N2201/00; H04N2201/32; H04N2201/3201; H04N2201/3225; H04N2201/3233; H04N2201/3236; H04N2201/3269; H04N2201/327; H04N2201/328; H04N2201/3281
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
134 words
A method of watermarking a compressed digital image, comprising the steps of: partially decoding the compressed digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients; determining whether to embed a watermark bit in each block based on one of the plurality of transform coefficients in that block and a number of watermark bits remaining to be embedded in the digital image; computing a watermark, having a plurality of bits, for the entire digital image by applying a digital signature algorithm and a secret key; and embedding a watermark bit in each block for which it was determined to do so in said determining step by setting the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed watermark.
Claim 2
Independent Claim
134 words
A method of watermarking a compressed digital image, comprising the steps of: partially decoding the compressed digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients; determining whether to embed a watermark bit in each block based on one of the plurality of transform coefficients in that block and a number of watermark bits remaining to be embedded in the digital image; computing a watermark, having a plurality of bits, for the entire digital image by applying a digital signature algorithm and a secret key; and embedding a watermark bit in each block for which it was determined to do so in said determining step by setting the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed watermark.
Claim 3
Dependent Claim
34 words
The method of claim 1, wherein the one of the plurality of transform coefficients in each block is the transform coefficient representative of the highest vertical frequency and highest horizontal frequency in that block.
Claim 4
Dependent Claim
50 words
The method of claim 1, wherein said step of computing the watermark further comprises the step of: setting to zero at least one bit of the one of the plurality of transform coefficients in each block for which it is determined in said determining step to embed a watermark bit.
Claim 5
Dependent Claim
26 words
The method of claim 3, further comprising the step of: encoding the plurality of blocks after said embedding step is completed to re-compress the watermarked image.
Claim 6
Dependent Claim
51 words
The method of claim 3, wherein said of computing the watermark further comprises the step of: updating a hash value at each block by applying a hash function at each block, wherein the hash value computed at a last block is the multiple-bit hash value representative of the entire digital image.
Claim 7
Dependent Claim
48 words
The method of claim 5, wherein said step of computing the watermark further comprises the steps of: obtaining a quantizer of the one of the plurality of transform coefficients in each block; and multiplying the one of the plurality of transform coefficients in each block by its quantizer.
Claim 8
Independent Claim
267 words
A method of watermarking a compressed digital image, comprising the steps of: computing a watermark, having a plurality of bits, for the entire digital image, comprising the steps of: partially decoding the compressed digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients; obtaining a quantizer of the one of the plurality of transform coefficients in each block; multiplying the one of the plurality of transform coefficients in each block by its quantizer; determining whether to embed a watermark bit in each block based on one of the plurality of transform coefficients in that block that is representative of a highest vertical frequency and a highest horizontal frequency in that block and a number of watermark bits remaining to be embedded in the digital image; setting to zero at least one bit of the one of the plurality of transform coefficients in each block for which it is determined in said determining step to embed a watermark bit; updating a hash value at each block by applying a hash function at each block, wherein the hash value computed at a last block is a multiple-bit hash value representative of the entire digital image; and applying a secret key and a digital signature algorithm to the multiple-bit hash value to compute the watermark; and embedding a watermark bit in each block for which it was determined to do so in said determining step by setting the at least one bit of the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed watermark.
Claim 9
Independent Claim
267 words
A method of watermarking a compressed digital image, comprising the steps of: computing a watermark, having a plurality of bits, for the entire digital image, comprising the steps of: partially decoding the compressed digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients; obtaining a quantizer of the one of the plurality of transform coefficients in each block; multiplying the one of the plurality of transform coefficients in each block by its quantizer; determining whether to embed a watermark bit in each block based on one of the plurality of transform coefficients in that block that is representative of a highest vertical frequency and a highest horizontal frequency in that block and a number of watermark bits remaining to be embedded in the digital image; setting to zero at least one bit of the one of the plurality of transform coefficients in each block for which it is determined in said determining step to embed a watermark bit; updating a hash value at each block by applying a hash function at each block, wherein the hash value computed at a last block is a multiple-bit hash value representative of the entire digital image; and applying a secret key and a digital signature algorithm to the multiple-bit hash value to compute the watermark; and embedding a watermark bit in each block for which it was determined to do so in said determining step by setting the at least one bit of the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed watermark.
Claim 10
Independent Claim
175 words
A method of detecting tampering of a compressed watermarked image, comprising the steps of: partially decoding the compressed watermarked image to generate a plurality of data blocks, each block having a plurality of transform coefficients; determining each block in which a watermark bit is embedded; extracting, from each block for which it was determined in said determining step to be an embedder of a watermark bit, at least one bit of one of the plurality of transform coefficients in that block to generate an extracted watermark; computing a hash value of the digital image by applying a hash function at each block based on a zeroed value of the at least one bit of one of the plurality of transform coefficients in that block, wherein the hash value computed at a last block is a multiple-bit value representative of the entire digital image; and applying a digital signature verification algorithm to the extracted watermark and the multiple-bit computed hash value and a public key to determine whether the compressed watermarked image has been tampered with.
Claim 11
Independent Claim
175 words
A method of detecting tampering of a compressed watermarked image, comprising the steps of: partially decoding the compressed watermarked image to generate a plurality of data blocks, each block having a plurality of transform coefficients; determining each block in which a watermark bit is embedded; extracting, from each block for which it was determined in said determining step to be an embedder of a watermark bit, at least one bit of one of the plurality of transform coefficients in that block to generate an extracted watermark; computing a hash value of the digital image by applying a hash function at each block based on a zeroed value of the at least one bit of one of the plurality of transform coefficients in that block, wherein the hash value computed at a last block is a multiple-bit value representative of the entire digital image; and applying a digital signature verification algorithm to the extracted watermark and the multiple-bit computed hash value and a public key to determine whether the compressed watermarked image has been tampered with.
Claim 12
Dependent Claim
34 words
The method of claim 8, wherein the one of the plurality of transform coefficients in each block is the transform coefficient representative of the highest vertical frequency and highest horizontal frequency in that block.
Claim 13
Dependent Claim
144 words
An image capturing device, comprising: a sensor for capturing light and converting the light into an analog image signal; an analog-to-digital converter for converting the analog image signal to a digital image; and a digital image processor for compressing the digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients, determining whether to embed a watermark bit in each block based on one of the plurality of transform coefficients in that block and a number of watermark bits remaining to be embedded in the digital image, computing a watermark, having a plurality of bits, for the entire digital image, and embedding a watermark bit in each block for which it was determined to do so by setting the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed watermark.
Claim 14
Dependent Claim
144 words
An image capturing device, comprising: a sensor for capturing light and converting the light into an analog image signal; an analog-to-digital converter for converting the analog image signal to a digital image; and a digital image processor for compressing the digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients, determining whether to embed a watermark bit in each block based on one of the plurality of transform coefficients in that block and a number of watermark bits remaining to be embedded in the digital image, computing a watermark, having a plurality of bits, for the entire digital image, and embedding a watermark bit in each block for which it was determined to do so by setting the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed watermark.
Claim 15
Dependent Claim
41 words
The image capturing device of claim 10, wherein said digital image processor sets to zero at least one bit of the one of the plurality of transform coefficients in each block for which it is determined to embed a watermark bit.
Claim 16
Dependent Claim
29 words
The image capturing device of claim 11, wherein said digital image processor encodes the plurality of blocks after the watermark bit embedding is completed to re-compress the watermarked image.
Claim 17
Dependent Claim
47 words
The image capturing device of claim 11, wherein said digital image processor updates a hash value at each block by applying a hash function at each block, wherein the hash value computed at a last block is the multiple-bit hash value representative of the entire digital image.
Claim 18
Dependent Claim
43 words
The image capturing device of claim 11, wherein said digital image processor obtains a quantizer of the one of the plurality of transform coefficients in each block and multiples the one of the plurality of transform coefficients in each block by its quantizer.
Claim 19
Dependent Claim
191 words
A computer system including a processor and a memory having a computer-readable readable program code embodied therein for causing the processor to detect tampering of a compressed watermarked digital image by performing the steps of: partially decoding the compressed watermarked image to generate a plurality of data blocks, each block having a plurality of transform coefficients; determining each block in which a watermark bit is embedded; extracting, from each block for which it was determined in said determining step to be an embedder of a watermark bit, at least one bit of one of the plurality of transform coefficients in that block to generate an extracted watermark; computing a hash value of the digital image by applying a hash function at each block based on a zeroed value of the at least one bit of one of the plurality of transform coefficients in that block, wherein the hash value computed at a last block is a multiple-bit value representative of the entire digital image; and comparing the extracted watermark with the multiple-bit value by applying a digital signature verification algorithm to determine whether the compressed watermarked image has been tampered with.
Claim 20
Dependent Claim
191 words
A computer system including a processor and a memory having a computer-readable readable program code embodied therein for causing the processor to detect tampering of a compressed watermarked digital image by performing the steps of: partially decoding the compressed watermarked image to generate a plurality of data blocks, each block having a plurality of transform coefficients; determining each block in which a watermark bit is embedded; extracting, from each block for which it was determined in said determining step to be an embedder of a watermark bit, at least one bit of one of the plurality of transform coefficients in that block to generate an extracted watermark; computing a hash value of the digital image by applying a hash function at each block based on a zeroed value of the at least one bit of one of the plurality of transform coefficients in that block, wherein the hash value computed at a last block is a multiple-bit value representative of the entire digital image; and comparing the extracted watermark with the multiple-bit value by applying a digital signature verification algorithm to determine whether the compressed watermarked image has been tampered with.
Claim 21
Dependent Claim
35 words
The computer system of claim 15, wherein the one of the plurality of transform coefficients in each block is the transform coefficient representative of the highest vertical frequency and highest horizontal frequency in that block.
Claim 22
Independent Claim
186 words
A method of watermarking a digital image, having a plurality of pixels, comprising the steps of: computing a watermark, having a plurality of bits, for the entire digital image, comprising the steps of: determining whether to embed a watermark bit in each pixel based on one of a plurality of bits representative of that pixel and a number of watermark bits remaining to be embedded in the digital image; setting to zero at least one bit of each pixel for which it is determined in said determining step to embed a watermark bit; updating a hash value at each pixel by applying a hash function at each pixel, wherein the hash value computed at a last pixel is a multiple-bit hash value representative of the entire digital image; and applying a secret key and a digital signature algorithm to the multiple-bit hash value to compute the watermark; and embedding a watermark bit in each pixel for which it was determined to do so in said determining step by setting the at least one bit of that pixel to match a corresponding bit of the computed watermark.
Claim 23
Independent Claim
186 words
A method of watermarking a digital image, having a plurality of pixels, comprising the steps of: computing a watermark, having a plurality of bits, for the entire digital image, comprising the steps of: determining whether to embed a watermark bit in each pixel based on one of a plurality of bits representative of that pixel and a number of watermark bits remaining to be embedded in the digital image; setting to zero at least one bit of each pixel for which it is determined in said determining step to embed a watermark bit; updating a hash value at each pixel by applying a hash function at each pixel, wherein the hash value computed at a last pixel is a multiple-bit hash value representative of the entire digital image; and applying a secret key and a digital signature algorithm to the multiple-bit hash value to compute the watermark; and embedding a watermark bit in each pixel for which it was determined to do so in said determining step by setting the at least one bit of that pixel to match a corresponding bit of the computed watermark.
Claim 24
Dependent Claim
16 words
The method of claim 17, wherein the at least one bit is the least significant bit.
Claim 25
Independent Claim
149 words
A method of detecting tampering of a watermarked digital image, having a lo plurality of pixels, comprising the steps of: determining each pixel in which a watermark bit is embedded; extracting, from each pixel for which it was determined in said determining step to be an embedder of a watermark bit, at least one of a plurality of bits representative of that pixel to generate an extracted watermark; computing a hash value of the digital image by applying a hash function at each pixel based on a zeroed value of the at least one bit of that pixel, wherein the hash value computed at a last pixel is a multiple-bit value representative of the entire digital image; and applying a digital signature verification algorithm to the extracted watermark and the multiple-bit computed hash value and a public key to determine whether the compressed watermarked image has been tampered with.
Claim 26
Independent Claim
149 words
A method of detecting tampering of a watermarked digital image, having a lo plurality of pixels, comprising the steps of: determining each pixel in which a watermark bit is embedded; extracting, from each pixel for which it was determined in said determining step to be an embedder of a watermark bit, at least one of a plurality of bits representative of that pixel to generate an extracted watermark; computing a hash value of the digital image by applying a hash function at each pixel based on a zeroed value of the at least one bit of that pixel, wherein the hash value computed at a last pixel is a multiple-bit value representative of the entire digital image; and applying a digital signature verification algorithm to the extracted watermark and the multiple-bit computed hash value and a public key to determine whether the compressed watermarked image has been tampered with.
Claim 27
Dependent Claim
16 words
The method of claim 19, wherein the at least one bit is the least significant bit.
Claim 28
Independent Claim
276 words
A method of watermarking a compressed digital image, comprising the steps of: adding a visible watermark; computing an invisible watermark from the digital image and the visible watermark, comprising the steps of: partially decoding the compressed digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients; obtaining a quantizer of the one of the plurality of transform coefficients in each block; multiplying the one of the plurality of transform coefficients in each block by its quantizer; determining whether to embed an invisible watermark bit in each block based on one of the plurality of transform coefficients in that block that is representative of a highest vertical frequency and a highest horizontal frequency in that block and a number of invisible watermark bits remaining to be embedded in the digital image; setting to zero at least one bit of the one of the plurality of transform coefficients in each block for which it is determined in said determining step to embed an invisible watermark bit; updating a hash value at each block by applying a hash function at each block, wherein the hash value computed at a last block is a multiple-bit hash value representative of the entire digital image; and applying a secret key and a digital signature algorithm to the multiple-bit hash value to compute the invisible watermark; and embedding an invisible watermark bit in each block for which it was determined to do so in said determining step by setting the at least one bit of the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed invisible watermark.
Claim 29
Independent Claim
276 words
A method of watermarking a compressed digital image, comprising the steps of: adding a visible watermark; computing an invisible watermark from the digital image and the visible watermark, comprising the steps of: partially decoding the compressed digital image to generate a plurality of data blocks, each block having a plurality of transform coefficients; obtaining a quantizer of the one of the plurality of transform coefficients in each block; multiplying the one of the plurality of transform coefficients in each block by its quantizer; determining whether to embed an invisible watermark bit in each block based on one of the plurality of transform coefficients in that block that is representative of a highest vertical frequency and a highest horizontal frequency in that block and a number of invisible watermark bits remaining to be embedded in the digital image; setting to zero at least one bit of the one of the plurality of transform coefficients in each block for which it is determined in said determining step to embed an invisible watermark bit; updating a hash value at each block by applying a hash function at each block, wherein the hash value computed at a last block is a multiple-bit hash value representative of the entire digital image; and applying a secret key and a digital signature algorithm to the multiple-bit hash value to compute the invisible watermark; and embedding an invisible watermark bit in each block for which it was determined to do so in said determining step by setting the at least one bit of the one of the plurality of transform coefficients in that block to match a corresponding bit of the computed invisible watermark.
References Cited (Backward Citations)
US5488664A
Cited
US5617119A
Cited
US5606609A
Cited
US5568570A
Cited
US5530759A
Cited
US5942414A
Cited
US5613004A
Cited
US5687236A
Cited
US5699427A
Cited
US5930369A
Cited
US5689587A
Cited
US5664018A
Cited
US5862217A
Cited
US5862218A
Cited
US5822436A
Cited
US5848155A
Cited
US5809139A
Cited
US5825892A
Cited
US5915027A
Cited
US5875249A
Cited
US5960081A
Cited
US5991426A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-05-16 | 2003-11-15 | 2004-05-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-05-16 | 2007-11-15 | 2008-05-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-05-16 | 2011-11-15 | 2012-05-16 | $7700.00 | Window Closed / Lapsed |