System for and method of image reconstruction with dual line scanner using line counts

Information

  • Patent Grant
  • 8594393
  • Patent Number
    8,594,393
  • Date Filed
    Wednesday, January 26, 2011
    14 years ago
  • Date Issued
    Tuesday, November 26, 2013
    11 years ago
Abstract
A fingerprint scanning and image reconstruction system and method including a fingerprint scanner providing a first scan line and a second scan line separated by a line separation distance in a scanning direction. The system includes an image reconstruction module accumulating scan lines including at least the first scan line and the second scan line over a time period t. The image reconstruction module a value for decimation (t) necessary to produce a selected y axis resolution in the scanning direction based at least in part on (line count(t)/line separation distance)* a selected y resolution, where line count(t) is the number of lines accumulated in time t, and decimation(t) indicates of whether the line count(t) is greater than or less than the number of lines accumulated as a function of the time period t that will result in a selected reconstructed image y resolution in the scanning direction.
Description
BACKGROUND OF THE INVENTION

Some conventional fingerprint scanners include large, wall-mounted units, called contact or placement sensors, that sense an entire fingerprint at once (e.g., an entire fingerprint including images of 200-500 rows and 128-200 columns of pixels). Other fingerprint scanners include smaller swipe scanners incorporated into laptop and notebook computers, mobile phones, mobile email devices, and smart phones. Smaller swipe scanners are much less expensive to manufacture than larger contact or placement scanners. Stationary swipe fingerprint scanners sense a finger being swiping across the scanner and can be dual line scanners or multi line scanners.


One example of a dual line scanner is disclosed in U.S. Pat. No. 6,002,815 issued to Immega et al. on Dec. 14, 1999 (“Immega”), the entire contents of which is herein incorporated by reference. The Immega dual line scanner must determine and track the velocity of the finger as it passes over the sensor and a 1×n pixel array scanner. The Immega dual line scanner performs 1×n linear array cross-correlation on current and historic line scans to initially image the fingerprint. The velocity of the finger must then be known in order to reconstruct the fingerprint image from the line scans.


One example of a multi line scanner is disclosed in U.S. Pat. No. 7,197,168, issued to Russo on Mar. 27, 2007 (“Russo”), the entire contents of which is herein incorporated by reference. The Russo multi line scanner reassembles overlapping object imaging frame scans collected by a multi line sensor array to reconstruct the fingerprint image without calculating the velocity of the finger.


SUMMARY OF THE INVENTION

Determining and tracking the velocity of the finger as it moves over the scanner is cumbersome and require additional system complexity to address special cases such as stiction, dropped lines and line culling. Thus, there is a need for a dual line scanner for imaging a fingerprint that does not require velocity to be determined.


Some embodiments of the present disclosure provide a fingerprint scanning and image reconstruction system and method to create fingerprint images without relying on velocity. The system can include a fingerprint scanner providing a first scan line and a second scan line separated by a line separation distance in a scanning direction. The system can include an image reconstruction module receiving and accumulating scan lines including at least the first scan line and the second scan line over a time period t. The image reconstruction module determines a reconstructed image resolution in the scanning direction based at least in part on [line separation distance divided by line count(t)] multiplied by decimation(t), where line count(t) is the number of lines accumulated as a function of the time period t, and decimation(t) is a ratio indicative of whether the line count(t) is greater than or less than the number of lines accumulated as a function of the time period t that will result in a selected reconstructed image resolution in the scanning direction.


INCORPORATION BY REFERENCE

All publications, patents, and patent applications mentioned in this specification are herein incorporated by reference to the same extent as if each individual publication, patent, or patent application was specifically and individually indicated to be incorporated by reference.





BRIEF DESCRIPTION OF THE DRAWINGS

The novel features of the invention are set forth with particularity in the appended claims. A better understanding of the features and advantages of the present invention will be obtained by reference to the following detailed description that sets forth illustrative embodiments, in which the principles of the invention are utilized, and the accompanying drawings of which:



FIG. 1 is a schematic block diagram of a basic configuration for a fingerprint scanning and image reconstruction system according to embodiments of the present disclosure.



FIG. 2 is a schematic view, partly in block diagram form, of a dual line fingerprint scanner according to one embodiment of the present disclosure.



FIG. 3 is a flow diagram for an image reconstruction process according to one embodiment of the present disclosure.





DETAILED DESCRIPTION OF THE INVENTION

Before any embodiments of the invention are explained in detail, it is to be understood that the present disclosure is not limited in its application to the details of construction and the arrangement of components set forth in the following description or illustrated in the described drawings. The present disclosure is capable of other embodiments and of being practiced or of being carried out in various ways. Also, it is to be understood that the phraseology and terminology used in this application is for the purpose of description and should not be regarded as limiting. The use of “including,” “comprising,” or “having” is meant to encompass the items listed thereafter and equivalents, as well as additional items. Unless specified or limited otherwise, the terms used are intended to cover variations ordinarily known, now or in the future. Further, “connected” and “coupled” are not restricted to physical or mechanical connections or couplings and can include both physical and electrical, magnetic, and capacitive couplings and connections.


The following discussion is presented to enable a person skilled in the art to make and use embodiments of the present disclosure. The following detailed description is to be read with reference to the figures, in which like elements in different figures have like reference numerals. The figures depict selected embodiments and are not intended to limit the scope of embodiments of the present disclosure.



FIG. 1 schematically illustrates a fingerprint scanning and image reconstruction system 200 according to embodiments of the present disclosure. The fingerprint scanning and image reconstruction system 200 includes a sensor 202 and an image reconstruction module 204. The image reconstruction module 204 can be connected to or integrated with a host computing device 206 (as shown in FIG. 2) and can receive inputs from the sensor 202. The host computing device 206 can be connected to a database 210. In some embodiments, the sensor 202 can also include a culling module 205 to reduce the amount of data transmitted over the bandwidth of the communication links, whether wired or wireless, between the sensor 202, the image reconstruction module 204, and the host computing device 206. Culling is a technique for keeping line scans with very little variation from one clock time to the next clock time from being sent to the image reconstruction module 204 and/or the host computing device 206. If there is no change from one clock time to the next clock time, the finger is not moving with respect to the sensor 202. It is well understood in the art that such essentially redundant scan lines are not useful in image reconstruction. Note that the image reconstruction system 200 may be implemented across multiple discrete devices or on a single piece of silicon.



FIG. 2 schematically illustrates a dual line fingerprint scanner 220 according to one embodiment of the present disclosure. The dual line scanner 220 includes a primary linear scanner segment 230 and a secondary linear scanner segment 250. The primary linear scanner segment 230 can be a 1×n linear pixel array, where n is typically 128-200 pixel scan points (for illustrative purposes, only 12 pixel scan points 232 are shown in FIG. 2). The secondary linear scanner segment 250 can be a 1×n linear pixel array, where n is about half of the number of pixels in the primary linear scanner segment 230 (e.g., about 64-100 pixel scan points 252, but with only 6 pixel scan points 252 being shown in FIG. 2). The secondary linear segment 250 need not be centered with respect to the primary segment 230, but in fact may span any physical subset of the primary segment 230.


Drive signals are supplied to each pixel scan point 232, 252 through leads 234, 254 across from reference voltage plates 236, 256 using a multiplexer 270, connected to the leads 234, 254 through contacts 262. The responses to the drive signals are influenced by capacitive couplings between the leads 234, 254 and the voltage plates 236, 256 at the pixel scan points 232, 252 as sensed by sensors 272. The capacitive couplings are influenced by whether the portion of the fingerprint being scanned at the pixel scan points 232, 252 is a ridge or a valley of the fingerprint. The output of each pixel scan point 232, 252 is a gray scale value from zero to 255. This is a convenient byte size data value range that is exemplary only and can be other values of gray scale granularity, such as using 4 bits instead of 8 bits per pixel. Typically, the gray scale value of zero is white and the gray scale value of 255 is black, with intervening incremental shades of gray between these values. The image reconstruction module 204 can perform image reconstruction using these scan lines and the gray scale values to reconstruct the fingerprint with dark indicating ridges and light indicating valleys.


The goal of image reconstruction with a single line scanner or the dual line scanner 220 is to create a fingerprint image with fixed resolution in the y direction. The value of n in the primary linear scanner segment 230 (e.g., n=128) determines the resolution in the x direction. With currently existing systems having 128-200 pixels in the x direction, the leads 234, 254 are typically 25 μm in width with spaces 238, 258 between the leads 234, 254 being 25 μm. Therefore, x-resolution, determined by the distance between the centers of leads 234, is 50 um typically (which gives us 508 dpi). This distance “R” is shown in FIG. 2 for both the primary linear scanner section 230 and the secondary liner scanner section 250. For illustration purposes, +y is chosen to be in the direction the finger moves across the secondary linear scan segment 250 first and then over the primary linear scan segment 230, i.e., SP as shown in FIG. 2, and −y is chosen to be in the direction the finger moves over the primary linear scan segment 230 first and then over the secondary linear scan segment 250, i.e., PS (up as shown in the arrangement of FIG. 2). Typically y-resolution is chosen to equal x-resolution, but y-resolution may be chosen arbitrarily depending on other system attributes.


For illustration purposes, the y resolution in a reconstructed image can be measured in unit distance/row (e.g., μm/row=μm/sample). In other words, at the given clock speed for the pixels 232, 252, a row is substantially equivalent to a sample taken at each sample time, dictated by the clocking of the sampling scanners (i.e., the pixel scan points 232, 252 in each of the primary linear scanner segment 230 and the secondary linear scanner segment 250). Alternatively, this could be expressed in a more familiar row/unit distance desired in the recreated image to obtain a desired dots per inch (dpi) image resolution in the y direction (e.g., 508 rows/inch=508 samples/inch for a 508 dpi resolution, which corresponds to a scan line separation of 50 μm per sample). Assuming a separation of the primary linear scanner segment 230 from the secondary linear scanner segment 250 of eight rows, this is equal to a 400 μm separation between the scanned image line from the primary linear scanner segment 230 to the secondary linear scanner segment 250 for each sample time.


The mathematical equation for a single or dual line sensor without line culling is the following equation (i):

Image Y-resolution=[Velocity(t)*Decimation(t)]/SensorSampleRate  (i)

where time period t is the time it takes for the finger to move from the secondary to the primary (or vice versa), Velocity(t) is the finger velocity during time period t with respect to the primary and secondary linear scanner segments 230, 250; SensorSampleRate is the sensor's fixed scan line rate (i.e., sample timing); and Decimation(t) is the decimation or interpolation ratio required to obtain the desired y-resolution during time period t; it is unitless. A decimation value of 1 means no decimation or interpolation occurs in the image reconstruction (i.e., the object being scanned uniformly passed the primary and secondary linear scanner segments 230, 250 at exactly the velocity needed to obtain the desired y resolution for the desired dpi. A value of greater than 1 implies some scan lines are not used in the reconstructed image (i.e., decimation needs to be done). A value of less than 1 implies some scan lines are added to the reconstructed image (i.e., interpolation needs to be done). In this equation the reconstruction algorithm needs first to estimate the finger velocity over each time period t, after which the decimation rate may then be calculated using the above equation in order to properly resample the scan lines into a fixed-resolution reconstructed image.


Since the sample rate is constant, once velocity is calculated using the dual scan lines, the decimation ratio is trivial to compute. Resolution is in μm/row, velocity is in μm/sec, and sample rate is in rows/sec. Velocity divided by sample rate is in μm/row, since the decimation ratio is unitless. Therefore, the image reconstruction unit 204 simply needs to calculate the correct Decimation(t) and resample the scan line data it receives (i.e., perform decimation or perform interpolation as needed, or perform neither).


With the first equation (i), it can be seen that as the fingerprint being scanned moves more quickly, the decimation ratio must change in an inversely proportional way to velocity to result in a constant output resolution. This is what is used in conventional single and dual line scanners for image reconstruction to determine what is known as “required resampling.” However, with line culling, the effective sample rate is a variable (i.e., dependent on time as well). Therefore, the governing second equation (ii) is as follows:

Image Y-resolution=[Velocity(t)*Decimation(t)]/EffectiveSampleRate(t)  (ii)


As the finger velocity changes, the nature of culling is that it is likely to change in a proportional way. For example, as velocity goes down, the effective sample rate also goes down because fewer lines are sent. Stiction, where the finger moves very slowly or stops moving, is an extreme example of this. During stiction, the decimation factor still may change with time (because culling is not perfect), but it is also no longer guaranteed to be inversely proportional to velocity. With conventional image reconstruction methods, it is necessary to modify the timestamps attached to each scan during stiction to remove the long delay between received scan lines due to culling, which allows the proper resampling to occur.


According to embodiments of the present disclosure, resampling is not required if the correct equations are used. As an extreme example, the finger is moving at the natural rate of the sensor, namely 50 μm/sec (i.e., 1 row per sample speed Δt interval), and for simplicity the sensor's sampling rate is 1 row/sec (i.e., one sample every 50 μm). In such a case, the decimation rate is always 1 and the image reconstruction module 204 does not need to perform any resampling (decimation or interpolation).


In another extreme example, consider the finger stopping due to stiction for 1 hour during which time culling correctly does not send any lines to the image reconstruction module 204. In this example, the finger then immediately resumes at the original 50 μm/sec velocity. During the stiction, due to the long delay in movement, the velocity calculation will effectively be zero. Using the first equation (i), one may choose to decimate greatly, which is incorrect. In fact, the correct answer is to do nothing but stack the received scan lines. If the second equation (ii) were being used, the decline in velocity would be offset by the decline in effective sample rate, and the decimation would have remained constant at 1.


According to embodiments of the present disclosure, there is a more effective way to address these issues with image reconstruction as it is currently implemented. Even if using what currently may be determined to be the correct equation, a velocity calculation still appears to be required. However, embodiments of the present disclosure use image reconstruction equations that do not require a velocity calculation. The following is the second equation (ii):

Image Y-resolution=[Velocity(t)*Decimation(t)]/EffectiveSampleRate(t)  (ii)


The second equation (ii) can be refactored as follows into equation (iii):

Image Y-resolution=[Velocity(t)/EffectiveSampleRate(t)]*Decimation(t)  (iii)


The secondary linear scanner segment 250 of the dual line scanner 220 has been used solely to determine velocity, which is why equations (i), (ii), and (iii) also apply to a single line scanner that has some alternate way of calculating instantaneous velocity. When a row previously seen on the secondary linear scanner segment 250 reaches the primary linear scanner segment 230 (i.e., the finger is sweeping across the secondary linear scanner segment 250 first), the velocity calculation is performed as follows according to equation (iv):

Velocity(t)=LineSeparation/ElapsedTime(t)  (iv)


where LineSeparation is for example 400 μm (i.e., 8 rows) and ElapsedTime(t) is the amount of time it took for the finger to move from the secondary linear scanner segment 250 to the primary linear scanner segment 230 (or vice versa). This relationship would be inversely proportional if the velocity is high enough such that the sensor 202 is undersampled, in which case no culling should occur and EffectiveSampleRate(t) can safely be replaced by SensorSamplingRate. While ElapsedTime(t) may actually be calculated using sensor timestamps, which are really line counts, and multiplying by some fixed SensorSamplingRate, it does not cancel out the EffectiveSampleRate(t) factor in the denominator.


Inserting equation (iv) into the second equation (ii) gives the following equation (v):

Image Y-resolution=[LineSeparation/{ElapsedTime(t)*EffectiveSampleRate(t)}]*Decimation(t)  (v)


However, it can be seen that EffectiveSampleRate(t) is actually the number of rows received by the image reconstruction module 204 divided by the time it took to move from the secondary linear scanner segment 250 to the primary linear scanner segment 230, which equals the ElapsedTime. Thus, ElapsedTime(t)*EffectiveSampleRate(t) is simply the number of rows received by the image reconstruction module 204 in that time. Therefore, the new image reconstruction equation (vi) is as follows:













Image





Y


-


resolution

=




[

LineSeparation
/

LineCount


(
t
)



]

*












Decimation


(
t
)







or

,
reorganized
,

Decimation


(
t
)









=




(


Image





Y

-

resolution
*
Line





Count






(
t
)



)

/










Line





Separation








(
vi
)







As can be seen, there is no velocity calculation in the new image reconstruction equation (vi). If 8 rows were received by the image reconstruction module 204 in the time it took to move from the secondary linear scanner segment 250 to the primary linear scanner segment 230, and the line separation between the two is 8 rows, the decimation ratio is 1 and no re-sampling needs to be done for image reconstruction. If 16 lines are received, the decimation factor=2 and half of the received lines will be thrown away (i.e., decimated) in order to maintain a constant 508 dpi resolution. If only 4 lines are received, the image reconstruction module 204 must interpolate (i.e., add in) another 4 lines to maintain the required 508 dpi resolution. Using the above equation only decimation rate needs to be calculated; velocity is not needed as it has been substituted by the line count, which is trivial to obtain.


Revisiting the extreme example of the finger stopping for 1 hour in the middle of a swipe due to stiction (the same applies for lesser amounts of stiction, but the extreme amount is illustrative of the effects), no matter how long it takes, the image reconstruction module 204 will receive 8 lines. Due to the assumption that the finger when it is actually moving, moves at 50 μm/sec, the image reconstruction module 204 will receive 8 scan lines from the sensor 202 (again assuming perfect culling). Therefore, the line count is 8 rows, the line separation is 400 μm, and the decimation is 1, in order to maintain 50 μm/row.


According to embodiments of the present disclosure, an improved version of image reconstruction can use the new image reconstruction equation (vi) to perform resampling to match the actual number of scanned lines to the desired number of scanned lines and it will not be necessary to compute instantaneous velocity. Therefore, the improved way of performing image reconstruction is very different from the prior art, which clearly requires the use of velocity for image reconstruction. The software used to implement equation (vi) is more simple and the computing requirements are reduced. Stiction will not need to be accounted for and the use of timestamp modifications is rendered unnecessary. Improved fidelity of the reconstructed image may also prove to be a result in some cases.



FIG. 3 illustrates an object imaging process according to embodiments of the present disclosure. The sensor 202 can be used (at 302) to scan the primary and secondary scan lines. The image reconstruction module 204 can accumulate (at 304) the scan lines. The image reconstruction module 204 can then determine (at 306) the y-axis resolution from equation (vi), i.e., [line separation/line count (t)]*decimation (t). The image reconstruction unit 204 can then reconstruct (at 308) the image.


Embodiments of the present disclosure can be used to scan objects other than fingers and to create images of such objects other than fingerprint images. The present disclosure can be used to scan other biometric data, such as the palm of a hand or a retina. The present disclosure can also be used to scan virtually any type of object by a swipe scan without having to calculate the velocity of the object as it moves across the swipe scanner.


The present disclosure is described with reference to block diagrams and operational illustrations of methods and devices implementing methods (collectively “block diagrams”). Each block of the block diagram, and combinations of blocks in the block diagram, can be implemented with analog or digital hardware and/or computer program instructions, such as in a computing device. The computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, microcontroller, ASIC, or any other programmable data processing apparatus, so that the instructions implement the functions/acts specified in the block diagram when executed via the computing device. The functions/acts noted in the blocks can occur out of the order noted in the block diagram. For example, two blocks shown in succession can in fact be executed substantially concurrently or the blocks can sometimes be executed in the reverse order, depending upon the functionality/acts involved. In addition, different blocks may be implemented by different computing devices, such as an array of processors within computing devices operating in series or parallel arrangement, and exchanging data and/or sharing common data storage media.


The term “computer readable medium” as used herein and in the claims generally means a non-transitory medium that stores computer programs and/or data in computing device machine-readable form. Computer readable medium can include computer storage media and communication media. Computer storage media can include volatile and non-volatile, removable and non-removable media implemented with any suitable method or technology for the storage of information, such as computer-readable instructions, data structures, program modules, or specific applications.


The term “module” as used herein and in the claims generally means a software, hardware, and/or firmware system, process and/or functionality that can perform or facilitate the processes, features, and/or functions of the present disclosure, with or without human interaction or augmentation. A module can include sub-modules. Software components of a module can be stored on a non-transitory computing device readable medium. Modules can be integral to one or more servers or can be loaded and executed by one or more servers. One or more modules can be grouped into an engine or an application.


While preferred embodiments of the present invention have been shown and described herein, it will be obvious to those skilled in the art that such embodiments are provided by way of example only. Numerous variations, changes, and substitutions will now occur to those skilled in the art without departing from the invention. It should be understood that various alternatives to the embodiments of the invention described herein may be employed in practicing the invention. It is intended that the following claims define the scope of the invention and that methods and structures within the scope of these claims and their equivalents be covered thereby.

Claims
  • 1. A fingerprint scanning and image reconstruction system comprising: a fingerprint scanner providing a first scan line and a second scan line separated by a line separation distance in a scanning direction; andan image reconstruction module in communication with the fingerprint scanner, the image reconstruction module receiving scan lines including at least the first scan line and the second scan line, the image reconstruction module accumulating scan lines over a time period t;the image reconstruction module determining a value for decimation (t) necessary to produce a selected y axis resolution in the scanning direction based at least in part on (line count(t) divided by line separation distance) times the selected y resolution, where line count(t) is the number of lines accumulated as a function of the time period t, anddecimation(t) is a ratio indicative of whether the line count(t) is greater than or less than the number of lines accumulated as a function of the time period t that will result in the selected reconstructed image y resolution in the scanning direction.
  • 2. The system of claim 1 wherein the image reconstruction module is adapted to remove scan lines from a reconstructed image when the decimation(t) ratio is greater than 1 and to add interpolated scan lines to the reconstructed image when the decimation(t) ratio is less than 1.
  • 3. The system of claim 1 wherein the first scan line and second scan line each include a plurality of pixel scan points from a linear scanner array.
  • 4. The system of claim 1 wherein the fingerprint scanner is a dual line scanner.
  • 5. The system of claim 4 wherein the dual line scanner includes a primary linear scanner segment and a secondary linear scanner segment.
  • 6. The system of claim 1 and further comprising a sensor in communication with the fingerprint scanner and the image reconstruction module.
  • 7. The system of claim 6 wherein the sensor includes a culling module to eliminate redundant scan lines.
  • 8. A method of scanning a fingerprint of a finger moving in a scanning direction and reconstructing a fingerprint image, the method comprising: scanning a first scan line and a second scan line separated by a line separation distance in the scanning direction;accumulating scan lines including at least the first scan line and the second scan line over a time period t;determining a value for decimation(t) necessary to produce a selected y axis resolution in the scanning direction based at least in part on (line count(t) divided by line separation distance) times the selected y resolution,where line count(t) is the number of lines accumulated as a function of the time period t, anddecimation(t) is a ratio indicative of whether the line count(t) is greater than or less than the number of lines accumulated as a function of the time period t that will result in the selected reconstructed image y resolution in the scanning direction.
  • 9. The method of claim 8 and further comprising removing scan lines from a reconstructed image when the decimation ratio is greater than 1 and adding interpolated scan lines to the reconstructed image when the decimation ratio is less than 1.
  • 10. The method of claim 8 and further comprising obtaining the first scan line and second scan line with a plurality of pixel scan points from a respective first linear scanner array and second linear scanner array.
  • 11. A non-transitory computer-readable storage medium for tangibly storing thereon computer readable instructions for a method of creating an image of a finger moving in a scanning direction, the method comprising: receiving a first scan line and a second scan line separated by a line separation distance in the scanning direction;accumulating scan lines including at least the first scan line and the second scan line over a time period t;determining a value for decimation(t) necessary to produce a selected y axis resolution in the scanning direction based at least in part on (line count(t)/line separation distance)* the selected y resolution,where line count(t) is the number of lines accumulated as a function of the time period t, anddecimation(t) is a ratio indicative of whether the line count(t) is greater than or less than the number of lines accumulated as a function of the time period t that will result in the selected reconstructed image y resolution in the scanning direction.
  • 12. The method of claim 11 and further comprising removing scan lines from a reconstructed image when the decimation ratio is greater than 1 and adding interpolated scan lines to the reconstructed image when the decimation ratio is less than 1.
  • 13. The method of claim 11 and further comprising obtaining the first scan line and second scan line with a plurality of pixel scan points from a linear scanner array.
  • 14. A method of scanning an object of and reconstructing an image, the method comprising: scanning a first scan line and a second scan line separated by a line separation distance in the scanning direction;accumulating scan lines including at least the first scan line and the second scan line over a time period t;determining a reconstructed image resolution in the scanning direction based at least in part on [line separation distance divided by line count(t)] multiplied by decimation(t), where line count(t) is a number of lines accumulated as a function of the time period t, anddecimation(t) is a ratio indicative of whether the line count(t) is greater than or less than the number of lines as a function of the time period t that will result in the selected reconstructed image resolution in the scanning direction.
  • 15. The method of claim 14 wherein the object is at least one of a fingerprint, a hand, and a retina.
  • 16. The method of claim 14 and further comprising removing scan lines from a reconstructed image when the decimation ratio is greater than 1 and adding interpolated scan lines to the reconstructed image when the decimation ratio is less than 1.
  • 17. The method of claim 14 and further comprising obtaining the first scan line and second scan line with a plurality of pixel scan points from a linear scanner array.
US Referenced Citations (456)
Number Name Date Kind
3593319 Barber Jul 1971 A
4151512 Rigannati et al. Apr 1979 A
4225850 Chang et al. Sep 1980 A
4310827 Asai 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 Schrenk 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 Hara 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 Duton 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 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
20010026636 Mainget Oct 2001 A1
20010030644 Allport Oct 2001 A1
20010036299 Senior Nov 2001 A1
20010043728 Kramer et al. Nov 2001 A1
20020025062 Black Feb 2002 A1
20030014530 Iihma Feb 2002 A1
20020061125 Fujii May 2002 A1
20020064892 Lepert et al. May 2002 A1
20020067845 Griffis Jun 2002 A1
20020073046 David 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 Fujii 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 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 Ishii 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
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 Funushige et al. Aug 2006 A1
20060181521 Perreault 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
20100117794 Adams et al. May 2010 A1
20100119124 Satyan May 2010 A1
20100123675 Ippel 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 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 (79)
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
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 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
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 CSAILl 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).
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.
Gassend, et al., “Controlled Physical Random Functions”, In Proceedings of the 18th Annual Computer Security Conference, Las Vegas, Nevada, Dec. 12, 2002.
bellagiodesigns.com (Internet Archive Wayback Machine, www.bellagiodesigns.com date: Oct. 29, 2005).
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.
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
20120189172 A1 Jul 2012 US