US 8,630,464 B2Grant

Adaptive iris matching using database indexing

Issue Date:2014-01-14

•18 Claims

•5 Drawing Sheets

Abstract

An adaptive iris matching approach for processing images of irises having a quality not sufficient for conventional non-adaptive matching approaches. Visible regions in a radial direction on an iris, without segmenting a circumferential of the iris, may be processed. A boundary of the visible region of the iris may be estimated. An iris map may be constructed with the non-visible portion of the iris masked. The iris map may be at least partially encoded. Partial codes of the iris map may be extracted to index at least portions of a database containing iris information. Irises may be retrieved from the database with an iris code as a query.

Metadata

Assignee

Honeywell International Inc.

Inventors

Rand Whillock
Rida Hamza
Isaac Cohen

Application Information

Application Number:US 12/814,272

Filing Date:2010-06-11

Priority Date:2009-06-15

Art Unit:2665

Classifications

IPC:

G06K9/00G06K9/46G06K9/62

Patent Drawings (5 sheets)

Description

[0001] This application claims the benefit of U.S. Provisional Patent Application No. 61/268,678, filed Jun. 15, 2009, and entitled “Adaptive Iris Matching Using Database Indexing”. U.S. Provisional Patent Application No. 61/268,678, filed Jun. 15, 2009, is hereby incorporated by reference.

Background

[0002] The present invention pertains to recognition systems and particularly to biometric recognition systems; in particular the invention pertains to iris recognition systems.

Summary

[0003] The invention is an adaptive iris matching approach for processing images of irises having a quality not sufficient for conventional non-adaptive matching approaches. Visible regions in a radial direction on an iris, without segmenting a circumferential of the iris, may be processed. A boundary of a visible region of the iris may be estimated. An iris map may be constructed with the non-visible portion of the iris masked. The iris map may be partially encoded. Partial codes of the iris map may be extracted to index at least portions of a database containing iris information. Irises may be retrieved from the database with an iris code as a query.

Brief Description of the Drawing

[0004] FIG. 1a is a diagram of an iris showing various delineated boundaries;

[0005] FIG. 1b is a diagram of a blurred iris image;

[0006] FIG. 1c is a diagram of a gazed eye;

[0007] FIG. 2a is a diagram of polar segmentation of an iris in an image;

[0008] FIG. 2b is a diagram of processing blocks for an adaptive iris matching approach;

[0009] FIG. 2c is a diagram of adaptive matching;

[0010] FIG. 3a is a diagram of polar segmentation used to estimate a pupil bound;

[0011] FIG. 3b is a diagram of model fitting using a pupil warp function to obtain a symmetric pupil shape and outside iris boundary;

[0012] FIG. 3c is a diagram of an inverse projection or transform as applied to iris, pupil and eyelid boundaries; and

[0013] FIG. 4 is a diagram of an operation of an iris image processing approach.

Description

[0014] While much progress has been made toward recognition through iris analysis under small variations in pose and lighting, reliable techniques for recognition under more extreme non-cooperative environments appear to have proven elusive. Iris recognition signatures may perform well when the data acquisition parameters are relatively constrained and the acquired data quality is moderately high. However, when the data acquisition and quality constraints are relaxed, the match performance of iris recognition may suffer a considerable decline.

[0015] This may be due in part to the variability of the resulting non-ideal iris relative to the constrained signature, and the likelihood that there is insufficient iris exposure to adequately normalize—a procedure required by virtually all existing iris algorithms. Apart from estimating these irregularities, the segmentation routine should also detect reflections due to ambient light sources and occlusions due to eyelashes and eyelids. The challenges of processing such irises may mount mostly in the segmentation process or a loss of iris information due to gazing or heavy obscurations.

[0016] One may introduce an adaptive solution based on partial segmentation and database indexing. A key aspect of the present approach may be that it does not necessarily require the usual upfront normalization procedure in order to capture these local variations and thus there is no need to estimate the entire outer border of the iris prior to matching. It is important to note that such a procedure may be crucial to virtually all existing iris recognition techniques.

[0017] One may introduce a technical approach to solve the above challenge by initially parsing through the portion of the iris that is visible, and then adaptively extracting features from the rest of the iris based upon data indexing and model fitting approximation. Present solution may extend the POSE technique (see e.g., U.S. patent application Ser. No. 11/043,366, filed Jan. 26, 2005, and entitled “Iris Recognition System and Method”) having capabilities to adaptively extract features from the iris without the prior need to estimate the actual outer bound of the iris. It is arguable that it may suffice only to capture local sharp variations along the radial directions in the nonobscured areas of the iris. The key aspect of the present approach is that it does not require a normalization procedure in order to capture these local sharp variations. It is important to note that such a procedure may be crucial to virtually all existing iris recognition techniques. One may introduce an approach of an iris recognition technique that does not necessarily require normalization of the iris map.

[0018] The approach is based on the fact that local details of the iris are spread along the radial directions and thus virtually any visible iris region may be independently processed on the radial direction without estimating the circumferential of the iris.

[0019] The merit of the present approach is that it may allow users to enroll or match poor quality iris images that would be rejected by other states of the art technology. In addition, this approach may generate a list of possible matches instead of only the best match when the iris-print is too obscured to be a reliable matcher. Another merit of the present approach is that it may allow the iris recognition system to be more tolerable of noise and could potentially improve the matching process computational efficiency. The database may be easily indexed using a skin-print or eye-print to fewer manageable subsets of individuals.

[0020] One may solve the problem in three processing steps. 1) One may first segment only the visible region. Most of the fitting models may provide a reasonable estimate of the border segment to a first order estimation. 2) One then may extract the associated partial codes of the iris barcode to index a smaller population in a large population. 3) One then may recover the noisy information in the obscured area by adapting the appropriate fitting model that provides the best matching bits within the limited subset retrieved in step 1). The last processing step may be beneficial to denoise to some extent the obscured area as long as the iris information is not lost due to heavy gazing or obscurations.

[0021] In step 3, alternatively, one may capture the iris dyadic variations by formulating a dynamic encoder that takes into account the varying edge points. Due to the dyadic nature of wavelet functions, one may modify the encoding scheme to make use of a dynamic wavelet function that varies as a function of the angular variable. Unlike the standard wavelet transform, the wavelength scalar is not necessarily a constant but rather may be a smooth continuous function as a function of the angle variable. The output of the wavelet filter may thus be evaluated at each angle using virtually all possible values for the best match. The concatenated matched bits may determine the overall match score between a probe and query barcode.

[0022] The initialization step for the adaptive iris model may be based on the perspective projection of an ideal frontal pupil image (i.e., circular shape) into the actual image plane. Since the pupil edges are visible and easy to estimate, one may compute the warping projection function. One may use the inverse transform of the projection on both the pupil and iris edges to estimate the iris boundaries.

[0023] One may introduce a technical approach to solve the above problem by initially parsing through a portion of the iris that is visible, and then adaptively extracting features from the rest of the iris based upon data indexing and model fitting approximation. The solution may extend the POSE technique capabilities to adaptively extract features from the iris without the prior need to estimate the actual outer bound of the iris. Arguably, it may suffice only to capture local sharp variations along the radial directions in the non-obscured areas of the iris. A key aspect of the present approach is that it does not necessarily require a normalization procedure in order to capture the local sharp variations. It is important to note that such a procedure is crucial to virtually all existing iris recognition techniques. To one's best knowledge, one may introduce the first approach of an iris recognition technique that does not require normalization of the iris map.

[0024] A merit of the present approach is that it may allow users to enroll or match poor quality iris images that would be rejected by the current state of the art technology. In addition, this approach may generate a list of possible matches instead of only the best match when iris-print is too obscured to be a reliable matcher. Another merit of the present approach is that it may allow the iris recognition system to be more tolerable of noise and could potentially improve the matching process computational efficiency. The database may be easily indexed using skin-print or eye-print to fewer manageable subsets of individuals.

[0025] The original foundation of the iris technology and algorithms do not appear to address issues such as side looking eyes, self occlusion, non-frontal face images, and so forth. Recognition of this situation has led to solutions to address the real-time operational requirements of a standoff iris recognition system. The present approach is an efficient and robust one-dimensional (1D) fast segmentation approach built around the present approach for the Polar Segmentation (POSE) system (see e.g., U.S. patent application Ser. No. 11/043,366, filed Jan. 26, 2005, and entitled “Iris Recognition System and Method”).

[0026] There may be great promise for iris technology with a false reject rate between 0.01-0.03 at a false acceptance rate of 10-3. The false non-matching rate (FNMR) versus false matching rate (FMR) may be better even on larger datasets. The uniqueness and richness of iris patterns when deployed to match billions of subjects may be a requirement that should be met to deploy the technology for things such as border control and the global war on terror.

[0027] A challenge to solve may be presented. Current iris recognition solutions do not necessarily reflect the full potential of the technology. Iris recognition signatures may perform well when the data acquisition parameters are relatively constrained and the acquired data quality is moderately high. However, when the data acquisition and quality constraints are relaxed, the match performance of iris recognition may suffer considerably. Very few developed techniques appear to address the true nature of iris irregularity in iris segmentation. This may be due in part to the variability of the iris-print in unconstrained scenarios and less than optimal acquisition conditions, as illustrated by the examples shown in FIGS. 1a, 1b and 1c. Apart from estimating these irregularities, the segmentation routine may also detect reflections due to ambient light sources and occlusions due to eyelashes and eyelids. The difficulties of processing such irises may reside mostly in the segmentation process, loss of spatial frequency content (e.g., blur side effect), or loss of iris information due to gazing or heavy obscurations.

[0028] As shown in FIGS. 1a, 1b and 1c, the pupil edges and the eyelids (highlighted at items 11 and 12) may be estimated. The iris borders, on the other hand, may yield multiple fitting models 1, 2 and 3, as noted with numerals 13, 14 and 15, respectively. The uncertainty in the iris segmentation may result in assigning bit codes to the wrong iris pixels during feature extraction, and therefore drastically affecting the matching outcome. Similarly, the blurry low-quality image 16 in FIG. 1b appears to have no high spatial frequency content of the actual iris pattern. The strong gazed eye 17 in FIG. 1c appears to have led to a compression of the iris information that cannot be recovered. An image acceptable to current commercial iris technology may generally require highly constrained conditions such as little to no gaze, high contrast, and rich spatial frequency content. Thus, these illustrative examples may represent a challenge for iris recognition technologies.

[0029] FIGS. 1a, 1b and 1c, from left to right, show examples of challenging cases of iris images: (1a) obscured eye 18 (1b) blurred eye 16 (boxes 19 and 21 indicate areas with key holistic ocular features), (1c) strong gazing 17 (patch(es) 22 indicate discriminating skin textures). No existing iris approach appears to address these types of problems simultaneously, as many seem to rely solely on visible iris-prints and constrained environments.

[0030] The present approach is an iris recognition system implementing image quality metrics as a first step of the process to assess the quality of the acquired eye image for reliable operation, and then apply the appropriate iris processing. Images with high quality may be processed using the POSE technique or virtually any third party reliable iris recognition system.

[0031] If the iris image does meet a subset of quality metrics (e.g., not blur but obscured images), then the eye image may be passed to the adaptive iris matching process described below. If the iris image does not meet a second set of quality metrics and cannot be rehabilitated, then the eye image may be rejected and a new eye image capture be sought by the eye-finder.

[0032] The present technical approach for iris quality measurement is described in U.S. patent application Ser. No. 11/681,614, filed Mar. 2, 2007, and entitled “Iris Recognition System Having Image Quality Metrics”.

[0033] An adaptive iris matching technique (AIM) may be noted. Very few techniques appear to have been developed to address the true nature of iris irregularity in standoff iris segmentation. Apart from estimating these irregularities, the segmentation routine should also detect reflections due to ambient light sources and occlusions due to eyelashes, eyelids and gazing.

[0034] The present approach may be based on the fact that local details of the iris are spread along the radial directions, and thus virtually any visible iris region may be independently processed on the radial direction without segmenting the circumferential of the iris. It may suffice only to capture local variations along the radial directions in the non-obscured areas of the iris for inferring an iris biometrics. A key aspect of the present approach is that it does not necessarily require the usual upfront normalization procedure in order to capture these local variations; thus, there appears no need to estimate the entire outer border of the iris prior to matching. Such a procedure may be crucial to virtually all existing iris recognition techniques, and use the segmentation functionalities available in the POSE system. The present approach is illustrated in FIGS. 2a, 2b and 2c. FIG. 2a is a diagram of POSE segmentation. FIG. 2b shows AIM processing blocks partial encoding 25, database indexing 26 and adaptive coding 27. The blocks effectively show the following: (1) segment only visible iris regions; (2) index to a manageable database; and (3) search for a best matching model using adaptive encoding. FIG. 2c is a diagram of adaptive matching.

[0035] The present approach may solve the issue in three processing steps.

[0036] 1) Partial encoding 25 may be noted. One may first segment only the visible region (e.g., the iris segment highlighted at 23 in FIG. 1a, as delineated by lid borders 12). The fitting model 15 in FIG. 1a may provide a reasonable first order estimation of the border segment. Since one may estimate the iris boundaries for the visible iris segment 23, one can construct the iris map using a “rubber sheet” model while masking the rest of the iris. One may then proceed to encode the phasor information of the extracted iris map using Log-Gabor or Wavelet filters so that comparisons between templates can be made at least partially.

[0037] 2) Database indexing 26 may be noted. One may extract the associated partial codes of the iris barcode to index a smaller population in the large database. Verification of an iris barcode against large biometrics databases may be daunting, especially when one has only partial code for an iris. To retrieve irises from a large database, one may use the extracted iris code as a query and compute two feature vectors for the iris query (phasor based clustering and angular clustering). Organization of feature data may be completed hierarchically to compare one feature at a time, starting with the extracted feature elements that are closest to the inner iris boundary and going outward. Current linear database indexing does not necessarily leverage the data structure of the iris barcode. In one approach, one may use the KD-Tree search approach (e.g., see J. L. Bentley, “Multidimensional Binary Search Trees Used for Associative Searching,” Comm. of the ACM, p. 18(9), 1975). Nearly any other alternative search process may be applied to this process step. A primary benefit of the KD-Tree algorithm is that it may enable the use of spatial structure within the data to limit the cost of the search. In one approach, one may use structures from multiple features, and their indexing to increase the efficiency of the search.

[0038] Irises may be retrieved from a large collection of databases using a visible iris barcode as a query and then finding the similarity measure for all the features of the iris codes in the database. A search process may be noted in U.S. patent application Ser. No. 11/681,751, filed Mar. 2, 2007, and entitled “Indexing and Database Search System”.

[0039] 3) Adaptive Encoding 27 may be noted. Appropriate segmentation of the rest of the iris may appear critical to the success of the iris recognition. Since data that is rescaled (e.g., replacing Model 1 (13) with Model 3 (15) in FIG. 1a) iris patterns may corrupt the iris code and the generated template, resulting in poor recognition rates, especially if the visible region is much smaller then the obscured regions. One may linearly adapt the fitting model that provides the best matching bits within the limited subset retrieved in Step 1 (25). The iris pattern deformation due to gazing could generate lateral pressure on some of the tissue that may cause small parts of the iris tissue to fold and change in patterns and some of which might be obscured by the eyelids. The approach may be to adaptively normalize the iris to adjust linearly the rubber sheet iris map to fit fewer identified models, as shown in FIG. 1a, and to align the map to the varying edge points of the model while searching for the minimum possible matching distance. The search may be executed only on the subset of subjects indexed at Step 2 (26) of the process. It is important to note that the map calibration may be applied not necessarily uniformly but rather linearly on the radial direction to fit the varying edge points of the matching model.

[0040] Alternatively, in another approach, in Step 3 (27) one may capture the iris dyadic variations by formulating a wavelet based encoder that takes into account the varying edge points. Due to the dyadic nature of wavelet functions, one may modify the encoding scheme to make use of a dynamic wavelet function that varies as a function of the angular variable,

[0041]

\begin{matrix} W_{α} (R) = {[α (θ)]}^{- 1 / 2} \int sig (r) ψ^{*} (\frac{r - R}{α (θ)}) ⅆ r, & (1) \end{matrix}

where R is the translation parameter and α is the scale parameter. The function ψ(·) may be the mother wavelet. Unlike the standard wavelet transform, the wavelength scale α(θ) may be a smooth continuous function of the angle. The concatenated matched bits may determine the overall match score between a probe and query barcode.

[0042] The initialization step for the adaptive iris model may be based on the perspective projection of an ideal frontal pupil image (i.e., circular shape) into the actual image plane. Since the pupil edges are visible and easy to estimate, one may compute the warping projection function. One may use the inverse transform of the projection on both the pupil and iris edges to estimate the iris boundaries as shown in FIGS. 3a, 3b and 3c. Polar segmentation may be used to estimate a pupil bound 31 in FIG. 3a. FIG. 3b shows a model fitting using pupil warp function to obtain a symmetric pupil shape 32 and outside iris boundary 33. The inverse projection or transform is applied to the iris 34, pupil 35 and eyelid 36 boundaries as shown in FIG. 3c. In the preprocessor approach, the iris signature is directly extracted from the reference warped image. By incorporating the warping projection in the adaptive iris matching algorithm, one may report an improvement of the matching accuracy at fixed equal error rate.

[0043] The following numbered items are information of the present system. 1) A standoff iris recognition system may have an iris image source, a quality processing module connected to the image source, where the quality processing module is for providing a quality assessment of an iris image.

[0044] 2) In the system of item 1, the assessment of an iris image may be provided according to one or more of the following image conditions which include blur, obscuration, standoff angle, iris visibility, and so forth.

[0045] 3) The system of item 2, may further have an evaluator connected to the quality measure, where the evaluator is for receiving a quality assessment of an iris image from the quality processing module, and for indicating whether the iris image is high quality, acceptable (can be processed using adaptive iris matching) or unacceptable for further processing, and the evaluator is for indicating whether an iris image that is unacceptable should be rejected or be rehabilitated for further processing, and the evaluator is for indicating whether an iris image that is acceptable should be processed using the adaptive iris matching process.

[0046] 4) In the system of item 3, further processing may include segmentation of the iris image using adaptive process having partial encoding, database indexing, and adaptive matching.

[0047] 5) The system of item 3, where the system medium that provides instructions of item 4 that, when executed by a machine, may further cause the machine to perform operations including normalizing a number of data points from the iris portion along the visible radial at an angle segment.

[0048] 6) The recognition system that provides instructions of item 5 that, when executed by a machine, may further cause the machine to perform operations to encode the partial visible iris map signature.

[0049] 7) The system of item 1 may have a approach of indexing: providing a database of templates; grouping the database into a plurality of sub-databases, where: each template in the database has a first number of bits (based on angular indexing), each sub-database of the plurality of sub-databases represents virtually all templates in the database, and each template in a sub-database has a second number of bits (hierarchical structure item, e.g., KD Tree approach).

[0050] 8) The system of item 7 may further have providing a subset of possible template barcodes for matching, and selecting a second number of bits of a barcode that corresponds to the second number of bits of identified templates.

[0051] 9) In the system of item 8, providing instructions of item 6 that, when executed by a machine, may further cause the machine to perform operations having normalizing a number of data points from the obscured iris portion to match one of the identified templates (Adaptive Encoding item: The best matching bits within the limited subset retrieved by the database indexing).

[0052] 10) The recognition system that provides instructions of item 9 that, when executed by a machine, may further cause the machine to perform operations to encode the partial obscured iris map signature. (I.e., it may adaptively normalize the iris to adjust linearly the rubber sheet iris map to fit fewer identified models.)

[0053] 11) The system of item 1 that provides instructions of item 10 that, when executed by a machine, may further cause the machine to perform operations having comparing the iris barcodes to a previously generated reference iris signature, indicated by item 8. (It may be an item on aligning the map to the varying edge points of the model while searching for the minimum possible matching distance).

[0054] The present standoff iris recognition approach using adaptive iris matching (AIM) may tackle the challenging case of iris recognition from images where irises are obscured but partially visible. One may provide an approach that may adaptively extract features from the iris without requiring the actual segmentation of the outer bound of the iris. It may suffice only to capture local sharp variations along the radial directions in the non-obscured areas of the iris. An aspect of the present approach may be that it does not require a normalization procedure in order to capture these local sharp variations. Such a procedure may be crucial to iris recognition techniques. One may introduce an approach of an iris recognition technique that does not require normalization of the iris map.

[0055] FIG. 4 is a diagram of an operation of the present approach. A quality evaluation at symbol 42 may be made of an iris image from an iris image acquisition module at symbol 41. If the quality of the image is deemed to be “high” (by reaching a predefined iris quality measure adequate for an iris to be processed using iris signature), the image may be processed using a non-adaptive iris matching approach at symbol 43. Such an approach may be POSE noted herein, or some commercial approach. If the quality of image is deemed to be “low” (does not reach a predefined iris quality level that allows recognition of an identity using iris signature), a second quality evaluation of the image may be made at symbol 44. A result of the second evaluation may be “acceptable low”, such as there is enough percentage of the iris region visible that can be processed, which indicates that the image may be processed by the present adaptive iris matching approach 58 starting at symbol 45. This image quality would not be acceptable to the non-adaptive iris matching approach at symbol 43. An alternative result of the second evaluation at symbol 44 may be “very low”. Here, the image may be rehabilitated at symbol 46. Because of something like a glitch or other issue with the image which could be cleared up, a result may be a “rehabilitated acceptable low” which means that the image may go to the adaptive iris matching approach at symbol 45. The result of rehabilitation at symbol 46 could be a “rehabilitated high” which means that the image could go to the non-adaptive iris matching approach at symbol 43. Or the image may be deemed as an “unrehabilitatable very low” which means that the iris image would be rejected at symbol 47.

[0056] At symbol 45, the approach for adaptive iris matching may begin. The following is a summary of the approach for illustrative purposes but could incorporate additional details. There may be a processing of virtually any visible iris region on a radial direction at symbol 48, without segmenting a circumferential of the iris of the image. The iris boundary may be estimated for the visible iris region at symbol 49. An iris map may be constructed using a rubber sheet model at symbol 51. Rest of the iris map may be masked. Phasor information of the iris map may be encoded for at least partial comparisons between templates, as indicated at symbol 52. Associated partial codes of the iris code may be extracted to index a portion of a database at symbol 53. Irises, i.e., images of them, may be retrieved from the database with the iris code as a query and determine a similarity measure for features of iris codes in the database at symbol 54. At symbol 55, the remainder of the iris may be segmented. The iris may be adaptively normalized to linearly adjust the rubber sheet iris map to fit fewer identified models (i.e., narrow the search) at symbol 56. The search may be executed just on the indexed portion of the database at symbol 57.

[0057] Relevant applications may include U.S. patent application Ser. No. 11/675,424, filed Feb. 15, 2007, and entitled “Standoff Iris Recognition System”; U.S. patent application Ser. No. 11/372,854, filed Mar. 10, 2006, and entitled “Invariant Radial Iris Segmentation”; U.S. patent application Ser. No. 11/043,366, filed Jan. 26, 2005, and entitled “Iris Recognition System and Method”; U.S. patent application Ser. No. 11/672,108, filed Feb. 7, 2007, and entitled “Approaches and Apparatus for Eye Detection in a Digital Image”; U.S. patent application Ser. No. 11/681,614, filed Mar. 2, 2007, and entitled “Iris Recognition System Having Image Quality Metrics”; U.S. patent application Ser. No. 11/681,751, filed Mar. 2, 2007, and entitled “Indexing and Database Search System”; U.S. patent application Ser. No. 11/681,662, filed Mar. 2, 2007, and entitled “Expedient Encoding System; U.S. patent application Ser. No. 10/979,129, filed Nov. 3, 2004, entitled “System and Method for Gate Access Control”; U.S. patent application Ser. No. 10/655,124, filed Sep. 5, 2003, and entitled “System and Method for Dynamic Stand-Off Biometric Verification” (issued as U.S. Pat. No. 7,183,895); and U.S. Provisional Patent Application 60/778,770, filed Mar. 3, 2006, and entitled “Stand-Off Iris Detection Tracking and Recognition System”; all of which are hereby incorporated by reference.

[0058] In the present specification, some of the matter may be of a hypothetical or prophetic nature although stated in another manner or tense.

[0059] Although the present system has been described with respect to at least one illustrative example, many variations and modifications will become apparent to those skilled in the art upon reading the specification. It is therefore the intention that the appended claims be interpreted as broadly as possible in view of the prior art to include all such variations and modifications.

Claims

What is claimed is:

1. A standoff iris recognition system comprising:

an iris image acquisition module;

an image quality evaluator connected to the iris image acquisition module; and

an adaptive iris matching module connected to the image quality evaluator and the eye image acquisition module; and

wherein the image quality evaluator determines if an eye image from the iris image acquisition module has a quality which is too low for a non-adaptive iris matching module and is sufficiently high enough for the adaptive iris matching module; and

wherein if the quality is high enough for the adaptive iris matching module, the adaptive iris matching module executes a search and generates a list of possible matches without segmenting a circumferential of an iris of the eye image.

2. The system of claim 1, wherein the non-adaptive iris matching module processes an iris image having sufficient quality so that a best match for the iris image can be generated from a database of iris images.

3. The system of claim 2, wherein the adaptive iris matching module processes an iris image having low but sufficient quality so that a group of most probable matches for the iris image instead of one best match can be generated from a database of iris images.

4. The system of claim 3, wherein the image quality evaluator determines whether an iris image has sufficient quality for successful processing by the non-adaptive iris matching module or not sufficient quality for successful processing by the non-adaptive iris matching module but has sufficient quality for processing by the adaptive iris matching module, or not sufficient quality for processing by the non-adaptive iris matching module or by the adaptive iris matching module.

5. The system of claim 4, wherein:

if an iris image has not sufficient quality for processing by the non-adaptive iris matching module or by the adaptive iris matching module, then the image is rehabilitated, if possible, for processing by the non-adaptive iris matching module or by the adaptive iris matching module; and

if the iris image cannot be rehabilitated, then the iris image is rejected.

6. The system of claim 1, wherein the image quality evaluator determines a quality of an iris image relative to blur, obscuration, standoff angle, and/or iris visibility of the iris image.

7. The system of claim 1, wherein the adaptive iris matching module is for segmenting a visible portion of an iris image, partial encoding, database indexing, and/or adaptive matching relative to the visible portion of the iris image.

8. The system of claim 7, wherein the adaptive iris matching module is further for normalizing data points of an iris portion along a visible radial at an angle segment of an iris image.

9. The system of claim 7, wherein the adaptive iris matching module is further for encoding a partial visible iris map signature of an iris image.

10. The system of claim 7, wherein the database indexing comprises:

providing a database having templates; and

grouping the database into a plurality of sub-databases; and

wherein:

each template in the database has a first number of bits based on angular indexing;

each sub-database of the plurality of sub-databases represents virtually all templates in the database; and/or

each template in a sub-database has a second number of bits based on a hierarchical structure.

11. The system of claim 10, wherein the database indexing further comprises:

providing a subset of template barcodes for possible matching; and/or

selecting a second number of bits of a barcode that corresponds to the second number of bits of each template.

12. The system of claim 11, wherein the adaptive iris matching module is further for normalizing a number of data points from an obscured iris portion of an iris image to match one of the templates.

13. The system of claim 12, wherein the adaptive iris matching module is further for encoding a partial obscured iris map signature.

14. The system of claim 13, wherein the adaptive iris matching module is further for comparing iris barcodes to a previously generated reference iris signature.

15. A method for standoff iris recognition, comprising:

segmenting a visible region of an iris, with a model providing a first order estimate of a border segment;

extracting associated partial codes of a barcode of the iris to index a smaller population of a whole population; and

recovering noisy information in an obscured area by adapting a fitting model that provides best matching bits within the visible region of the iris;

wherein:

iris dyadic variations are captured by formulating a dynamic encoder that takes into account varying edge points; and

an encoding scheme is modified to make use of a dynamic wavelet function wherein a wavelength scalar of the wavelet function varies as a function of an angular variable.

16. The method of claim 15, wherein:

the dynamic wavelet function is a smooth continuous function of the angular variable; and

an output of the dynamic wavelet function is enabled at each angle using virtually all possible values for a best match.

17. The method of claim 16, wherein concatenated matched bits can determine an overall match score between a probe and a query barcode.

18. A method for adaptive iris matching, comprising:

acquiring an image of an iris;

evaluating quality of the image;

processing a visible region of the iris in the image on a radial direction without segmenting a circumferential of the iris in the image, if the quality is too low for non-adaptive iris matching but high enough for adaptive iris matching;

estimating a boundary for the visible region of the iris in the image;

constructing an iris map using a rubber sheet model;

masking a non-visible region of the iris;

encoding the iris map for at least partial comparisons between templates;

extracting associated partial codes of an iris code to index a portion of a database; and

retrieving a list of two or more possible iris matches from the database with the iris code as a query.

Patent Citations (589)

Patent	Date	Inventor	Cited By
US4641349(A)	1987-02-01	Flom et al.	Applicant
US4836670(A)	1989-06-01	Hutchinson	Applicant
US5231674(A)	1993-07-01	Cleveland et al.	Applicant
US5291560(A)	1994-03-01	Daugman	Applicant
US5293427(A)	1994-03-01	Ueno et al.	Applicant
US5359382(A)	1994-10-01	Uenaka	Applicant
US5404013(A)	1995-04-01	Tajima	Applicant
US5543887(A)	1996-08-01	Akashi	Applicant
US5551027(A)	1996-08-01	Choy et al.	Applicant
US5572596(A)	1996-11-01	Wildes et al.	Applicant
US5608472(A)	1997-03-01	Szirth et al.	Applicant
US5664239(A)	1997-09-01	Nakata	Applicant
US5671447(A)	1997-09-01	Tokunaga	Applicant
US5687031(A)	1997-11-01	Ishihara	Applicant
US5717512(A)	1998-02-01	Chmielewski, Jr. et al.	Applicant
US5751836(A)	1998-05-01	Wildes et al.	Applicant
US5859686(A)	1999-01-01	Aboutalib et al.	Applicant
US5860032(A)	1999-01-01	Iwane	Applicant
US5896174(A)	1999-04-01	Nakata	Applicant
US5901238(A)	1999-05-01	Matsushita	Applicant
US5909269(A)	1999-06-01	Isogai et al.	Applicant
US5953440(A)	1999-09-01	Zhang et al.	Applicant
US5956122(A)	1999-09-01	Doster	Applicant
US5978494(A)	1999-11-01	Zhang	Applicant
US5991429(A)	1999-11-01	Coffin et al.	Applicant
US6005704(A)	1999-12-01	Chmielewski, Jr. et al.	Applicant
US6007202(A)	1999-12-01	Apple et al.	Applicant
US6012376(A)	2000-01-01	Hanke et al.	Applicant
US6021210(A)	2000-02-01	Camus et al.	Applicant
US6028949(A)	2000-02-01	McKendall	Applicant
US6055322(A)	2000-04-01	Salganicoff et al.	Applicant
US6064752(A)	2000-05-01	Rozmus et al.	Applicant
US6069967(A)	2000-05-01	Rozmus et al.	Applicant
US6081607(A)	2000-06-01	Mori et al.	Applicant
US6088470(A)	2000-07-01	Camus et al.	Applicant
US6091899(A)	2000-07-01	Konishi et al.	Applicant
US6101477(A)	2000-08-01	Hohle et al.	Applicant
US6104431(A)	2000-08-01	Inoue et al.	Applicant
US6108636(A)	2000-08-01	Yap et al.	Applicant
US6119096(A)	2000-09-01	Mann et al.	Applicant
US6120461(A)	2000-09-01	Smyth	Applicant
US6134339(A)	2000-10-01	Luo	Applicant
US6144754(A)	2000-11-01	Okano et al.	Applicant
US6246751(B1)	2001-06-01	Bergl et al.	Applicant
US6247813(B1)	2001-06-01	Kim et al.	Applicant
US6252977(B1)	2001-06-01	Salganicoff et al.	Applicant
US6259478(B1)	2001-07-01	Hori	Applicant
US6282475(B1)	2001-08-01	Washington	Applicant
US6285505(B1)	2001-09-01	Melville et al.	Applicant
US6285780(B1)	2001-09-01	Yamakita et al.	Applicant
US6289113(B1)	2001-09-01	McHugh et al.	Applicant
US6299306(B1)	2001-10-01	Braithwaite et al.	Applicant
US6308015(B1)	2001-10-01	Matsumoto	Applicant
US6309069(B1)	2001-10-01	Seal et al.	Applicant
US6320610(B1)	2001-11-01	Van Sant et al.	Applicant
US6320612(B1)	2001-11-01	Young	Applicant
US6320973(B2)	2001-11-01	Suzaki et al.	Applicant
US6323761(B1)	2001-11-01	Son	Applicant
US6325765(B1)	2001-12-01	Hay et al.	Applicant
US6330674(B1)	2001-12-01	Angelo et al.	Applicant
US6332193(B1)	2001-12-01	Glass et al.	Applicant
US6344683(B1)	2002-02-01	Kim	Applicant
US6370260(B1)	2002-04-01	Pavlidis et al.	Applicant
US6377699(B1)	2002-04-01	Musgrave et al.	Applicant
US6393136(B1)	2002-05-01	Amir et al.	Applicant
US6400835(B1)	2002-06-01	Lemelson et al.	Applicant
US6424727(B1)	2002-07-01	Musgrave et al.	Applicant
US6424845(B1)	2002-07-01	Emmoft et al.	Applicant
US6433818(B1)	2002-08-01	Steinberg et al.	Applicant
US6438752(B1)	2002-08-01	McClard	Applicant
US6441482(B1)	2002-08-01	Foster	Applicant
US6446045(B1)	2002-09-01	Stone et al.	Applicant
US6483930(B1)	2002-11-01	Musgrave et al.	Applicant
US6484936(B1)	2002-11-01	Nicoll et al.	Applicant
US6490443(B1)	2002-12-01	Freeny, Jr.	Applicant
US6493363(B1)	2002-12-01	Roger et al.	Applicant
US6493669(B1)	2002-12-01	Curry et al.	Applicant
US6494363(B1)	2002-12-01	Roger et al.	Applicant
US6503163(B1)	2003-01-01	Van Sant et al.	Applicant
US6505193(B1)	2003-01-01	Musgrave et al.	Applicant
US6506078(B1)	2003-01-01	Mori et al.	Applicant
US6508397(B1)	2003-01-01	Do	Applicant
US6516078(B1)	2003-02-01	Yang et al.	Applicant
US6516087(B1)	2003-02-01	Camus	Applicant
US6516416(B2)	2003-02-01	Gregg et al.	Applicant
US6522772(B1)	2003-02-01	Morrison et al.	Applicant
US6523165(B2)	2003-02-01	Liu et al.	Applicant
US6526160(B1)	2003-02-01	Ito	Applicant
US6532298(B1)	2003-03-01	Cambier et al.	Applicant
US6540392(B1)	2003-04-01	Braithwaite	Applicant
US6542624(B1)	2003-04-01	Oda	Applicant
US6546121(B1)	2003-04-01	Oda	Applicant
US6553494(B1)	2003-04-01	Glass	Applicant
US6580356(B1)	2003-06-01	Alt et al.	Applicant
US6591001(B1)	2003-07-01	Oda et al.	Applicant
US6591064(B2)	2003-07-01	Higashiyama et al.	Applicant
US6594377(B1)	2003-07-01	Kim et al.	Applicant
US6594399(B1)	2003-07-01	Camus et al.	Applicant
US6598971(B2)	2003-07-01	Cleveland	Applicant
US6600878(B2)	2003-07-01	Pregara	Applicant
US6614919(B1)	2003-09-01	Suzaki et al.	Applicant
US6652099(B2)	2003-11-01	Chae et al.	Applicant
US6674367(B2)	2004-01-01	Sweatte	Applicant
US6687389(B2)	2004-02-01	McCartney et al.	Applicant
US6690997(B2)	2004-02-01	Rivalto	Applicant
US6708176(B2)	2004-03-01	Strunk et al.	Applicant
US6709734(B2)	2004-03-01	Higashi et al.	Applicant
US6711562(B1)	2004-03-01	Ross et al.	Applicant
US6714665(B1)	2004-03-01	Hanna et al.	Applicant
US6718049(B2)	2004-04-01	Pavlidis et al.	Applicant
US6718050(B1)	2004-04-01	Yamamoto	Applicant
US6718665(B2)	2004-04-01	Hess et al.	Applicant
US6732278(B2)	2004-05-01	Baird, III et al.	Applicant
US6734783(B1)	2004-05-01	Anbai	Applicant
US6745520(B2)	2004-06-01	Puskaric et al.	Applicant
US6750435(B2)	2004-06-01	Ford	Applicant
US6751733(B1)	2004-06-01	Nakamura et al.	Applicant
US6753919(B1)	2004-06-01	Daugman	Applicant
US6754640(B2)	2004-06-01	Bozeman	Applicant
US6760467(B1)	2004-07-01	Min et al.	Applicant
US6765470(B2)	2004-07-01	Shinzaki	Applicant
US6766041(B2)	2004-07-01	Golden et al.	Applicant
US6775774(B1)	2004-08-01	Harper	Applicant
US6785406(B1)	2004-08-01	Kamada	Applicant
US6792134(B2)	2004-09-01	Chen et al.	Applicant
US6793134(B2)	2004-09-01	Clark	Applicant
US6819219(B1)	2004-11-01	Bolle et al.	Applicant
US6829370(B1)	2004-12-01	Pavlidis et al.	Applicant
US6832044(B2)	2004-12-01	Doi et al.	Applicant
US6836554(B1)	2004-12-01	Bolle et al.	Applicant
US6837436(B2)	2005-01-01	Swartz et al.	Applicant
US6845879(B2)	2005-01-01	Park	Applicant
US6853444(B2)	2005-02-01	Haddad	Applicant
US6867683(B2)	2005-03-01	Calvesio et al.	Applicant
US6873960(B1)	2005-03-01	Wood et al.	Applicant
US6896187(B2)	2005-05-01	Stockhammer	Applicant
US6905411(B2)	2005-06-01	Nguyen et al.	Applicant
US6920237(B2)	2005-07-01	Chen et al.	Applicant
US6930707(B2)	2005-08-01	Bates et al.	Applicant
US6934849(B2)	2005-08-01	Kramer et al.	Applicant
US6950139(B2)	2005-09-01	Fujinawa	Applicant
US6954738(B2)	2005-10-01	Wang et al.	Applicant
US6957341(B2)	2005-10-01	Rice et al.	Applicant
US6964666(B2)	2005-11-01	Jackson	Applicant
US6968457(B2)	2005-11-01	Tam	Applicant
US6972797(B2)	2005-12-01	Izumi	Applicant
US6992562(B2)	2006-01-01	Fuks et al.	Applicant
US6992717(B2)	2006-01-01	Hatano	Applicant
US7003669(B2)	2006-02-01	Monk	Applicant
US7017359(B2)	2006-03-01	Kim et al.	Applicant
US7030351(B2)	2006-04-01	Wasserman et al.	Applicant
US7031539(B2)	2006-04-01	Tisse et al.	Applicant
US7043056(B2)	2006-05-01	Edwards et al.	Applicant
US7053948(B2)	2006-05-01	Konishi	Applicant
US7058209(B2)	2006-06-01	Chen et al.	Applicant
US7071971(B2)	2006-07-01	Elberbaum	Applicant
US7076087(B2)	2006-07-01	Wakiyama	Applicant
US7084904(B2)	2006-08-01	Liu et al.	Applicant
US7092555(B2)	2006-08-01	Lee et al.	Applicant
US7095901(B2)	2006-08-01	Lee et al.	Applicant
US7100818(B2)	2006-09-01	Swaine	Applicant
US7113170(B2)	2006-09-01	Lauper et al.	Applicant
US7114080(B2)	2006-09-01	Rahman et al.	Applicant
US7120607(B2)	2006-10-01	Bolle et al.	Applicant
US7125335(B2)	2006-10-01	Rowe	Applicant
US7130452(B2)	2006-10-01	Bolle et al.	Applicant
US7130453(B2)	2006-10-01	Kondo et al.	Applicant
US7135980(B2)	2006-11-01	Moore et al.	Applicant
US7136581(B2)	2006-11-01	Fujii	Applicant
US7145457(B2)	2006-12-01	Spitz et al.	Applicant
US7146027(B2)	2006-12-01	Kim et al.	Applicant
US7152085(B2)	2006-12-01	Tisse	Applicant
US7155035(B2)	2006-12-01	Kondo et al.	Applicant
US7169052(B2)	2007-01-01	Beaulieu	Applicant
US7173348(B2)	2007-02-01	Voda et al.	Applicant
US7174036(B2)	2007-02-01	Ohba	Applicant
US7177449(B2)	2007-02-01	Russon et al.	Applicant
US7181049(B2)	2007-02-01	Ike	Applicant
US7183895(B2)	2007-02-01	Bazakos et al.	Applicant
US7184577(B2)	2007-02-01	Chen et al.	Applicant
US7187786(B2)	2007-03-01	Kee	Applicant
US7191936(B2)	2007-03-01	Smith et al.	Applicant
US7197166(B2)	2007-03-01	Jeng	Applicant
US7197173(B2)	2007-03-01	Jones et al.	Applicant
US7203343(B2)	2007-04-01	Manasse et al.	Applicant
US7204425(B2)	2007-04-01	Mosher, Jr. et al.	Applicant
US7206431(B2)	2007-04-01	Schuessler	Applicant
US7215797(B2)	2007-05-01	Park	Applicant
US7226164(B2)	2007-06-01	Abourizk et al.	Applicant
US7239726(B2)	2007-07-01	Li	Applicant
US7269737(B2)	2007-09-01	Robinson	Applicant
US7271839(B2)	2007-09-01	Lee et al.	Applicant
US7272380(B2)	2007-09-01	Lee et al.	Applicant
US7272385(B2)	2007-09-01	Mirouze et al.	Applicant
US7277561(B2)	2007-10-01	Shin	Applicant
US7277891(B2)	2007-10-01	Howard et al.	Applicant
US7280984(B2)	2007-10-01	Phelan, III et al.	Applicant
US7287021(B2)	2007-10-01	De Smet	Applicant
US7298873(B2)	2007-11-01	Miller, Jr. et al.	Applicant
US7298874(B2)	2007-11-01	Cho	Applicant
US7305089(B2)	2007-12-01	Morikawa et al.	Applicant
US7309126(B2)	2007-12-01	Mihashi et al.	Applicant
US7312818(B2)	2007-12-01	Ooi et al.	Applicant
US7313529(B2)	2007-12-01	Thompson	Applicant
US7315233(B2)	2008-01-01	Yuhara	Applicant
US7331667(B2)	2008-02-01	Grotehusmann et al.	Applicant
US7333637(B2)	2008-02-01	Walfridsson	Applicant
US7333798(B2)	2008-02-01	Hodge	Applicant
US7336806(B2)	2008-02-01	Schonberg et al.	Applicant
US7338167(B2)	2008-03-01	Zelvin et al.	Applicant
US7346195(B2)	2008-03-01	Lauper et al.	Applicant
US7346779(B2)	2008-03-01	Leeper	Applicant
US7353399(B2)	2008-04-01	Ooi et al.	Applicant
US7362210(B2)	2008-04-01	Bazakos et al.	Applicant
US7362370(B2)	2008-04-01	Sakamoto et al.	Applicant
US7362884(B2)	2008-04-01	Willis et al.	Applicant
US7365771(B2)	2008-04-01	Kahn et al.	Applicant
US7380938(B2)	2008-06-01	Chmielewski, Jr. et al.	Applicant
US7391865(B2)	2008-06-01	Orsini et al.	Applicant
US7404086(B2)	2008-07-01	Sands et al.	Applicant
US7406184(B2)	2008-07-01	Wolff et al.	Applicant
US7414648(B2)	2008-08-01	Imada	Applicant
US7417682(B2)	2008-08-01	Kuwakino et al.	Applicant
US7418115(B2)	2008-08-01	Northcott et al.	Applicant
US7421097(B2)	2008-09-01	Hamza et al.	Applicant
US7436986(B2)	2008-10-01	Caldwell	Applicant
US7443441(B2)	2008-10-01	Hiraoka	Applicant
US7447911(B2)	2008-11-01	Chou et al.	Applicant
US7460693(B2)	2008-12-01	Loy et al.	Applicant
US7466348(B2)	2008-12-01	Morikawa et al.	Applicant
US7467809(B2)	2008-12-01	Breed et al.	Applicant
US7471451(B2)	2008-12-01	Dent et al.	Applicant
US7472283(B2)	2008-12-01	Angelo et al.	Applicant
US7486806(B2)	2009-02-01	Azuma et al.	Applicant
US7506172(B2)	2009-03-01	Bhakta	Applicant
US7512254(B2)	2009-03-01	Vollkommer et al.	Applicant
US7518651(B2)	2009-04-01	Butterworth	Applicant
US7537568(B2)	2009-05-01	Moehring	Applicant
US7538326(B2)	2009-05-01	Johnson et al.	Applicant
US7542945(B2)	2009-06-01	Thompson et al.	Applicant
US7552333(B2)	2009-06-01	Wheeler et al.	Applicant
US7580620(B2)	2009-08-01	Raskar et al.	Applicant
US7593550(B2)	2009-09-01	Hamza	Applicant
US7639846(B2)	2009-12-01	Yoda	Applicant
US7722461(B2)	2010-05-01	Gatto et al.	Applicant
US7751598(B2)	2010-07-01	Matey et al.	Applicant
US7756301(B2)	2010-07-01	Hamza	Applicant
US7756407(B2)	2010-07-01	Raskar	Applicant
US7761453(B2)	2010-07-01	Hamza	Applicant
US7777802(B2)	2010-08-01	Shinohara et al.	Applicant
US7804982(B2)	2010-09-01	Howard et al.	Applicant
US2001/0026632(A1)	2001-10-01	Tamai	Applicant
US2001/0027116(A1)	2001-10-01	Baird	Applicant
US2001/0047479(A1)	2001-11-01	Bromba et al.	Applicant
US2001/0051924(A1)	2001-12-01	Uberti	Applicant
US2002/0010857(A1)	2002-01-01	Karthik	Applicant
US2002/0039433(A1)	2002-04-01	Shin	Applicant
US2002/0040434(A1)	2002-04-01	Elliston et al.	Applicant
US2002/0062280(A1)	2002-05-01	Zachariassen et al.	Applicant
US2002/0112177(A1)	2002-08-01	Voltmer et al.	Applicant
US2002/0142844(A1)	2002-10-01	Kerr	Applicant
US2002/0150281(A1)	2002-10-01	Cho	Applicant
US2002/0154794(A1)	2002-10-01	Cho	Applicant
US2002/0158750(A1)	2002-10-01	Almalik	Applicant
US2002/0175182(A1)	2002-11-01	Matthews	Applicant
US2002/0186131(A1)	2002-12-01	Fettis	Applicant
US2002/0191075(A1)	2002-12-01	Doi et al.	Applicant
US2002/0191076(A1)	2002-12-01	Wada et al.	Applicant
US2002/0194128(A1)	2002-12-01	Maritzen et al.	Applicant
US2002/0194131(A1)	2002-12-01	Dick	Applicant
US2002/0198731(A1)	2002-12-01	Barnes et al.	Applicant
US2003/0002714(A1)	2003-01-01	Wakiyama	Applicant
US2003/0012413(A1)	2003-01-01	Kusakari et al.	Applicant
US2003/0038173(A1)	2003-02-01	Blackson et al.	Applicant
US2003/0046228(A1)	2003-03-01	Berney	Applicant
US2003/0055689(A1)	2003-03-01	Block et al.	Applicant
US2003/0055787(A1)	2003-03-01	Fujii	Applicant
US2003/0065626(A1)	2003-04-01	Allen	Applicant
US2003/0071743(A1)	2003-04-01	Seah et al.	Applicant
US2003/0072475(A1)	2003-04-01	Tamori	Applicant
US2003/0073499(A1)	2003-04-01	Reece	Applicant
US2003/0074317(A1)	2003-04-01	Hofi	Applicant
US2003/0074326(A1)	2003-04-01	Byers	Applicant
US2003/0080194(A1)	2003-05-01	O'Hara et al.	Applicant
US2003/0092489(A1)	2003-05-01	Veradej	Applicant
US2003/0098776(A1)	2003-05-01	Friedli	Applicant
US2003/0099379(A1)	2003-05-01	Monk et al.	Applicant
US2003/0107097(A1)	2003-06-01	McArthur et al.	Applicant
US2003/0107645(A1)	2003-06-01	Yoon	Applicant
US2003/0115148(A1)	2003-06-01	Takhar	Applicant
US2003/0116630(A1)	2003-06-01	Carey et al.	Applicant
US2003/0118212(A1)	2003-06-01	Min et al.	Applicant
US2003/0125054(A1)	2003-07-01	Garcia	Applicant
US2003/0125057(A1)	2003-07-01	Pesola	Applicant
US2003/0126560(A1)	2003-07-01	Kurapati et al.	Applicant
US2003/0131245(A1)	2003-07-01	Linderman	Applicant
US2003/0133597(A1)	2003-07-01	Moore et al.	Applicant
US2003/0140235(A1)	2003-07-01	Immega et al.	Applicant
US2003/0140928(A1)	2003-07-01	Bui et al.	Applicant
US2003/0141411(A1)	2003-07-01	Pandya et al.	Applicant
US2003/0149881(A1)	2003-08-01	Patel et al.	Applicant
US2003/0152251(A1)	2003-08-01	Ike	Applicant
US2003/0156741(A1)	2003-08-01	Lee et al.	Applicant
US2003/0158762(A1)	2003-08-01	Wu	Applicant
US2003/0158821(A1)	2003-08-01	Maia	Applicant
US2003/0159051(A1)	2003-08-01	Hollnagel	Applicant
US2003/0163739(A1)	2003-08-01	Armington et al.	Applicant
US2003/0169334(A1)	2003-09-01	Braithwaite et al.	Applicant
US2003/0174049(A1)	2003-09-01	Beigel et al.	Applicant
US2003/0177051(A1)	2003-09-01	Driscoll et al.	Applicant
US2003/0182151(A1)	2003-09-01	Taslitz	Applicant
US2003/0182182(A1)	2003-09-01	Kocher	Applicant
US2003/0189480(A1)	2003-10-01	Hamid	Applicant
US2003/0189481(A1)	2003-10-01	Hamid	Applicant
US2003/0191949(A1)	2003-10-01	Odagawa	Applicant
US2003/0194112(A1)	2003-10-01	Lee	Applicant
US2003/0210139(A1)	2003-11-01	Brooks et al.	Applicant
US2003/0225711(A1)	2003-12-01	Paping	Applicant
US2003/0236120(A1)	2003-12-01	Reece et al.	Applicant
US2004/0002894(A1)	2004-01-01	Kocher	Applicant
US2004/0005078(A1)	2004-01-01	Tillotson	Applicant
US2004/0006553(A1)	2004-01-01	de Vries et al.	Applicant
US2004/0010462(A1)	2004-01-01	Moon et al.	Applicant
US2004/0025030(A1)	2004-02-01	Corbett-Clark et al.	Applicant
US2004/0025053(A1)	2004-02-01	Hayward	Applicant
US2004/0030930(A1)	2004-02-01	Nomura	Applicant
US2004/0037450(A1)	2004-02-01	Bradski	Applicant
US2004/0039914(A1)	2004-02-01	Barr et al.	Applicant
US2004/0042641(A1)	2004-03-01	Jakubowski	Applicant
US2004/0044627(A1)	2004-03-01	Russell et al.	Applicant
US2004/0046640(A1)	2004-03-01	Jourdain et al.	Applicant
US2004/0050924(A1)	2004-03-01	Mletzko et al.	Applicant
US2004/0050930(A1)	2004-03-01	Rowe	Applicant
US2004/0052405(A1)	2004-03-01	Walfridsson	Applicant
US2004/0052418(A1)	2004-03-01	DeLean	Applicant
US2004/0059590(A1)	2004-03-01	Mercredi et al.	Applicant
US2004/0059953(A1)	2004-03-01	Purnell	Applicant
US2004/0117636(A1)	2004-06-01	Cheng	Applicant
US2004/0133804(A1)	2004-07-01	Smith et al.	Applicant
US2004/0160518(A1)	2004-08-01	Park	Applicant
US2004/0162870(A1)	2004-08-01	Matsuzaki et al.	Applicant
US2004/0162984(A1)	2004-08-01	Freeman et al.	Applicant
US2004/0172541(A1)	2004-09-01	Ando et al.	Applicant
US2004/0193893(A1)	2004-09-01	Braithwaite et al.	Applicant
US2004/0233038(A1)	2004-11-01	Beenau et al.	Applicant
US2004/0252866(A1)	2004-12-01	Tisse et al.	Applicant
US2004/0255168(A1)	2004-12-01	Murashita et al.	Applicant
US2005/0008201(A1)	2005-01-01	Lee et al.	Applicant
US2005/0012817(A1)	2005-01-01	Hampapur et al.	Applicant
US2005/0029353(A1)	2005-02-01	Isemura et al.	Applicant
US2005/0052566(A1)	2005-03-01	Kato	Applicant
US2005/0055582(A1)	2005-03-01	Bazakos et al.	Applicant
US2005/0063567(A1)	2005-03-01	Saitoh et al.	Applicant
US2005/0084137(A1)	2005-04-01	Kim et al.	Applicant
US2005/0084179(A1)	2005-04-01	Hanna et al.	Applicant
US2005/0102502(A1)	2005-05-01	Sagen	Applicant
US2005/0125258(A1)	2005-06-01	Yellin et al.	Applicant
US2005/0129286(A1)	2005-06-01	Hekimian	Applicant
US2005/0138385(A1)	2005-06-01	Friedli et al.	Applicant
US2005/0138387(A1)	2005-06-01	Lam et al.	Applicant
US2005/0146640(A1)	2005-07-01	Shibata	Applicant
US2005/0151620(A1)	2005-07-01	Neumann	Applicant
US2005/0152583(A1)	2005-07-01	Kondo et al.	Applicant
US2005/0193212(A1)	2005-09-01	Yuhara	Applicant
US2005/0199708(A1)	2005-09-01	Friedman	Applicant
US2005/0206501(A1)	2005-09-01	Farhat	Applicant
US2005/0206502(A1)	2005-09-01	Bernitz	Applicant
US2005/0210267(A1)	2005-09-01	Sugano et al.	Applicant
US2005/0210270(A1)	2005-09-01	Rohatgi et al.	Applicant
US2005/0238214(A1)	2005-10-01	Matsuda et al.	Applicant
US2005/0240778(A1)	2005-10-01	Saito	Applicant
US2005/0248725(A1)	2005-11-01	Ikoma et al.	Applicant
US2005/0249385(A1)	2005-11-01	Kondo et al.	Applicant
US2005/0255840(A1)	2005-11-01	Markham	Applicant
US2006/0093190(A1)	2006-05-01	Cheng et al.	Applicant
US2006/0147094(A1)	2006-07-01	Yoo	Applicant
US2006/0165266(A1)	2006-07-01	Hamza	Applicant
US2006/0274919(A1)	2006-12-01	LoIacono et al.	Applicant
US2007/0036397(A1)	2007-02-01	Hamza	Examiner
US2007/0140531(A1)	2007-06-01	Hamza	Examiner
US2007/0160266(A1)	2007-07-01	Jones et al.	Applicant
US2007/0189582(A1)	2007-08-01	Hamza et al.	Applicant
US2007/0206840(A1)	2007-09-01	Jacobson	Applicant
US2007/0211924(A1)	2007-09-01	Hamza	Applicant
US2007/0274570(A1)	2007-11-01	Hamza	Examiner
US2007/0274571(A1)	2007-11-01	Hamza	Examiner
US2007/0286590(A1)	2007-12-01	Terashima	Applicant
US2008/0005578(A1)	2008-01-01	Shafir	Applicant
US2008/0075334(A1)	2008-03-01	Determan et al.	Applicant
US2008/0075441(A1)	2008-03-01	Jelinek et al.	Applicant
US2008/0075445(A1)	2008-03-01	Whillock et al.	Applicant
US2008/0104415(A1)	2008-05-01	Palti-Wasserman et al.	Applicant
US2008/0148030(A1)	2008-06-01	Goffin	Applicant
US2008/0211347(A1)	2008-09-01	Wright et al.	Applicant
US2008/0252412(A1)	2008-10-01	Larsson et al.	Applicant
US2009/0046899(A1)	2009-02-01	Northcott et al.	Applicant
US2009/0092283(A1)	2009-04-01	Whillock et al.	Applicant
US2009/0316993(A1)	2009-12-01	Brasnett et al.	Applicant
US2010/0033677(A1)	2010-02-01	Jelinek	Applicant
US2010/0034529(A1)	2010-02-01	Jelinek	Applicant
US2010/0182440(A1)	2010-07-01	McCloskey	Applicant
US2010/0239119(A1)	2010-09-01	Bazakos et al.	Applicant
EP484076	1992-05-01		Applicant
EP593386	1994-04-01		Applicant
EP878780	1998-11-01		Applicant
EP899680	1999-03-01		Applicant
EP910986	1999-04-01		Applicant
EP962894	1999-12-01		Applicant
EP1018297	2000-07-01		Applicant
EP1024463	2000-08-01		Applicant
EP1028398	2000-08-01		Applicant
EP1041506	2000-10-01		Applicant
EP1041523	2000-10-01		Applicant
EP1126403	2001-08-01		Applicant
EP1139270	2001-10-01		Applicant
EP1237117	2002-09-01		Applicant
EP1477925	2004-11-01		Applicant
EP1635307	2006-03-01		Applicant
GB2369205	2002-05-01		Applicant
GB2371396	2002-07-01		Applicant
GB2375913	2002-11-01		Applicant
GB2402840	2004-12-01		Applicant
GB2411980	2005-09-01		Applicant
JP9161135	1997-06-01		Applicant
JP9198545	1997-07-01		Applicant
JP9201348	1997-08-01		Applicant
JP9147233	1997-09-01		Applicant
JP9234264	1997-09-01		Applicant
JP9305765	1997-11-01		Applicant
JP9319927	1997-12-01		Applicant
JP10021392	1998-01-01		Applicant
JP10040386	1998-02-01		Applicant
JP10049728	1998-02-01		Applicant
JP10137219	1998-05-01		Applicant
JP10137221	1998-05-01		Applicant
JP10137222	1998-05-01		Applicant
JP10137223	1998-05-01		Applicant
JP10248827	1998-09-01		Applicant
JP10269183	1998-10-01		Applicant
JP11047117	1999-02-01		Applicant
JP11089820	1999-04-01		Applicant
JP11200684	1999-07-01		Applicant
JP11203478	1999-07-01		Applicant
JP11213047	1999-08-01		Applicant
JP11339037	1999-12-01		Applicant
JP2000005149	2000-01-01		Applicant
JP2000005150	2000-01-01		Applicant
JP2000011163	2000-01-01		Applicant
JP2000023946	2000-01-01		Applicant
JP2000083930	2000-03-01		Applicant
JP2000102510	2000-04-01		Applicant
JP2000102524	2000-04-01		Applicant
JP2000105830	2000-04-01		Applicant
JP2000107156	2000-04-01		Applicant
JP2000139878	2000-05-01		Applicant
JP2000155863	2000-06-01		Applicant
JP2000182050	2000-06-01		Applicant
JP2000185031	2000-07-01		Applicant
JP2000194972	2000-07-01		Applicant
JP2000237167	2000-09-01		Applicant
JP2000242788	2000-09-01		Applicant
JP2000259817	2000-09-01		Applicant
JP2000356059	2000-12-01		Applicant
JP2000357232	2000-12-01		Applicant
JP2001005948	2001-01-01		Applicant
JP2001067399	2001-03-01		Applicant
JP2001101429	2001-04-01		Applicant
JP2001167275	2001-06-01		Applicant
JP2001222661	2001-08-01		Applicant
JP2001292981	2001-10-01		Applicant
JP2001297177	2001-10-01		Applicant
JP2001358987	2001-12-01		Applicant
JP2002119477	2002-04-01		Applicant
JP2002133415	2002-05-01		Applicant
JP2002153444	2002-05-01		Applicant
JP2002153445	2002-05-01		Applicant
JP2002260071	2002-09-01		Applicant
JP2002271689	2002-09-01		Applicant
JP2002286650	2002-10-01		Applicant
JP2002312772	2002-10-01		Applicant
JP2002329204	2002-11-01		Applicant
JP2003006628	2003-01-01		Applicant
JP2003036434	2003-02-01		Applicant
JP2003108720	2003-04-01		Applicant
JP2003108983	2003-04-01		Applicant
JP2003132355	2003-05-01		Applicant
JP2003150942	2003-05-01		Applicant
JP2003153880	2003-05-01		Applicant
JP2003242125	2003-08-01		Applicant
JP2003271565	2003-09-01		Applicant
JP2003271940	2003-09-01		Applicant
JP2003308522	2003-10-01		Applicant
JP2003308523	2003-10-01		Applicant
JP2003317102	2003-11-01		Applicant
JP2003331265	2003-11-01		Applicant
JP2004005167	2004-01-01		Applicant
JP2004021406	2004-01-01		Applicant
JP2004030334	2004-01-01		Applicant
JP2004038305	2004-02-01		Applicant
JP2004094575	2004-03-01		Applicant
JP2004152046	2004-05-01		Applicant
JP2004163356	2004-06-01		Applicant
JP2004164483	2004-06-01		Applicant
JP2004171350	2004-06-01		Applicant
JP2004171602	2004-06-01		Applicant
JP2004206444	2004-07-01		Applicant
JP2004220376	2004-08-01		Applicant
JP2004261515	2004-09-01		Applicant
JP2004280221	2004-10-01		Applicant
JP2004280547	2004-10-01		Applicant
JP2004287621	2004-10-01		Applicant
JP2004315127	2004-11-01		Applicant
JP2004318248	2004-11-01		Applicant
JP2005004524	2005-01-01		Applicant
JP2005011207	2005-01-01		Applicant
JP2005025577	2005-01-01		Applicant
JP2005038257	2005-02-01		Applicant
JP2005062990	2005-03-01		Applicant
JP2005115961	2005-04-01		Applicant
JP2005148883	2005-06-01		Applicant
JP2005242677	2005-09-01		Applicant
WO97/17674	1997-05-01		Applicant
WO97/21188	1997-06-01		Applicant
WO98/02083	1998-01-01		Applicant
WO98/08439	1998-03-01		Applicant
WO99/32317	1999-07-01		Applicant
WO99/52422	1999-10-01		Applicant
WO99/65175	1999-12-01		Applicant
WO/28484	2000-05-01		Applicant
WO/29986	2000-05-01		Applicant
WO/31677	2000-06-01		Applicant
WO/36605	2000-06-01		Applicant
WO/62239	2000-10-01		Applicant
WO1/01329	2001-01-01		Applicant
WO1/03100	2001-01-01		Applicant
WO1/28476	2001-04-01		Applicant
WO1/35348	2001-05-01		Applicant
WO1/35349	2001-05-01		Applicant
WO1/40982	2001-06-01		Applicant
WO1/63994	2001-08-01		Applicant
WO1/69490	2001-09-01		Applicant
WO1/86599	2001-11-01		Applicant
WO2/01451	2002-01-01		Applicant
WO2/19030	2002-03-01		Applicant
WO2/35452	2002-05-01		Applicant
WO2/35480	2002-05-01		Applicant
WO2/091735	2002-11-01		Applicant
WO2/095657	2002-11-01		Applicant
WO3/002387	2003-01-01		Applicant
WO3/003910	2003-01-01		Applicant
WO3/054777	2003-07-01		Applicant
WO3/077077	2003-09-01		Applicant
WO2004/029863	2004-04-01		Applicant
WO2004/042646	2004-05-01		Applicant
WO2004/055737	2004-07-01		Applicant
WO2004/089214	2004-10-01		Applicant
WO2004/097743	2004-11-01		Applicant
WO2005/008567	2005-01-01		Applicant
WO2005/013181	2005-02-01		Applicant
WO2005/024698	2005-03-01		Applicant
WO2005/024708	2005-03-01		Applicant
WO2005/024709	2005-03-01		Applicant
WO2005/029388	2005-03-01		Applicant
WO2005/062235	2005-07-01		Applicant
WO2005/069252	2005-07-01		Applicant
WO2005/093510	2005-10-01		Applicant
WO2005/093681	2005-10-01		Applicant
WO2005/096962	2005-10-01		Applicant
WO2005/098531	2005-10-01		Applicant
WO2005/104704	2005-11-01		Applicant
WO2005/109344	2005-11-01		Applicant
WO2006/012645	2006-02-01		Applicant
WO2006/023046	2006-03-01		Applicant
WO2006/051462	2006-05-01		Applicant
WO2006/063076	2006-06-01		Applicant
WO2006/081209	2006-08-01		Applicant
WO2006/081505	2006-08-01		Applicant
WO2007/101269	2007-09-01		Applicant
WO2007/101275	2007-09-01		Applicant
WO2007/101276	2007-09-01		Applicant
WO2007/103698	2007-09-01		Applicant
WO2007/103701	2007-09-01		Applicant
WO2007/103834	2007-09-01		Applicant
WO2008/016724	2008-02-01		Applicant
WO2008/019168	2008-02-01		Applicant
WO2008/019169	2008-02-01		Applicant
WO2008/021584	2008-02-01		Applicant
WO2008/031089	2008-03-01		Applicant
WO2008/040026	2008-04-01		Applicant

Non-Patent Literature (93)

Chun et al, “Iris Recognition for Palm-Top Application,” 2004, ICBA 2004, LNCS 3072, pp. 426-433.Examiner
Proenca et al, Iris Recognition: Measuring Feature's Quality for the Feature Selection in Unconstrained Image Capture Environments, 2006, IEEE Proceedings of the 2006 International Conference on Computational Intelligence for Homeland Security and Personal Safety—CIHSPS 2006, vol. 1, pp. 1-5.Examiner
U.S. Appl. No. 13/077,821, filed Mar. 30, 2011.Applicant
Freeboy, “Adaptive Optics Speeds Up Airport Immigration,” Optics.org/ole, 2 pages, Jan. 2009.Applicant
http://www.imagine-eyes.com/content/view/100/115/, “INOVEO—Ultra-High Resolution Retinal Imaging with Adaptive Optics,” 2 pages, printed Feb. 22, 2010.Applicant
AOptix Technologies, “Introducing the AOptix InSight 2 Meter Iris Recognition System,” 6 pages, 2010.Applicant
Belhumeur et al., “Eigenfaces Vs. Fisherfaces: Recognition Using Class Specific Linear Projection,” 14 pages, prior to Jun. 11, 2010.Applicant
Bentley et al., “Multidimensional Binary Search Trees Used for Associative Searching,” Communications of the ACM, vol. 18, No. 9, pp. 509-517, Sep. 1975.Applicant
Blackman et al., “Chapter 9, Multiple Sensor Tracking: Issues and Methods,” Design and Analysis of Modern Tracking Systems, Artech House, pp. 595-659, 1999.Applicant
Brasnett et al., “A Robust Visual Identifier Using the Trace Transform,” 6 pages, prior to Jun. 11, 2010.Applicant
Buades et al., “A Review of Image Denoising Algorithms, with a New One,” Multiscale Modeling & Simulation, vol. 4, No. 2, pp. 490-530, 2005.Applicant
Chen et al., “Localized Iris Image Quality Using 2-D Wavelets,” LNCS vol. 3832, pp. 373-381, 2005.Applicant
Chow et al., “Towards a System for Automatic Facial Feature Detection,” Pattern Recognition vol. 26, No. 12, pp. 1739-1755, 1993.Applicant
U.S. Appl. No. 12/792,498, filed Jun. 2, 2010.Applicant
U.S. Appl. No. 12/814,232, filed Jun. 11, 2010.Applicant
Cula et al., “Bidirectional Imaging and Modeling of Skin Texture,” Proceedings of Texture 2003, 6 pages, Oct. 17, 2003.Applicant
Cula et al., “Bidirectional Imaging and Modeling of Skin Texture,” IEEE Transactions on Biomedical Engineering, vol. 51, No. 12, pp. 2148-2159, 2004.Applicant
Cula et al., “Compact Representation of Bidirectional Texture Functions,” Proceedings of IEEE Computer Soviet Conference on Computer Vision and Pattern Recognition 2001, 8 pages, 2001.Applicant
Cula et al., “Skin Texture Modeling,” International Journal of Computer Vision 2004, 34 pages, 2004.Applicant
Dabov et al., “Image Denoising by Sparse 3-D Transform-Domain Collaborative Filtering,” IEEE Transactions on Image Processing, vol. 16, No. 8, pp. 2080-2095, Aug. 2007.Applicant
Dabov et al., “Image Restoration by Spars 3D Transform Collaborative Filtering,” SPIE vol. 6812 681207-1, 12 pages, 2008.Applicant
Daugman, “High Confidence Visual Recognition of Persons by a Test of Statistical Independence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 15, No. 11, pp. 1148-1161, 1993.Applicant
Daugman, “Probing the Uniqueness and Randomness of Iris Codes: Results from 200 Billion Iris Pair Comparisons,” Proceedings of the IEEE vol. 94, No. 11, pp. 1928-1935, Nov. 2006.Applicant
Fooprateepsiri et al., “A Highly Robust Method for Face Authentication,” IEEE 2009 First Asian Conference on Intelligent Information and Database Systems, pp. 380-385, 2009.Applicant
Fooprateepsiri et al., “Face Verification Base-On Hausdorff-Shape Context,” IEEE 2009 Asia Conference on Informatics in Control, Automation and Robotics, pp. 240-244, 2009.Applicant
Forstner et al., “A Metric for Covariance Matrices,” 16 pages, prior to Jun. 11, 2010.Applicant
Gan et al., “Applications of Wavelet Packets Decomposition in Iris Recognition,” LNCS vol. 3832, pp. 443-449, 2005.Applicant
Hampapur et al., “Smart Surveillance: Applications, Technologies and Implications,” IEEE, 6 pages, Dec. 15-18, 2003.Applicant
Hamza et al., “Standoff Iris Recognition Usin Non-Iterative Polar Based Segmentation,” Proceedings of SPIE vol. 6944, 8 pages, 2008.Applicant
Hanna et al., “A System for Non-Intrusive Human Iris Acquisition and Identification,” IAPR Workshop on Machine Vision Applications, pp. 200-203, Nov. 12-14, 1996.Applicant
http://en.wikipedia.org/wiki/Radon—transform, “Radon Transform,” 5 pages, printed May 14, 2010.Applicant
Ivins et al., “A Deformable Model of the Human Iris for Measuring Small Three-Dimensional Eye Movements,” Machine Vision and Applications, vol. 11, pp. 42-51, 1998.Applicant
Kadyrov et al., “The Trace Transform and Its Applications,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, No. 8, pp. 811-828, Aug. 2001.Applicant
Kadyrov et al., “The Trace Transform as a Tool to Invariant Feature Construction,” 3 pages, prior to Jun. 11, 2010.Applicant
Kang et al., “Improved Dual Action Contour for Iris Recognition,” 10 pages, prior to Jun. 11, 2010.Applicant
Kawaguchi et al., “Detection of Eyes from Human Faces by Hough Transform and Separability Filter,” IEEE, 4 pages, 2000.Applicant
Kong et al., “Detecting Eyelash and Reflection for Accurate Iris Segmentation,” International Journal of Pattern Recognition and Artificial Intelligence, vol. 17, No. 6, pp. 1025-1034, 2003.Applicant
Li et al., “Appearance Modeling Using a Geometric Transform,” IEEE Transactions on Image Processing, 17 pages, 2008.Applicant
Li et al., “Appearance Modeling Using a Geometric Transform,” Journal Preparation for IEEE Transactions on Image Processing, 30 pages, Nov. 5, 2006.Applicant
Ma et al., “Local Intensity Variation Analysis for Iris Recognition,” Pattern Recognition, vol. 37, pp. 1287-1298, 2004.Applicant
Ma et al., “Video Sequence Querying Using Clustering of Objects' Appearance Models,” Advances in Visual Computing Third Annual Symposium, ISVC 2007, 14 pages, 2007.Applicant
Monro et al., “DCT-Based Iris Recognition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, No. 4, Apr. 2007.Applicant
Noh et al., “A Novel Method to Extract Features for Iris Recognition System,” AVBPA 2003, LNCS 2688, pp. 862-868, 2003.Applicant
Ojala et al., “Multiresolution Gray-Scale and Rotation Invariant Texture Classification with Local Binary Patterns,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, No. 7, 18 pages, Jul. 2002.Applicant
Pamudurthy et al., “Dynamic Approach for Face Recognition Using Digital Image Skin Correlation,” Audio and Video Based Person Authentication 5th International Conference, AVBPA 2005, Hilton Rye Town, NY, USA, 11 pages, Jul. 20-22, 2005.Applicant
Petrou et al., “The Trace Transform in a Nutshell,” 9 pages, prior to Jun. 11, 2010.Applicant
Phillips et al., “FRVT 2006 and ICE 2006 Large-Scale Results,” 56 pages, Mar. 2007.Applicant
Porikli et al., “Covariance Tracking Using Model Update Based on Means on Riemannian Manifolds,” 8 pages, prior to Jun. 11, 2010.Applicant
Proenca et al., “Toward Noncooperative Iris Recognition: A Classification Approach Using Multiple Signatures,” IEEE Transactions on Patern Analysis and Machine Intellingence, vol. 29, No. 4, pp. 607-612, Apr. 2007.Applicant
Ross et al., “Segmenting Non-Ideal Irises Using Geodesic Active Contours,” IEEE 2006 Biometrics Symposium, 3 pages, 2006.Applicant
Shapiro et al., pp. 556-559 in Book Entitled “Computer Vision,” Prentice Hall, prior to Jun. 11, 2010.Applicant
Stillman et al., “A System for Tracking and Recognizing Multiple People with Multiple Cameras,” 6 pages, Aug. 1998.Applicant
Sun et al., “Iris Recognition Based on Non-local Comparisons,” Sinobiometrics 2004, LNCS 3338, pp. 67-77, 2004.Applicant
Suzaki et al., “A Horse Identification System Using Biometrics,” Systems and Computer in Japan, vol. 32, No. 14, pp. 12-23, 2001.Applicant
Trucco et al., “Robust Iris Location in Close-up Images of the Eye,” Pattern Anal. Applic. vol. 8, pp. 247-255, 2005.Applicant
Turan et al., “Trace Transform Based Invariant Object Recognition System,” 4 pages, prior to Jun. 11, 2010.Applicant
Turk et al., “Eigenfaces for Recognition,” Journal of Cognitive Neuroscience, vol. 3, No. 1, 16 pages, 1991.Applicant
Wang et al., “Recent Developments in Human Motion Analysis,” Pattern Recognition, vol. 36, pp. 585-601, 2003.Applicant
Wei et al., “Robust and Fast Assessment of Iris Image Quality,” LNCS vol. 3832, pp. 464-471, 2005.Applicant
Zhao et al., “Dynamic Texture Recognition Using Local Binary Patterns with an Application to Facial Expressions,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, No. 6, pp. 915-928, Jun. 2007.Applicant
Zhi-Hui et al., “Research Iris Serial Images Quality Assessment Method Based on HVS,” Proceedings of SPIE, vol. 6034, 6 pages, 2006.Applicant
Avcibas et al., “Steganalysis Using Image Quality Metrics,” IEEE Transactions on Image Processing, vol. 12, No. 2, pp. 221-229, Feb. 2003.Applicant
Boles, “A Security System Based on Human Iris Identification Using Wavelet Transform,” IEEE First International Conference on Knowledge Based Intelligent Electronic Systems, May 21-23, Adelaide, Australia, pp. 533-541, 1997.Applicant
Bonney et al., “Iris Pattern Extraction Using Bit Planes and Standard Deviations,” IEEE, pp. 582-586, 2004.Applicant
Camus et al., “Reliable and Fast Eye Finding in Close-up Images,” IEEE, pp. 389-394, 2002.Applicant
Carson et al., “Blobworld: Image Segmentation Using Expectation-Maximization and Its Application to Image Querying,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, No. 8, pp. 1026-1038, Aug. 2002.Applicant
Cui et al., “A Fast and Robust Iris Localization Method Based on Texture Segmentation,” 8 pages, 2004.Applicant
Cui et al., “An Appearance-Based Method for Iris Detection,” 6 pages, 2004.Applicant
Cui et al., “An Iris Detection Method Based on Structure Information,” Advances in Biometric Person Authentication, International Workshop on Biometric Recognition Systems, IWBRS 2005, Beijing China, 10 pages, Oct. 22-23, 2005.Applicant
Cui et al., “An Iris Image Synthesis Method Based on PCA and Super-Resolution,” IEEE Computer Society, Proceedings of the 17th International Conference on Pattern Recognition, 6 pages, Aug. 23-26, 2004.Applicant
Cui et al., “An Iris Recognition Algorithm Using Local Extreme Points,” Biometric Authentication, First International Conference, ICBA 2004, Hong Kong, China, 10 pages, Jul. 15-17, 2004.Applicant
Daugman, “Results From 200 Billion Iris Cross-Comparisons,” University of Cambridge Computer Laboratory, Technical Report, No. 635, 8 pages, Jun. 2005.Applicant
Daugman, “How Iris Recognition Works,” IEEE 2002 International Conference on Image Processing, vol. I of III, 6 pages, Sep. 22-25, 2002.Applicant
Du et al., “A One-Dimensional Approach for Iris Identification,” 11 pages, prior to Jan. 25, 2006.Applicant
Guo et al., “A System for Automatic Iris Capturing,” Mitsubishi Electric Research Laboratories, Inc., 10 pages, 2005.Applicant
Guo, “Face, Expression, and Iris Recognition Using Learning-Based Approaches,” 132 pages, 2006.Applicant
http://www.newscientisttech.com/article/dn11110-invention-covert-iris-sc, “Invention: Covert Iris Scanner,” 3 pages, printed Feb. 8, 2007.Applicant
Huang et al., “Iris Model Based on Local Orientation Description,” 5 pages, prior to Jan. 25, 2006.Applicant
Huang et al., “An Efficient Iris Recognition System,” IEEE Proceedings of the First International Conference on Machine Learning and Cybernetics, Beijing, pp. 450-454, Nov. 4-5, 2002.Applicant
Jalaja et al., “Texture Element Feature Characterizations for CBIR,” IEEE, pp. 733-736, 2005.Applicant
Kalka et al., “Image Quality Assessment for Iris Biometric,” Proc. of SPIE vol. 6202 62020D, 11 pages, 2006.Applicant
Ko et al., “Monitoring and Reporting of Fingerprint Image Quality and Match Accuracy for a Large User Application,” IEEE Computer Society, Proceedings of the 33rd Applied Imagery Pattern Recognition Workshops, 6 pages, 2004.Applicant
Lau et al., “Finding a Small Number of Regions in an Image Using Low-Level Features,” Pattern Recognition 35, pp. 2323-2339, 2002.Applicant
Ma et al., “Personal Identification Based on Iris Texture Analysis,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, No. 12, pp. 1519-1533, Dec. 2003.Applicant
Masek, “Recognition of Human Iris Patterns for Biometric Identification,” 61 pages, 2003.Applicant
Maurer et al., “Tracking and Learning Graphs and Pose on Image Sequences of Faces,” IEEE Computer Society Press, International Conference on Automatic Face and Gesture Recognition, pp. 176-181, Oct. 14-16, 1996.Applicant
Oppenheim et al, “The Importance of Phase in Signals,” Proceedings of the IEEE, vol. 69, No. 5, pp. 529-541, 1981.Applicant
Ratha et al., “A Real-Time Matching System for Large Fingerprint Databases,” IEEE Transactions on Pattern Analysis, and Machine Intelligence, vol. 18, No. 8, pp. 799-812, Aug. 1996.Applicant
Sony, “Network Color Camera, SNC-RZ30N (NTSC) ,” 6 pages, Aug. 2002.Applicant
Sun et al., “Robust Encoding of Local Ordinal Measures: A General Framework of Iris Recognition,” 13 pages, prior to Jan. 25, 2006.Applicant
Wang et al, “Image Quality Assessment: From Error Visibility to Structural Similarity,” IEEE Transactions on Image Processing vol. 13, No. 4, pp. 600-612, Apr. 2004.Applicant
Wang et al., “A Universal Image Quality Index,” IEEE Signal Processing Letters, vol. 9, No. 3, pp. 81-84, Mar. 2002.Applicant
Wang et al., “Local Phase Coherence and the Perception of Blur,” Advances in Nueral Information Processing Systems 16, pp. 1435-1442, 2004.Applicant

Abstract

Description

Background

[0002] The present invention pertains to recognition systems and particularly to biometric recognition systems; in particular the invention pertains to iris recognition systems.

Summary

Brief Description of the Drawing

[0004] FIG. 1a is a diagram of an iris showing various delineated boundaries;

[0005] FIG. 1b is a diagram of a blurred iris image;

[0006] FIG. 1c is a diagram of a gazed eye;

[0007] FIG. 2a is a diagram of polar segmentation of an iris in an image;

[0008] FIG. 2b is a diagram of processing blocks for an adaptive iris matching approach;

[0009] FIG. 2c is a diagram of adaptive matching;

[0010] FIG. 3a is a diagram of polar segmentation used to estimate a pupil bound;

[0011] FIG. 3b is a diagram of model fitting using a pupil warp function to obtain a symmetric pupil shape and outside iris boundary;

[0012] FIG. 3c is a diagram of an inverse projection or transform as applied to iris, pupil and eyelid boundaries; and

[0013] FIG. 4 is a diagram of an operation of an iris image processing approach.

Description

[0035] The present approach may solve the issue in three processing steps.

[0041]

\begin{matrix} W_{α} (R) = {[α (θ)]}^{- 1 / 2} \int sig (r) ψ^{*} (\frac{r - R}{α (θ)}) ⅆ r, & (1) \end{matrix}