This application is related to LOCAL ENCODING OF INTRINSIC AUTHENTICATION DATA, U.S. Pat. App. No. 63/006,059 filed Apr. 6, 2020, and which is incorporated herein by reference.
COPYRIGHT © 2018-2021 Alitheon, Inc. A portion of the disclosure of this document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the document or the disclosure, as it appears in the Patent and Trademark Office file or records, but otherwise reserves all copyright rights whatsoever. 37 C.F.R. § 1.71(d) (2017).
This application pertains to methods, systems and software to apply a novel identifier to an item such as a physical object. That identifier is unique for each item or for each set of items and contains information about contents of authentication regions of the object useful for reliable, machine-implemented identification and or authentication of the object.
Significant efforts are made each year to prevent or inhibit the counterfeiting of items of value. One of the simplest and most common techniques is to apply a unique identifier or “ID” (often in the form of a 1-D or 2-D machine-readable symbol commonly referred to as a barcode symbol) to the item. When a person seeking to authenticate the object (we use “object” and “item” interchangeably in this document) scans the barcode symbol with, for example, a phone app, the app reads the barcode symbol, connects to an online site, and affirms that an object with the barcode symbol was manufactured by a particular producer, or otherwise may provide provenance information or other metadata.
With known unique identifiers, the identifier intrinsically contains no information about the object. The connection of the identifier with the object is through their exogenous association in a database, for example. In other words, a common way to use a barcode symbol, RFID transponder, or other ID is to start with a more-or-less random number or other code that contains no intrinsic information other than being suitable for use as an index into a database where data extracted from the object (e.g., digital fingerprints) and metadata about the object are associated with it. The ID then becomes a way to access the data and metadata about the item in the database. This approach for making such an index means that a copy of the object yields the same information from the database and authenticates just as well as the original so that the copy, if the associated database record is queried first, erroneously gets the authentication certification.
In other words, if, subsequently, someone attempts to authenticate another item with the same barcode symbol, the system knows that barcode symbol has already been authenticated and will reject the new item. The obvious problem with this approach is that the system has no way of knowing which of the two items is the copy, and which, if either, the original. Further, the above-described approach, as well as many other forms of item authentication, require the user or an application to connect to an online database in order to operate. If no connectivity is available, all attempts at authentication will fail.
There are other forms of anti-counterfeiting technology that do not require online connectivity. The paper fibers and special inks in bank notes, the capsules and coded corks on wine bottles, and many more fit into this category. As counterfeiters have become more capable in reproducing such features, manufacturers have had to add more and more such items to their goods. This has resulted in an arms race between producers and manufacturers. Complexity upon complexity has been added to items, with the results that ordinary users are unable to distinguish legitimate items from counterfeits.
The need remains for improvements in anti-counterfeiting technology to overcome the above problems associated with duplication of bar codes or other identifiers. The need also remains for improvements in anti-counterfeiting technology to obviate the need for external (say, network) connectivity to remote database resources. And the need remains for improvements in anti-counterfeiting technology to avoid increasingly complex and expensive solutions and improve user convenience.
The following is a summary of the present disclosure to provide a basic understanding of some features and context. This summary is not intended to identify key or critical elements of the disclosure or to delineate the scope of the disclosure. Its sole purpose is to present some concepts of the present disclosure in simplified form as a prelude to a more detailed description that is presented later.
Copying of an authentication machine-readable symbol (commonly referred to as a barcode symbol) or other item: The improvements described herein have at least two properties that make it exempt from the copying problems outlined above. First, the unique identifier taught in this disclosure has inherent content, not just content assigned to it through its use as, say, an index into a database. That unique content in a preferred embodiment comprises an encoding of item digital fingerprints, templates, etc. Second, inherent features of the item (such as paper fibers and ink bleeds) are used to produce those digital fingerprints and a copy does not have the same innate features as the original. As a result, the taught approach does not suffer from the second-to-authenticate problems since a copy will not authenticate at all. The unique identifier (or simply, “identifier”), for example, a number/number-letter combination may be printed onto a physical object or on a label on the object.
Connectivity failure: Because the location of and the digital fingerprints of the authentication region(s) of interest are encoded in the unique identifier, reading the unique identifier and extracting the digital fingerprints from the region(s) of interest and then comparing them are sufficient, when taken together, to authenticate the item without requiring external connectivity. The teachings of this disclosure are thus exempt from connectivity problems.
Complexity arms race: No amount of added complexity—be it special inks, clever logos, multiple hidden features—can secure an item against counterfeiting. Anything that can be intentionally created by one person can be intentionally recreated by another. The approach taught here, however, uses the complexity innate to the object (such as its physical structure at multiple scales) and accidents of its manufacture (such as machining marks and ink bleeds) to ensure against copying or duplication. The use of an available application (for instance on a smart phone) for extracting that complexity means that it is no longer up to the user (who is often ill equipped to do so) to ascertain whether the item has all the proper anti-counterfeiting add-ons.
Together, these considerations provide a system that allows authentication of an object that is less sensitive to copying than existing techniques, that does not require online connectivity to function effectively, and that does not require the end user to be an expert in anti-counterfeiting techniques.
This brief summary has been provided to describe certain concepts in a simplified form that are further described in more detail in the Detailed Description. The Brief Summary does not limit the scope of the claimed subject matter, but rather the words of the claims themselves determine the scope of the claimed subject matter.
Drawing figures are appended to illustrate some aspects of the present disclosure. The drawings are simplified representations of selected systems, methods and aspects; they are not intended to be limiting.
Reference will now be made in detail to embodiments of the inventive concept, examples of which are illustrated in the accompanying drawings. The accompanying drawings are not necessarily drawn to scale. In the following detailed description, numerous specific details are set forth to enable a thorough understanding of the inventive concept. It should be understood, however, that persons having ordinary skill in the art may practice the inventive concept without these specific details. In other instances, well-known methods, procedures, components, circuits, and networks have not been described in detail so as not to unnecessarily obscure aspects of the embodiments.
It will be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first machine could be termed a second machine, and, similarly, a second machine could be termed a first machine, without departing from the scope of the inventive concept.
It will be further understood that when an element or layer is referred to as being “on,” “coupled to,” or “connected to” another element or layer, it can be directly on, directly coupled to or directly connected to the other element or layer, or intervening elements or layers may be present. In contrast, when an element is referred to as being “directly on,” “directly coupled to,” or “directly connected to” another element or layer, there are no intervening elements or layers present. Like numbers refer to like elements throughout. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items.
The terminology used in the description of the inventive concept herein is for the purposes of describing illustrative embodiments only and is not intended to be limiting of the inventive concept. As used in the description of the inventive concept and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will also be understood that the term “and/or” as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed objects.
It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. As a preliminary matter, some of the terms used above, such as fingerprints (short for digital fingerprints) and authentication regions are described in detail later. A digital fingerprint is also sometimes called a “FeaturePrint.” FeaturePrint is a trademark of applicant Alitheon, Inc.
Reading a machine-readable symbol (used interchangeably with the terms bar code and barcode symbol or interrogating (used interchangeably with the term pinging) an RFID transponder (used interchangeably with the term RFID tag), for example by connecting to a remote database, are becoming more familiar acts for people seeking to ascertain that the items they have purchased are authentic. The presently disclosed improvements remove several of the limitations inherent in current approaches. Among the novel aspects taught by this disclosure are the following:
The application refers to a software application which may comprise, in some embodiments, an application program or “app” executable in a smartphone or other portable device. In other embodiments, the device need not be portable; it may comprise a kiosk or fixed terminal.
The location from which to extract the fingerprint can be a single region or a more complex template. In other words, a template may be coded in the unique identifier that specifies multiple locations or regions to be inspected or captured. These are sometimes called regions of interest. The template or region of interest can be localized in many ways, some of which are described in the companion patent application described in the next paragraph. In some embodiments, a region of interest may be specified (in the identifier) as an offset from the unique identifier. The captured image data may be processed using this location information to generate a digital fingerprint for authentication of the object.
The teachings of this disclosure may be combined with those of our other patent application, Automated Authentication Region Localization and Capture, No. 62/842,444 filed May 2, 2019. In that case, a process focuses in on, say, a logo or other “anchor region” that a user can find without difficulty on an object. In that disclosure, there is nothing in the anchor region that says where the authentication region is. The database knows based on what it has been told is being authenticated and from having the anchor region's contents as a starting point for offsetting and scaling to find the authentication region for fingerprint feature extraction. In the present case, the unique identifier on the object encodes where to find the authentication region(s).
If the region of interest is not already captured in the image data, the application may then tell the user where to focus the camera to acquire the region or regions of interest or the camera may be caused to automatically capture an image that at least includes the region or regions of interest, for example, by automatically directing, orienting and/or focusing the camera, scanner or other imager. The application decodes the data and then causes the camera, scanner or other imager or image sensor to capture one or more images of the desired area or areas, and then extracts authenticating information from the captured image(s).
Also coded in the unique identifier is authentication data that was extracted from the fingerprinted region of the object when the unique identifier was created. If that information matches sufficiently well to the authenticating information extracted at a later time as described above, the identity or authenticity of the item is established. This match need not be perfect. Matching is described in more detail later. No external connection to a reference database is required since all the required information is encoded locally. The encoding and representation of that information in the unique identifier can be accomplished through many methods known in the art.
Using a radio or a visible authentication method: The techniques taught here do not require any particular form of authenticating information. So long as that information is intrinsic to the object, can be extracted, added to the unique ID then later re-extracted when authentication is required, the approach is covered by this patent. For example, it is possible to use random or pseudorandom RFID (or other non-visual pinging) characteristics as a fingerprint. These characteristics are encoded and a unique identifier containing that information placed on the object. In general, any form of item ID that can contain information unique to and/or inherent in that particular object (or set of objects) is in view here.
The bottle may have content items 1151 such as items each labeled “G 3060.” That identifier is obviously not unique and serves no purpose here. Each content item also may have a region of interest, for example, 1169, which can be used to uniquely identify each individual item. In an embodiment, the identifier 1108 on the bottle may encode information for locating, capturing and processing the individual content item regions of interest.
An apparatus 1110, for example, a smartphone or a fixed machine, preferably includes or is coupled to a scanner 1114 which may comprise one or more cameras, RFID transceivers, etc. The scanner device, in operation, is arranged to capture an image of the bottle 1101 that includes the identifier 1108 and the region of interest 1119. The apparatus 1110 preferably includes a display 1120 which may present user instructions such as feedback to the user for image capture (“get closer”) and or display match (authentication) results. Of course, generated instructions may be audible.
In an embodiment, the apparatus 1110 may include a processor 1125 operatively coupled to the display 1120. The processor is further coupled to a memory 1105. The memory stores instructions executable on the processor, the executable instructions including an encoding component 1130 and an authentication component 1132.
In some embodiments, the “unique identifier” may specify where to look to get the image to be used for authentication, as well as how many of the feature vectors of that region are sufficient to generate a positive authentication result.
Metadata recovered by the processor 1105 may include, for example, information about contents of the item (e.g. the wine in the bottle), manufacturing data, etc. In general, “metadata” does not include the identifying information such as the digital fingerprint. Rather, it includes information on the object such as who made it, where, when, and so on. It may, for example, include a URL to look online to find additional data.
Digital Fingerprinting in General
“Digital fingerprinting” refers to the creation and use of digital records (digital fingerprints) derived from properties of a physical object, which digital records are typically stored in a database. Digital fingerprints maybe used to reliably and unambiguously identify or authenticate corresponding physical objects, track them through supply chains, record their provenance and changes over time, and for many other uses and applications.
In more detail, digital fingerprints typically include information, preferably in the form of numbers or “feature vectors,” that describes features that appear at particular locations, called points of interest, of a two-dimensional (2-D) or three-dimensional (3-D) object. In the case of a 2-D object, the points of interest are preferably on a surface of the corresponding object; in the 3-D case, the points of interest may be on the surface or in the interior of the object. In some applications, an object “feature template” may be used to define locations or regions of interest for a class of objects. The digital fingerprints may be derived or generated from digital data of the object which may be, for example, image data.
While the data from which digital fingerprints are derived is often images, a digital fingerprint may contain digital representations of any data derived from or associated with the object. For example, digital fingerprint data may be derived from an audio file. That audio file in turn may be associated or linked in a database to an object. Thus, in general, a digital fingerprint may be derived from a first object directly, or it may be derived from a different object (or file) linked to the first object, or a combination of the two (or more) sources. In the audio example, the audio file may be a recording of a person speaking a particular phrase as detailed above. The digital fingerprint of the audio recording may be stored as part of a digital fingerprint of the person speaking. The digital fingerprint (of the person) may be used as part of a system and method to later identify or authenticate that person, based on their speaking the same phrase, in combination with other sources.
In the context of this description, a digital fingerprint is a digital representation of the physical object. It can be captured from features of the surface, the internals, the progression of the object in time, and any other repeatable way that creates a digital fingerprint that can be uniquely and securely assigned to the particular digital object. The physical object may be a living object.
Feature extraction or feature detection may be used to characterize points of interest. In an embodiment, this may be done in various ways. Two examples include Scale-Invariant Feature Transform (or SIFT) and Speeded Up Robust features (or SURF). Both are described in the literature. For example: “Feature detection and matching are used in image registration, object tracking, object retrieval etc. There are number of approaches used to detect and matching of features as SIFT (Scale Invariant Feature Transform), SURF (Speeded up Robust Feature), FAST, ORB etc. SIFT and SURF are most useful approaches to detect and matching of features because of it is invariant to scale, rotate, translation, illumination, and blur.” MISTRY, Darshana et al., Comparison of Feature Detection and Matching Approaches: SIFT and SURF, GRD Journals—Global Research and Development Journal for Engineering I Volume 2 I Issue 4 I March 2017.
In some embodiments, digital fingerprint features may be matched, for example, based on finding a minimum threshold distance. Distances can be found using Euclidean distance, Manhattan distance, etc. If distances of two points are less than a prescribed minimum threshold distance, those key points may be known as matching pairs. Matching a digital fingerprint may comprise assessing a number of matching pairs, their locations or distance and other characteristics. Many points may be assessed to calculate a likelihood of a match, since, generally, a perfect match will not be found. In some applications an “feature template” may be used to define locations or regions of interest for a class of objects.
In an embodiment, features may be used to represent information derived from a digital image in a machine-readable and useful way. Features may be point, line, edges, and blob of an image etc. There are areas as image registration, object tracking, and object retrieval etc. that require a system or processor to detect and match correct features. Therefore, it may be desirable to find features in ways that are invariant to rotation, scale, translation, illumination, noisy and blurry images. The search of interest points from one object image to corresponding images can be very challenging work. The search may preferably be done such that same physical interest points can be found in different views. Once located, points of interest and their respective characteristics may be aggregated to form the digital fingerprint (generally also including 2-D or 3-D location parameters).
Scanning
In this application, the term “scan” is used in the broadest sense, referring to any and all means for capturing an image or set of images, which may be in digital form or transformed into digital form. Images may, for example, be two dimensional, three dimensional, or in the form of a video. Thus a “scan” may refer to an image (or digital data that defines an image) captured by an imager, scanner, a camera, a specially adapted sensor or sensor array (such as a CCD array), a microscope, a smartphone camera, a video camera, an x-ray machine, a sonar, an ultrasound machine, a microphone (or other instruments for converting sound waves into electrical energy variations), etc. Broadly, any device that can sense and capture either electromagnetic radiation or mechanical wave that has traveled through an object or reflected off an object or any other means to capture surface or internal structure of an object is a candidate to create a “scan” of an object.
Various means to extract “fingerprints” or features from an object may be used; for example, through sound, physical structure, chemical composition, or many others. The remainder of this application will use terms like “image” but when doing so, the broader uses of this technology should be implied. In other words, alternative means to extract “fingerprints” or features from an object should be considered equivalents within the scope of this disclosure. Similarly, terms such as “scanner” and “scanning equipment” herein may be used in a broad sense to refer to any equipment capable of carrying out “scans” as defined above, or to equipment that carries out “scans” as defined above as part of their function. Attestable trusted scanners should be used to provide images for digital fingerprint creation. Scanner may be a single device or a multitude of devices working to enforce policy and procedures.
Authentication
More information about digital fingerprinting can be found in various disclosures and publications assigned to Alitheon, Inc. including, for example, the following: DIGITAL FINGERPRINTING, U.S. Pat. No. 8,6109,762; OBJECT IDENTIFICATION AND INVENTORY MANAGEMENT, U.S. Pat. No. 9,152,862; DIGITAL FINGERPRINTING OBJECT AUTHENTICATION AND ANTI-COUNTERFEITING SYSTEM, U.S. Pat. No. 9,443,298; PERSONAL HISTORY IN TRACK AND TRACE SYSTEM, U.S. Pat. No. 10,037,537; PRESERVING AUTHENTICATION UNDER ITEM CHANGE, U.S. Pat. App. Pub. No. 2017-0243230 A1; AUTOMATED AUTHENTICATION REGION LOCALIZATION AND CAPTURE, U.S. Pat. App. No. 62/842,444 filed May 2, 2019; and LOCAL ENCODING OF INTRINSIC AUTHENTICATION DATA, U.S. Pat. App. No. 63/006,059 filed Apr. 6, 2020. Each of these patents and publications is hereby incorporated by this reference.
The foregoing description, for purpose of explanation, has been described with reference to specific embodiments. However, the illustrative discussions above are not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Many modifications and variations are possible in view of the above teachings. The embodiments were chosen and described in order to best explain the principles of the disclosure and its practical applications, to thereby enable others skilled in the art to best utilize the disclosure and various embodiments with various modifications as are suited to the particular use contemplated.
The system and method disclosed herein may be implemented via one or more components, systems, servers, appliances, other subcomponents, or distributed between such elements. When implemented as a system, such systems may include an/or involve, inter alia, components such as software modules, general-purpose CPU, RAM, etc. found in general-purpose computers. In implementations where the innovations reside on a server, such a server may include or involve components such as CPU, RAM, etc., such as those found in general-purpose computers. Additionally, the system and method herein may be achieved via implementations with disparate or entirely different software, hardware and/or firmware components, beyond that set forth above. With regard to such other components (e.g., software, processing components, etc.) and/or computer-readable media associated with or embodying the present inventions, for example, aspects of the innovations herein may be implemented consistent with numerous general purpose or special purpose computing systems or configurations. Various exemplary computing systems, environments, and/or configurations that may be suitable for use with the innovations herein may include, but are not limited to: software or other components within or embodied on personal computers, servers or server computing devices such as routing/connectivity components, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, consumer electronic devices, network PCs, other existing computer platforms, distributed computing environments that include one or more of the above systems or devices, etc.
In some instances, aspects of the system and method may be achieved via or performed by logic and/or logic instructions including program modules, executed in association with such components or circuitry, for example. In general, program modules may include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular instructions herein. The inventions may also be practiced in the context of distributed software, computer, or circuit settings where circuitry is connected via communication buses, circuitry, or links. In distributed settings, control/instructions may occur from both local and remote computer storage media including memory storage devices.
The software, circuitry and components herein may also include and/or utilize one or more type of computer readable media. Computer readable media can be any available media that is resident on, associable with, or can be accessed by such circuits and/or computing components. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and can accessed by computing component. Communication media may comprise computer readable instructions, data structures, program modules and/or other components. Further, communication media may include wired media such as a wired network or direct-wired connection, however no media of any such type herein includes transitory media. Combinations of the any of the above are also included within the scope of computer readable media.
In the present description, the terms component, module, device, etc. may refer to any type of logical or functional software elements, circuits, blocks, and/or processes that may be implemented in a variety of ways. For example, the functions of various circuits and/or blocks can be combined with one another into any other number of modules. Each module may even be implemented as a software program stored on a tangible memory (e.g., random access memory, read only memory, CD-ROM memory, hard disk drive, etc.) to be read by a central processing unit to implement the functions of the innovations herein. Or, the modules can comprise programming instructions transmitted to a general-purpose computer or to processing/graphics hardware via a transmission carrier wave. Also, the modules can be implemented as hardware logic circuitry implementing the functions encompassed by the innovations herein. Finally, the modules can be implemented using special purpose instructions (SIMD instructions), field programmable logic arrays or any mix thereof which provides the desired levels of performance and cost.
As disclosed herein, features consistent with the disclosure may be implemented via computer-hardware, software and/or firmware. For example, the systems and methods disclosed herein may be embodied in various forms including, for example, a data processor, such as a computer that also includes a database, digital electronic circuitry, firmware, software, or in combinations of them. Further, while some of the disclosed implementations describe specific hardware components, systems and methods consistent with the innovations herein may be implemented with any combination of hardware, software and/or firmware. Moreover, the above-noted features and other aspects and principles of the innovations herein may be implemented in various environments. Such environments and related applications may be specially constructed for performing the various routines, processes and/or operations according to the invention or they may include a general-purpose computer or computing platform selectively activated or reconfigured by code to provide the necessary functionality. The processes disclosed herein are not inherently related to any particular computer, network, architecture, environment, or other apparatus, and may be implemented by a suitable combination of hardware, software, and/or firmware. For example, various general-purpose machines may be used with programs written in accordance with teachings of the invention, or it may be more convenient to construct a specialized apparatus or system to perform the required methods and techniques.
Aspects of the method and system described herein, such as the logic, may also be implemented as functionality programmed into any of a variety of circuitry, including programmable logic devices (“PLDs”), such as field programmable gate arrays (“FPGAs”), programmable array logic (“PAL”) devices, electrically programmable logic and memory devices and standard cell-based devices, as well as application specific integrated circuits. Some other possibilities for implementing aspects include: memory devices, microcontrollers with memory (such as EEPROM), embedded microprocessors, firmware, software, etc. Furthermore, aspects may be embodied in microprocessors having software-based circuit emulation, discrete logic (sequential and combinatorial), custom devices, fuzzy (neural) logic, quantum devices, and hybrids of any of the above device types. The underlying device technologies may be provided in a variety of component types, e.g., metal-oxide semiconductor field-effect transistor (“MOSFET”) technologies like complementary metal-oxide semiconductor (“CMOS”), bipolar technologies like emitter-coupled logic (“ECL”), polymer technologies (e.g., silicon-conjugated polymer and metal-conjugated polymer-metal structures), mixed analog and digital, and so on.
It should also be noted that the various logic and/or functions disclosed herein may be enabled using any number of combinations of hardware, firmware, and/or as data and/or instructions embodied in various machine-readable or computer-readable media, in terms of their behavioral, register transfer, logic component, and/or other characteristics. Computer-readable media in which such formatted data and/or instructions may be embodied include, but are not limited to, non-volatile storage media in various forms (e.g., optical, magnetic or semiconductor storage media) though again does not include transitory media.
Unless the context clearly requires otherwise, throughout the description, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is to say, in a sense of “including, but not limited to.” Words using the singular or plural number also include the plural or singular number respectively. Additionally, the words “herein,” “hereunder,” “above,” “below,” and words of similar import refer to this application as a whole and not to any particular portions of this application. When the word “or” is used in reference to a list of two or more items, that word covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
Although certain presently preferred implementations of the invention have been specifically described herein, it will be apparent to those skilled in the art to which the invention pertains that variations and modifications of the various implementations shown and described herein may be made without departing from the spirit and scope of the invention. Accordingly, it is intended that the invention be limited only to the extent required by the applicable rules of law.
Number | Name | Date | Kind |
---|---|---|---|
4218674 | Brosow et al. | Aug 1980 | A |
4423415 | Goldman | Dec 1983 | A |
4677435 | Causse et al. | Jun 1987 | A |
4700400 | Ross | Oct 1987 | A |
4883971 | Jensen | Nov 1989 | A |
4921107 | Hofer | May 1990 | A |
5031223 | Rosenbaum et al. | Jul 1991 | A |
5079714 | Manduley et al. | Jan 1992 | A |
5393939 | Nasuta et al. | Feb 1995 | A |
5422821 | Allen et al. | Jun 1995 | A |
5514863 | Williams | May 1996 | A |
5518122 | Tilles et al. | May 1996 | A |
5521984 | Denenberg et al. | May 1996 | A |
5703783 | Allen et al. | Dec 1997 | A |
5719939 | Tel | Feb 1998 | A |
5734568 | Borgendale et al. | Mar 1998 | A |
5745590 | Pollard | Apr 1998 | A |
5883971 | Bolle et al. | Mar 1999 | A |
5923848 | Goodhand et al. | Jul 1999 | A |
5974150 | Kaish et al. | Oct 1999 | A |
6205261 | Goldberg | Mar 2001 | B1 |
6246794 | Kagehiro et al. | Jun 2001 | B1 |
6292709 | Uhl et al. | Sep 2001 | B1 |
6327373 | Yura | Dec 2001 | B1 |
6343327 | Daniels et al. | Jan 2002 | B2 |
6360001 | Berger et al. | Mar 2002 | B1 |
6370259 | Hobson et al. | Apr 2002 | B1 |
6400805 | Brown et al. | Jun 2002 | B1 |
6424728 | Ammar | Jul 2002 | B1 |
6434601 | Rollins | Aug 2002 | B1 |
6470091 | Koga et al. | Oct 2002 | B2 |
6539098 | Baker et al. | Mar 2003 | B1 |
6549892 | Sansone | Apr 2003 | B1 |
6597809 | Ross et al. | Jul 2003 | B1 |
6643648 | Ross et al. | Nov 2003 | B1 |
6697500 | Woolston et al. | Feb 2004 | B2 |
6741724 | Bruce et al. | May 2004 | B1 |
6768810 | Emanuelsson et al. | Jul 2004 | B2 |
6778703 | Zlotnick | Aug 2004 | B1 |
6805926 | Cote et al. | Oct 2004 | B2 |
6816602 | Coffelt et al. | Nov 2004 | B2 |
6829369 | Poulin et al. | Dec 2004 | B2 |
6961466 | Imagawa et al. | Nov 2005 | B2 |
6985925 | Ogawa | Jan 2006 | B2 |
6985926 | Ferlauto et al. | Jan 2006 | B1 |
7016532 | Boncyk et al. | Mar 2006 | B2 |
7031519 | Elmenhurst | Apr 2006 | B2 |
7096152 | Ong | Aug 2006 | B1 |
7120302 | Billester | Oct 2006 | B1 |
7121458 | Avant et al. | Oct 2006 | B2 |
7152047 | Nagel | Dec 2006 | B1 |
7171049 | Snapp | Jan 2007 | B2 |
7204415 | Payne et al. | Apr 2007 | B2 |
7212949 | Bachrach | May 2007 | B2 |
7333987 | Ross et al. | Feb 2008 | B2 |
7343623 | Ross | Mar 2008 | B2 |
7356162 | Caillon | Apr 2008 | B2 |
7379603 | Ross et al. | May 2008 | B2 |
7436979 | Bruce et al. | Oct 2008 | B2 |
7477780 | Boncyk et al. | Jan 2009 | B2 |
7518080 | Amato | Apr 2009 | B2 |
7602938 | Prokoski | Oct 2009 | B2 |
7674995 | Desprez et al. | Mar 2010 | B2 |
7676433 | Ross et al. | Mar 2010 | B1 |
7680306 | Boutant et al. | Mar 2010 | B2 |
7720256 | Desprez et al. | May 2010 | B2 |
7726457 | Maier et al. | Jun 2010 | B2 |
7726548 | Delavergne | Jun 2010 | B2 |
7748029 | Ross | Jun 2010 | B2 |
7822263 | Prokoski | Oct 2010 | B1 |
7834289 | Orbke et al. | Nov 2010 | B2 |
7853792 | Cowburn | Dec 2010 | B2 |
8022832 | Vogt et al. | Sep 2011 | B2 |
8032927 | Ross | Oct 2011 | B2 |
8108309 | Tan | Jan 2012 | B2 |
8180174 | Di et al. | May 2012 | B2 |
8180667 | Baluja et al. | May 2012 | B1 |
8194938 | Wechsler et al. | Jun 2012 | B2 |
8316418 | Ross | Nov 2012 | B2 |
8374020 | Katti | Feb 2013 | B2 |
8374399 | Talwerdi | Feb 2013 | B1 |
8374920 | Hedges et al. | Feb 2013 | B2 |
8391583 | Mennie et al. | Mar 2013 | B1 |
8428772 | Miette et al. | Apr 2013 | B2 |
8437530 | Mennie et al. | May 2013 | B1 |
8457354 | Kolar et al. | Jun 2013 | B1 |
8477992 | Paul et al. | Jul 2013 | B2 |
8520888 | Spitzig et al. | Aug 2013 | B2 |
8526743 | Campbell et al. | Sep 2013 | B1 |
8774455 | Elmenhurst et al. | Jul 2014 | B2 |
8959029 | Jones et al. | Feb 2015 | B2 |
9031329 | Farid et al. | May 2015 | B1 |
9058543 | Campbell et al. | Jun 2015 | B2 |
9152862 | Ross et al. | Oct 2015 | B2 |
9170654 | Boncyk et al. | Oct 2015 | B1 |
9224196 | Duerksen et al. | Dec 2015 | B2 |
9234843 | Sopori et al. | Jan 2016 | B2 |
9245133 | Durst et al. | Jan 2016 | B1 |
9350552 | Elmenhurst et al. | May 2016 | B2 |
9350714 | Freeman et al. | May 2016 | B2 |
9361507 | Hoyos et al. | Jun 2016 | B1 |
9361596 | Ross et al. | Jun 2016 | B2 |
9424461 | Yuan et al. | Aug 2016 | B1 |
9443298 | Ross et al. | Sep 2016 | B2 |
9558463 | Ross et al. | Jan 2017 | B2 |
9582714 | Ross et al. | Feb 2017 | B2 |
9646206 | Ross et al. | May 2017 | B2 |
9665800 | Kuffner | May 2017 | B1 |
9741724 | Seshadri et al. | Aug 2017 | B2 |
10037537 | Withrow et al. | Jul 2018 | B2 |
10043073 | Ross et al. | Aug 2018 | B2 |
10192140 | Ross et al. | Jan 2019 | B2 |
10199886 | Li et al. | Feb 2019 | B2 |
10346852 | Ross et al. | Jul 2019 | B2 |
10505726 | Andon et al. | Dec 2019 | B1 |
10540664 | Ross et al. | Jan 2020 | B2 |
10572883 | Ross et al. | Feb 2020 | B2 |
10614302 | Withrow et al. | Apr 2020 | B2 |
10621594 | Land et al. | Apr 2020 | B2 |
10740767 | Withrow | Aug 2020 | B2 |
10900914 | Althoefer | Jan 2021 | B2 |
10936838 | Wong | Mar 2021 | B1 |
11315286 | Azhar | Apr 2022 | B2 |
20010010334 | Park et al. | Aug 2001 | A1 |
20010054031 | Lee et al. | Dec 2001 | A1 |
20020015515 | Lichtermann et al. | Feb 2002 | A1 |
20020073049 | Dutta | Jun 2002 | A1 |
20020134836 | Cash et al. | Sep 2002 | A1 |
20020168090 | Bruce et al. | Nov 2002 | A1 |
20030015395 | Hallowell et al. | Jan 2003 | A1 |
20030046103 | Amato et al. | Mar 2003 | A1 |
20030091724 | Mizoguchi | May 2003 | A1 |
20030120677 | Vernon | Jun 2003 | A1 |
20030138128 | Rhoads | Jul 2003 | A1 |
20030179931 | Sun | Sep 2003 | A1 |
20030182018 | Snapp | Sep 2003 | A1 |
20030208298 | Edmonds | Nov 2003 | A1 |
20030219145 | Smith | Nov 2003 | A1 |
20040027630 | Lizotte | Feb 2004 | A1 |
20040101174 | Sato et al. | May 2004 | A1 |
20040112962 | Farrall et al. | Jun 2004 | A1 |
20040218791 | Jiang et al. | Nov 2004 | A1 |
20040218801 | Houle et al. | Nov 2004 | A1 |
20040250085 | Tattan et al. | Dec 2004 | A1 |
20050007776 | Monk et al. | Jan 2005 | A1 |
20050038756 | Nagel | Feb 2005 | A1 |
20050065719 | Khan et al. | Mar 2005 | A1 |
20050086256 | Owens et al. | Apr 2005 | A1 |
20050111618 | Sommer et al. | May 2005 | A1 |
20050119786 | Kadaba | Jun 2005 | A1 |
20050125360 | Tidwell et al. | Jun 2005 | A1 |
20050131576 | De et al. | Jun 2005 | A1 |
20050137882 | Cameron et al. | Jun 2005 | A1 |
20050160271 | Brundage et al. | Jul 2005 | A9 |
20050169529 | Owechko et al. | Aug 2005 | A1 |
20050188213 | Xu | Aug 2005 | A1 |
20050204144 | Mizutani | Sep 2005 | A1 |
20050251285 | Boyce et al. | Nov 2005 | A1 |
20050257064 | Boutant et al. | Nov 2005 | A1 |
20050289061 | Kulakowski et al. | Dec 2005 | A1 |
20060010503 | Inoue et al. | Jan 2006 | A1 |
20060083414 | Neumann et al. | Apr 2006 | A1 |
20060109520 | Gossaye et al. | May 2006 | A1 |
20060131518 | Ross et al. | Jun 2006 | A1 |
20060177104 | Prokoski | Aug 2006 | A1 |
20060253406 | Caillon | Nov 2006 | A1 |
20070056041 | Goodman | Mar 2007 | A1 |
20070071291 | Yumoto et al. | Mar 2007 | A1 |
20070085710 | Bousquet et al. | Apr 2007 | A1 |
20070094155 | Dearing | Apr 2007 | A1 |
20070211651 | Ahmed et al. | Sep 2007 | A1 |
20070211964 | Agam et al. | Sep 2007 | A1 |
20070230656 | Lowes et al. | Oct 2007 | A1 |
20070263267 | Ditt | Nov 2007 | A1 |
20070269043 | Launay et al. | Nov 2007 | A1 |
20070282900 | Owens et al. | Dec 2007 | A1 |
20080005578 | Shafir | Jan 2008 | A1 |
20080008377 | Andel et al. | Jan 2008 | A1 |
20080011841 | Self et al. | Jan 2008 | A1 |
20080013804 | Moon et al. | Jan 2008 | A1 |
20080016355 | Beun et al. | Jan 2008 | A1 |
20080128496 | Bertranou et al. | Jun 2008 | A1 |
20080130947 | Ross et al. | Jun 2008 | A1 |
20080219503 | Di et al. | Sep 2008 | A1 |
20080250483 | Lee | Oct 2008 | A1 |
20080255758 | Graham et al. | Oct 2008 | A1 |
20080272585 | Conard et al. | Nov 2008 | A1 |
20080290005 | Bennett et al. | Nov 2008 | A1 |
20080294474 | Furka | Nov 2008 | A1 |
20090028379 | Belanger et al. | Jan 2009 | A1 |
20090057207 | Orbke et al. | Mar 2009 | A1 |
20090106042 | Maytal et al. | Apr 2009 | A1 |
20090134222 | Ikeda | May 2009 | A1 |
20090154778 | Lei et al. | Jun 2009 | A1 |
20090157733 | Kim et al. | Jun 2009 | A1 |
20090223099 | Versteeg | Sep 2009 | A1 |
20090232361 | Miller | Sep 2009 | A1 |
20090245652 | Bastos | Oct 2009 | A1 |
20090271029 | Doutre | Oct 2009 | A1 |
20090283583 | Cowburn | Nov 2009 | A1 |
20090287498 | Choi | Nov 2009 | A2 |
20090307005 | Omartin et al. | Dec 2009 | A1 |
20100027834 | Spitzig et al. | Feb 2010 | A1 |
20100054551 | Decoux | Mar 2010 | A1 |
20100070527 | Chen | Mar 2010 | A1 |
20100104200 | Baras et al. | Apr 2010 | A1 |
20100157064 | Cheng et al. | Jun 2010 | A1 |
20100163612 | Caillon | Jul 2010 | A1 |
20100166303 | Rahimi | Jul 2010 | A1 |
20100174406 | Miette et al. | Jul 2010 | A1 |
20100286815 | Zimmermann | Nov 2010 | A1 |
20110026831 | Perronnin et al. | Feb 2011 | A1 |
20110064279 | Uno | Mar 2011 | A1 |
20110081043 | Sabol et al. | Apr 2011 | A1 |
20110091068 | Stuck et al. | Apr 2011 | A1 |
20110161117 | Busque et al. | Jun 2011 | A1 |
20110188709 | Gupta et al. | Aug 2011 | A1 |
20110194780 | Li et al. | Aug 2011 | A1 |
20110235920 | Iwamoto et al. | Sep 2011 | A1 |
20110248827 | Bertoncini | Oct 2011 | A1 |
20110267192 | Goldman et al. | Nov 2011 | A1 |
20120042171 | White et al. | Feb 2012 | A1 |
20120089639 | Wang | Apr 2012 | A1 |
20120130868 | Loeken | May 2012 | A1 |
20120177281 | Frew | Jul 2012 | A1 |
20120185393 | Atsmon et al. | Jul 2012 | A1 |
20120199651 | Glazer | Aug 2012 | A1 |
20120242481 | Gernandt et al. | Sep 2012 | A1 |
20120243797 | Di Venuto Dayer et al. | Sep 2012 | A1 |
20120250945 | Peng et al. | Oct 2012 | A1 |
20130110719 | Carter et al. | May 2013 | A1 |
20130162394 | Etchegoyen | Jun 2013 | A1 |
20130212027 | Sharma et al. | Aug 2013 | A1 |
20130214164 | Zhang et al. | Aug 2013 | A1 |
20130273968 | Rhoads et al. | Oct 2013 | A1 |
20130277425 | Sharma et al. | Oct 2013 | A1 |
20130284803 | Wood et al. | Oct 2013 | A1 |
20140032322 | Schwieger et al. | Jan 2014 | A1 |
20140140570 | Ross et al. | May 2014 | A1 |
20140140571 | Elmenhurst et al. | May 2014 | A1 |
20140184843 | Campbell et al. | Jul 2014 | A1 |
20140201094 | Herrington et al. | Jul 2014 | A1 |
20140270341 | Elmenhurst et al. | Sep 2014 | A1 |
20140314283 | Harding | Oct 2014 | A1 |
20140380446 | Niu et al. | Dec 2014 | A1 |
20150058142 | Lenahan et al. | Feb 2015 | A1 |
20150067346 | Ross et al. | Mar 2015 | A1 |
20150078629 | Gottemukkula et al. | Mar 2015 | A1 |
20150086068 | Mulhearn et al. | Mar 2015 | A1 |
20150110364 | Niinuma et al. | Apr 2015 | A1 |
20150117701 | Ross et al. | Apr 2015 | A1 |
20150127430 | Hammer | May 2015 | A1 |
20150248587 | Oami et al. | Sep 2015 | A1 |
20150294189 | Benhimane et al. | Oct 2015 | A1 |
20150309502 | Breitgand et al. | Oct 2015 | A1 |
20150371087 | Ross et al. | Dec 2015 | A1 |
20160034913 | Zavarehi et al. | Feb 2016 | A1 |
20160034914 | Gonen et al. | Feb 2016 | A1 |
20160055651 | Oami | Feb 2016 | A1 |
20160057138 | Hoyos et al. | Feb 2016 | A1 |
20160072626 | Kouladjie | Mar 2016 | A1 |
20160117631 | McCloskey et al. | Apr 2016 | A1 |
20160162734 | Ross et al. | Jun 2016 | A1 |
20160180485 | Avila et al. | Jun 2016 | A1 |
20160180546 | Kim et al. | Jun 2016 | A1 |
20160189510 | Hutz | Jun 2016 | A1 |
20160203387 | Lee et al. | Jul 2016 | A1 |
20160300234 | Moss-Pultz et al. | Oct 2016 | A1 |
20160335520 | Ross et al. | Nov 2016 | A1 |
20170004444 | Krasko et al. | Jan 2017 | A1 |
20170032285 | Sharma et al. | Feb 2017 | A1 |
20170076132 | Sezan et al. | Mar 2017 | A1 |
20170132458 | Short et al. | May 2017 | A1 |
20170153069 | Huang et al. | Jun 2017 | A1 |
20170243230 | Ross et al. | Aug 2017 | A1 |
20170243231 | Withrow et al. | Aug 2017 | A1 |
20170243232 | Ross et al. | Aug 2017 | A1 |
20170243233 | Land et al. | Aug 2017 | A1 |
20170249491 | Macintosh et al. | Aug 2017 | A1 |
20170251143 | Peruch et al. | Aug 2017 | A1 |
20170253069 | Kerkar et al. | Sep 2017 | A1 |
20170295301 | Liu et al. | Oct 2017 | A1 |
20170300905 | Withrow et al. | Oct 2017 | A1 |
20170344823 | Withrow et al. | Nov 2017 | A1 |
20170344824 | Martin | Nov 2017 | A1 |
20170372327 | Withrow | Dec 2017 | A1 |
20180000359 | Watanabe | Jan 2018 | A1 |
20180012008 | Withrow et al. | Jan 2018 | A1 |
20180018627 | Ross et al. | Jan 2018 | A1 |
20180018838 | Fankhauser et al. | Jan 2018 | A1 |
20180024074 | Ranieri et al. | Jan 2018 | A1 |
20180024178 | House et al. | Jan 2018 | A1 |
20180047128 | Ross et al. | Feb 2018 | A1 |
20180053312 | Ross | Feb 2018 | A1 |
20180121643 | Talwerdi et al. | May 2018 | A1 |
20180144211 | Ross et al. | May 2018 | A1 |
20180315058 | Withrow et al. | Nov 2018 | A1 |
20180349694 | Ross et al. | Dec 2018 | A1 |
20190026581 | Leizerson | Jan 2019 | A1 |
20190034518 | Liu et al. | Jan 2019 | A1 |
20190034694 | Ross | Jan 2019 | A1 |
20190102873 | Wang et al. | Apr 2019 | A1 |
20190102973 | Oyama et al. | Apr 2019 | A1 |
20190130082 | Alameh et al. | May 2019 | A1 |
20190228174 | Withrow et al. | Jul 2019 | A1 |
20190266373 | Hirokawa | Aug 2019 | A1 |
20190279017 | Graham et al. | Sep 2019 | A1 |
20190287118 | Ross et al. | Sep 2019 | A1 |
20190342102 | Hao et al. | Nov 2019 | A1 |
20190362186 | Irshad et al. | Nov 2019 | A1 |
20200153822 | Land et al. | May 2020 | A1 |
20200226366 | Withrow et al. | Jul 2020 | A1 |
20200233901 | Crowley et al. | Jul 2020 | A1 |
20200250395 | Ross et al. | Aug 2020 | A1 |
20200257791 | Shannon et al. | Aug 2020 | A1 |
20200334689 | Withrow | Oct 2020 | A1 |
20200349379 | Ross | Nov 2020 | A1 |
20200356772 | Withrow et al. | Nov 2020 | A1 |
Number | Date | Country |
---|---|---|
102006005927 | Aug 2007 | DE |
0439669 | Aug 1991 | EP |
0759596 | Feb 1997 | EP |
1016548 | Jul 2000 | EP |
1016549 | Jul 2000 | EP |
1719070 | Apr 2009 | EP |
2107506 | Oct 2009 | EP |
2166493 | Mar 2010 | EP |
2195621 | Nov 2013 | EP |
2866193 | Apr 2015 | EP |
2257909 | May 2015 | EP |
2869240 | May 2015 | EP |
2869241 | May 2015 | EP |
3208744 | Aug 2017 | EP |
3249581 | Nov 2017 | EP |
3267384 | Jan 2018 | EP |
3270342 | Jan 2018 | EP |
3435287 | Jan 2019 | EP |
3514715 | Jul 2019 | EP |
2097979 | Nov 1982 | GB |
2482127 | Jan 2012 | GB |
61234481 | Oct 1986 | JP |
H07192112 | Jul 1995 | JP |
2007213148 | Aug 2007 | JP |
2010146158 | Jul 2010 | JP |
20120009654 | Feb 2012 | KR |
2005086616 | Sep 2005 | WO |
2006038114 | Apr 2006 | WO |
2007028799 | Mar 2007 | WO |
2007031176 | Mar 2007 | WO |
2007071788 | Jun 2007 | WO |
2007090437 | Aug 2007 | WO |
2007144598 | Dec 2007 | WO |
2009030853 | Mar 2009 | WO |
2009089126 | Jul 2009 | WO |
2009115611 | Sep 2009 | WO |
2010018464 | Feb 2010 | WO |
2010018646 | Feb 2010 | WO |
2012145842 | Nov 2012 | WO |
2013051019 | Apr 2013 | WO |
2013126221 | Aug 2013 | WO |
2013173408 | Nov 2013 | WO |
2015004434 | Jan 2015 | WO |
2016081831 | May 2016 | WO |
Entry |
---|
Extended European Search Report, dated Aug. 18, 2021, for European Application No. 21164207.9—17 pages. |
Extended European Search Report, dated Aug. 18, 2021, for European Application No. 21164207.9, 13 pages. |
Extended European Search Report, dated Aug. 19, 2021, for European Application No. 21164353.1, 9 pages. |
Non-Final Office Action Issued in U.S. Appl. No. 16/553,943, dated Sep. 1, 2021, 13 pages. |
Non-Final Office Action Issued in U.S. Appl. No. 16/827,701, dated Aug. 17, 2021, 19 pages. |
Non-Final Office Action Issued in U.S. Appl. No. 16/866,468, dated Sep. 9, 2021, 24 pages. |
Non-Final Office Action Issued in U.S. Appl. No. 16/872,202, dated Sep. 24, 2021, 24 pages. |
Hensler, J. , et al., “Hybrid Face Recognition Based on Real-time Multi-camera Stereo-Matching”, ICIAP: International Conference on Image Analysis and Processing, 17th International Conference, Naples, Italy, Sep. 9-13, 2013, 10 pages. |
Scott, Von Duhn , et al., “Three-View Surveillance Video Based Face Modeling For Recognition”, Biometrics Symposium, 2007, IEEE, Pi, Sep. 30, 2007, 6 pages XP031202430. |
Anonymous, “Intrinsic Characteristics for Authentication” & “Alp Vision Advances Security Through Digital Technology,” Authentication News vol. 12, (No. 9) pp. 2, 7 and 8, dated Sep. 2006, 3 pages total. |
Bao et al., “Local Feature based Multiple Object Instance Identification using Scale and Rotation Invariant Implicit Shape Model,” 12th Asian Conference on Computer Vision, Singapore, Singapore, Nov. 1-5, 2014, pp. 600-614. |
Beekhof et al., “Secure Surface Identification Codes,” Proceeding of the SPIE 6819: Security Forensics, Steganography, and Watermarking of Multimedia Contents X:68190D, 2008. (12 pages). |
Buchanan et al., “Fingerprinting documents and packaging,” Nature 436 (7050): 475, 2005. |
Cavoukian et al. “Biometric Encryption: Technology for Strong Authentication, Security and Privacy,” 2008, WE, Intl. Fed. Iot Info Processing, vol. 261; Policies and Research in Identity Management; pp. 57-77. |
Di Paola et al., “An Autonomous Mobile Robotic System for Surveillance of Indoor Environments,” International Journal of Advanced Robotic Systems 7(1): 19-26, 2010. |
Drew, M. S., et al., “Sharpening from Shadows: Sensor Transforms for Removing Shadows using a Single Image,” Color and Imaging Conference, vol. 5, Society for Imaging Science and Technology, 2009, pp. 267-271. |
Ebay, “eBay Launches Must-Have !Phone App Red Laser 3.0” published Nov. 18, 2011; https://www.ebayinc.com/stories/news/ ebay-launches-must-have-iphone-app-redlaser-30/, downloaded Mar. 21, 2019, 7 pages). |
Entropy.com Website History, Wayback Machine; https://web.archive.org/web/20 l 60330060808/https://www.entrupy.com/; Mar. 30, 2016 (Year: 2016), 2 pages. |
Extended European Search Report Application No. 21153877.2, dated Jun. 15, 2021, 8 pages. |
Extended European Search Report, dated Jun. 18, 2021, for European Application No. 21153355.9, 8 pages. |
Farid, “Digital Image Forensics”, Dartmouth CS 89/189, Sprint 2013; 199 pages. |
Fischler et al., “Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography,” Communication of the ACM 24(6); 381-395, 1981. |
Huang et al., “A Novel Binarization Algorithm for Ballistic Imaging Systems,” 3rd International Congress on Image and Signal Processing, Yantai, China, Oct. 16-18, 2010, pp. 1287-1291. |
Huang, et al., “An Online Ballistics Imaging System for Firearm Identification”; 2nd International Conference on Signal Processing Systems, Dalian, China, Jul. 5-7, 2010, vol. 2, pp. 68-72. |
Kartik et al., “Security System with Face Recognition, SMS Alert and Embedded Network Video Monitoring Terminal,” International Journal of Security, Privacy and Trust Management 2(5):9-19, 2013. |
Li, “Image Processing for the Positive Identification of Forensic Ballistics Specimens,” Proceedings of the 6th International Conference of Information Fusion, Cairns, Australia, Jul. 8-11, 2003, pp. 1494-1498. |
Li, “Firearm Identification System Based on Ballistics Image Processing,” Congress on Image and Signal Processing, School of Computer and Information Science, Faculty of Computing, Health and Science Edith Cowan University, Perth, Australia pp. 149-154. |
Maddern et al., “Illumination Invariant Imaging: Applications in Robust Vision-based Localization, Mapping and Classification for Autonomous Vehicles,” IEEE International Conference on Robotics and Automation, Hong Kong, May 31-Jun. 7, 2014, 8 pages. |
Matsumoto et al., “Nano-artifact metrics based on random collapse of resist,” Scientific Reports 4:6142, 2014 (5 pages). |
Mistry et al., “Comparison of Feature Detection and Matching Approaches: SIFT and SURF,” Global Research and Development Journal for Engineering, vol. 2, Issue 4, Mar. 2017, 8 pages. |
Online NCOALink ® Processing Acknowledgement Form (PAF) Released by Lorton Data, Jun. 2, 2009, URL=http://us.generation-nt.com/online-ncoalink-processingacknowledgement-form-paf-released-by-press-1567191.html, download date Jun. 25, 2010, 2 pages. |
Rublee et al., “ORB: an efficient alternative to SIFT or Surf,” IEEE International Conference on Computer Vision, Barcelona, Spain, Nov. 6-13, 2011, 8 pages. |
Schneider et al., “A Robust Content Based Digital Signature for Image Authentication,” Proceeding of the International Conference on Image Processing Lausanne, Switzerland, Sep. 19, 1996, pp. 227-230. |
Schwabe Williamson & Wyatt, PC—Listing of Related Cases; dated Sep. 16, 2017; 2 pages. |
Sharma et al., “The Fake vs Real Goods Problem: Microscopy and Machine Learning to the Rescue,” KDD 2017 Applied Data Science Paper, Aug. 13-17, 2017, Halifax, NS, Canada, 9 pages. |
Shi et al., “Smart Cameras: Fundamentals and Classification,” Chapter 2, Belbachir (ed.), Smart Cameras, Springer, New York, New York, USA 2010, pp. 19-34. |
Shields, “How To Shop Savvy With Red Laser,” published online on Mar. 22, 2010; https ://i phone .appstomn .net/ reviews/lifesty le/how-to-shop-savvy-with-redlaser /, downloaded Mar. 22, 2010, 8 pages). |
Smith, “Fireball: A Forensic Ballistic Imaging System: Proceedings of the 31st Annual International Carnahan Conference on Security Technology,” Canberra, Australia, Oct. 15-17, 1997, pp. 64-70. |
Takahashi et al., “Mass-produced Parts Traceability System Based on Automated Scanning of Fingerprint of Things,” 15th IAPR International Conference on Machine Vision Applications, Nagoya, Japan, May 8-12, 2017, 5 pages. |
United States Postal Service, “NCOALink Systems”, http:/ /www.usps.com/ncsc/addressservices/moveupdate/changeaddress.htm, website accessed Jun. 23, 2010, 2 pages. |
United States Postal Service, “Postal Addressing Standards,” Publication Jul. 28, 2008, 55 pages. |
United States Postal Services, NCOALink® Systems, dated May 27, 2009, URL=http://ribbs.usps.gov/ncoalink/ncoalink_print.htm, download date Jun. 23, 2010, 3 pages. |
Veena et al., “Automatic Theft Security System (Smart Surveillance Camera),” Computer Science & Information Technology 3:75-87, 2013. |
Woods, “Counterfeit-spotting truth machine launches out of Dumbo,” published online on Feb. 11, 2016, downloaded from http://technically/brooklyn/2016/02/11/entrupy-counterfeit-scanner/ on Mar. 20, 2019, 3 pages. |
Farid, Ahmed , et al., “Integrated fingerprint verification method using a composite signature-based watermarking technique”, Optical Engineering, The Catholic University of America, (Year: 2007), 6 pages. |
Jain, Anil K, et al., “Biometric Cryptosystems: Issues and Challenges”, Proceedings of the IEEE, IEEE, New York, US, vol. 92, No. 6, Jun. 1, 2004, XP011112757, pp. 948-960. |
Truong, Hieu C, et al., “Royal Canadian Mint/Signoptic Technologies Coin DNA Technology”, World Money Fair (WMF) Berlin Feb. 1-3, 2011, http://www.amisdeleuro.org/upload/1340734488.pptx, 22 pages. |
Zaeri, Naser , “Minutiae-based Fingerprint Extraction and Recognition, 2020 (year 2010)”, 47 pages. |
Number | Date | Country | |
---|---|---|---|
20210314316 A1 | Oct 2021 | US |
Number | Date | Country | |
---|---|---|---|
63006059 | Apr 2020 | US |