IP Library Granted Patent US 12,651,303
Granted Patent B2
US 12,651,303 · App. 17/670,305 · Granted Jun 9, 2026

Determining detectability measures for images with encoded signals

Inventor: Vojtech Holub (Portland, OR)
Assignee: Digimarc Corporation
G06T1/0028G06T1/0021G06T1/005G06T1/0078G06T1/0035G06T1/0092G06T2201/0202
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,651,303
App. No.
17/670,305
Granted
Jun 9, 2026
Kind
B2
Abstract

Advanced image signal processing is used to generate detectability measures. Such detectability measures can predict robustness of embedded printed objects prior to printing. Other technology is described and claimed as well.

Claims (38)

1 . An image processing method comprising:

obtaining data representing a digital image;

using one or more processors, embedding an information signal within the data representing the digital image, the information signal comprising a synchronization component and a message component, said embedding yielding altered data;

transforming the altered data to simulate a print and optical capture process, said transforming yielding transformed, altered data;

for each of a plurality of regions within the transformed, altered data, generating detectability measures, in which a first detectability measure comprises a measure corresponding to synchronization component strength of the synchronization component itself within a region of the transformed, altered data, and in which a second detectability measure comprises a measure corresponding to message component strength of the message component itself within the region of the transformed, altered data, wherein the first detectability measure and the second detectability measure are independently generated, prior to printing, by analyzing properties of the synchronization component and the message component in the transformed, altered data that simulates the print and optical capture process, in which the synchronization component comprises a plurality of peaks in a transform domain, and in which the synchronization component strength represents the plurality of peaks to their neighboring peaks in the transform domain by utilizing peak value magnitudes or average value of such; and

based on a combination of generated detectability measures from each of the plurality of regions, determining a likelihood that the altered data, once printed on a physical substrate, will be detectable from optical scan data representing such, wherein said determining the likelihood comprises forming a composite prediction that jointly accounts for both synchronization and message component detectability in each region and across multiple regions of the transformed, altered data.

2 . The image processing method of claim 1 in which the plurality of regions comprises embedding tiles.

3 . The image processing method of claim 1 in which multiple likelihoods are determined, with one likelihood determined for each of the plurality of regions.

4 . The image processing method of claim 1 in which the likelihood represents likely detection along a swipe path across the transformed, altered data.

5 . The image processing method of claim 1 in which the message component comprises a plural-bit signature comprising an error corrected plural-bit message, and in which the message component strength comprises a comparison of data representing bits in an original version of the plural-bit signature to data representing bits decoded from the transformed, altered data.

6 . The image processing method of claim 5 in which the comparison of data representing bits in the original version of the plural-bit signature to a sign of data representing bits decoded from the transformed, altered data.

7 . The image processing method of claim 1 in which said transforming estimates the print and optical capture process by introducing noise and blur to the altered data.

8 . The image processing method of claim 1 in which the message component comprises a plural-bit signature, and in which the message component strength comprises a comparison of data representing bits in an original version of the plural-bit signature to data representing bits decoded from the transformed, altered data, wherein the comparison comprises a strength measure based on comparing the bits in an original version to the bits decoded from the transformed, altered data.

9 . The image processing method of claim 1 in which the message component comprises a plural-bit signature, and in which the message component strength is determined by comparing data representing bits in an original version of the plural-bit signature to a sign of data representing bits decoded from the transformed, altered data to generate a correlation metric indicating detectability of the message component.

10 . A system comprising:

a display;

memory for storing data representing a digital image;

means for embedding an information signal within the data representing the digital image, the information signal comprising a synchronization component and a message component, said means for embedding generating altered data;

means for transforming the altered data to estimate a print and optical capture process, said means for transforming generating transformed, altered data;

means for generating detectability measures, for each of a plurality of regions within the transformed, altered data, in which a first detectability measure corresponds to synchronization component strength within a region of the transformed, altered data, and in which a second detectability measure corresponds to message component strength within the region of the transformed, altered data;

means for determining a likelihood that the altered data, once printed on a physical substrate, will be detectable from optical scan data representing such, in which said means for determining utilizes a combination of the first detectability measure and the second detectability measure from each of the plurality of regions, in which the likelihood represents likely detection along a swipe path across the plurality of regions within the transformed, altered data, the swipe path representing a swath of imagery as seen by a stationary camera as a physical object comprising the altered data moves across its field of view; and

a graphical user interface for causing said display to display a color map which represents determined information signal detectability from the altered data as if printed on a substrate.

11 . The system of claim 10 in which the plurality of regions comprises embedding tiles.

12 . The system of claim 10 in which multiple likelihoods are determined, one likelihood for each for the plurality of regions.

13 . The system of claim 10 in which the message component comprises a plural-bit signature comprising an error corrected plural-bit message, and in which the message component strength comprises a comparison of data representing bits in an original version of the plural-bit signature to data representing bits decoded from the transformed, altered data.

14 . The system of claim 10 in which the message component comprises a plural-bit signature comprising an error corrected plural-bit message, and in which the message component strength comprises a comparison of data representing bits in an original version of the plural-bit signature to a sign of data representing bits decoded from the transformed, altered data.

15 . The system of claim 10 in which said means for transforming estimates the print and optical capture process by introducing noise and blur into the altered data.

16 . A non-transitory computer readable medium comprising instructions stored thereon that, when executed by one or more processors, cause the one or more processors to perform the following:

obtaining data representing a digital image;

embedding an information signal within the data representing the digital image, the information signal comprising a synchronization component and a message component, the embedding yielding altered data;

transforming the altered data to simulate a print and optical capture process, the transforming yielding transformed, altered data;

for each of a plurality of regions within the transformed, altered data, generating detectability measures, in which a first detectability measure corresponds to synchronization component strength based on synchronization signal properties within a region of the transformed, altered data, and in which a second detectability measure corresponds to message component strength based on message signal properties within the region of the transformed, altered data, wherein the first detectability measure and the second detectability measure are independently generated, prior to printing, in which the synchronization component comprises a plurality of peaks in a transform domain, and in which the synchronization component strength represents the plurality of peaks to their neighboring peaks in the transform domain by utilizing peak value magnitudes or average value of such; and

based on a combination of the first detectability measure and the second detectability measure from each of the plurality of regions, determining a likelihood for each of the plurality of regions that the altered data, once printed on a physical substrate, will be detectable from optical scan data representing such, wherein said determining the likelihood comprises forming a composite prediction that jointly accounts for both synchronization and message component detectability in each region and across multiple regions of the transformed, altered data.

17 . The non-transitory computer readable medium of claim 16 in which the plurality of regions comprises embedding tiles.

18 . The non-transitory computer readable medium of claim 16 in which the likelihood represents likely detection along a swipe path across a plurality of regions within the transformed, altered data, the swipe path representing a swath of imagery as seen by a stationary camera as a physical object comprising the altered data moves across its field of view.

19 . The non-transitory computer readable medium of claim 16 in which the message component comprises a plural-bit signature comprising an error corrected plural-bit message, and in which the message component strength comprises a comparison of data representing bits in an original version of the plural-bit signature to data representing bits decoded from the transformed, altered data.

20 . The non-transitory computer readable medium of claim 16 in which the message component comprises a plural-bit signature comprising an error corrected plural-bit message, and in which the message component strength comprises a comparison of data representing bits in an original version of the plural-bit signature to a sign of data representing bits decoded from the transformed, altered data.

21 . The non-transitory computer readable medium of claim 16 in which the transforming simulates the print and optical capture process by introducing noise and blur to the altered data.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 11, 2022
From: HOLUB, VOJTECH
To: DIGIMARC CORPORATION
Reel/Frame 058994/0535 →
Continuity (6)
Continuation 16179740 · Nov 2, 2018
Continuation 15154529 · May 13, 2016
Provisional Application 62325254 · Apr 20, 2016
Provisional Application 62299228 · Feb 24, 2016
Provisional Application 62248264 · Oct 29, 2015
Related Publication 20220343453A1 · Oct 27, 2022
References Cited (216)
US 5262623A · Batterman · 1993 [cited by applicant]
US 5365048A · Komiya · 1994 [cited by applicant]
US 5841886A · Rhoads · 1998 [cited by applicant]
US 5859920A · Daly · 1999 [cited by applicant]
US 5862260A · Rhoads · 1999 [cited by applicant]
US 5949885A · Leighton · 1999 [cited by applicant]
US 6122403A · Rhoads · 2000 [cited by applicant]
US 6175627B1 · Petrovic · 2001 [cited by applicant]
US 6208735B1 · Cox · 2001 [cited by applicant]
US 6246775B1 · Nakamura · 2001 [cited by applicant]
US 6307949B1 · Rhoads · 2001 [cited by applicant]
US 6343138B1 · Rhoads · 2002 [cited by applicant]
US 6345104B1 · Rhoads · 2002 [cited by applicant]
US 6408082B1 · Rhoads · 2002 [cited by applicant]
US 6449377B1 · Rhoads · 2002 [cited by applicant]
US 6463416B1 · Messina · 2002 [cited by applicant]
US 6523741B1 · Dimaria · 2003 [cited by applicant]
US 6590996B1 · Reed · 2003 [cited by applicant]
US 6614914B1 · Rhoads · 2003 [cited by applicant]
US 6625297B1 · Bradley · 2003 [cited by applicant]
US 6687385B1 · Handley · 2004 [cited by applicant]
US 6698658B2 · Mcqueen · 2004 [cited by applicant]
US 6704869B2 · Rhoads · 2004 [cited by applicant]
US 6718046B2 · Reed · 2004 [cited by applicant]
US 6738495B2 · Rhoads · 2004 [cited by applicant]
US 6763123B2 · Reed · 2004 [cited by applicant]
US 6843422B2 · Jones · 2005 [cited by applicant]
US 6891959B2 · Reed · 2005 [cited by applicant]
US 6912295B2 · Reed · 2005 [cited by applicant]
US 6947571B1 · Rhoads · 2005 [cited by applicant]
US 6993154B2 · Brunk · 2006 [cited by applicant]
US 7006662B2 · Alattar · 2006 [cited by applicant]
US 7013021B2 · Sharma · 2006 [cited by applicant]
US 7016516B2 · Rhoads · 2006 [cited by applicant]
US 7043052B2 · Rhoads · 2006 [cited by applicant]
US 7044395B1 · Davis · 2006 [cited by applicant]
US 7046819B2 · Sharma · 2006 [cited by applicant]
US 7054461B2 · Zeller · 2006 [cited by applicant]
US 7058200B2 · Donescu · 2006 [cited by applicant]
US 7085396B2 · Pelly · 2006 [cited by applicant]
US 7113596B2 · Rhoads · 2006 [cited by applicant]
US 7116781B2 · Rhoads · 2006 [cited by applicant]
US 7130442B2 · Braudaway · 2006 [cited by applicant]
US 7158654B2 · Rhoads · 2007 [cited by applicant]
US 7213757B2 · Jones · 2007 [cited by applicant]
US 7231061B2 · Bradley · 2007 [cited by applicant]
US 7263203B2 · Rhoads · 2007 [cited by applicant]
US 7286685B2 · Brunk · 2007 [cited by applicant]
US 7330563B2 · Rhoads · 2008 [cited by applicant]
US 7349555B2 · Rhoads · 2008 [cited by applicant]
US 7352878B2 · Reed · 2008 [cited by applicant]
US 7369678B2 · Rhoads · 2008 [cited by applicant]
US 7370190B2 · Calhoon · 2008 [cited by applicant]
US 7478067B2 · Messina · 2009 [cited by applicant]
US 7602977B2 · Rhoads · 2009 [cited by applicant]
US 7607016B2 · Brunk · 2009 [cited by applicant]
US 7657058B2 · Sharma · 2010 [cited by applicant]
US 7724920B2 · Rhoads · 2010 [cited by applicant]
US 7762468B2 · Jones · 2010 [cited by applicant]
US 7796826B2 · Rhoads · 2010 [cited by applicant]
US 7856116B2 · Rodriguez · 2010 [cited by applicant]
US 7986807B2 · Stach · 2011 [cited by applicant]
US 8051295B2 · Brunk · 2011 [cited by applicant]
US 8059858B2 · Brundage · 2011 [cited by applicant]
US 8123134B2 · Reed · 2012 [cited by applicant]
US 8127137B2 · Levy · 2012 [cited by applicant]
US 8194919B2 · Rodriguez · 2012 [cited by applicant]
US 8243980B2 · Rhoads · 2012 [cited by applicant]
US 8245926B2 · Guess · 2012 [cited by applicant]
US 8301893B2 · Brundage · 2012 [cited by applicant]
US 8321350B2 · Durst · 2012 [cited by applicant]
US 8411898B2 · Rhoads · 2013 [cited by applicant]
US 8438395B2 · Andelin · 2013 [cited by applicant]
US 8473209B2 · Nielsen · 2013 [cited by applicant]
US 8543823B2 · Carr · 2013 [cited by applicant]
US 9008192B2 · Rhoads · 2015 [cited by applicant]
US 9087376B2 · Rodriguez · 2015 [cited by applicant]
US 9117268B2 · Reed · 2015 [cited by applicant]
US 9224184B2 · Bai · 2015 [cited by applicant]
US 9380186B2 · Reed · 2016 [cited by applicant]
US 9521291B2 · Holub · 2016 [cited by applicant]
US 9635378B2 · Holub · 2017 [cited by applicant]
US 9690967B1 · Brundage · 2017 [cited by applicant]
US 9716807B2 · Holub · 2017 [cited by applicant]
US 9727941B1 · Falkenstern · 2017 [cited by applicant]
US 9754341B2 · Falkenstern · 2017 [cited by applicant]
US 9892478B2 · Calhoon · 2018 [cited by applicant]
US 10078878B2 · Bai · 2018 [cited by applicant]
US 10198782B1 · Bradley · 2019 [cited by applicant]
US 10217182B1 · Holub · 2019 [cited by examiner]
US 10262176B1 · Powell · 2019 [cited by applicant]
US 10275847B2 · Brundage · 2019 [cited by applicant]
US 10460161B1 · Lauer · 2019 [cited by applicant]
US 10506128B1 · Chadwick · 2019 [cited by examiner]
US 10565415B2 · Powell · 2020 [cited by applicant]
US 10748231B2 · Brundage · 2020 [cited by applicant]
US 11250534B2 · Holub · 2022 [cited by examiner]
US 20020009208A1 · Alattar · 2002 [cited by examiner]
US 20020054355A1 · Brunk · 2002 [cited by applicant]
US 20020057823A1 · Sharma · 2002 [cited by examiner]
US 20020157005A1 · Brunk · 2002 [cited by applicant]
US 20020159614A1 · Bradley · 2002 [cited by examiner]
US 20030002710A1 · Rhoads · 2003 [cited by applicant]
US 20030025423A1 · Miller · 2003 [cited by applicant]
US 20030033530A1 · Sharma · 2003 [cited by applicant]
US 20030147549A1 · Choi · 2003 [cited by applicant]
US 20030149879A1 · Tian · 2003 [cited by applicant]
US 20040001608A1 · Rhoads · 2004 [cited by applicant]
US 20040079804A1 · Harding · 2004 [cited by applicant]
US 20040181671A1 · Brundage · 2004 [cited by applicant]
US 20040263911A1 · Rodriguez · 2004 [cited by examiner]
US 20050157907A1 · Reed · 2005 [cited by examiner]
US 20080025554A1 · Landwehr · 2008 [cited by applicant]
US 20080149724A1 · Nishizawa · 2008 [cited by applicant]
US 20080221727A1 · Walls · 2008 [cited by applicant]
US 20090060331A1 · Liu · 2009 [cited by applicant]
US 20090206161A1 · Olmstead · 2009 [cited by applicant]
US 20100025472A1 · Morgana · 2010 [cited by applicant]
US 20100123005A1 · Guess · 2010 [cited by applicant]
US 20100142003A1 · Braun · 2010 [cited by applicant]
US 20110123063A1 · Delp · 2011 [cited by applicant]
US 20120000983A1 · Bhagwan · 2012 [cited by applicant]
US 20120104097A1 · Moran · 2012 [cited by applicant]
US 20130001290A1 · Trajkovic · 2013 [cited by applicant]
US 20130001313A1 · Denniston, Jr. · 2013 [cited by applicant]
US 20130206839A1 · Gao · 2013 [cited by applicant]
US 20130223673A1 · Davis · 2013 [cited by applicant]
US 20130230239A1 · Feris · 2013 [cited by applicant]
US 20130329006A1 · Boles · 2013 [cited by applicant]
US 20130336525A1 · Kurtz · 2013 [cited by applicant]
US 20140021260A1 · Cherry · 2014 [cited by applicant]
US 20140027516A1 · Fushiki · 2014 [cited by applicant]
US 20140052555A1 · MacIntosh · 2014 [cited by examiner]
US 20140112524A1 · Bai · 2014 [cited by applicant]
US 20140258110A1 · Davis · 2014 [cited by applicant]
US 20140343719A1 · Collombet · 2014 [cited by applicant]
US 20150006672A1 · Morel · 2015 [cited by applicant]
US 20150030201A1 · Holub · 2015 [cited by applicant]
US 20150097032A1 · Olmstead · 2015 [cited by applicant]
US 20150156369A1 · Reed · 2015 [cited by applicant]
US 20150187039A1 · Reed · 2015 [cited by applicant]
US 20150199581A1 · Zhang · 2015 [cited by applicant]
US 20150287156A1 · Mai · 2015 [cited by applicant]
US 20150302543A1 · Weaver · 2015 [cited by applicant]
US 20160105585A1 · Holub · 2016 [cited by applicant]
US 20160267620A1 · Calhoon · 2016 [cited by applicant]
US 20160275639A1 · Holub · 2016 [cited by applicant]
US 20160364623A1 · Evans · 2016 [cited by applicant]
US 20170004597A1 · Boles · 2017 [cited by applicant]
US 20170177656A1 · Johnson · 2017 [cited by applicant]
US 20180157883A1 · Cumoli · 2018 [cited by applicant]
US 20180157887A1 · D'Ercoli · 2018 [cited by applicant]
US 20180157888A1 · D'Ercoli · 2018 [cited by applicant]
US 20180157931A1 · D'Ercoli · 2018 [cited by applicant]
US 20180240212A1 · Calhoon · 2018 [cited by applicant]
US 20190073739A1 · Holub · 2019 [cited by applicant]
US 20190236748A1 · Long · 2019 [cited by applicant]
US 20190385034A1 · Evans · 2019 [cited by applicant]
US 20200051200A1 · Brundage · 2020 [cited by applicant]
US 20200234468A1 · Lerchner · 2020 [cited by applicant]
US 20210027413A1 · Brundage · 2021 [cited by applicant]
JP 2008171130A · 2008 [cited by applicant]
WO 2013033442A1 · 2013 [cited by applicant]
US 9,438,765 B2, 09/2016, Holub (withdrawn) [cited by applicant]
Riad et al., “Print-and-Scan Counterattacks For Plastic Card Supports Fourier Watermarking”, Jun. 2014, IEEE, 2014 IEEE 23rd Int. Symp. on Industrial Electronics (ISIE), p. 1036-1041. (Year: 2014). [cited by examiner]
Avcibas et al., “Steganalysis of Watermarking Techniques using Image Quality Metrics”, Aug. 2001, SPIE, Security and Watermarking of Multimedia Contents III, Proceedings of SPIE, vol. 4314, p. 523-531. (Year: 2001). [cited by examiner]
Amendment filed Jul. 29, 2020 in U.S. Appl. No. 16/264,413. 11 pgs. [cited by applicant]
Assignee's U.S. Appl. No. 15/063,381, filed Mar. 7, 2016, including filing receipt. 51 pgs. [cited by applicant]
Avcibas, et al., ‘Steganalysis of Watermarking Techniques Using Images Quality Metrics’, Proceedings of SPIE, Jan. 2001, vol. 4314, pp. 523-531. [cited by applicant]
Chih-Chung Chang and Chih-Jen Lin,, ‘LIBSVM: A Library for Support Vector Machines,’ ACM Transactions on Intelligent Systems and Technology, vol. 2, No. 3, Article 27, Publication date: Apr. 2011. 27 pgs. [cited by applicant]
Dautzenberg, ‘Watermarking Images,’ Department of Microelectronics and Electrical Engineering, Trinity College Dublin, 47 pages, Oct. 1994. [cited by applicant]
Del Colle et al. “DWT based Digital Watermarking Fidelity and Robustness Evaluation”, Apr. 2008, Journal of Computer Science and Technology, vol. 8, No. 1, p. 1-6. [cited by applicant]
Dot Product article, Wikipedia, Mar. 30, 2015. 8 pgs. [cited by applicant]
Fan, et al., ‘LIBLINEAR: A Library for Large Linear Classification,’ Journal of Machine Learning Research 9 (2008) 1871-1874. [cited by applicant]
Feb. 8, 2017 Amendment in assignee's U.S. Appl. No. 14/881,448 (published as US 2016-0105585 AI). 14 pgs. [cited by applicant]
Fridrich, Kodovsk & Holub, ‘Steganalysis of Content-Adaptive Steganography in Spatial Domain,’ Information Hiding, vol. 6958 of the series Lecture Notes in Computer Science pp. 102-117, 2011. [cited by applicant]
GS1 2D Barcode Verification Process Implementation Guideline: developed with the intention of providing a clear explanation on the practical implications of 2D Barcode Verification within the GS1 System. Release 1.3.21,… [cited by applicant]
GS1 Bar Code Verification For Linear Symbols, Version 4.3, May 2009. 69 pgs. [cited by applicant]
Hernandez et al., ‘Statistical Analysis of Watermarking Schemes for Copyright Protection of Images,’ Proceedings of the IEEE, vol. 87, No. 7, Jul. 1999. 22 pgs. [cited by applicant]
Holub & Fridrich, ‘Digital image steganography using universal distortion,’ IH&MMSec '13 Proceedings of the first ACM workshop on Information hiding and multimedia security, pp. 59-68 (2013). [cited by applicant]
International Standard: ISO/IEC15415, 2nd ed. Dec. 15, 2011, “Information technology—Automatic identification and data capture techniques—Bar code symbol print quality test specification—Two-dimensional symbols”. 52 pag… [cited by applicant]
J. Fridrich and J. Kodovsk , ‘Rich models for steganalysis of digital images,’ IEEE Trans. on Information Forensics and Security, 7(3):868-882, Jun. 2012. [cited by applicant]
J. Kodovsk , J. Fridrich, and V. Holub, ‘Ensemble classifiers for steganalysis of digital media,’ IEEE Trans. on Inform. Forensics and Security, 7(2):432-444, Apr. 2012. [cited by applicant]
Jan. 12, 2017 non-final Office Action; Jan. 13, 2017 Amendment; Mar. 15, 2017 Notice of Allowance; May 12, 2017 Amendment after Allowance; all from assignee's U.S. Appl. No. 15/154,572. 46 pgs. [cited by applicant]
Jul. 8, 2021 Amendment and Mar. 10, 2021 Office Action, both from assignee's U.S. Appl. No. 16/988,366, filed Aug. 7, 2020 and published as US 2021-0027413 A1. 30 pages. [cited by applicant]
Jul. 8, RCE + Amendment Accompanying RCE, and Mar. 8, 2021 Final Office Action, all from assignee's U.S. Appl. No. 16/179,740, filed Nov. 2, 2018 and published as US 2019-0073739 A1 . 44 pages. [cited by applicant]
Knill, Lecture 12: Correlation, Math 19b: Linear Algebra with Probability, Harvard, 2011. 2 pgs. [cited by applicant]
Kodovsk, Fridrich & Holub, “On dangers of overtraining steganography to incomplete cover model,” MM&Sec '11 Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security, pp. 69-76 (2011). [cited by applicant]
Kutter, ‘Watermarking Resisting to Translation, Rotation and Scaling,’ Proc. of SPIE: Multimedia Systems and Applications, vol. 3528, pp. 423-431, Boston, Nov. 1998. [cited by applicant]
Lin et al., ‘Rotation, Scale, and Translation Resilient Watermarking for Images,’ IEEE Transactions on Image ProU.S. Appl. No. 62/803,341cessing, vol. 10, No. 5, May 2001, pp. 767-782. [cited by applicant]
May 19, 2017 Response to Amendment under Rule 312; May 12, 2017 Amendment after Notice of Allowance; Mar. 15, 2017 Notice of Allowance; Jan. 12, 2017 non-final Office Action; and Jan. 13, 2017 Amendment, all from assign… [cited by applicant]
Nguyen et al. “Perceptual watermarking robust to JPEG compression attack”, May 2012, IEEE, Proceedings of the 5th Int. Symposium on Communications, Control and Signal Processing 2012, p. 1-4. [cited by applicant]
Nikolaidis and Pitas., ‘Region-based Image Watermarking,’ IEEE Transactions on Image Processing, vol. 10, No. 11, Nov. 2001, pp. 1726-1740. [cited by applicant]
Notice of Allowance, Notice of Allowability and Reasons for Allowance, dated Oct. 15, 2020 in U.S. Appl. No. 16/264,413. 11 pgs. [cited by applicant]
O'Ruanaidh et al., ‘Rotation, Scale and Translation Invariant Digital Image Watermarking,’ Int. Conf. on Image Proc., Oct. 1997, IEEE, pp. 536-539. [cited by applicant]
O'Ruanaidh et al., ‘Rotation, Scale and Translation Invariant Spread Spectrum Digital Image Watermarking,’ Signal Processing 66, May 1, 1998, pp. 303-317. [cited by applicant]
O'Ruanaidh, ‘Rotation, Scale and Translation Invariant Digital Image Watermarking,’ Signal Processing, pp. 2-15, May 1, 1998. [cited by applicant]
Oct. 14, 2016 Preliminary Amendment, and Jan. 27, 2017 non-final Office Action; all from assignee's U.S. Appl. No. 14/881,448 (published as US 2016-0105585 AI). 17 pgs. [cited by applicant]
Oct. 21, 2021 Amendment after Notice of Allowance, Jul. 21, 2021 Notice of Allowance, Jul. 8, 2021 Amendment, and Mar. 10, 2021 non-final Office Action, all from assignee's U.S. Appl. No. 16/988,366 (published as US 202… [cited by applicant]
Pereira et al., ‘Template Based Recovery of Fourier-Based Watermarks Using Log-Polar and Log-log Maps,’ Proc. IEEE Int. Conf. on Multimedia Computing and Systems, vol. 1, Jun. 1999, pp. 870-874. [cited by applicant]
Pevny , P. Bas, and J. Fridrich, ‘Steganalysis by subtractive pixel adjacency matrix,’ IEEE Transactions on Information Forensics and Security, 5(2):215-224, Jun. 2010. [cited by applicant]
R. O. Duda, P. E. Hart, and D. G. Stork, ‘Pattern Classification.’ Wiley Interscience, 2nd edition, 2000. 737 pgs. [cited by applicant]
Sheng et al., ‘Experiments on Pattern Recognition Using Invariant Fourier-Mellin Descriptors,’ Journal of Optical Society of America, vol. 3. No. 6, Jun. 1986, pp. 771-776. [cited by applicant]
Su et al., ‘An Image Watermarking Scheme to Resist Generalized Geometrical Transforms,’ Proc. SPIE vol. 4209: Multimedia Systems and Applications III, Nov. 2000, pp. 354-365. [cited by applicant]
Su et al., ‘Synchronized Detection of the Block-based Watermark with Invisible Grid Embedding,’ Proc. SPIE vol. 4314: Security and Watermarking of Multimedia Contents III, Jan. 2001, pp. 406-417. [cited by applicant]
U.S. Appl. No. 15/063,381, filed Oct. 17, Response to Amendment under Rule 312; Oct. 10, 2017 Amendment after Notice of Allowance; Sep. 27, 2017 Notice of Allowance; Mar. 7, 2016, including Aug. 18, 2017 Response to Res… [cited by applicant]
U.S. Appl. No. 15/154,572, filed May 13, 2016. 91 pgs. [cited by applicant]
U.S. Appl. No. 61/856,476, filed Jul. 19, 2013. 20 pgs. [cited by applicant]
U.S. Appl. No. 61/918,214, filed Dec. 19, 2013. 29 pgs. [cited by applicant]
U.S. Appl. No. 62/063,248, filed Oct. 13, 2014. 23 pgs. [cited by applicant]
U.S. Appl. No. 62/063,248, filed Oct. 13, 2014. 26 pgs. [cited by applicant]
U.S. Appl. No. 62/129,655, filed Mar. 6, 2015. 17 pgs. [cited by applicant]
U.S. Appl. No. 62/322, 193, filed Apr. 13, 2016. 73 pgs. [cited by applicant]
U.S. Appl. No. 14/725,399, filed May 29, 2015. (74 pgs.). [cited by applicant]
U.S. Appl. No. 15/154,529, filed May 13, 2016. (90 pages). [cited by applicant]
Wang et al. “OR-Benchmark: An Open and Reconfigurable Digital Watermarking Benchmarking Framework”, Jun. 2015, arXiv.org, <https://arxiv.org/abs/1506.00243>, p. 1-15. [cited by applicant]