US5745604A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Identification/authentication system using robust, distributed coding
Assignee: Digimarc Corp
•
Filing: 1996-03-15
•
Granted: 1998-04-28
•
Expires: 2016-03-15
Abstract
Abstract An identification code signal is impressed on a carrier to be identified (such as an electronic data signal or a physical medium) in a manner that permits the identification signal later to be statistically discerned and the carrier thereby identified. The method and apparatus are characterized by robustness despite degradation of the encoded carrier, and by holographic permeation of the identification signal throughout the carrier.
Inventors
- 👤 Geoffrey B. Rhoads
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 11:42
CPC Classifications
H; H04; H04N; H04N5/00; H04N5/76; H04N5/91; H04N5/913; G; G06; G06Q; G06Q20/00; G06Q20/30; G06Q20/34; G06Q20/341; G06Q20/38; G06Q20/40; G06Q20/401; G06Q20/4014; G06Q20/40145; G06T; G06T1/00; G06T1/0021; G06T1/005; G06T1/0057; G07; G07C; G07C9/00; G07C9/20; G07C9/22; G07C9/25; G07C9/253; G07D; G07D7/00; G07D7/003; G07D7/0032; G07D7/004; G07F; G07F17/00; G07F17/16; G07F17/26; G07F7/00; G07F7/08; G07F7/086; G07F7/10; G07F7/1008; G07F7/1016; G07F7/12; G10; G10L; G10L19/00; G10L19/018; G11; G11B; G11B20/00; G11B20/00086; G11B20/00094; G11B20/00115; G11B20/00166; G11B20/00181; G11B20/0021; G11B20/00884; G11B20/00891; H04B; H04B1/00; H04B1/66; H04B1/665; H04N1/00; H04N1/00002; H04N1/00005; H04N1/00026; H04N1/00037; H04N1/00071; H04N1/00074; H04N1/00079; H04N1/00838; H04N1/0084; H04N1/00843; H04N1/00846; H04N1/32; H04N1/32101; H04N1/32144; H04N1/32149; H04N1/32203; H04N1/32208; H04N1/32251; H04N1/32288; G06T2201/00; G06T2201/005; G06T2201/0052; G06T2201/0065; G06T2201/0081; H04N2005/91307; H04N2005/91321; H04N2005/91335; H04N2201/00; H04N2201/32; H04N2201/3201; H04N2201/3204; H04N2201/3205; H04N2201/3207; H04N2201/3225; H04N2201/3226; H04N2201/3233; H04N2201/3269; H04N2201/327; H04N2201/3271; H04N2201/328
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
119 words
In a method of image processing that includes processing an input image to steganographically encode a multi-bit message code therein, thereby yielding an encoded output image, and thereafter processing suspect data corresponding to said encoded output image to decode the message code therefrom, an improvement including: encoding the message code redundantly through the image data, wherein the message code can be detected from first and second non-overlapping rectangular excerpts thereof; and decoding the message code from said suspect data without reference to said input image, said decoding including performing a domain transformation on a first set of data related to said suspect data, said domain transformation producing transformed data in a spatial frequency domain, and analyzing said transformed data.
Claim 2
Dependent Claim
119 words
In a method of image processing that includes processing an input image to steganographically encode a multi-bit message code therein, thereby yielding an encoded output image, and thereafter processing suspect data corresponding to said encoded output image to decode the message code therefrom, an improvement including: encoding the message code redundantly through the image data, wherein the message code can be detected from first and second non-overlapping rectangular excerpts thereof; and decoding the message code from said suspect data without reference to said input image, said decoding including performing a domain transformation on a first set of data related to said suspect data, said domain transformation producing transformed data in a spatial frequency domain, and analyzing said transformed data.
Claim 3
Dependent Claim
41 words
The method of claim 1 in which said steganographic encoding includes processing the input image in accordance with key data in addition to said message code, each element of the input image having an element of said key data corresponding thereto.
Claim 4
Dependent Claim
26 words
The method of claim 2 in which the key data causes the message code to be represented differently at different locations in the encoded output image.
Claim 5
Dependent Claim
40 words
The method of claim 1 in which said first set of data is distinct from said suspect data, said first set of data being a set of difference data obtained by subtracting a second second data from said suspect data.
Claim 6
Dependent Claim
14 words
The method of claim 1 in which said domain transformation is a Fourier transformation.
Claim 7
Dependent Claim
41 words
The method of claim 1 in which said input image is obtained by a camera, and said processing includes exposing an emulsion film with said input image, said emulsion film having been pretreated to embed the multi-bit message code redundantly therethrough.
Claim 8
Dependent Claim
25 words
A method of video processing, the video including a plurality of frames, comprising performing the method of claim 1 on a plurality of said frames.
Claim 9
Dependent Claim
170 words
In an image processing method that includes steganographically encoding an input two-dimensional image to embed a multi-bit message code therein, the image comprising a plurality of rows of picture data, the method including processing said input image in accordance with said multi-bit message code to produce an output image having the message code encoded therein, an improvement including: encoding the message code throughout the output image so that the message code can be recovered from first and second non-overlapping rectangular excerpts of the output image; and representing a given bit of the encoded message code differently, both in absolute and percentage terms, in said first and second excerpts to reduce image degradation and increase message security, said encoding including changing a plurality of said picture data in accordance with said multi-bit message code, and also in accordance with local scaling data to control the amplitude of the multi-bit message code at different locations in the image, said local scaling data being computed from said picture data using a non-linear function.
Claim 10
Dependent Claim
170 words
In an image processing method that includes steganographically encoding an input two-dimensional image to embed a multi-bit message code therein, the image comprising a plurality of rows of picture data, the method including processing said input image in accordance with said multi-bit message code to produce an output image having the message code encoded therein, an improvement including: encoding the message code throughout the output image so that the message code can be recovered from first and second non-overlapping rectangular excerpts of the output image; and representing a given bit of the encoded message code differently, both in absolute and percentage terms, in said first and second excerpts to reduce image degradation and increase message security, said encoding including changing a plurality of said picture data in accordance with said multi-bit message code, and also in accordance with local scaling data to control the amplitude of the multi-bit message code at different locations in the image, said local scaling data being computed from said picture data using a non-linear function.
Claim 11
Dependent Claim
39 words
The method of claim 8 which includes deriving the local scaling data from picture data related thereto by use of a non-linear function, wherein doubling the value of picture data does not double the local scaling data corresponding thereto.
Claim 12
Dependent Claim
21 words
The method of claim 8 in which the local scaling data is also a function of first and second non-unity parameters.
Claim 13
Dependent Claim
25 words
A method of video processing, the video including a plurality of frames, comprising performing the method of claim 8 on a plurality of said frames.
Claim 14
Dependent Claim
159 words
In an image processing method that includes steganographically encoding an input two-dimensional image to embed a multi-bit message code therein, the image comprising a plurality of rows of picture data, the method including processing said input image in accordance with said multi-bit message code to produce an output image having the message code encoded therein, an improvement including: encoding the message code throughout the output image so that the message code can be recovered from first and second non-overlapping rectangular excerpts of the output image; said encoding including determining a scaling factor for each of a plurality of regions of the input image, each scaling factor being a non-linear function of picture data related thereto, wherein doubling the value of picture data does not double the scaling factor corresponding thereto, the encoding further including processing the input image in accordance with said scaling factors in addition to said noise data and said message code to produce an output image.
Claim 15
Dependent Claim
159 words
In an image processing method that includes steganographically encoding an input two-dimensional image to embed a multi-bit message code therein, the image comprising a plurality of rows of picture data, the method including processing said input image in accordance with said multi-bit message code to produce an output image having the message code encoded therein, an improvement including: encoding the message code throughout the output image so that the message code can be recovered from first and second non-overlapping rectangular excerpts of the output image; said encoding including determining a scaling factor for each of a plurality of regions of the input image, each scaling factor being a non-linear function of picture data related thereto, wherein doubling the value of picture data does not double the scaling factor corresponding thereto, the encoding further including processing the input image in accordance with said scaling factors in addition to said noise data and said message code to produce an output image.
Claim 16
Dependent Claim
20 words
The method of claim 12 in which the scaling factors are each a function of first and second non-unity parameters.
Claim 17
Dependent Claim
25 words
A method of video processing, the video including a plurality of frames, comprising performing the method of claim 12 on a plurality of said frames.
References Cited (Backward Citations)
US3493674A
Cited
US3585290A
Cited
US4231113A
Cited
US3569619A
Cited
US3655162A
Cited
US4944036A
Cited
US3703628A
Cited
US3971917A
Cited
US3805238A
Cited
US3922074A
Cited
US3809806A
Cited
US3838444A
Cited
US3982064A
Cited
US3914877A
Cited
US3984624A
Cited
US4025851A
Cited
US4252995A
Cited
US4238849A
Cited
US4225967A
Cited
US4262329A
Cited
US4379947A
Cited
US4230990A
Cited
US4230990C1
Cited
GB2063018B
Cited
GB2067871A
Cited
US4313197A
Cited
US4423415A
Cited
US4595950A
Cited
US4528588A
Cited
US4389671A
Cited
US4395600A
Cited
US4367488A
Cited
US4380027A
Cited
US4476468A
Cited
US4425642A
Cited
US4665431A
Cited
US4967273A
Cited
US4547804A
Cited
US4805020A
Cited
US4639779A
Cited
US4532508A
Cited
US4908873A
Cited
US4553261A
Cited
US4590366A
Cited
US4660221A
Cited
US4637051A
Cited
US4675746A
Cited
US4703476A
Cited
US4835517A
Cited
US5166676A
Cited
US4672605A
Cited
US4654867A
Cited
US4677435A
Cited
US4663518A
Cited
US4921278A
Cited
US4647974A
Cited
US4750173A
Cited
US4682794A
Cited
US4820912A
Cited
US4765656A
Cited
US4712103A
Cited
US4775901A
Cited
US4776013A
Cited
US4876617A
Cited
US4718106A
Cited
GB2196167B
Cited
US4739377A
Cited
US5293399A
Cited
US4864618A
Cited
US4884139A
Cited
US4866771A
Cited
US4939615A
Cited
US4903301A
Cited
GB2204984B
Cited
US4941150A
Cited
US4965827A
Cited
US4979210A
Cited
US4855827A
Cited
US5150409A
Cited
US4807031A
Cited
US4811408A
Cited
US5075773A
Cited
US4811357A
Cited
US5394274A
Cited
US4885632A
Cited
DE3806411C2
Cited
US4879747A
Cited
US4874936A
Cited
US4963998A
Cited
US5079648A
Cited
US4920503A
Cited
US5213337A
Cited
US5073899A
Cited
US5144660A
Cited
US4943976A
Cited
US4969041A
Cited
US4908836A
Cited
US5113437A
Cited
US5161210A
Cited
US5095196A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-04-27 | 2001-10-27 | 2002-04-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-04-27 | 2005-10-27 | 2006-04-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-04-27 | 2009-10-27 | 2010-04-28 | $7700.00 | Window Closed / Lapsed |