Standoff iris recognition system

Information

  • Patent Grant
  • 8098901
  • Patent Number
    8,098,901
  • Date Filed
    Thursday, February 15, 2007
    17 years ago
  • Date Issued
    Tuesday, January 17, 2012
    12 years ago
Abstract
An iris recognition system having pupil and iris border conditioning prior to iris mapping and analysis. The system may obtain and filter an image of an eye. A pupil of the mage may be selected and segmented. Portions of the pupil border can be evaluated and pruned. A curve may be fitted on at least the invalid portions of the pupil border. The iris of the eye with an acceptable border of the pupil as an inside border of the iris may be selected from the image. The iris outside border having sclera and eyelash/lid boundaries may be grouped using a cluster angular range based on eye symmetry. The sclera boundaries may be fitted with a curve. The eyelash/lid boundaries may be extracted or masked. The iris may be segmented, mapped and analyzed.
Description
BACKGROUND

The present invention pertains to recognition systems and particularly to biometric recognition systems. More particularly, the invention pertains to iris recognition systems.


Related applications may include U.S. patent application Ser. No. 10/979,129, filed Nov. 3, 2004, which is a continuation-in-part of U.S. patent application Ser. No. 10/655,124, filed Sep. 5, 2003; and U.S. patent application Ser. No. 11/672,108, filed Feb. 7, 2007.


U.S. patent application Ser. No. 11/275,703, filed Jan. 25, 2006, is hereby incorporated by reference.


U.S. Provisional Application No. 60/647,270, filed Jan. 26, 2005, is hereby incorporated by reference.


U.S. patent application Ser. No. 11/043,366, filed Jan. 26, 2005, is hereby incorporated by reference.


U.S. patent application Ser. No. 11/372,854, filed Mar. 10, 2006, is hereby incorporated by reference.


U.S. Provisional Application No. 60/778,770, filed Mar. 3, 2006, is hereby incorporated by reference.


U.S. patent application Ser. No. 11/672,108, filed Feb. 7, 2007, is hereby incorporated by reference.


SUMMARY

The present invention is a stand off iris recognition system.





BRIEF DESCRIPTION OF THE DRAWING


FIG. 1 is a diagram of an overall structure of the standoff iris recognition system;



FIG. 2 is a diagram of a pupil processing mechanism;



FIGS. 3, 4 and 5 are diagrams showing a basis for pupil border analysis, curve fitting and portion substitution;



FIG. 6 is a diagram of an approach for an iris outer border analysis, curve fitting and portion removal or substitution;



FIG. 7 is a diagram of a polar segmentation subroutine mechanism;



FIGS. 8
a and 8b are diagrams illustrating an approach for estimating eyelash/lid curve detection;



FIG. 9 is an illustration showing an eye having eyelash/lid obscuration;



FIG. 10 is a diagram of pupil and iris centers;



FIGS. 11 and 12 are diagrams of iris quadrants and masking; and



FIGS. 13-18 are diagrams of various kinds of masking for noisy and informational areas of the eye.





DESCRIPTION

Various noted properties of irises may make iris recognition technology as a reliable person identification tool. For instance, irises may have uniqueness unlike other biometric technologies, such as face-prints and fingerprints. Irises may be unique to a person and even among genetically twin individuals. Although the striking visual similarity of identical twins reveals the genetic penetrance of facial appearance, a comparison of genetically identical irises reveals just the opposite for iris patterns. Further, there appears to be no aging effect, that is, there is stability over the life of iris features. The physical characteristics of iris patterns are unalterable without significant duress. A non-invasive iris may be considered as an internal unique organ but yet is externally visible and can be measured. It is in a protected environment but still visible.


The present system and approach address the real-time operational requirements of a standoff iris recognition system and may be regarded as an “on-the-fly” iris recognition system. Unlike other approaches, which mostly are based on brute force of a Hough Transform to fit the iris edges into circular or regular shapes, one may employ an efficient and robust enhancement approach built around a polar segmentation (POSE) technique by the present assignee disclosed in U.S. patent application Ser. No. 11/043,366, filed Jan. 26, 2005. Present improvements made to the POSE segmentation technique contribute to a robust and computational efficient and accurate real-time iris recognition.


The present iris recognition system is well suited for high-security access control or “at-a-distance biometrics” applications with little or no control exercised on subject positioning or orientations. The iris recognition operation may include subjects captured at various ranges from the acquisition device or include subjects that may not have their eye directly aligned with the imaging equipment. Usually, for such applications, it may be difficult to implement a level of control required by most of the existing art to enable reliable iris recognition operations. The present approach of iris recognition may cope with asymmetry in acquired iris imaging and it can operate under any uncontrolled operations as long as some of the iris annular is visible.


The present system may provide an accurate segmentation technique and hence identify good iris patterns, which may be regarded as signatures. The present system may take the analysis of edges into polar domain and use local patterns to detect iris features using an enhanced version of POSE technique disclosed in U.S. patent application Ser. No. 11/275,703. This technique may detect curves of the iris borders of any irregular shapes. A detection algorithm may robustly detect the inner and outer borders of the eye iris for the purpose of human or animal recognition.


The present approach may begin with a mapping the analysis immediately into the polar domain with respect to a centered point in the pupil region. The centered point, not necessarily the exact center of the pupil but may be identified within the pupil region. One may then detect edges of the inner and outer borders of the iris based upon a one dimensional polar segmentation (1D POSE) technique and detect the irregular shape of the iris curves using additional rules that are introduced on the POSE technique to cluster the edge points separately into two groups that represent edges at the sclera and edges at the borders of the eyelids. One may extract the iris signature using a guided analysis to correctly normalize the stretching and compression of the patterns and bring uniformity into the interpretation of the patterns. In addition, one may cluster obscured pixels and affected areas to be either weighted with low weights or masked out of the analysis. The patterns may then be matched against multiple codes within a database and are given weights based upon the pattern visibility and exposure to the camera system.


The present system and approach may include the following items. There may be a map analysis at an earlier stage to conduct segmentation into the polar domain. Iris inner border detection may be achieved using the estimated edges of POSE or any other active contour technique that provides a way to analyze each edge at each angle separately to determine whether the resulting edge is a valid border edge or invalided edge. A valid edge may be defined as an edge that was detected within a predefined range. Any edge point that results out of range or at the extreme points of the gradient signal segment may represent a leaked peak and is treated as invalid edge. A predefined regular or irregular model shape may be used to fit the resulting edges. The depicted model shape may be used to fill in any missing edges within the contour of the pupil to replace the non-valid points with the estimated points from the irregular shape. The analysis may be offset with a predefined minimum possible width of an iris as the starting point for the iris outer border analysis. Boundary edges may be extracted using POSE. A median filter may be run to smooth the resulting outcome of POSE. The boundary edge points may be clustered into several categories: 1) sclera and iris boundary points; and 2) iris and eyelid boundary points to be analyzed differently. The valid sclera and iris boundary points may be extracted. These edge points may be fitted into a predefined regular model shape. The regular model shape may be used for guidance of the analysis and will not present the final outcome of the edge estimates.


One may track the lowermost points of the lowermost curve of the upper eyelid edge, and track the uppermost points of the upper curve of the lower eyelid edges. Then one may interpolate among these samples to replace the entire angular range corresponding to the eyelid obscurations. The area between the estimated eyelid-eyelash curve and the pupil curve (inner border) may be measured. Weights may be assigned based upon significance of the area between the curves. In some approaches, one may choose to assign zero to the weights to discard the entire region given the significance of the occlusions. The spacing between the inner and outer curves may be scaled based upon the position of the outer curve within the regular shape. The actual edge points detected by POSE may be used to be the actual edges of the iris borders and not the fitted model shapes.


Any pixel that lies within the outer border of the iris and the fitting model shape may be masked. Any pixel that lies outside the fitting shape may be discarded. The pixels may be mapped into an iris pattern map. Virtually any encoding scheme may be used to compress the image into few bits while covering the entire angular range using a predefined angular resolution and radius resolution. A similarity of information metric may be used to measure the similarity among the barcode of the templates for matching while weighing the pixels that come from valid edges with higher values and weighing pixels associated with invalid edges or obscuration with smaller or zero values.


The present approach may be for performing iris recognition under suboptimal image acquisition conditions. The approach may be for iris segmentation to detect all boundaries (inner, outer, eyelid and sclera and horizon) of the image iris simultaneously.


The overall structure of the standoff iris recognition system 10 is shown in the FIG. 1. One may start an analysis by mapping 12 a located eye image 11 into a polar domain at the start with respect to a centered point within the pupil region of the eye image. An approach to estimate a point within the pupil may be straightforward in that it can use thresholding or summation over the x-axis and the y-axis to localize the darkest contrast within the eye image to locate the pupil region. The eye finder approach which is discussed in U.S. patent application Ser. No. 11/672,108, filed Feb. 7, 2007, may be used to estimate a pupil point. There may be an iris inner curve estimation 13 and outer curve estimation 14. A feature extraction 15 may proceed, leading to an iris signature map 16. The iris signature 17 may be compressed. An enroll and/or match 18 may occur with iris signature data flowing to and from a storage 19 in the form of bar codes.



FIG. 2 is a diagram of a pupil processing mechanism 20. An image 21 having an eye may go to an eye finder 22 which is discussed in U.S. patent application Ser. No. 11/672,108, filed Feb. 7, 2007. From the eye finder, the result may enter a filter 30 having a median filter 23 and then a smooth low pass filter 24 for noise removal. One does not want an actual feature on the pupil to interfere with the actual edge detection. An input kernel (pupil) module 69 may define a specific kernel or matrix of pixels covering just the pupil from the eye image for analysis. The edges of the pupil may include the most significant peaks, sufficient for detection. An output image of the pupil with certain edge smoothened out may go from the filter 24 may go to a POSE-ID segmentation 25.


Constraint evaluation is where a peak may be detected within a range. Edge detection may be on the limits within a certain range. A rough center location and an approximate size of the pupil may be attained. When the edges of the pupil are detected as peaks within the 1D signal along the radial axis and are said to be valid if they were detected within the radial range, one may have a validation of the pupil by testing the pupil profile, estimates of the edges. The new edges may yield to a better estimate of the pupil center sufficient for analysis.


A median filter 23 may be applied to eliminate salt and pepper noise due to the system acquisition of background noise. At this point, the image may be a kernel, i.e., a block of pixels of a pupil for analysis. The image 21 may be passed through a low pass filter 24 to smooth the variation with the pupil region while preserving the apparent contrast change at the edge of the pupil and the iris. Next, the POSE-1D segmentation 25 may be applied. The validity of the edges at step or stage 51, indicated by a diamond symbol, may be determined by checking whether the peaks in the contrast changes are leaked to the edges of the gradient of the contrast change signal. The leaking may indicate several cases. A constraint may include that the pixels of the edge be within a set range. First, the actual edge of the pupil may be too close to the signal edge and therefore the detected edge might not reflect the actual edge of the gradient. There may not be enough contrast to can determine whether there is a pupil edge. There may be a presence of obstacles that is obscuring the pupil edges. Obstacles may include skin of an eye, eyelashes due to eye closure, an eyeglass frame, a contact lens, optics, and the like. In either case, the peak may be deemed an invalid peak or an edge of a pupil. One may then fit only the valid points into a predefined model shape, i.e., elliptic fitting 52, just for guidance. Two alternatives may then be proposed. In an approach 54, one may actually use the estimated shape 56, 52, 48 (i.e., ellipse) that replaces the actual edges as an approximation to the pupil edges (which may also be referred to as an inner bound of the iris). In another approach 53, the actual active contour edge 57 may be kept as a final outcome using the POSE technique and only the invalid edges will be replaced by points from the estimated shape (i.e., the estimated ellipse).


Once the iris inner border at the pupil is estimated, one may move outward from the pupil with some margin that represents the least possible width of an iris. Then that width offset may be used as the starting point of the iris outer border analysis. An offset 90 of FIG. 9 may vary from zero to some value depending on the visibility of the pupil within the eye image during image acquisition. For instance, one offset may vary dependent on a scoring and/or a validation of a pupil profile being captured. Relative to a closed or highly obscured eye, an offset may be at a minimum or zero. For an open eye with no obscuration and having a high score and/or validation of a pupil profile, the offset may be large. The offset may vary depending on the areas or angular segments of the eye that are visible. Offset may vary according to the border type. For example, the iris/sclera border may warrant significant offset, and the offset for the iris/eyelash-lid may be low, minimus or zero. The iris outer border analysis is illustrated, at least partially, in a diagram of FIG. 3.



FIG. 3 shows a pupil 31 of which a portion of an edge 38 is within a range 32 of a circle 33 having a radius 34 about an approximate center 35. It may be noted that there may be a first reflection 36 and a first center estimate 37. However, an approximate center 35 is noted for subsequent use. The range 32 can have a set amount of deviation that the edge 38 of pupil 31 may have and yet be regarded as valid. It may be noted that the edge 38 could but does not extend beyond the outer circumference of range 33, but edge 38 does appear at points 41, 42 and 45 to be inside of a circumference 39 showing an inner limit of range 32. Points 43, 44 and 46 appear within the range 32 and thus may be deemed to be valid. The edge 38 of the pupil 31 may not be within the range 32 at points 41, 42 and 45 because of the eyelashes, eyelid and/or noise 47 at the bottom and top of the pupil. Other factors of pupil 31 may include a blob fitting (BF) and a coverage fitting (CF). An example set of percentages may be BF=78% and CF=92%, which appear to be an acceptable indication of an actual pupil. The validity of the edge 38 may be determined at symbol 51 of FIG. 2. The input may be an output from the segmentation stage or block 25. Also, an output from block 25 may go to a snake plus elliptic curve (or the like module) block 53.


The output of the valid edge determination diamond symbol 51 may go to a pruning block 40 where prompt changes of the edge 38 may be smoothed or reduced in its extension out from the edge curve. Then, the edge 38 may go to a predefined model shape (such as elliptic fitting) block 52. Here, the edge 38 of pupil 31 is fitted with a model shape curve 48 (as an example, one may show an elliptic shape as a fitting model shown as a thick line in FIG. 4). The entire edge 38, including the invalid and valid portions, may be replaced with the elliptic fitting 48 in a first approach (elliptic or like module) 54. Only the valid portions of the edge 38 are incorporated in determining an elliptic fitting curve 48 as indicated by block 54. The elliptic fitting 48 may used to do a final estimate of the pupil center 35. In a second approach, a non-linear fitting may be done as shown in FIG. 5. The model fitting 48 may be kept for only the non-valid portion or points 41, 42 and 45, but the actual valid edges or points 43, 44 and 46 may be kept, as indicated by block 53.


An output of elliptic fitting block 52 may go to a diamond 55 which asks whether the actual contour 38 or the model fitting 48 should be used. One may note that in either case, the model fitting or curve 48 should always be used for the non-valid portions of curve or contour 38 incorporating such. The approach does not get affected by any reflection within the pupil and as shown in FIG. 3, the analysis goes around the reflection and thus it would be neglected without having to add any preprocessing for its elimination. Besides reflections, a partially closed eye, eyelashes or lids, noise, and the like may be well treated using this segmentation method.


If the answer at diamond 55 is no, then the model curve 48 is used in place of the valid and non-valid portions of pupil edge 38. The output of block 54 may be a pupil border 56 as shown in image 58. If the answer is yes at diamond 55, then a “snake”, which is an active contour, that is, an estimate of the actual edge 38, rather than the ellipse approximation 48, is used for the valid portions of edge 38. The output of block 53 may be a pupil border 57 as shown in image 59. One may note two reflections 61 in the pupil of images 58 and 59. These reflections may be a pattern of the light used for analytical purposes of a pupil and so that the reflection on the pupil may be found and identified. Also, arrows 62 may repeat elliptic fitting data sent to blocks 53 and 54 for effecting an elliptic curve fit.


An enhancement to elliptic fitting may be added as a part of the elliptic fitting box 52. This enhancement may be a pruning of the pupil edge before doing a model fitting at block or module 52 (FIG. 2). The pruning may be used to smooth the curve edges and eliminate any mismatches of extraneous edges. In pruning, outliers are replaced with the likelihood edge within a predefined angular segment.



FIG. 6 is a diagram of an approach for an iris outer border analysis, curve fitting and portion removal or substitution. An eye image 21 may be processed through the median filter 24, respectively, which is noted herein. A kernel 91, which may be a matrix or block of pixels of the iris of the image 21, can be processed. A resulting image 93 for analysis may proceed to a cluster angular range module 92. The eye symmetry, as shown by inset 93, may proceed on to a POSE+ (illustrated in FIG. 7) segmentation module 94.



FIG. 7 reveals more detail (i.e., the 1D POSE+ subroutine) of the segmentation module 94. Two major portions of the eye image 93 go to module 94 for segmentation concerning sclera borders and eyelash borders. Input 96 for sclera borders may go to a 1D POSE segmentation submodule 98 and input 97 for eyelash borders may go to 1D POSE segmentation submodule 99. Information 67 of the pupil model fitting, center may be input to the submodules 98 and 99. An output of segmentation submodule 98 may go to a get max peak submodule 60 which in turn provides an output to a 1D median filter 102. Also input to median filter 102 may be a filter bandwidth 68. An output from segmentation submodule 99 may go to a get max peak submodule 101 which in turn provides an output to a 1D median filter 63. A filter bandwidth signal 68 may be provided to filter 63.


An output 64 from median filter 102 of module 94 may go to a (∂r/∂θ) module 71 for sclera borders, as shown in FIG. 6. An output 65 from median filter 63 may go to a (∂/∂θ) module 72 for eyelash/lid borders. Modules 71 and 72 may be of a border module 103. An output from module 71 may go to a count module 73, and an output from module 72 may go to a count module 74. Modules 73 and 74 may be of a count module 104. If the count at module 73 is not less than λ, where λ is threshold, then there is not a valid eye image 75. If the count is less than λ, then a circular, elliptic, or the like, fitting may be placed on the iris outer sclera borders at module 76. If the count at module 74 is not greater than λ, then the eyelash edges may be extracted at module 77. This may involve 1D POSE+. If the count at module 74 is greater than λ, then the eyelashes may be masked at module 78. This may involve POSE 1D. λmay be a number indicating a number of hits or places where a curve discontinues. The range of λ may be around 3 or 4. Under certain circumstances of more tolerance, λ may be set to be 5 or greater.


A combined output 66 from the 1D median filters 102 and 63 may go to a map analysis center 81. Also, outputs from the circular fitting module 76, the extract eyelash edges module 77 and the mask eyelashes module 78 may go to a center 81 for a map analysis.


The preprocessing may include the filter or combination 30 of a median 23 and low pass filter 24 of FIG. 6 to smooth the iris texture while preserving the strong edge of the contrast change at the outer border of the iris. One may then cluster the angular range into two categories. Boundary points may be clustered. With the occlusion of the iris by the eyelids and eyelids, there may be two groups of boundary points around the outer bounds of the iris that may be treated differently in the present analysis. The groups may be iris sclera boundaries and iris eyelid boundaries. The two classes of points may be treated according to the expected distributions of edge pixels. To cluster the points into these two classes, one may use the symmetry method in POSE+ (see U.S. patent application Ser. No. 11/275,703, filed Jan. 25, 2006) where pixels placed symmetrically relative to each other in terms of curvature with smooth continuous edges.


In another approach, one may estimate the limits the symmetry ends by conducting the following steps. The lowermost edge points of the upper eyelid edge may be fit into a straight-line and the uppermost of the lower eyelid edge points may be fit into a straight line crossing the detected iris outer border curve (original curve detected by POSE). The intersection of these two straight lines and the curve may define a good estimate of the trapezoid contour of the eye socket. The intersection of these lines and the pre-estimated shape may define these boundary points. The POSE+ subroutine is shown with a diagram in FIG. 7.



FIG. 7 reveals more detail (i.e., the 1D POSE+ subroutine) of the segmentation module 94. Two major portions of the eye image 93 go to module 94 for segmentation concerning sclera borders and eyelash borders. Input 96 for sclera borders may go to a 1D POSE segmentation submodule 98 and input 97 for eyelash borders may go to 1D POSE segmentation submodule 99. Information 67 of the pupil ellipse fitting and center may be input to the submodules 98 and 99. An output of segmentation submodule 98 may go to a get max peak submodule 60 which in turn provides an output to a 1D median filter 102. Also input to median filter 102 may be a filter bandwidth 68. An output from segmentation submodule 99 may go to a get max peak submodule 101 which in turn provides an output to a 1D median filter 63. A filter bandwidth signal 68 may be provided to filter 63.


An output 64 from median filter 102 of module 94 may go to a (∂r/∂θ) module 71 for sclera borders. An output 65 from median filter 63 may go to a (∂/∂θ) module 72. An output from module 71 may go to a count module 73, and an output from module 72 may go to a count module 74. If the count at module 73 is not less than λ (where λ is as discussed herein), then there is not a valid eye image 75. If the count is less than λ, then a circular fitting may be placed on the iris outer sclera borders at module 76. If the count at module 74 is not greater than λ, then the eyelash edges may be extracted at module 77. This may involve 1D POSE+. If the count at module 74 is greater than λ, then the eyelashes may be masked at module 78. This may involve POSE 1D. A combined output 66 from the 1D median filters 102 and 63 may go to a map analysis center 81. Also, outputs from the circular fitting module 76, the extract eyelash edges module 77 and the mask eyelashes module 78 may go to a center 81 for a map analysis.


Eyelid detection may be noted. With the nature of eye closure under nominal conditions, there may be two possibilities for eye positioning. One is a wide-open eye and another partially open. In either case, one might only consider points of observable edges of iris in the curve fitting. To estimate the eyelid edges, one may track the lowermost points of the lowermost curve 82 (FIGS. 8a and 8b) of the upper eyelid 87 edge, and track the uppermost points of the upper curve 84 of the lower eyelid 88 edges. FIGS. 8a and 8b are graphs illustrating an approach for estimating eyelid curve detection. A piece-wise linear fitting 83 of the local minima of the curve 82 may be done for the upper eyelid 87. A piece-wise linear fitting 85 of the local maxima of the curve 84 may be done for the lower eyelid 88.


One may interpolate among these samples to cover the entire angular range corresponding to the eyelid segments, L=┐θ2−θ1┌. Thus,














(


x
k

,

x

k
-
1



)






pair





sequence


;









Let





Δ





x

=

(


x
k

,

x

k
-
1



)


;









Δ





f

=




f


(

x
k

)


-

f


(

x

k
-
1


)




Δ





x











x

k
-
1


<
x
<

x
k





,






f


(
x
)


=


f


(

x

k
-
1


)


+

Δ





x





Δ





f








(
1
)







One may limit the sampling space to a predefined angular range φ, so the next sampling point is determined using the following minimization equation, {tilde over (x)}k=min(xk−1+φ,xk). FIGS. 8a and 8b illustrate a technical approach for estimating the eyelids curve detections



FIG. 9 relates to eyelid detection and shows a picture of an eye 86 with an obscuration by an upper eyelid 87 and possible obscuration with a lower eyelid 88. This Figure illustrates a resulting output of a following process.


A weighting scheme may also be introduced to assess the obscuration amount of the eyelids, eyelashes or other manner of obscuration such as glass, a frame, and so forth. The obscuration may be assessed by computing the integral of the area between the eyelid curve and pupil boundary with the following equation,










m
o

=






Θ
1

->

Θ
2






(


r


(
θ
)


-


r
p



(
θ
)



)




θ





η
o






(
2
)








where θi represents the angles associated with the boundary curve of the eyelash/eyelid, and rp(θ) is the estimated pupil radius at angle θ. The integral may be evaluated over the angular range covered by eyelashes (and/or eyelids) and be based upon the value of the integral with respect to a pre-estimated threshold. A weighting factor may be assigned to these angular segments to be used in the matching function.


Once the iris region is successfully segmented using the POSE technique, the next stage may be to extract the valid sclera and iris boundary points and fit these edge points into a predefined regular shape, e.g., a circular shape. It is important to note that these regular shapes are generally not used as the final outcome of the detection. The regular shapes may be used for guiding the present normalization process and to keep the actual detected edges of the active contour that POSE has identified.


The normalization is crucial to iris processing to address dimensional changes of the iris shapes. These dimensional inconsistencies may be mainly due to the iris stretches and dilation of the pupil that usually undergoes different environment lightings as well as imaging distance variations. The regular shape is not meant to be the final outcome of the present estimates. The curve detected by the present active contour approach as an ensemble of all edges detected by POSE may be the final estimate of the iris outer border edges. The predefined shape may be used to scale back the curve shape into a common scaling for normalization purposes as well as an approach to identify areas that do not belong to the iris map and ought to be masked from the analysis. The regular shape may define the actual scaling needed to bring uniformity among all the captured images and templates in the database. The analytical formula for computing the scaled signal vector of the pixels along the radius variable is shown in the following,

{tilde over (s)}θ(r)=sθ(r)u(Re−r)+E[sθ(r)]θ,ru(r−Re),  (3)

where sθ(r) represents the pixel values at a radius r and angle θ. The function {tilde over (s)}(r) may represent the elements of the scaled vector that is used to map the iris pixels into the normalized iris pattern map (also referred to as a rubber sheet). One may use u(r) to denote the step function. The expected value of the signal function shown in equation (3) represents the expected value edge based upon the fitting model. For circular model, E[sθ(r)]=Re (circular radius).


A challenge in building the standoff iris recognition system may lie at how to extract and segment the boundaries of an iris and not necessarily the compression approach to encode the barcode of the extracted map. To complete the iris recognition process, iris encoding may usually be used to compress the iris map into fewer bits in a barcode to be stored or matched against other barcodes stored in a database. The iris encoding may be processed on the iris map to extract the pattern texture variations. What type of encoding or algorithm may be irrelevant here as there are many COTS approaches to encode a digital image. One may make use of Gabor filters to encode the iris map image to its minimum possible number of bits so that metrics can be used to give one range of values when comparing templates with capture maps. Similarly, any similarity metrics may be used to measure the information similarity among templates. One metric in particular that may be used is the weighted hamming distance (WHD). The WHD may give more weight to the pixels associated with valid edges and less weight to the pixels that are associated with non-valid pixels. The masked pixels may of course be zeroed out during the matching process.


The present system provides a solution to an issue of eye gazing where an individual subject is looking off angle and not straight to the camera system. Gazing effects on iris segmentation may be dramatic and trying to quantify the amount of eye gazing to correct for it may be regarded by many as challenging. A correction process may involve many geometrical models and assumptions that are not general and image specific. The model complexity and its analysis might not only reduce the robustness of the gaze detection estimations but also often introduce errors into the estimates. The present system does not require any gaze detection in that it is designed to deal with all image perspectives.


In iris feature extraction analysis, for instance, θ is with respect to a center 111 of a pupil 114, and θ+Δθ is with respect to the iris center 112, as shown in FIG. 10. The edge point 113 may be on the outside border of the iris 115. One usually needs the iris center to read relative to a corresponding angle. One may measure a distance from the center of the pupil to the edge of the iris. For a point 113 on the iris edge, at each angle, the map pixels are constructed using interpolation scheme to sample a predefined number of pixels at each angle that passes from the inner edge 117 to outer edge 113 with respect to the analysis center 111. The above analysis is applicable whether the fitting model is circular, an ellipse, or a non-linear fitting that may be parameterized (i.e., as a polynomial). One may select fixed size sample vectors from the pupil edge to the iris edge. Or, one may take samples from the pupil edge to the iris at a number of points.



FIG. 11 is a diagram of angular clustering where a focus is on the sclera, that is, the side portions 121 and 122 of the iris 142. One may start at an estimated edge and end up at a new edge. To start, the sclera portions 121 and 122 may appear symmetrical but probably will not end up as such in actuality. Each angle of the quadrants or portions may have a distinct value. The noisy portions at the top 123 and the bottom 124 may be treated differently than the side sclera portions 121 and 122. If the upper and lower portions 123 and 124, respectively, are too discontinuous or noisy, then they may be masked down through the iris 142 to the center of the pupil 141, as shown in FIG. 12.



FIG. 13 is a mapping 131 showing the noisy upper 123 and lower 124 portions relative to pupil 141 and iris 142. In a mapping 132FIG. 14, one may attempt to use information in the iris 142 the within a radius 133 of the iris 142 that does not extend into the portions 123 and 124. The mapping 151 of FIG. 15 shows a masking 145 and 146 that is complete from portions 123 and 124, respectively, through the iris 142 to the center of the pupil 141, as shown in FIG. 12. Since much information in the iris 142 may not be available as shown by the masking of FIGS. 12 and 15, a partial masking 147 and 148 of portions 123 and 124 may done according to a mapping 152 as shown in FIG. 16. Masking could be used right on the edges of the noisy pixels and therefore masking only those pixels that represent 124 and 123. Mapping 152 may make more iris information available.



FIG. 17 is a masking 161 of iris 142 showing the masking out of only the portions 123 and 124, plus some other minor noise, with zeros. Ones represent areas of iris information. FIG. 18 shows a masking 162 showing various masking schemes of noisy or obscured areas of the iris 142, such as a reflection 163, blurriness or obscuration 164, and other iris non-information spots near portions 123 and 124. The ones and zeros are merely approximations of example masks (for instance, the ones can be replaced with weights based upon the segmentation analysis as explained herein) as they are for illustrative purposes.


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


Although the invention 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 present 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
  • 1. A non-transitory computer readable medium containing instructions that, when executed by a computer, provides an iris recognition system comprising: an eyefinder;a filter connected to the eyefinder;a range module connected to the filter for setting a cluster angular range;a segmenter connected to the range determiner, wherein the segmenter is a one dimensional polar plus segmentation module and comprises: a first one dimensional polar segmenter, for sclera borders, connected to the range module;a second one dimensional polar segmenter, for eyelash/lid borders, connected to the range module;a first get max peak module connected to the first one dimensional polar segmenter;a second get max peak module connected to the second one dimensional polar segmenter;a first one dimensional median filter connected to the first get max peak module and to the border module; anda second one dimensional median filter connected to the second get max peak module and to the border module;a border module connected to the segmenter;a count module connected to the border module; anda curve fitter connected to the count module.
  • 2. The non-transitory computer readable medium of claim 1, wherein: the eyefinder is for providing a valid eye image having a processed pupil border; andthe filter is for smoothing out edges in the eye image.
  • 3. The non-transitory computer readable medium of claim 1, further containing instructions such that the iris recognition system further comprises a kernel module, for selecting an image of an iris in the eye image, connected to the filter.
  • 4. The non-transitory computer readable medium of claim 1, further containing instructions such that the iris recognition system further comprises a map analysis module connected to the count module, the curve fitter and the segmenter.
  • 5. A non-transitory computer readable medium containing instructions that, when executed by a computer, provides an iris recognition system comprising: an eyefinder for providing a valid eye image having a processed pupil border;a filter connected to the eyefinder for smoothing out edges in the eye image;a range module connected to the filter;a segmenter connected to the range determiner;a border module connected to the segmenter, the border module comprising a sclera border module and an eyelash/lid border module;a count module connected to the border module, wherein the count module is for determining a number of discontinuities in sclera borders, and further wherein the count module is for determining a number of discontinuities in the eyelash/lid borders; anda curve fitter connected to the count module;wherein:if the number of discontinuities in the sclera borders is less than a first threshold, then the curve fitter is activated for curve fitting the sclera borders; andif the number of discontinuities in the sclera borders is not less than the first threshold, then the eye image is invalid.
  • 6. The non-transitory computer readable medium of claim 5, further containing instructions such that the iris recognition system further comprises a kernel module, for selecting an image of an iris in the eye image, connected to the filter.
  • 7. The non-transitory computer readable medium of claim 5, further containing instructions such that the iris recognition system further comprises a map analysis module connected to the count module, the curve fitter and the segmenter.
  • 8. The non-transitory computer readable medium of claim 5, wherein: the range module is for setting a cluster angular range; andthe segmenter is a one dimensional polar plus segmentation module.
  • 9. The non-transitory computer readable medium of claim 5, wherein: if the number of discontinuities in the eyelash/lid borders is greater than a second threshold, then the eyelash/lid borders are masked; andif the number of discontinuities in the eyelash/lid borders is not greater than the second threshold, then the eyelash/lid borders are extracted.
  • 10. A method for iris recognition comprising providing an image of an eye to a processor, the processor being configured to perform the steps of: selecting a pupil in the image;segmenting the pupil;determining a validity of portions of a border of the pupil;fitting a curve on at least invalid portions of the border of the pupil to form a resulting border of the pupil;selecting an iris with the pupil having the resulting border from the image of the eye;clustering iris sclera boundaries and the eyelash/lid boundaries of the iris into first and second groups of boundaries, respectively; anddetermining a first number of discontinuities of the first group of boundaries; wherein:if the first number is less than a first threshold, then the first group of boundaries is fitted with a curve fitting model; andif the first number is not less than the first threshold, then the eye image is invalid.
  • 11. The method of claim 10, wherein the processor is further configured to perform the step of: determining a second number of discontinuities of the second group of boundaries; andfurther wherein:if the second number is not greater than a second threshold, then the second group of boundaries is extracted;if the second number is not greater than the second threshold and an area between outer borders of the second group of boundaries and an inner border of the iris is less than a third threshold, then the second group of boundaries are weighted accordingly; andif the second number is greater than the second threshold, then the second group of boundaries is masked; andfurther comprising mapping the iris.
  • 12. The method of claim 10, wherein the processor is further configured to perform the step of constructing an iris map based upon actual inner and outer edge estimates with respect to fitting models.
  • 13. The method of claim 12, wherein the processor is further configured such that pixels of the iris map are extracted based upon an interpolation of image pixels within inner fitting model and outer fitting model edges at nearly all angles, deemed to be valid, with respect to a pupil center.
  • 14. The method of claim 12, wherein the processor is further configured such that nearly any pixel that lies within an outer border of the iris and a fitting model shape may be masked.
  • 15. The method of claim 12, wherein the processor is further configured such that nearly any pixel that lies outside an outer fitting model shape may be discarded.
Parent Case Info

This application is a continuation-in-part of U.S. patent application Ser. No. 11/275,703, filed Jan. 25, 2006, which claims the benefit of U.S. Provisional Application No. 60/647,270, filed Jan. 26, 2005. This application is a continuation-in-part of U.S. patent application Ser. No. 11/043,366, filed Jan. 26, 2005. This application is a continuation-in-part of U.S. patent application Ser. No. 11/372,854, filed Mar. 10, 2006; This application is a continuation-in-part of U.S. patent application Ser. No. 11/672,108, filed Feb. 7, 2007. This application claims the benefit of U.S. Provisional Application No. 60/778,770, filed Mar. 3, 2006.

Government Interests

The government may have rights in the present invention.

US Referenced Citations (395)
Number Name Date Kind
4641349 Flom et al. Feb 1987 A
4836670 Hutchinson Jun 1989 A
5231674 Cleveland et al. Jul 1993 A
5291560 Daugman Mar 1994 A
5293427 Ueno et al. Mar 1994 A
5359382 Uenaka Oct 1994 A
5404013 Tajima Apr 1995 A
5551027 Choy et al. Aug 1996 A
5572596 Wildes et al. Nov 1996 A
5608472 Szirth et al. Mar 1997 A
5664239 Nakata Sep 1997 A
5717512 Chmielewski, Jr. et al. Feb 1998 A
5751836 Wildes et al. May 1998 A
5859686 Aboutalib et al. Jan 1999 A
5860032 Iwane Jan 1999 A
5896174 Nakata Apr 1999 A
5901238 Matsushita May 1999 A
5909269 Isogai et al. Jun 1999 A
5953440 Zhang et al. Sep 1999 A
5956122 Doster Sep 1999 A
5978494 Zhang Nov 1999 A
6005704 Chmielewski, Jr. et al. Dec 1999 A
6007202 Apple et al. Dec 1999 A
6012376 Hanke et al. Jan 2000 A
6021210 Camus et al. Feb 2000 A
6028949 McKendall Feb 2000 A
6055322 Salganicoff et al. Apr 2000 A
6064752 Rozmus et al. May 2000 A
6069967 Rozmus et al. May 2000 A
6081607 Mori et al. Jun 2000 A
6088470 Camus et al. Jul 2000 A
6091899 Konishi et al. Jul 2000 A
6101477 Hohle et al. Aug 2000 A
6104431 Inoue et al. Aug 2000 A
6108636 Yap et al. Aug 2000 A
6119096 Mann et al. Sep 2000 A
6120461 Smyth Sep 2000 A
6134339 Luo Oct 2000 A
6144754 Okano et al. Nov 2000 A
6246751 Bergl et al. Jun 2001 B1
6247813 Kim et al. Jun 2001 B1
6252977 Salganicoff et al. Jun 2001 B1
6282475 Washington Aug 2001 B1
6285505 Melville et al. Sep 2001 B1
6285780 Yamakita et al. Sep 2001 B1
6289113 McHugh et al. Sep 2001 B1
6299306 Braithwaite et al. Oct 2001 B1
6308015 Matsumoto Oct 2001 B1
6309069 Seal et al. Oct 2001 B1
6320610 Van Sant et al. Nov 2001 B1
6320612 Young Nov 2001 B1
6320973 Suzaki et al. Nov 2001 B2
6323761 Son Nov 2001 B1
6325765 Hay et al. Dec 2001 B1
6330674 Angelo et al. Dec 2001 B1
6332193 Glass et al. Dec 2001 B1
6344683 Kim Feb 2002 B1
6370260 Pavlidis et al. Apr 2002 B1
6377699 Musgrave et al. Apr 2002 B1
6393136 Amir et al. May 2002 B1
6400835 Lemelson et al. Jun 2002 B1
6424727 Musgrave et al. Jul 2002 B1
6424845 Emmoft et al. Jul 2002 B1
6433818 Steinberg et al. Aug 2002 B1
6438752 McClard Aug 2002 B1
6441482 Foster Aug 2002 B1
6446045 Stone et al. Sep 2002 B1
6483930 Musgrave et al. Nov 2002 B1
6484936 Nicoll et al. Nov 2002 B1
6490443 Freeny, Jr. Dec 2002 B1
6493363 Weaver et al. Dec 2002 B1
6493669 Curry et al. Dec 2002 B1
6494363 Roger et al. Dec 2002 B1
6503163 Van Sant et al. Jan 2003 B1
6505193 Musgrave et al. Jan 2003 B1
6506078 Mori et al. Jan 2003 B1
6508397 Do Jan 2003 B1
6516078 Yang et al. Feb 2003 B1
6516087 Camus Feb 2003 B1
6516416 Gregg et al. Feb 2003 B2
6522772 Morrison et al. Feb 2003 B1
6523165 Liu et al. Feb 2003 B2
6526160 Ito Feb 2003 B1
6532298 Cambier et al. Mar 2003 B1
6540392 Braithwaite Apr 2003 B1
6542624 Oda Apr 2003 B1
6546121 Oda Apr 2003 B1
6553494 Glass Apr 2003 B1
6580356 Alt et al. Jun 2003 B1
6591001 Oda et al. Jul 2003 B1
6591064 Higashiyama et al. Jul 2003 B2
6594377 Kim et al. Jul 2003 B1
6594399 Camus et al. Jul 2003 B1
6598971 Cleveland Jul 2003 B2
6600878 Pregara Jul 2003 B2
6614919 Suzaki et al. Sep 2003 B1
6652099 Chae et al. Nov 2003 B2
6674367 Sweatte Jan 2004 B2
6690997 Rivalto Feb 2004 B2
6708176 Strunk et al. Mar 2004 B2
6711562 Ross et al. Mar 2004 B1
6714665 Hanna et al. Mar 2004 B1
6718049 Pavlidis et al. Apr 2004 B2
6718665 Hess et al. Apr 2004 B2
6732278 Baird, III et al. May 2004 B2
6734783 Anbai May 2004 B1
6745520 Puskaric et al. Jun 2004 B2
6750435 Ford Jun 2004 B2
6751733 Nakamura et al. Jun 2004 B1
6753919 Daugman Jun 2004 B1
6754640 Bozeman Jun 2004 B2
6760467 Min et al. Jul 2004 B1
6765470 Shinzaki Jul 2004 B2
6766041 Golden et al. Jul 2004 B2
6775774 Harper Aug 2004 B1
6785406 Kamada Aug 2004 B1
6793134 Clark Sep 2004 B2
6819219 Bolle et al. Nov 2004 B1
6829370 Pavlidis et al. Dec 2004 B1
6832044 Doi et al. Dec 2004 B2
6836554 Bolle et al. Dec 2004 B1
6837436 Swartz et al. Jan 2005 B2
6845479 Illman Jan 2005 B2
6853444 Haddad Feb 2005 B2
6867683 Calvesio et al. Mar 2005 B2
6873960 Wood et al. Mar 2005 B1
6896187 Stockhammer May 2005 B2
6905411 Nguyen et al. Jun 2005 B2
6920237 Chen et al. Jul 2005 B2
6930707 Bates et al. Aug 2005 B2
6934849 Kramer et al. Aug 2005 B2
6950139 Fujinawa Sep 2005 B2
6954738 Wang et al. Oct 2005 B2
6957341 Rice et al. Oct 2005 B2
6972797 Izumi Dec 2005 B2
6992562 Fuks et al. Jan 2006 B2
7053948 Konishi May 2006 B2
7071971 Elberbaum Jul 2006 B2
7084904 Liu et al. Aug 2006 B2
7136581 Fujii Nov 2006 B2
7183895 Bazakos et al. Feb 2007 B2
7184577 Chen et al. Feb 2007 B2
7197173 Jones et al. Mar 2007 B2
7204425 Mosher, Jr. et al. Apr 2007 B2
7277561 Shin Oct 2007 B2
7277891 Howard et al. Oct 2007 B2
7298873 Miller, Jr. et al. Nov 2007 B2
7315233 Yuhara Jan 2008 B2
7362210 Bazakos et al. Apr 2008 B2
7362370 Sakamoto et al. Apr 2008 B2
7362884 Willis et al. Apr 2008 B2
7365771 Kahn et al. Apr 2008 B2
7406184 Wolff et al. Jul 2008 B2
7414648 Imada Aug 2008 B2
7417682 Kuwakino et al. Aug 2008 B2
7418115 Northcott et al. Aug 2008 B2
7421097 Hamza et al. Sep 2008 B2
7443441 Hiraoka Oct 2008 B2
7460693 Loy et al. Dec 2008 B2
7471451 Dent et al. Dec 2008 B2
7486806 Azuma et al. Feb 2009 B2
7518651 Butterworth Apr 2009 B2
7537568 Moehring May 2009 B2
7538326 Johnson et al. May 2009 B2
7542945 Thompson et al. Jun 2009 B2
7580620 Raskar et al. Aug 2009 B2
7593550 Hamza Sep 2009 B2
7639846 Yoda Dec 2009 B2
7722461 Gatto et al. May 2010 B2
7751598 Matey et al. Jul 2010 B2
7756301 Hamza Jul 2010 B2
7756407 Raskar Jul 2010 B2
7761453 Hamza Jul 2010 B2
7777802 Shinohara et al. Aug 2010 B2
7804982 Howard et al. Sep 2010 B2
20010026632 Tamai Oct 2001 A1
20010027116 Baird Oct 2001 A1
20010047479 Bromba et al. Nov 2001 A1
20010051924 Uberti Dec 2001 A1
20010054154 Tam Dec 2001 A1
20020010857 Karthik Jan 2002 A1
20020033896 Hatano Mar 2002 A1
20020039433 Shin Apr 2002 A1
20020040434 Elliston et al. Apr 2002 A1
20020062280 Zachariassen et al. May 2002 A1
20020077841 Thompson Jun 2002 A1
20020089157 Breed et al. Jul 2002 A1
20020106113 Park Aug 2002 A1
20020112177 Voltmer et al. Aug 2002 A1
20020114495 Chen et al. Aug 2002 A1
20020130961 Lee et al. Sep 2002 A1
20020131622 Lee et al. Sep 2002 A1
20020139842 Swaine Oct 2002 A1
20020140715 Smet Oct 2002 A1
20020142844 Kerr Oct 2002 A1
20020144128 Rahman et al. Oct 2002 A1
20020150281 Cho Oct 2002 A1
20020154794 Cho Oct 2002 A1
20020158750 Almalik Oct 2002 A1
20020164054 McCartney et al. Nov 2002 A1
20020175182 Matthews Nov 2002 A1
20020186131 Fettis Dec 2002 A1
20020191075 Doi et al. Dec 2002 A1
20020191076 Wada et al. Dec 2002 A1
20020194128 Maritzen et al. Dec 2002 A1
20020194131 Dick Dec 2002 A1
20020198731 Barnes et al. Dec 2002 A1
20030002714 Wakiyama Jan 2003 A1
20030012413 Kusakari et al. Jan 2003 A1
20030014372 Wheeler et al. Jan 2003 A1
20030020828 Ooi et al. Jan 2003 A1
20030038173 Blackson et al. Feb 2003 A1
20030046228 Berney Mar 2003 A1
20030053663 Chen et al. Mar 2003 A1
20030055689 Block et al. Mar 2003 A1
20030055787 Fujii Mar 2003 A1
20030058492 Wakiyama Mar 2003 A1
20030061172 Robinson Mar 2003 A1
20030061233 Manasse et al. Mar 2003 A1
20030065626 Allen Apr 2003 A1
20030071743 Seah et al. Apr 2003 A1
20030072475 Tamori Apr 2003 A1
20030073499 Reece Apr 2003 A1
20030074317 Hofi Apr 2003 A1
20030074326 Byers Apr 2003 A1
20030076161 Tisse Apr 2003 A1
20030076300 Lauper et al. Apr 2003 A1
20030076984 Tisse et al. Apr 2003 A1
20030080194 O'Hara et al. May 2003 A1
20030091215 Lauper et al. May 2003 A1
20030092489 Veradej May 2003 A1
20030095689 Volkommer et al. May 2003 A1
20030098776 Friedli May 2003 A1
20030099379 Monk et al. May 2003 A1
20030099381 Ohba May 2003 A1
20030103652 Lee et al. Jun 2003 A1
20030107097 McArthur et al. Jun 2003 A1
20030107645 Yoon Jun 2003 A1
20030108224 Ike Jun 2003 A1
20030108225 Li Jun 2003 A1
20030115148 Takhar Jun 2003 A1
20030115459 Monk Jun 2003 A1
20030116630 Carey et al. Jun 2003 A1
20030118212 Min et al. Jun 2003 A1
20030118217 Kondo et al. Jun 2003 A1
20030123711 Kim et al. Jul 2003 A1
20030125054 Garcia Jul 2003 A1
20030125057 Pesola Jul 2003 A1
20030126560 Kurapati et al. Jul 2003 A1
20030131245 Linderman Jul 2003 A1
20030131265 Bhakta Jul 2003 A1
20030133597 Moore et al. Jul 2003 A1
20030140235 Immega et al. Jul 2003 A1
20030140928 Bui et al. Jul 2003 A1
20030141411 Pandya et al. Jul 2003 A1
20030149881 Patel et al. Aug 2003 A1
20030152251 Ike Aug 2003 A1
20030152252 Kondo et al. Aug 2003 A1
20030156741 Lee et al. Aug 2003 A1
20030158762 Wu Aug 2003 A1
20030158821 Maia Aug 2003 A1
20030159051 Hollnagel Aug 2003 A1
20030163739 Armington et al. Aug 2003 A1
20030169334 Braithwaite et al. Sep 2003 A1
20030169901 Pavlidis et al. Sep 2003 A1
20030169907 Edwards et al. Sep 2003 A1
20030173408 Mosher, Jr. et al. Sep 2003 A1
20030174049 Beigel et al. Sep 2003 A1
20030177051 Driscoll et al. Sep 2003 A1
20030182151 Taslitz Sep 2003 A1
20030182182 Kocher Sep 2003 A1
20030189480 Hamid Oct 2003 A1
20030189481 Hamid Oct 2003 A1
20030191949 Odagawa Oct 2003 A1
20030194112 Lee Oct 2003 A1
20030195935 Leeper Oct 2003 A1
20030198368 Kee Oct 2003 A1
20030200180 Phelan, III et al. Oct 2003 A1
20030210139 Brooks et al. Nov 2003 A1
20030210802 Schuessier Nov 2003 A1
20030218719 Abourizk et al. Nov 2003 A1
20030225711 Paping Dec 2003 A1
20030228898 Rowe Dec 2003 A1
20030233556 Angelo et al. Dec 2003 A1
20030235326 Morikawa et al. Dec 2003 A1
20030235411 Morikawa et al. Dec 2003 A1
20030236120 Reece et al. Dec 2003 A1
20040001614 Russon et al. Jan 2004 A1
20040002894 Kocher Jan 2004 A1
20040005078 Tillotson Jan 2004 A1
20040006553 de Vries et al. Jan 2004 A1
20040010462 Moon et al. Jan 2004 A1
20040012760 Mihashi et al. Jan 2004 A1
20040019570 Bolle et al. Jan 2004 A1
20040023664 Mirouze et al. Feb 2004 A1
20040023709 Beaulieu et al. Feb 2004 A1
20040025030 Corbett-Clark et al. Feb 2004 A1
20040025031 Ooi et al. Feb 2004 A1
20040025053 Hayward Feb 2004 A1
20040029564 Hodge Feb 2004 A1
20040030930 Nomura Feb 2004 A1
20040035123 Kim et al. Feb 2004 A1
20040037450 Bradski Feb 2004 A1
20040039914 Barr et al. Feb 2004 A1
20040042641 Jakubowski Mar 2004 A1
20040044627 Russell et al. Mar 2004 A1
20040046640 Jourdain et al. Mar 2004 A1
20040049687 Orsini et al. Mar 2004 A1
20040050924 Mletzko et al. Mar 2004 A1
20040050930 Rowe Mar 2004 A1
20040052405 Walfridsson Mar 2004 A1
20040052418 DeLean Mar 2004 A1
20040059590 Mercredi et al. Mar 2004 A1
20040059953 Purnell Mar 2004 A1
20040104266 Bolle et al. Jun 2004 A1
20040117636 Cheng Jun 2004 A1
20040133804 Smith et al. Jul 2004 A1
20040146187 Jeng Jul 2004 A1
20040148526 Sands et al. Jul 2004 A1
20040160518 Park Aug 2004 A1
20040162870 Matsuzaki et al. Aug 2004 A1
20040162984 Freeman et al. Aug 2004 A1
20040169817 Grotehusmann et al. Sep 2004 A1
20040172541 Ando et al. Sep 2004 A1
20040174070 Voda et al. Sep 2004 A1
20040190759 Caldwell Sep 2004 A1
20040193893 Braithwaite et al. Sep 2004 A1
20040219902 Lee et al. Nov 2004 A1
20040233038 Beenau et al. Nov 2004 A1
20040240711 Hamza et al. Dec 2004 A1
20040252866 Tisse et al. Dec 2004 A1
20040255168 Murashita et al. Dec 2004 A1
20050008200 Azuma et al. Jan 2005 A1
20050008201 Lee et al. Jan 2005 A1
20050012817 Hampapur et al. Jan 2005 A1
20050029353 Isemura et al. Feb 2005 A1
20050052566 Kato Mar 2005 A1
20050055582 Bazakos et al. Mar 2005 A1
20050063567 Saitoh et al. Mar 2005 A1
20050084137 Kim et al. Apr 2005 A1
20050084179 Hanna et al. Apr 2005 A1
20050099288 Spitz et al. May 2005 A1
20050102502 Sagen May 2005 A1
20050110610 Bazakos et al. May 2005 A1
20050125258 Yellin et al. Jun 2005 A1
20050127161 Smith et al. Jun 2005 A1
20050129286 Hekimian Jun 2005 A1
20050134796 Zelvin et al. Jun 2005 A1
20050138385 Friedli et al. Jun 2005 A1
20050138387 Lam et al. Jun 2005 A1
20050146640 Shibata Jul 2005 A1
20050151620 Neumann Jul 2005 A1
20050152583 Kondo et al. Jul 2005 A1
20050193212 Yuhara Sep 2005 A1
20050199708 Friedman Sep 2005 A1
20050206501 Farhat Sep 2005 A1
20050206502 Bernitz Sep 2005 A1
20050207614 Schonberg et al. Sep 2005 A1
20050210267 Sugano et al. Sep 2005 A1
20050210270 Rohatgi et al. Sep 2005 A1
20050210271 Chou et al. Sep 2005 A1
20050238214 Matsuda et al. Oct 2005 A1
20050240778 Saito Oct 2005 A1
20050248725 Ikoma et al. Nov 2005 A1
20050249385 Kondo et al. Nov 2005 A1
20050255840 Markham Nov 2005 A1
20060093190 Cheng et al. May 2006 A1
20060147094 Yoo Jul 2006 A1
20060165266 Hamza Jul 2006 A1
20060274919 LoIacono et al. Dec 2006 A1
20070036397 Hamza Feb 2007 A1
20070160266 Jones et al. Jul 2007 A1
20070189582 Hamza et al. Aug 2007 A1
20070206840 Jacobson Sep 2007 A1
20070211924 Hamza Sep 2007 A1
20070274570 Hamza Nov 2007 A1
20070274571 Hamza Nov 2007 A1
20070286590 Terashima Dec 2007 A1
20080005578 Shafir Jan 2008 A1
20080075334 Determan et al. Mar 2008 A1
20080075441 Jelinek et al. Mar 2008 A1
20080104415 Palti-Wasserman et al. May 2008 A1
20080148030 Goffin Jun 2008 A1
20080211347 Wright et al. Sep 2008 A1
20080252412 Larsson et al. Oct 2008 A1
20080267456 Anderson Oct 2008 A1
20090046899 Northcott et al. Feb 2009 A1
20090092283 Whillock et al. Apr 2009 A1
20090316993 Brasnett et al. Dec 2009 A1
20100002913 Hamza Jan 2010 A1
20100033677 Jelinek Feb 2010 A1
20100034529 Jelinek Feb 2010 A1
20100142765 Hamza Jun 2010 A1
20100182440 McCloskey Jul 2010 A1
20100239119 Bazakos et al. Sep 2010 A1
Foreign Referenced Citations (188)
Number Date Country
0484076 May 1992 EP
0593386 Apr 1994 EP
0878780 Nov 1998 EP
0899680 Mar 1999 EP
0910986 Apr 1999 EP
0962894 Dec 1999 EP
1018297 Jul 2000 EP
1024463 Aug 2000 EP
1028398 Aug 2000 EP
1041506 Oct 2000 EP
1041523 Oct 2000 EP
1126403 Aug 2001 EP
1139270 Oct 2001 EP
1237117 Sep 2002 EP
1477925 Nov 2004 EP
1635307 Mar 2006 EP
2369205 May 2002 GB
2371396 Jul 2002 GB
2375913 Nov 2002 GB
2402840 Dec 2004 GB
2411980 Sep 2005 GB
9161135 Jun 1997 JP
9198545 Jul 1997 JP
9201348 Aug 1997 JP
9147233 Sep 1997 JP
9234264 Sep 1997 JP
9305765 Nov 1997 JP
9319927 Dec 1997 JP
10021392 Jan 1998 JP
10040386 Feb 1998 JP
10049728 Feb 1998 JP
10137219 May 1998 JP
10137221 May 1998 JP
10137222 May 1998 JP
10137223 May 1998 JP
10248827 Sep 1998 JP
10269183 Oct 1998 JP
11047117 Feb 1999 JP
11089820 Apr 1999 JP
11200684 Jul 1999 JP
11203478 Jul 1999 JP
11213047 Aug 1999 JP
11339037 Dec 1999 JP
2000005149 Jan 2000 JP
2000005150 Jan 2000 JP
2000011163 Jan 2000 JP
2000023946 Jan 2000 JP
2000083930 Mar 2000 JP
2000102510 Apr 2000 JP
2000102524 Apr 2000 JP
2000105830 Apr 2000 JP
2000107156 Apr 2000 JP
2000139878 May 2000 JP
2000155863 Jun 2000 JP
2000182050 Jun 2000 JP
2000185031 Jul 2000 JP
2000194972 Jul 2000 JP
2000237167 Sep 2000 JP
2000242788 Sep 2000 JP
2000259817 Sep 2000 JP
2000356059 Dec 2000 JP
2000357232 Dec 2000 JP
2001005948 Jan 2001 JP
2001067399 Mar 2001 JP
2001101429 Apr 2001 JP
2001167275 Jun 2001 JP
2001222661 Aug 2001 JP
2001292981 Oct 2001 JP
2001297177 Oct 2001 JP
2001358987 Dec 2001 JP
2002119477 Apr 2002 JP
2002133415 May 2002 JP
2002153444 May 2002 JP
2002153445 May 2002 JP
2002260071 Sep 2002 JP
2002271689 Sep 2002 JP
2002286650 Oct 2002 JP
2002312772 Oct 2002 JP
2002329204 Nov 2002 JP
2003006628 Jan 2003 JP
2003036434 Feb 2003 JP
2003108720 Apr 2003 JP
2003108983 Apr 2003 JP
2003132355 May 2003 JP
2003150942 May 2003 JP
2003153880 May 2003 JP
2003242125 Aug 2003 JP
2003271565 Sep 2003 JP
2003271940 Sep 2003 JP
2003308522 Oct 2003 JP
2003308523 Oct 2003 JP
2003317102 Nov 2003 JP
2003331265 Nov 2003 JP
2004005167 Jan 2004 JP
2004021406 Jan 2004 JP
2004030334 Jan 2004 JP
2004038305 Feb 2004 JP
2004094575 Mar 2004 JP
2004152046 May 2004 JP
2004163356 Jun 2004 JP
2004164483 Jun 2004 JP
2004171350 Jun 2004 JP
2004171602 Jun 2004 JP
2004206444 Jul 2004 JP
2004220376 Aug 2004 JP
2004261515 Sep 2004 JP
2004280221 Oct 2004 JP
2004280547 Oct 2004 JP
2004287621 Oct 2004 JP
2004315127 Nov 2004 JP
2004318248 Nov 2004 JP
2005004524 Jan 2005 JP
2005011207 Jan 2005 JP
2005025577 Jan 2005 JP
2005038257 Feb 2005 JP
2005062990 Mar 2005 JP
2005115961 Apr 2005 JP
2005148883 Jun 2005 JP
2005242677 Sep 2005 JP
WO 9717674 May 1997 WO
WO 9721188 Jun 1997 WO
WO 9802083 Jan 1998 WO
WO 9808439 Mar 1998 WO
WO 9932317 Jul 1999 WO
WO 9952422 Oct 1999 WO
WO 9965175 Dec 1999 WO
WO 0028484 May 2000 WO
WO 0029986 May 2000 WO
WO 0031677 Jun 2000 WO
WO 0036605 Jun 2000 WO
WO 0062239 Oct 2000 WO
WO 0101329 Jan 2001 WO
WO 0103100 Jan 2001 WO
WO 0128476 Apr 2001 WO
WO 0135348 May 2001 WO
WO 0135349 May 2001 WO
WO 0140982 Jun 2001 WO
WO 0163994 Aug 2001 WO
WO 0169490 Sep 2001 WO
WO 0186599 Nov 2001 WO
WO 0201451 Jan 2002 WO
WO 0219030 Mar 2002 WO
WO 0235452 May 2002 WO
WO 0235480 May 2002 WO
WO 02091735 Nov 2002 WO
WO 02095657 Nov 2002 WO
WO 03002387 Jan 2003 WO
WO 03003910 Jan 2003 WO
WO 03054777 Jul 2003 WO
WO 03077077 Sep 2003 WO
WO 2004029863 Apr 2004 WO
WO 2004042646 May 2004 WO
WO 2004055737 Jul 2004 WO
WO 2004089214 Oct 2004 WO
WO 2004097743 Nov 2004 WO
WO 2005008567 Jan 2005 WO
WO 2005013181 Feb 2005 WO
WO 2005024698 Mar 2005 WO
WO 2005024708 Mar 2005 WO
WO 2005024709 Mar 2005 WO
WO 2005029388 Mar 2005 WO
WO 2005062235 Jul 2005 WO
WO 2005069252 Jul 2005 WO
WO 2005093510 Oct 2005 WO
WO 2005093681 Oct 2005 WO
WO 2005096962 Oct 2005 WO
WO 2005098531 Oct 2005 WO
WO 2005104704 Nov 2005 WO
WO 2005109344 Nov 2005 WO
WO 2006012645 Feb 2006 WO
WO 2006023046 Mar 2006 WO
WO 2006051462 May 2006 WO
WO 2006063076 Jun 2006 WO
2006081209 Aug 2006 WO
WO 2006081505 Aug 2006 WO
WO 2007101269 Sep 2007 WO
WO 2007101275 Sep 2007 WO
WO 2007101276 Sep 2007 WO
WO 2007103698 Sep 2007 WO
WO 2007103701 Sep 2007 WO
WO 2007103833 Sep 2007 WO
WO 2007103834 Sep 2007 WO
WO 2008016724 Feb 2008 WO
WO 2008019168 Feb 2008 WO
WO 2008019169 Feb 2008 WO
WO 2008021584 Feb 2008 WO
WO 2008031089 Mar 2008 WO
WO 2008040026 Apr 2008 WO
Related Publications (1)
Number Date Country
20070140531 A1 Jun 2007 US
Provisional Applications (2)
Number Date Country
60647270 Jan 2005 US
60778770 Mar 2006 US
Continuation in Parts (5)
Number Date Country
Parent 11275703 Jan 2006 US
Child 11675424 US
Parent 11675424 US
Child 11675424 US
Parent 11672108 Feb 2007 US
Child 11675424 US
Parent 11372854 Mar 2006 US
Child 11672108 US
Parent 11043366 Jan 2005 US
Child 11372854 US