US6795565B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method to detect watermark resistant to resizing and translation
Assignee: Sony Corp
•
Filing: 2001-03-08
•
Granted: 2004-09-21
•
Expires: 2021-03-08
Abstract
Abstract A method of detecting a block-based watermark is provided. The method detects the location of the watermark within a frame of content data regardless of whether the watermark has been shifted or resized.
Inventors
- 👤 Peter David Wendt
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:35
CPC Classifications
G; G06; G06T; G06T1/00; G06T1/0021; G06T1/005; G06T1/0064; H; H04; H04N; H04N1/00; H04N1/32; H04N1/32101; H04N1/32144; H04N1/32149; G06T2201/00; G06T2201/005; G06T2201/0051; G06T2201/0061; G06T2201/0064; G06T2201/0065; H04N2201/00; H04N2201/32; H04N2201/3201; H04N2201/3225; H04N2201/3233; H04N2201/3269; H04N2201/327
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
128 words
A method of detecting block-based watermark data carrying a hidden message embedded in at least one frame of content data on a computer readable memory medium, said method comprising the steps of: filtering said content data to produce filtered data; calculating the absolute value of said filtered data to produce absolute value data, wherein said absolute value data comprises center data corresponding to centers of each block of said block-based watermark data; comparing said center data to reference data stored in memory associated with a watermark detector relating to the expected location of said watermark; calculating any deviation between said center data and said reference data; and utilizing any calculated deviation between said center data and said reference data to detect the hidden message of said watermark data.
Claim 2
Independent Claim
128 words
A method of detecting block-based watermark data carrying a hidden message embedded in at least one frame of content data on a computer readable memory medium, said method comprising the steps of: filtering said content data to produce filtered data; calculating the absolute value of said filtered data to produce absolute value data, wherein said absolute value data comprises center data corresponding to centers of each block of said block-based watermark data; comparing said center data to reference data stored in memory associated with a watermark detector relating to the expected location of said watermark; calculating any deviation between said center data and said reference data; and utilizing any calculated deviation between said center data and said reference data to detect the hidden message of said watermark data.
Claim 3
Dependent Claim
17 words
The method of claim 1 , wherein a linear filter is employed to perform said filtering step.
Claim 4
Dependent Claim
15 words
The method of claim 2 , wherein said linear filter performs multiplication and addition computations.
Claim 5
Dependent Claim
18 words
The method of claim 1 , wherein said filtering step is performed using a finite impulse response filter.
Claim 6
Dependent Claim
34 words
The method of claim 4 , wherein said filtering step is performed using said finite impulse response filter including an 8×8 matrix embedded with a binary sequence comprising the values of 1 and −1.
Claim 7
Dependent Claim
31 words
The method of claim 1 , wherein said filtering step is accomplished using a filter chosen from the group consisting of an adaptive filter, a non-FIR filter, and a nonlinear filter.
Claim 8
Dependent Claim
17 words
The method of claim 1 , wherein a memoryless nonlinearity is employed to perform said calculating step.
Claim 9
Dependent Claim
16 words
The method of claim 1 , wherein a lookup table is employed to perform said calculating.
Claim 10
Dependent Claim
21 words
The method of claim 1 , wherein a neural network is employed to perform said filtering step and said calculating step.
Claim 11
Independent Claim
187 words
A method of detecting block-based watermark data carrying a hidden message embedded in at least one frame of content data on a computer readable memory medium, said method comprising the steps of: filtering said content data to produce filtered data arranged in a matrix of rows and columns; calculating the absolute value of said filtered data to produce absolute value data arranged in a matrix of rows and columns; summing said absolute value data along each row of filtered data to generate a row projection signal; summing said absolute value data along each column of filtered data to generate a column projection signal, wherein said row and column projection signals comprise center data corresponding to centers of each block of said block-based watermark data; comparing said center data to reference data stored in memory associated with a watermark detector relating to the expected location of said watermark data within said at least one frame; calculating any deviation between said center data and said reference data; and utilizing any calculated deviation between said center data and said reference data to detect the hidden message of said watermark data.
Claim 12
Independent Claim
187 words
A method of detecting block-based watermark data carrying a hidden message embedded in at least one frame of content data on a computer readable memory medium, said method comprising the steps of: filtering said content data to produce filtered data arranged in a matrix of rows and columns; calculating the absolute value of said filtered data to produce absolute value data arranged in a matrix of rows and columns; summing said absolute value data along each row of filtered data to generate a row projection signal; summing said absolute value data along each column of filtered data to generate a column projection signal, wherein said row and column projection signals comprise center data corresponding to centers of each block of said block-based watermark data; comparing said center data to reference data stored in memory associated with a watermark detector relating to the expected location of said watermark data within said at least one frame; calculating any deviation between said center data and said reference data; and utilizing any calculated deviation between said center data and said reference data to detect the hidden message of said watermark data.
Claim 13
Dependent Claim
17 words
The method of claim 10 , wherein a linear filter is employed to perform said filtering step.
Claim 14
Dependent Claim
15 words
The method of claim 11 , wherein said linear filter performs multiplication and addition computations.
Claim 15
Dependent Claim
18 words
The method of claim 10 , wherein said filtering step is performed using a finite impulse response filter.
Claim 16
Dependent Claim
34 words
The method of claim 13 , wherein said filtering step is performed using said finite impulse response filter including an 8×8 matrix embedded with a binary sequence comprising the values of 1 and −1.
Claim 17
Dependent Claim
31 words
The method of claim 10 , wherein said filtering step is accomplished using a filter chosen from the group consisting of an adaptive filter, a non-FIR filter, and a nonlinear filter.
Claim 18
Dependent Claim
17 words
The method of claim 11 , wherein a memoryless nonlinearity is employed to perform said calculating step.
Claim 19
Dependent Claim
17 words
The method of claim 11 , wherein a lookup table is employed to perform said calculating step.
Claim 20
Dependent Claim
21 words
The method of claim 11 , wherein a neural network is employed to perform said filtering step and said calculating step.
Claim 21
Independent Claim
203 words
A method of detecting block-based watermark data carrying a hidden message embedded in at least one frame of content data on a computer readable memory medium, said method comprising the steps of: linearly filtering said content data using a finite impulse response filter to produce filtered data arranged in a matrix of rows and columns; calculating the absolute value of said filtered data to produce absolute value data arranged in a matrix of rows and columns; summing said absolute value data along each row of filtered data to generate a row projection signal comprising row center data corresponding to centers of said rows of blocks of said watermark data; summing said absolute value data along each column of filtered data to generate a column projection signal comprising column center data corresponding to centers of said columns of said blocks of watermark data; and comparing said row and column center data to reference data stored in memory associated with a watermark detector relating to the expected location of said watermark data; calculating any deviation between said center data and said reference data; and utilizing any calculated deviation between said center data and said reference data to detect the hidden message of said watermark data.
Claim 22
Independent Claim
203 words
A method of detecting block-based watermark data carrying a hidden message embedded in at least one frame of content data on a computer readable memory medium, said method comprising the steps of: linearly filtering said content data using a finite impulse response filter to produce filtered data arranged in a matrix of rows and columns; calculating the absolute value of said filtered data to produce absolute value data arranged in a matrix of rows and columns; summing said absolute value data along each row of filtered data to generate a row projection signal comprising row center data corresponding to centers of said rows of blocks of said watermark data; summing said absolute value data along each column of filtered data to generate a column projection signal comprising column center data corresponding to centers of said columns of said blocks of watermark data; and comparing said row and column center data to reference data stored in memory associated with a watermark detector relating to the expected location of said watermark data; calculating any deviation between said center data and said reference data; and utilizing any calculated deviation between said center data and said reference data to detect the hidden message of said watermark data.
Claim 23
Dependent Claim
17 words
The method of claim 19 , wherein said finite impulse response filter performs multiplication and addition computations.
Claim 24
Dependent Claim
28 words
The method of claim 19 , wherein said finite impulse response filter is an 8×8 matrix embedded with a binary sequence comprising the values of 1 and −1.
Claim 25
Dependent Claim
31 words
The method of claim 19 , wherein said filtering step is accomplished using a filter chosen from the group consisting or an adaptive filter, a non-FIR filter, and a nonlinear filter.
Claim 26
Dependent Claim
17 words
The method of claim 19 , wherein a memoryless nonlinearity is employed to perform said calculating step.
Claim 27
Dependent Claim
16 words
The method of claim 19 , wherein a lookup table is employed to perform said calculating.
Claim 28
Dependent Claim
17 words
The method of claim 19 , wherein a neural network is employed to perform said filtering step.
References Cited (Backward Citations)
US20030215112A1
Cited
US6047374A
Cited
US20030219144A1
Cited
US6424725B1
Cited
US6404926B1
Cited
US6108434A
Cited
US6556689B1
Cited
US6463162B1
Cited
JP2001078010A
Cited
US6282300B1
Cited
US20010036292A1
Cited
US20020032698A1
Cited
US20020090107A1
Cited
US20030012402A1
Cited
US20030021439A1
Cited
US6563937B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2007-09-21 | 2008-03-22 | 2008-09-21 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-09-21 | 2012-03-22 | 2012-09-21 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-09-21 | 2016-03-22 | 2016-09-21 | $7700.00 | Window Closed / Lapsed |