Apparatus and method for culling substantially redundant data in fingerprint sensing circuits

Information

  • Patent Grant
  • 8600122
  • Patent Number
    8,600,122
  • Date Filed
    Thursday, January 15, 2009
    15 years ago
  • Date Issued
    Tuesday, December 3, 2013
    11 years ago
Abstract
An apparatus for culling substantially redundant data in a fingerprint sensing circuit is disclosed in one embodiment of the invention as including an input module, a storage module, a comparator module, and a determination module. The input module may receive sets of data samples from an array of fingerprint sensing elements. The sets of data samples may be stored by the storage module. The comparator module may calculate a difference between each data sample from a first-received set, and a corresponding data sample from a second-received set. The determination module may count the number of difference values that exceed a predetermined difference limit, and identify the second set of data samples as redundant if the number of difference values counted is less than a pre-set count limit.
Description
BACKGROUND

This invention relates to biometric authentication devices and, more particularly, to apparatus and methods for culling substantially redundant data in fingerprint sensing circuits.


Fingerprint recognition and authentication systems are well recognized and highly reputed as reliable, non-intrusive ways to verify individual identity. Historically, however, the size and cost of fingerprint sensors needed to implement fingerprint recognition and authentication technology have limited their widespread use. Indeed, many conventional fingerprint recognition technologies often utilize large fingerprint sensing components (e.g., integrated circuits), rendering them impracticable and often cost-prohibitive for many portable or small applications, such as personal digital assistants, peripheral computer components, or cell phones.


Recent developments in fingerprint recognition and authentication systems have focused on “swipe”-type fingerprint sensors that significantly reduce the real estate needed to digitally capture and verify fingerprints. Particularly, such sensors provide a small-area sensor element that repeatedly scans portions (e.g., lines) of a fingerprint as it is swiped over the sensor. Later, the portions may be reconstructed to provide a complete fingerprint image for recognition and authentication purposes.


In many “swipe”-type fingerprint sensors, data acquired from the fingerprint sensor must be transmitted to a host system to enable image reconstruction and fingerprint image recognition and authentication. Often, redundant information is unnecessarily transmitted, stored, and processed by the host system as a result of time-dependent sampling that fails to account for slower swipe speeds or a lack of motion across the sensor. The redundant information and resources needed to process the redundant information unnecessarily and undesirably consumes large amounts of bandwidth, memory, and power in both the fingerprint sensing circuit and the host system.


In view of the foregoing, what is needed is an apparatus and method for reducing the amount of redundant data that is generated by “swipe”-type fingerprint sensors and transmitted to host fingerprint recognition and authentication systems. Ideally, such an apparatus and method would reduce the amount of energy, bandwidth, and memory that is required to transmit and store fingerprint data. Further needed are apparatus and methods for efficiently detecting motion across “swipe”-type fingerprint sensors. As will become evident herein, apparatus and methods in accordance with the invention satisfy many, if not all, of the above-stated needs.





BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific examples illustrated in the appended drawings. Understanding that these drawings depict only typical examples of the invention and are not therefore to be considered limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:



FIG. 1 is a high-level block diagram of one embodiment of a fingerprint sensing area having an array of fingerprint sensing elements;



FIG. 2 is a chart showing “lines” of data samples received from the fingerprint sensing elements;



FIG. 3 is a chart showing the data samples of FIG. 2 and highlighting samples that are significantly different from the last unique line, or reference line, of data samples;



FIG. 4 is a block diagram of various hardware components that may be included in a fingerprint sensing circuit in accordance with the present invention;



FIG. 5 is a high-level block diagram of one embodiment of a culling module in accordance with the present invention;



FIG. 6 is a more detailed block diagram of one embodiment of a culling module in accordance with the present invention; and



FIG. 7 is a flow chart detailing one embodiment of a method for culling substantially redundant data in a fingerprint sensing circuit in accordance with the invention.





DETAILED DESCRIPTION

The invention has been developed in response to the present state of the art, and in particular, in response to the problems and needs in the art that have not yet been fully solved by currently available fingerprint sensors. Accordingly, the invention has been developed to provide novel apparatus and methods for culling substantially redundant data in fingerprint sensing circuits. The features and advantages of the invention will become more fully apparent from the following description and appended claims and their equivalents, and also any subsequent claims or amendments presented, or may be learned by practice of the invention as set forth hereinafter.


Consistent with the foregoing, an apparatus for culling substantially redundant data in fingerprint sensing circuits is disclosed in one embodiment of the invention as including an input module, a storage module, a comparator module, and a determination module. The input module may receive sets (e.g., lines) of data samples from an array of fingerprint sensing elements, such as a linear array of fingerprint sensing elements. The storage module may store these sets of data samples. In one embodiment, the storage module stores a first-received set of a data samples in a first data buffer, and stores a second-received set of data samples in a second data buffer. The comparator module may then calculate a difference between each data sample from the first set and a corresponding data sample from the second set. The determination module may count the number of difference values that exceed a predetermined difference limit, and identify the second set of data samples as redundant if the cumulative number of difference values that exceed the predetermined difference limit is less than a pre-set count limit.


In certain embodiments, the determination module may overwrite the first-received set of data samples with an incoming set of data samples in the event the number of difference values counted exceeds the pre-set count limit. Alternatively, the determination module may overwrite the second-received set of data samples with the incoming set of data samples if the number of difference values counted is less than the pre-set count limit.


In one embodiment, the apparatus further includes a header module. The header module may attach a header to the second-received set of data samples, identifying the second set as redundant, if the number of difference values counted is less than the count limit. In some embodiments, the determination module may transmit the header, with or without the second set of data samples attached, to the host system. In other embodiments, the determination module may discard the second set of data samples if the number of difference values counted is less than the count limit.


In another embodiment of the invention, a method to cull substantially redundant data in a fingerprint sensing circuit is disclosed. The method may include initially receiving first and second sets of data samples from an array of fingerprinting elements. A difference may then be calculated between each data sample in the first set and a corresponding data sample in a second set. The difference values exceeding a predetermined difference limit may be counted. If the number of difference values counted is less than a predetermined count limit, the second set of data samples may be identified as redundant.


In certain embodiments, the first set of data samples may be stored in a first data buffer while the second set of data samples may be stored in a second data buffer. The first set of data samples in the first data buffer may be overwritten with a third set of data samples if the number of difference values counted is greater than the count limit. Otherwise, the second set of data samples in the second data buffer may be overwritten with the third set of data samples.


In one embodiment, the method may further include attaching a header to the second set of data samples to identify such samples as redundant if the number of difference values counted is less than the count limit. The header may then be transmitted to the host system with or without the second set of data samples attached. Alternatively, the second set of data samples may be suppressed or discarded.


In another embodiment of the invention, a system to cull substantially redundant data in a fingerprint sensing circuit may include a fingerprint sensor, a host system, and a culling module. The fingerprint sensor may include an array of fingerprint sensing elements to generate sets (e.g., lines) of data samples when scanning a fingerprint. The culling module may cull redundant data that is generated by the fingerprint sensor. In selected embodiments, the culling module may include means for receiving and storing sets of data samples; means for calculating differences between data samples in the sets; means for counting the number of difference values that exceed a difference limit; and means for identifying a set of data samples as redundant in the event the number is less than a count limit.


Many of the functional units described in this specification have been labeled as modules, in order to more particularly emphasize their implementation independence. For example, a module may be implemented as a hardware circuit comprising custom VLSI circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices or the like.


Modules may also be implemented in software for execution by various types of processors. An identified module of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions which may, for instance, be organized as an object, procedure, function, or other construct. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module.


Indeed, a module of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.


Reference throughout this specification to “a select embodiment,” “one embodiment,” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases “a select embodiment,” “in one embodiment,” or “in an embodiment” in various places throughout this specification are not necessarily all referring to the same embodiment.


Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided, such as examples of programming, software modules, user selections, user interfaces, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention can be practiced without one or more of the specific details, or with other methods, components, materials, etc. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the invention.


Referring now to FIG. 1, in one embodiment, a fingerprint sensor 100 in accordance with the invention may include a fingerprint sensing area 102 having an array of fingerprint sensing elements 106. A fingerprint sensing element 106 may include, for example, a transmitter element 108 and a receiver element 110, as discussed in more detail below.


In operation, a user may swipe a finger 112 over the fingerprint sensing area 102 to identify or verify a fingerprint. As shown in FIG. 1, the fingerprint sensing area 102 may be sized and oriented such that the array of fingerprint sensing elements 106 captures only a small portion of the overall fingerprint. In certain embodiments, for example, the fingerprint sensing area 102 may be designed to capture one “line” of a fingerprint at a time. As the fingerprint is swiped across the fingerprint sensing area 102, successive “lines” may be captured and later reconstructed for identification and/or identity verification purposes, as is known in the art.


In certain embodiments, each transmitter element 108 may emit a probing signal, one after the other. As explained in more detail below, the probing signal emitted by each transmitter element 108 may comprise a series of probing pulses, such as a series of square waves. Similarly, the probing signal emitted by each transmitter element 108 may be detected by one or more receiver elements 110. The receiver elements 110 may generate a response signal comprising a series of response pulses, in response to the probing signal. The magnitude of the response signal measured at the receiving element 110 may depend on various factors, such as whether a finger 112 is present over the fingerprint sensing area 102, and more particularly whether a papillary ridge or valley is near the transmitter element 108 that is emitting the probing signal. The magnitude of the signal may be directly related to the RF impedance of a papillary ridge or valley residing near the gap between the transmitter elements 108 and the receiver element 110.


Unlike many conventional fingerprint sensors that employ a single large transmitter element 108 with a large array of receiver elements 110, some embodiments of the present invention may include a single or small number of receiver elements 110 and a comparatively larger number of transmitter elements 108. Utilizing a single receiver element 110 and multiple transmitter elements 108 may enable use of a high quality receiver having a much better dynamic range than would otherwise be possible using multiple receiver elements 110.


Referring now to FIG. 2, in selected embodiments, the fingerprint sensing elements 106 may operate at fixed time intervals to produce a stream of data samples 200 represented as “lines” 202 of fingerprint data. Each data sample 200 may correspond to a different transmitter element 108 and may be assigned a numerical value (e.g., a number between 0 and 255) depending on the strength of the signal measured at the receiver element 110 for a particular transmitter element 108. Successive lines 202 of data may be captured and compared, sample 200 by sample 200, to identify and cull lines 202 that are substantially redundant, as discussed in more detail below.


In order to identify whether a line of data samples is substantially redundant in view of another line, a reference line 204 may be initially established. By default, a first-captured line 202a of data may be deemed the initial reference line 204. Each subsequent line 202b-e may be compared to the reference line 204 until a new unique line 202 is encountered. The new unique line 202 may then replace the reference line 204.


As additional lines 202b-e are scanned, each of these lines may be compared to the reference line 204. More specifically, each of the data samples 200a-m of the lines 202b-e may be compared to the data samples 200a-m of the reference line 204. If the enough of the data samples of a line 202b-e are different enough from the samples of the reference line 204, the line 202b-e may be considered “unique” and become the new reference line 204.


In order to compare lines 202, two initial data values may be established: a “difference limit” and a “count limit.” The “difference limit” may define how different data samples 200 must be to be considered unique relative to one another. The difference limit may be set to compensate for natural fluctuations due to noise or other natural variations that may not reflect actual changes in the fingerprint data. The “count limit,” on the other hand, may define how many “different” data samples 200 the lines 202 must have for the lines 202 to be considered unique.


For example, consider a difference limit that is set at a numerical value of five (5). If the numerical difference between a first data sample 200a in a first line 202a and a first data sample 200a in a second line 202b is greater than five (5), the first data sample 200a of the second line 202b may be considered unique relative to the first data sample 200a of the first line 202a. Alternatively, if the numerical difference between the first data sample 200a in the first line 202a and the first data sample 200a in the second line 202b is less than five (5), the first data sample 200a of the second line 202b may be deemed to be redundant (not unique) relative to the first data sample 200a of the first line 202a. This comparison may be performed for each data sample 200a-m in the line 202a and each data sample 200a-m in the line 202b.


Next, the number of “unique” data samples may be counted and compared to the count limit. For example, if the count limit is also set at five (5), then five (5) data samples 200 in a line 202 must be deemed to be unique relative to the reference line 204 for the line to be considered unique. If there are not five unique data samples, the line 202 may be considered redundant. This may allow the line to be discarded, suppressed, or marked as redundant as will be explained in more detail hereafter.


Consider the example provided in FIG. 3 where the count limit is set at five (5). As shown, a first-captured data line 202a may be initially deemed the reference line 204. Comparing each data sample 200a-m of the reference line 204 to each data sample 200a-m of the next line 202b may result in a determination that data sample 200b and data sample 200i of the second line 202b are unique (as indicated by the “X”) in view of the corresponding samples 200b, 200i of the reference line 204. Since only two data samples 200 in the second line 202b are deemed substantially unique, however, and because the count limit is five (5), the line 202b may be deemed to be redundant in view of the reference line 204.


This process may continue, with each data sample 200a-m of the reference line 204 being compared with the corresponding data sample 200a-m of each subsequent line 202b-e, until the number of data samples 200 deemed substantially unique in a particular line 202 is equal to or greater than the count limit of five (5). In this example, the fourth line 202d has six (6) substantially unique data samples 200b, 200c, 200e, 200h, 200i, 200l relative to the reference line 204. Accordingly, the fourth line 202d may then replace the first line 202a as the reference line 204.


Comparing all subsequent lines to a reference line 204 avoids the possibility that all lines 202 will be considered redundant where there are slow changes between adjacent lines 202. For example, consider the case where each line 202 changes by only a single data sample 200 with respect to the previous line 202. If the count limit is set at two (2), no line would ever be considered unique if compared to the immediately preceding line. That is, each line 202 would be deemed to be redundant of the line 202 immediately before it. By comparing each line to a reference line, rather than the immediately preceding line, changes will accumulate until a new unique reference line is eventually established.


Referring now to FIG. 4, a fingerprint sensor 100 in accordance with the present invention may include a fingerprint sensing integrated circuit or chip 400. In selected embodiments, the fingerprint sensing area 102 (including the transmitter and receiver elements 108, 110) may be physically decoupled from the fingerprint sensing integrated circuit or chip 400, as illustrated in FIG. 4. Nevertheless, the features disclosed herein may be applicable to fingerprint sensors 100 with sensing elements 108, 110 that are located on or off the chip 400.


In operation, the response signal generated by the receiver element 110 may be received by an analog front end 402, where it may be amplified and/or passed through various filters to remove noise or other unwanted components from the signal. The amplified and/or filtered analog signal may then be processed by an analog-to-digital converter (ADC) 404, where it may be converted to a sequence of bits, or data samples 200. These data samples 200 may represent lines 202 of data, as discussed above with reference to FIGS. 2 and 3.


The lines 202 of data may then be transmitted to a culling module 406. The culling module 406, as discussed in more detail below, may identify substantially redundant lines 202 such that they may be culled, suppressed, or marked as redundant prior to being transmitted to a host system 422.


Generally, embodiments of fingerprint sensors 100 in accordance with the present invention may scan lines 202 of data at a relatively constant rate. As a result, a significant amount of substantially redundant data may be received by the receiver element 110, for instance, if a finger 112 is not present over the fingerprint sensing area 102, or if a finger 112 is stationary or moving very slowly over the fingerprint sensing area 102. In some embodiments, this redundant data may be marked so that it may be discarded before transmission to a host system 422. By culling such redundant data, system bandwidth and the amount the energy that is required to process redundant data may be reduced.


Data received from the receiver element 110 and not discarded by the culling module 406 may be received and stored in a FIFO buffer 408. The FIFO 408 may be coupled to a bus 424, which may communicate with any of several components, such as a CPU 414, memory 410, a direct memory access controller (DMAC) 412, and the like. The bus 424 may also communicate with one or more interfaces, such as a USB interface 416, Serial Peripheral Interface (SPI) interface 418, parallel port (PP) interface 420, or the like.


The CPU 414 and/or DMAC 412 may retrieve line data 202 from the FIFO 408, possibly perform operations on the line data 202, and store the line data 202 in memory 410. This line data 202 may then be transmitted to a host system 422 through one or more of the interfaces 416, 418, 420. The host system 422 may reconstruct fingerprint image data from the line data 202, and compare the fingerprint image data to previously stored fingerprint patterns using various matching algorithms to authenticate a user's fingerprint.


Referring now to FIG. 5, in selected embodiments, a culling module 406 in accordance with the present invention may include an input module 500, a storage module 502, a comparator module 504, a determination module 506, and, in some cases, a header module 508. As discussed above, the culling module 406 may operate to mark, suppress, or cull substantially redundant data prior to transmitting it to a host system 422. In this manner, the culling module 406 may reduce the bandwidth and energy that is required to transmit and process redundant data.


In general, the input module 500 may be configured to receive lines 202 of data from an array of fingerprint sensing elements 106. The storage module 502 may then store each of the data lines 202 in, for example, designated data buffers. The comparator module 504 may then compare the data lines 202 to calculate the difference between the data samples of the data lines 202. The determination module 506 may then determine if the lines are unique or redundant based on the number of samples that are unique. In selected embodiments, a header module 508 may generate a header identifying a data line as redundant. This header may be output by the culling module 406 and transmitted, with or without the associated line data 202, to another component in the fingerprint sensing integrated circuit 400. In some cases, the header information may be transmitted to the host system 422. In any case, the header information may cause the associated line data 202 to be discarded or ignored by the recipient component.


Referring now to FIG. 6, a more detailed embodiment of the culling module 406 of FIG. 5 is illustrated. In selected embodiments, the culling module 406 may receive new line data 600 from the ADC 404, which may be forwarded to a demultiplexer 602. As previously described, this new line data 600 may include data samples 200. The demultiplexer 602 may then direct the new line data 600 into one of two data buffers 604, 606 as designated by a line buffer pointer 622. The other buffer 604, 606 may contain the reference line data 204.


A multiplexer 608 may route the reference line data 204 from the buffers 604, 606, to a logic module 610, where each data sample 200 from the new line 202 (originating at “line data in” 600) may be compared to a corresponding data sample 200 from the reference line 204. For example, the logic module 610 may calculate the difference between each data sample 200 in the new line 202 and the corresponding data sample 200 in the reference line 204.


At a logic module 612, each resulting difference value may be compared to a predetermined difference limit 614. If a difference value is greater than, or in some embodiments, greater than or equal to, the predetermined difference limit 614, a logic module 616 may increment a count value. Otherwise, the count value may be maintained at its current value. Thus, the count value may represent the number of data samples 200 in the new line 202 which are sufficiently unique in view of the data samples 200 in the reference line 204. In any case, the logic modules 610, 612, 616 may process each data sample 200 in the new line 202 before moving to a logic module 618.


At the logic module 618, the count may be compared to a predetermined count limit 620. This count limit 620 may provide a threshold for determining whether the number of difference values that exceed the difference limit 614 is sufficient to consider the new line 202 unique in view of the reference data line 204. If the count is greater than the count limit 620, the new line 202 may be output 626 from the culling module 406. Otherwise, the line 202 may be suppressed or discarded because it is redundant.


Discarding or culling a redundant line 202 may occur at any location in the system, including within the culling module 406. In some cases, for example, a header may be attached to the line 202 to indicate that the line 202 is substantially redundant. The header and/or the line 202 may then be output 626 from the culling module 406. The header and/or line 202 may be discarded by any component in the fingerprint sensing integrated circuit 400 or by the host system 422.


The line buffer pointer 622 may toggle the demultiplexer between the data buffers 604, 606 based on whether a new line 202 is determined to be unique in view of the reference line 204. For example, if a new line 202 is determined to be unique, the pointer 622 may route a new incoming line 202 to overwrite the previous reference line 204. In this manner, the new line 202 becomes the reference line 204.


If, however, the new line 202 is determined to be substantially redundant in view of the reference line 204, the line buffer pointer 622 may route the next incoming line 202 such that it overwrites the new line 202. In this manner, the previous reference line 204 is maintained.


Referring now to FIG. 7, a method 700 for culling substantially redundant data in a fingerprint sensing circuit 400 in accordance with the invention may include initially establishing 702 a difference limit and a count limit. As previously mentioned, the difference limit may be used to determine whether a data sample is unique relative to another data sample. Similarly, the count limit may be used to determine whether a line is unique relative to another line.


A pair of data samples 200, one from an incoming data line 202 and a corresponding sample 200 from a reference data line 204, may then be received 704 and compared 706. More specifically, a difference may be calculated between the data sample 200 from the incoming data line 202 and the corresponding data sample 200 from the reference data line 204. The difference between the two data samples 200 may then be compared 708 to the predetermined difference limit. If the difference is greater than the difference limit, or in some embodiments greater than or equal to the difference limit, a count value may be incremented 710. If the difference is less than the difference limit, the method may proceed to a step 712.


At step 712, the method 700 may determine whether the subject pair of data samples 200 is the last pair of data samples 200 in the subject data lines 202, 204. If not, the next pair of data samples 200 may be received 714 from the data line 202 and the reference line 204. The method 700 may then return to the compare step 706.


If, however, the subject pair of data samples 200 is the last pair of data samples 200 in the subject data lines 202, 204, the method 700 may proceed to a test 716. At the test 716, the count value may be compared to the count limit set in step 702. If the count is less than the count limit, the reference line 204 may be maintained 722 as the reference line 204, and the current data line 202 may be overwritten 724 with the next data line 202. If the count is greater than the count limit, the current data line 202 may be established 718 as the new reference line 204, and the previous reference line 204 may be overwritten 720 with the next data line 202. In any case, the method 700 may then return to receive 704 a next pair of corresponding data samples 200 from the new reference line 204 and the next incoming data line 202.


The apparatus and methods disclosed herein, in addition to being useful for line culling, may be used for motion detection. That is, the culling module 406 may be used for motion detection because it may be configured to suppress data until a finger moves on the fingerprint sensing area 102. This is because the data will not change until a finger moves. In selected embodiments, the header module 508 may set a flag in each line header which may indicate whether a line is unique or not. The CPU 414 may use the flag in a motion detection algorithm.


As previously mentioned, the culling module 406 may be configured to perform line-by-line comparisons on all data that is received by the culling module 406. In selected embodiments, however, the culling module 406 may be programmed as to whether it suppresses redundant data or not. In some cases, where redundant is encountered, the culling module 406 may be configured to transmit line headers without transmitting the redundant line data so that the host system 422 knows that a line of data was suppressed.


The following are various non-limiting example of actions that may be taken by the culling module 406 when redundant data is encountered: In a first embodiment, the culling module 406 could output each header and all data, whether redundant or not. A culled header bit could be used to indicate whether a line is redundant in view of a previous line. In a second embodiment, the culling module 406 could output a header for all lines received (whether redundant or not), but with unique line data attached. That is, the culling module 406 could output the last unique line data in place of redundant line data. A culled header bit could indicate similarity with a last unique line.


In a third embodiment, the culling module 406 could output a header for all lines received. However, the culling module 406 would transmit only unique line data, while suppressing redundant line data. A culled header bit could indicate similarity with a last unique line. In a fourth embodiment, the culling module 406 could output unique line headers and unique line data, while suppressing similar line headers and similar line data. In this embodiment, the culled header bit could always be clear. These represent just a few examples and are not intended to be limiting.


The invention may be embodied in other specific forms without departing from its spirit or essential characteristics. The described examples are to be considered in all respects only as illustrative and not restrictive. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. An apparatus comprising: a computing device configured to:receive a reference set of data samples, each data sample in the reference set of data samples being an output of a respective fingerprint image sensing element in a one dimensional linear array of fingerprint image sensing elements, oriented to capture one line of a fingerprint image at a time, each line later used to reconstruct an identifying fingerprint image and to receive a next successive set of data samples, each data sample in the next successive set of data samples being a subsequent output of the respective fingerprint image sensing element in the one dimensional linear array of fingerprint sensing elements;determine the existence of a difference between a data sample from the reference set and a corresponding data sample from the next successive set, which difference exceeds a selected threshold value, for each data sample from the reference set and the corresponding data sample from the next successive set;count the number of times the difference exceeds the threshold in comparing the reference set to the next successive set; andidentify the next successive set of data samples as redundant when the number is less than a selected count.
  • 2. The apparatus of claim 1, wherein the computing device is configured to store the reference set of data samples in a first data buffer and store the next successive set of data samples in a second data buffer.
  • 3. The apparatus of claim 2, wherein the computing device is configured to overwrite the reference set of data samples in the first data buffer with the next subsequent set of data samples when the number is greater than the selected count.
  • 4. The apparatus of claim 3, wherein the computing device is configured to overwrite the next successive set of data samples in the second data buffer with a further next successive set of data samples.
  • 5. The apparatus of claim 1, wherein the computing device is configured to attach a header to the next successive set of data samples.
  • 6. The apparatus of claim 5, wherein the header identifies the next successive set of data samples as redundant where the number is less than the selected count.
  • 7. The apparatus of claim 6, wherein the computing device is configured to transmit the header to a host system in the event the number is less than the selected count.
  • 8. The apparatus of claim 1, wherein the computing device is configured to discard the next successive set of data samples when the number is less than the selected count.
  • 9. A method comprising: receiving, via a computing device, a reference set of data samples, each data sample in the reference set of data samples being an output of a respective fingerprint image sensing element in a one dimensional linear array of fingerprint image sensing elements, oriented to capture one line of a fingerprint image at a time, each line later used to reconstruct an identifying fingerprint image;receiving, via a computing device, a next successive set of data samples, each data sample in the next successive set of data samples being a subsequent output of a respective fingerprint image sensing element in the one-dimensional linear array of fingerprint image sensing elements;calculating, via a computing device, a difference between a data sample from the reference set and a corresponding data sample from the next successive set and providing a plurality of difference values, for each data sample from the reference set and the corresponding data sample from the next successive set;counting, via a computing device, the number of difference values that exceed a selected threshold, for each data sample from the reference set and the corresponding data sample from the next successive set; andidentifying the next successive set of data samples as redundant when the number is less than a selected count.
  • 10. The method of claim 9, further comprising storing the reference set of data samples in a first data buffer and storing the next successive set of data samples in a second data buffer.
  • 11. The method of claim 10, further comprising overwriting the reference set of data samples in the reference data buffer with the next successive set of data samples when the number is greater than the selected count.
  • 12. The method of claim 11, further comprising overwriting the next successive set of data samples in the second data buffer with a further next successive set of data samples.
  • 13. The method of claim 9, further comprising attaching a header to the next successive set of data samples, the header identifying the next successive set of data samples as redundant when the number is less than the selected count.
  • 14. The method of claim 13, further comprising transmitting the header to a host system when the number is less than the selected count.
  • 15. The method of claim 9, further comprising discarding the next successive set of data samples when the number is less than the selected count.
  • 16. A system comprising: a fingerprint sensor comprising one-dimensional linear array of fingerprint sensing elements;a host system configured to receive sets of data samples from the fingerprint sensor;and a sensor computing device configured to reduce the amount of substantially redundant sets of data samples data that is transmitted from the fingerprint sensor to the host system, the sensor computing device configured to:receive a reference set of data samples from the one-dimensional linear array of fingerprint sensing elements, oriented to capture one line of a fingerprint image at a time, each line later used to reconstruct an identifying fingerprint image, and subsequently to receive a next successive set of data samples from the one-dimensional linear array of fingerprint sensing elements;calculate a difference between each data sample from the reference set and a corresponding data sample from the next successive set and provide a plurality of difference values, for each data sample from the reference set and the corresponding data sample from the next successive set;count the number of difference values that exceed a selected threshold, for each data sample from the reference set and the corresponding data sample from the next successive set; andidentify the next successive set of data samples as redundant when the number is less than a selected count.
  • 17. The system of claim 16, wherein the sensor computing device is configured to discard the next successive set of data samples when the number is less than the selected count.
  • 18. The system of claim 16, wherein the sensor computing device is configured to attach a header to the next successive set of data samples when the number is less than the selected count, the header identifying the next successive set of data samples as redundant.
  • 19. A non-transitory machine readable medium storing instructions that, when executed by a computing device, cause the computing device to perform a method, the method comprising: receiving a reference set of data samples, each data sample in the reference set of data samples being an output of a respective fingerprint image sensing element in a one dimensional linear array of fingerprint image sensing elements, oriented to capture one line of a fingerprint image at a time, each line later used to reconstruct an identifying fingerprint image, and a next successive set of data samples, each data sample in the next successive set of data samples being a subsequent output of the respective fingerprint image sensing element in the one dimensional linear array of fingerprint sensing elements;determining the existence of a difference between each data sample from the reference set and a corresponding data sample from the next successive set, which difference that exceeds a selected threshold value;counting the number of times the difference exceeds the threshold; andidentify the second set of data samples as redundant when the number is less than a selected count.
  • 20. A biometric sensing system comprising: a biometric sensor sensing a reference set of data samples, each data sample in the reference set of data samples being an output of a respective biometric image sensing element in a one dimensional linear array of biometric image sensing elements, oriented to capture one line of a biometric image at a time, each line later potentially to be used to reconstruct an identifying biometric image and to receive a next successive set of data samples, each data sample in the next successive set of data samples being a subsequent output of the respective biometric image sensing element in the one dimensional linear array of biometric sensing elements;a computing device configured to determine the existence of a difference between a data sample from the reference set and a corresponding data sample from the next successive set, which difference exceeds a selected threshold value, for each data sample from the reference set and the corresponding data sample from the next successive set;count the number of times the difference exceeds the threshold in comparing the reference set to the next successive set; andidentify the next successive set of data samples as redundant when the number is less than a selected count.
US Referenced Citations (458)
Number Name Date Kind
3593319 Barber Jul 1971 A
4151512 Rigannati et al. Apr 1979 A
4225850 Chang et al. Sep 1980 A
4310827 Asi Jan 1982 A
4353056 Tsikos Oct 1982 A
4405829 Rivest et al. Sep 1983 A
4525859 Bowles et al. Jun 1985 A
4550221 Mabusth Oct 1985 A
4580790 Doose Apr 1986 A
4582985 Loftberg Apr 1986 A
4675544 Shrenk Jun 1987 A
4758622 Gosselin Jul 1988 A
4817183 Sparrow Mar 1989 A
5076566 Kriegel Dec 1991 A
5079949 Tamori Jan 1992 A
5109427 Yang Apr 1992 A
5140642 Hau et al. Aug 1992 A
5270949 Atherton et al. Dec 1993 A
5305017 Gerpheide Apr 1994 A
5319323 Fong Jun 1994 A
5325442 Knapp Jun 1994 A
5359243 Norman Oct 1994 A
5420936 Fitzpatrick et al. May 1995 A
5422807 Mitra et al. Jun 1995 A
5429006 Tamori Jul 1995 A
5456256 Schneider et al. Oct 1995 A
5515738 Tamori May 1996 A
5543591 Gillespie et al. Aug 1996 A
5569901 Bridgelall et al. Oct 1996 A
5623552 Lane Apr 1997 A
5627316 De Winter et al. May 1997 A
5650842 Maase et al. Jul 1997 A
5717777 Wong et al. Feb 1998 A
5781651 Hsiao et al. Jul 1998 A
5801681 Sayag Sep 1998 A
5818956 Tuli Oct 1998 A
5828773 Setlak et al. Oct 1998 A
5838306 O'Connor Nov 1998 A
5844287 Hassan et al. Dec 1998 A
5848176 Harra et al. Dec 1998 A
5850450 Schweitzer et al. Dec 1998 A
5852670 Setlak et al. Dec 1998 A
5864296 Upton Jan 1999 A
5887343 Salatino et al. Mar 1999 A
5892824 Beatson et al. Apr 1999 A
5903225 Schmitt et al. May 1999 A
5915757 Tsuyama et al. Jun 1999 A
5920384 Borza Jul 1999 A
5920640 Salatino et al. Jul 1999 A
5940526 Setlak et al. Aug 1999 A
5963679 Setlak Oct 1999 A
5995630 Borza Nov 1999 A
5999637 Toyoda et al. Dec 1999 A
6002389 Kasser Dec 1999 A
6002815 Immega et al. Dec 1999 A
6011859 Kalnitsky et al. Jan 2000 A
6016355 Dickinson et al. Jan 2000 A
6052475 Upton Apr 2000 A
6067368 Setlak et al. May 2000 A
6073343 Petrick et al. Jun 2000 A
6076566 Lowe Jun 2000 A
6088585 Schmitt et al. Jul 2000 A
6098175 Lee Aug 2000 A
6118318 Fifield et al. Sep 2000 A
6134340 Hsu et al. Oct 2000 A
6157722 Lerner et al. Dec 2000 A
6161213 Lofstrom Dec 2000 A
6175407 Santor Jan 2001 B1
6182076 Yu et al. Jan 2001 B1
6182892 Angelo et al. Feb 2001 B1
6185318 Jain et al. Feb 2001 B1
6234031 Suga May 2001 B1
6241288 Bergenek et al. Jun 2001 B1
6259108 Antonelli et al. Jul 2001 B1
6289114 Mainguet Sep 2001 B1
6292272 Okauchi et al. Sep 2001 B1
6317508 Kramer et al. Nov 2001 B1
6320394 Tartagni Nov 2001 B1
6325285 Baratelli Dec 2001 B1
6327376 Harkin Dec 2001 B1
6330345 Russo et al. Dec 2001 B1
6332193 Glass et al. Dec 2001 B1
6333989 Borza Dec 2001 B1
6337919 Dunton Jan 2002 B1
6343162 Saito et al. Jan 2002 B1
6346739 Lepert et al. Feb 2002 B1
6347040 Fries et al. Feb 2002 B1
6357663 Takahashi et al. Mar 2002 B1
6360004 Akizuki Mar 2002 B1
6362633 Tartagni Mar 2002 B1
6392636 Ferrari et al. May 2002 B1
6399994 Shobu Jun 2002 B2
6400836 Senior Jun 2002 B2
6408087 Kramer Jun 2002 B1
6459804 Mainguet Oct 2002 B2
6473072 Comiskey et al. Oct 2002 B1
6481294 Zellner et al. Nov 2002 B2
6509501 Eicken et al. Jan 2003 B2
6512381 Kramer Jan 2003 B2
6525547 Hayes Feb 2003 B2
6525932 Ohnishi et al. Feb 2003 B1
6535622 Russo et al. Mar 2003 B1
6539101 Black Mar 2003 B1
6546122 Russo Apr 2003 B1
6580816 Kramer et al. Jun 2003 B2
6597289 Sabatini Jul 2003 B2
6628812 Setlak et al. Sep 2003 B1
6631201 Dickinson et al. Oct 2003 B1
6643389 Raynal et al. Nov 2003 B1
6672174 Deconde et al. Jan 2004 B2
6710461 Chou et al. Mar 2004 B2
6738050 Comiskey et al. May 2004 B2
6741729 Bjorn et al. May 2004 B2
6757002 Oross et al. Jun 2004 B1
6766040 Catalano et al. Jul 2004 B1
6785407 Tschudi et al. Aug 2004 B1
6799275 Bjorn et al. Sep 2004 B1
6836230 Le Pailleur et al. Dec 2004 B2
6838905 Doyle Jan 2005 B1
6862942 Kawahata Mar 2005 B2
6873356 Kanbe et al. Mar 2005 B1
6886104 McClurg et al. Apr 2005 B1
6897002 Teraoka et al. May 2005 B2
6898299 Brooks May 2005 B1
6924496 Manansala Aug 2005 B2
6937748 Schneider et al. Aug 2005 B1
6941001 Bolle et al. Sep 2005 B1
6941810 Okada Sep 2005 B2
6950540 Higuchi Sep 2005 B2
6959874 Bardwell Nov 2005 B2
6963626 Shaeffer et al. Nov 2005 B1
6970584 O'Gorman et al. Nov 2005 B2
6980672 Saito et al. Dec 2005 B2
6983882 Cassone Jan 2006 B2
7013030 Wong et al. Mar 2006 B2
7020591 Wei et al. Mar 2006 B1
7030860 Hsu et al. Apr 2006 B1
7031670 May Apr 2006 B2
7035443 Wong Apr 2006 B2
7042535 Katoh et al. May 2006 B2
7043061 Hamid et al. May 2006 B2
7043644 DeBruine May 2006 B2
7046230 Zadesky et al. May 2006 B2
7064743 Nishikawa Jun 2006 B2
7099496 Benkley Aug 2006 B2
7110574 Haruki et al. Sep 2006 B2
7110577 Tschud Sep 2006 B1
7113622 Hamid Sep 2006 B2
7126389 McRae et al. Oct 2006 B1
7129926 Mathiassen et al. Oct 2006 B2
7136514 Wong Nov 2006 B1
7146024 Benkley Dec 2006 B2
7146026 Russon et al. Dec 2006 B2
7146029 Manansala Dec 2006 B2
7184581 Johansen et al. Feb 2007 B2
7190209 Kang et al. Mar 2007 B2
7190816 Mitsuyu et al. Mar 2007 B2
7194392 Tuken et al. Mar 2007 B2
7197168 Russo Mar 2007 B2
7200250 Chou Apr 2007 B2
7251351 Mathiassen et al. Jul 2007 B2
7258279 Schneider et al. Aug 2007 B2
7260246 Fujii Aug 2007 B2
7263212 Kawabe Aug 2007 B2
7263213 Rowe Aug 2007 B2
7289649 Walley et al. Oct 2007 B1
7290323 Deconde et al. Nov 2007 B2
7308121 Mathiassen et al. Dec 2007 B2
7308122 McClurg et al. Dec 2007 B2
7321672 Sasaki et al. Jan 2008 B2
7356169 Hamid Apr 2008 B2
7360688 Harris Apr 2008 B1
7369685 DeLeon May 2008 B2
7379569 Chikazawa et al. May 2008 B2
7408135 Fujeda Aug 2008 B2
7409876 Ganapathi et al. Aug 2008 B2
7412083 Takahashi Aug 2008 B2
7424618 Roy et al. Sep 2008 B2
7447339 Mimura et al. Nov 2008 B2
7447911 Chou et al. Nov 2008 B2
7460697 Erhart et al. Dec 2008 B2
7463756 Benkley Dec 2008 B2
7474772 Russo et al. Jan 2009 B2
7505611 Fyke Mar 2009 B2
7505613 Russo Mar 2009 B2
7565548 Fiske et al. Jul 2009 B2
7574022 Russo Aug 2009 B2
7596832 Hsieh et al. Oct 2009 B2
7599530 Boshra Oct 2009 B2
7616787 Boshra Nov 2009 B2
7634117 Cho Dec 2009 B2
7643950 Getzin et al. Jan 2010 B1
7646897 Fyke Jan 2010 B2
7681232 Nordentoft et al. Mar 2010 B2
7689013 Shinzaki Mar 2010 B2
7706581 Drews et al. Apr 2010 B2
7733697 Picca et al. Jun 2010 B2
7734074 Setlak et al. Jun 2010 B2
7751601 Benkley Jul 2010 B2
7826645 Cayen Nov 2010 B1
7843438 Onoda Nov 2010 B2
7848798 Martinsen et al. Dec 2010 B2
7899216 Watanabe et al. Mar 2011 B2
7953258 Dean et al. May 2011 B2
8005276 Dean et al. Aug 2011 B2
8031916 Abiko et al. Oct 2011 B2
8063734 Conforti Nov 2011 B2
8077935 Geoffroy et al. Dec 2011 B2
8107212 Nelson et al. Jan 2012 B2
8116540 Dean et al. Feb 2012 B2
8131026 Benkley et al. Mar 2012 B2
8165355 Benkley et al. Apr 2012 B2
8175345 Gardner May 2012 B2
8204281 Satya et al. Jun 2012 B2
8224044 Benkley Jul 2012 B2
8229184 Benkley Jul 2012 B2
8276816 Gardner Oct 2012 B2
8278946 Thompson Oct 2012 B2
8290150 Erhart et al. Oct 2012 B2
8315444 Gardner Nov 2012 B2
8331096 Garcia Dec 2012 B2
8358815 Benkley et al. Jan 2013 B2
8374407 Benkley et al. Feb 2013 B2
8391568 Satyan Mar 2013 B2
8447077 Benkley et al. May 2013 B2
RE44440 Getzin et al. Aug 2013 E
8520913 Dean et al. Aug 2013 B2
20010026636 Mainget Oct 2001 A1
20010030644 Allport Oct 2001 A1
20010036299 Senior Nov 2001 A1
20010043728 Kramer et al. Nov 2001 A1
20020014530 Iihama Feb 2002 A1
20020025062 Black Feb 2002 A1
20020061125 Fujii May 2002 A1
20020064892 Lepert et al. May 2002 A1
20020067845 Griffis Jun 2002 A1
20020089044 Simmons et al. Jul 2002 A1
20020089410 Janiak et al. Jul 2002 A1
20020096731 Wu et al. Jul 2002 A1
20020122026 Bergstrom Sep 2002 A1
20020126516 Jeon Sep 2002 A1
20020133725 Roy et al. Sep 2002 A1
20020152048 Hayes Oct 2002 A1
20020181749 Matsumoto et al. Dec 2002 A1
20030002717 Hamid Jan 2003 A1
20030002719 Hamid et al. Jan 2003 A1
20030021495 Cheng Jan 2003 A1
20030035570 Benkley Feb 2003 A1
20030063782 Acharya et al. Apr 2003 A1
20030068072 Hamid Apr 2003 A1
20030076301 Tsuk et al. Apr 2003 A1
20030076303 Huppi Apr 2003 A1
20030095096 Robbin et al. May 2003 A1
20030095690 Su et al. May 2003 A1
20030102874 Lane et al. Jun 2003 A1
20030123714 O'Gorman et al. Jul 2003 A1
20030123715 Uchida Jul 2003 A1
20030141959 Keogh et al. Jul 2003 A1
20030147015 Katoh et al. Aug 2003 A1
20030161510 Fuji Aug 2003 A1
20030161512 Mathiassen et al. Aug 2003 A1
20030169228 Mathiassen et al. Sep 2003 A1
20030174871 Yoshioka et al. Sep 2003 A1
20030186157 Teraoka et al. Oct 2003 A1
20030209293 Sako et al. Nov 2003 A1
20030224553 Manansala Dec 2003 A1
20040012773 Puttkammer Jan 2004 A1
20040017934 Kocher et al. Jan 2004 A1
20040021786 Nakamura et al. Feb 2004 A1
20040022001 Chu et al. Feb 2004 A1
20040042642 Bolle et al. Mar 2004 A1
20040050930 Rowe Mar 2004 A1
20040066613 Leitao Apr 2004 A1
20040076313 Bronstein et al. Apr 2004 A1
20040081339 Benkley Apr 2004 A1
20040096086 Miyasaka et al. May 2004 A1
20040113956 Bellwood et al. Jun 2004 A1
20040120400 Linzer Jun 2004 A1
20040125993 Zhao et al. Jul 2004 A1
20040129787 Saito Jul 2004 A1
20040136612 Meister et al. Jul 2004 A1
20040155752 Radke Aug 2004 A1
20040172339 Snelgrove et al. Sep 2004 A1
20040179718 Chou Sep 2004 A1
20040184641 Nagasaka et al. Sep 2004 A1
20040188838 Okada et al. Sep 2004 A1
20040190761 Lee Sep 2004 A1
20040208346 Baharav et al. Oct 2004 A1
20040208347 Baharav et al. Oct 2004 A1
20040208348 Baharav et al. Oct 2004 A1
20040213441 Tschudi Oct 2004 A1
20040215689 Dooley et al. Oct 2004 A1
20040228505 Sugimoto Nov 2004 A1
20040228508 Shigeta Nov 2004 A1
20040240712 Rowe et al. Dec 2004 A1
20040252867 Lan et al. Dec 2004 A1
20050031174 Ryhanen et al. Feb 2005 A1
20050036665 Higuchi Feb 2005 A1
20050047485 Khayrallah et al. Mar 2005 A1
20050100196 Scott et al. May 2005 A1
20050100938 Hoffmann et al. May 2005 A1
20050103611 Holscher May 2005 A1
20050109835 Jacoby et al. May 2005 A1
20050110103 Setlak May 2005 A1
20050111708 Chou May 2005 A1
20050123176 Ishil et al. Jun 2005 A1
20050129291 Boshra Jun 2005 A1
20050136200 Durell et al. Jun 2005 A1
20050139656 Arnouse Jun 2005 A1
20050139685 Kozlay Jun 2005 A1
20050162402 Watanachote Jul 2005 A1
20050169503 Howell et al. Aug 2005 A1
20050174015 Scott et al. Aug 2005 A1
20050210271 Chou et al. Sep 2005 A1
20050219200 Weng Oct 2005 A1
20050220329 Payne et al. Oct 2005 A1
20050231213 Chou et al. Oct 2005 A1
20050238212 Du et al. Oct 2005 A1
20050244038 Benkley Nov 2005 A1
20050244039 Geoffroy et al. Nov 2005 A1
20050247559 Frey et al. Nov 2005 A1
20050249386 Juh Nov 2005 A1
20050258952 Utter et al. Nov 2005 A1
20050269402 Spitzer et al. Dec 2005 A1
20060006224 Modi Jan 2006 A1
20060055500 Burke et al. Mar 2006 A1
20060057756 Sato et al. Mar 2006 A1
20060066572 Yumoto et al. Mar 2006 A1
20060076926 Lee Apr 2006 A1
20060078176 Abiko et al. Apr 2006 A1
20060083411 Benkley Apr 2006 A1
20060110537 Huang et al. May 2006 A1
20060140461 Kim et al. Jun 2006 A1
20060144953 Takao Jul 2006 A1
20060170528 Fukushige et al. Aug 2006 A1
20060181521 Perrault et al. Aug 2006 A1
20060182319 Setlank et al. Aug 2006 A1
20060187200 Martin Aug 2006 A1
20060210082 Devadas et al. Sep 2006 A1
20060214512 Iwata Sep 2006 A1
20060214767 Carrieri Sep 2006 A1
20060239514 Watanabe et al. Oct 2006 A1
20060249008 Luther Nov 2006 A1
20060259873 Mister Nov 2006 A1
20060261174 Zellner et al. Nov 2006 A1
20060267125 Huang et al. Nov 2006 A1
20060267385 Steenwyk et al. Nov 2006 A1
20060271793 Devadas et al. Nov 2006 A1
20060285728 Leung et al. Dec 2006 A1
20060287963 Steeves et al. Dec 2006 A1
20070031011 Erhart et al. Feb 2007 A1
20070036400 Watanabe et al. Feb 2007 A1
20070057763 Blattner et al. Mar 2007 A1
20070058843 Theis et al. Mar 2007 A1
20070067828 Bychkov Mar 2007 A1
20070076926 Schneider et al. Apr 2007 A1
20070076951 Tanaka et al. Apr 2007 A1
20070086634 Setlak et al. Apr 2007 A1
20070090312 Stallinga et al. Apr 2007 A1
20070138299 Mitra Jun 2007 A1
20070154072 Taraba et al. Jul 2007 A1
20070160269 Kuo Jul 2007 A1
20070180261 Akkermans et al. Aug 2007 A1
20070196002 Choi et al. Aug 2007 A1
20070198141 Moore Aug 2007 A1
20070198435 Siegal et al. Aug 2007 A1
20070228154 Tran Oct 2007 A1
20070237366 Maletsky Oct 2007 A1
20070237368 Bjorn et al. Oct 2007 A1
20070248249 Stoianov Oct 2007 A1
20070290124 Neil et al. Dec 2007 A1
20080002867 Mathiassen et al. Jan 2008 A1
20080013805 Sengupta et al. Jan 2008 A1
20080019578 Saito et al. Jan 2008 A1
20080049987 Champagne et al. Feb 2008 A1
20080049989 Iseri et al. Feb 2008 A1
20080063245 Benkley et al. Mar 2008 A1
20080069412 Champagne et al. Mar 2008 A1
20080126260 Cox et al. May 2008 A1
20080169345 Keane et al. Jul 2008 A1
20080170695 Adler et al. Jul 2008 A1
20080175450 Scott et al. Jul 2008 A1
20080178008 Takahashi et al. Jul 2008 A1
20080179112 Qin et al. Jul 2008 A1
20080185429 Saville Aug 2008 A1
20080201265 Hewton Aug 2008 A1
20080205714 Benkley et al. Aug 2008 A1
20080219521 Benkley et al. Sep 2008 A1
20080222049 Loomis et al. Sep 2008 A1
20080223925 Saito et al. Sep 2008 A1
20080226132 Gardner Sep 2008 A1
20080238878 Wang Oct 2008 A1
20080240523 Benkley et al. Oct 2008 A1
20080240537 Yang et al. Oct 2008 A1
20080244277 Orsini et al. Oct 2008 A1
20080267462 Nelson et al. Oct 2008 A1
20080279373 Erhart et al. Nov 2008 A1
20080317290 Tazoe Dec 2008 A1
20090001999 Douglas Jan 2009 A1
20090130369 Huang et al. May 2009 A1
20090140838 Newman et al. Jun 2009 A1
20090153297 Gardner Jun 2009 A1
20090154779 Satyan et al. Jun 2009 A1
20090155456 Benkley et al. Jun 2009 A1
20090169071 Bond et al. Jul 2009 A1
20090174974 Huang et al. Jul 2009 A1
20090212902 Haddock Aug 2009 A1
20090218698 Lam Sep 2009 A1
20090237135 Ramaraju et al. Sep 2009 A1
20090252384 Dean et al. Oct 2009 A1
20090252385 Dean et al. Oct 2009 A1
20090252386 Dean et al. Oct 2009 A1
20090279742 Abiko Nov 2009 A1
20090319435 Little et al. Dec 2009 A1
20090324028 Russo Dec 2009 A1
20100026451 Erhart et al. Feb 2010 A1
20100045705 Vertegaal et al. Feb 2010 A1
20100083000 Kesanupalli et al. Apr 2010 A1
20100117224 McElrea et al. May 2010 A1
20100117794 Adams et al. May 2010 A1
20100119124 Satyan May 2010 A1
20100123657 Shimizu May 2010 A1
20100127366 Bond et al. May 2010 A1
20100176823 Thompson et al. Jul 2010 A1
20100176892 Thompson et al. Jul 2010 A1
20100177940 Thompson et al. Jul 2010 A1
20100180136 Thompson et al. Jul 2010 A1
20100189314 Benkley et al. Jul 2010 A1
20100208953 Gardner et al. Aug 2010 A1
20100244166 Shibuta et al. Sep 2010 A1
20100272329 Benkley Oct 2010 A1
20100284565 Benkley et al. Nov 2010 A1
20110002461 Erhart et al. Jan 2011 A1
20110018556 Le et al. Jan 2011 A1
20110083018 Kasanupalli et al. Apr 2011 A1
20110083170 Kasanupalli et al. Apr 2011 A1
20110090047 Patel Apr 2011 A1
20110102567 Erhart May 2011 A1
20110102569 Erhart May 2011 A1
20110175703 Benkley Jul 2011 A1
20110176037 Benkley Jul 2011 A1
20110182486 Valfridsson et al. Jul 2011 A1
20110214924 Perezselsky et al. Sep 2011 A1
20110221942 Taura Sep 2011 A1
20110267298 Erhart et al. Nov 2011 A1
20110298711 Dean et al. Dec 2011 A1
20110304001 Erhart et al. Dec 2011 A1
20120044639 Garcia Feb 2012 A1
20120148122 Dean et al. Jun 2012 A1
20120189166 Russo Jul 2012 A1
20120189172 Russo Jul 2012 A1
20120206586 Gardner Aug 2012 A1
20120256280 Erhart et al. Oct 2012 A1
20120257032 Benkley Oct 2012 A1
20120308092 Benkley et al. Dec 2012 A1
20130021044 Thompson et al. Jan 2013 A1
20130094715 Benkley et al. Apr 2013 A1
20130177220 Erhart et al. Jul 2013 A1
Foreign Referenced Citations (82)
Number Date Country
2213813 Oct 1973 DE
0791899 Aug 1997 EP
0791899 Aug 1997 EP
0791899 Aug 1997 EP
0929028 Jan 1998 EP
0905646 Mar 1999 EP
0973123 Jan 2000 EP
1018697 Jul 2000 EP
1139301 Oct 2001 EP
1531419 May 2005 EP
1533759 May 2005 EP
1536368 Jun 2005 EP
1538548 Jun 2005 EP
1624399 Feb 2006 EP
1775674 Apr 2007 EP
1939788 Jul 2008 EP
2343677 Jul 2011 EP
2343679 Jul 2011 EP
2331613 May 1999 GB
2480919 Dec 2011 GB
2487661 Aug 2012 GB
2489100 Sep 2012 GB
2490192 Oct 2012 GB
2474999 Feb 2013 GB
2499497 Aug 2013 GB
01094418 Apr 1989 JP
04158434 Jun 1992 JP
2003256820 Sep 2003 JP
2005011002 Jan 2005 JP
2005242856 Sep 2005 JP
2006053768 Jun 2006 JP
2007305097 Nov 2007 JP
3569804 Sep 2009 JP
200606745 Feb 2006 TW
200606746 Feb 2006 TW
200614092 May 2006 TW
200617798 Jun 2006 TW
200620140 Jun 2006 TW
200629167 Aug 2006 TW
WO 9003620 Apr 1990 WO
WO 9858342 Dec 1998 WO
WO 9928701 Jun 1999 WO
WO 9943258 Sep 1999 WO
WO 9946724 Sep 1999 WO
WO 0122349 Mar 2001 WO
WO 0159558 Aug 2001 WO
WO 0194902 Dec 2001 WO
WO 0194902 Dec 2001 WO
WO 0195304 Dec 2001 WO
WO 0211066 Feb 2002 WO
WO 0247018 Jun 2002 WO
WO 0247018 Jun 2002 WO
WO 02061668 Aug 2002 WO
WO 02077907 Oct 2002 WO
WO 03063054 Jul 2003 WO
WO 03075210 Sep 2003 WO
WO 2004066194 Aug 2004 WO
WO 2004066693 Aug 2004 WO
WO 2005104012 Nov 2005 WO
WO 2005106774 Nov 2005 WO
WO 2005106774 Nov 2005 WO
WO 2006040724 Apr 2006 WO
WO 2006041780 Apr 2006 WO
WO 2007011607 Jan 2007 WO
WO 2008033264 Mar 2008 WO
WO 2008033264 Mar 2008 WO
WO 2008033265 Jun 2008 WO
WO 2008033265 Jun 2008 WO
WO 2008137287 Nov 2008 WO
WO 2009002599 Dec 2008 WO
WO 2009002599 Dec 2008 WO
WO 2009029257 Jun 2009 WO
WO 2009079219 Jun 2009 WO
WO 2009079221 Jun 2009 WO
WO 2009079257 Jun 2009 WO
WO 2009079262 Jun 2009 WO
WO 2010034036 Mar 2010 WO
WO 2010036445 Apr 2010 WO
WO 2010143597 Dec 2010 WO
WO 2011088248 Jan 2011 WO
WO2011088252 Jan 2011 WO
WO 2011053797 May 2011 WO
Non-Patent Literature Citations (16)
Entry
Hiltgen, et al., “Secure Internet Banking Authentication”, IEEE Security and Privacy, IEEE Computer Society, New York, NY, US, Mar. 1, 2006, pp. 24-31, XP007908655, ISSN: 1540-7993.
Hegt, “Analysis of Current and Future Phishing Attacks on Internet Banking Services”, Mater Thesis. Techische Universiteit Eindhoven—Department of Mathematics and Computer Science May 31, 2008, pp. 1-149, XP002630374, Retrieved from the Internet: URL:http://alexandria.tue.nl/extral/afstversl/wsk-i/hgt2008.pdf [retrieved on Mar. 29, 2011] *pp. 127-134, paragraph 6.2*.
Matsumoto et al., Impact of Artificial “Gummy” Fingers on Fingerprint Systems, SPIE 4677 (2002), reprinted from cryptome.org.
Maltoni, “Handbook of Fingerprint Recognition”, XP002355942 Springer, New York, USA, Jun. 2003 pp. 65-69.
Vermasan, et al., “A500 dpi AC Capacitive Hybrid Flip-Chip CMOS ASIC/Sensor Module for Fingerprint, Navigation, and Pointer Detection With On-Chip Data Processing”, IEEE Journal of Solid State Circuits, vol. 38, No. 12, Dec. 2003, pp. 2288-2294.
Ratha, et al. “Adaptive Flow Orientation Based Feature Extraction in Fingerprint Images,” Pattern Recognition, vol. 28 No. 11, 1657-1672, Nov. 1995.
Ratha, et al., “A Real Time Matching System for Large Fingerprint Databases,” IEEE, Aug. 1996.
Suh, et al., “Design and Implementation of the AEGIS Single-Chip Secure Processor Using Physical Random Functions”, Computer Architecture, 2005, ISCA '05, Proceedings, 32nd International Symposium, Jun. 2005 (MIT Technical Report CSAIL CSG-TR-843, 2004.
Rivest, et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems”, Communication of the ACM, vol. 21 (2), pp. 120-126. (1978).
Gassend, et al., “Controlled Physical Random Functions”, In Proceedings of the 18th Annual Computer Security Conference, Las Vegas, Nevada, Dec. 12, 2002.
Wikipedia (Mar. 2003). “Integrated Circuit,” http://en.wikipedia.org/wiki/integrated—circuit. Revision as of Mar. 23, 2003.
Wikipedia (Dec. 2006). “Integrated circuit” Revision as of Dec. 10, 2006. http://en.widipedia.org/wiki/Integrated—circuit.
Bellagiodesigns.Com (Internet Archive Wayback Machine, www.bellagiodesigns.com date: Oct. 29, 2005).
Closed Loop Systems, The Free Dictionary, http://www.thefreedictionary.com/closed-loop+system (downloaded Dec. 1, 2011).
Feedback: Electronic Engineering, Wikipedia, p. 5 http://en.wikipedia.org/wiki/Feedback#Electronic—engineering (downloaded Dec. 1, 2011).
Galy et al. (Jul. 2007) “A full fingerprint verification system for a single-line sweep sensor.” IEEE Sensors J., vol. 7 No. 7, pp. 1054-1065.
Related Publications (1)
Number Date Country
20100177940 A1 Jul 2010 US