Iris Feature Extraction and Recognition using Triplet Halfband Filterbank Designed with Euler Frobenius Polynomial

Iris Feature Extraction and Recognition using Triplet Halfband Filterbank Designed with Euler Frobenius Polynomial

1st AliAsgar Udaipurwala

dept of Instrumentation Engineering RAIT (University of Mumbai.) Navi-Mumbai, India

2nd Shruti Mishra

dept of Instrumentation Engineering RAIT (University of Mumbai.) Navi-Mumbai, India

3rd Suraj Rasam

dept of Instrumentation Engineering RAIT (University of Mumbai.) Navi-Mumbai, India

4th Mukund Nagare

dept of Instrumentation Engineering RAIT (University of Mumbai.) Navi-Mumbai, India

AbstractIris Recognition has gained a great consideration for person authentication systems in various fields. Due to its high accuracy and uniqueness, iris recognition technology can be used in various domains of access control and security at borders. In this paper, new methodology for iris feature extractions based on triplet halfband filterbanks is proposed. Firstly, biorthogonal perfect reconstruction halfband filterbank is designed using Euler Frobenius halfband polynomial (EFHP). We use EFHP in three step lifting structure to determine analysis low-pass and high-pass filters. The lifting halfband kernels are designed using EFHP. The proposed filters are used to extract the iris features using discrete wavelet transform. The designed filters satisfy the linear phase and PR property. It has been shown that the proposed method efficiently captures the feature of Iris images which assures better recognition rate. Several examples are given on iris images to demonstrate the method.

Index Termsimage processing, iris recognition, wavelet FBs

1. INTRODUCTION

   A biometric system provides recognition of a person based on the basis of unique feature which is possessed by the person. There are various biometric systems that have been developed based on fingerprints, facial features, voice, retina, and iris. The demand for the iris recognition system is increasing daily. This system is known for its accuracy, uniqueness and reliability. It is the most robust identification and authentication features among all the others types of biometric features. The human iris remains unchanged through ones lifetime. Most commercial iris recognition systems use patented algorithms developed by Daugman [1][3].

   The main motivation to consider Iris images as biometric trait is because because every individual human beings has a

   different iris patterns. The iris is a thin circular concentric ring like structure, which lies between the cornea and the lens of the human eye. The iris is an externally visible, yet protected organ whose unique epigenetic pattern remains stable throughout adult life. These features of the iris makes it very attractive for use as a biometric for identifying a person [4]. Different image processing transforms can be used to extract the unique iris pattern from a digital image of the iris, encode it into a biometric template, and can be stored in the form of database. This template consists mathematical representation of the unique information stored in the iris, and allows one to one comparisons between templates.

   The iris recognition system consists of an automatic seg- mentation, and is also able to localize the circular iris and pupil regions excluding the eyelids, eyelashes and reflections. The iris region which was extracted is normalized into rectangular block with constant dimensions. Most of the biometric systems allow two modes of operation. An enrollment mode for adding templates to a database, and an identification mode, where a template is created for an individual and then a match is searched for in the database of existing templates. Highly unique features are the characteristics of a good biometric so that the chance of any two people having the same characteristic will be minimal, stable so that the feature are not time dependent, and be easily captured in order to provide ease to the user, and prevent mismatch of the feature.

   The wavelet filterbanks (FBs) are popular in the signal and image processing applications, such as pattern recognition, compression, denoising, feature extraction, classification etc. Filterbanks can be classified into two types orthogonal or bi- orthogonal. The biorthogonal filterbanks are mostly chosen for

   the image processing applications, because it has linear phase criterion. The wavelet filters should have the properties such as tight frame bound ratio, regularity, high frequency selectivity etc. It is also important to deal with higher regularity measure in the filterbanks design and it is obtained by imposing zeros at = or z = 1 (aliasing frequency) for the low-pass filters. The zeros are referred as vanishing moments (VMs). In theory, maximum VMs give the smoother scaling function which represents the complex signals accurately. Therefore, the selection of VMs is a desirable criterion to take into con- sideration for designing the PR FBs. In this direction several filterbank design methods have been proposed in [5][7]. The commonly used method for designing different wavelet FBs is by using factorization of halfband polynomials [8]. The well known biorthogonal FBs, such as spline wavelet FBs, CDF- 9/7 [9] have been designed by the factorization method. The Lagrange halfband polynomial (LHBP) has been factorized to design filters. This polynomial has maximum number of zeros at z = 1, which give higher regularity measure [10]. Several directional filterbank designs are also proposed based on 2-D filters for iris recognition [11].

   In this paper, we propose a methodology for iris feature extractions based on triplet halfband filterbanks. The iris im- ages are transformed into normalized form using Daugmans model [12]. The normalized images give efficient and highly discriminating representation of the iris patterns, which can be used to extract unique features using discrete wavelet transform. We use newly designed biorthogonal filters in discrete wavelet transform to extract the iris features. The new Biorthogonal perfect reconstruction filters are designed using Euler Frobenius halfband polynomial (EFHP) [7]. We use three step lifting structure to determine analysis low-pass and high-pass filters. The lifting halfband kernels are designed

   using EFHP. The proposed filters are then used to extract the

   Fig. 1. A general structure of two-channel filterbanks.

   be met if alias cancellation is achieved. This can be achieved by selecting the following analysis and synthesis high-pass filters as

   H1(z) = z1F0(z) and (2)

   F1(z) = zH0(z) (3)

   The product filter is defined as P (z) = H0(z)F0(z). This product filter is related to special class halfband filters.

   B. Design of Euler Frobenius Halfband polynomial

   The Euler Frobenius Polynomials (EFP) are well known and have been used in the design of spline wavelets. The main advantage of using EFP is that, its coefficients are integers and polynomial is symmetric. Also, these coefficients are determined recursively. The generalized Euler Frobenius Polynomials (EFP) are defined as

   m

   Ef (z) = e(i + 1)zi (4)

   i=0

   where m represents the order of EFP and coefficients are obtained by

   m+1

   m+1

   iris features using discrete wavelet transform. The designed filters satisfy the linear phase and PR property. It has been shown that the proposed method efficiently captures the feature

   e(i + 1) =

   i

   i

   =0

   (1)

   (m + 2\

   f

   f

   (i + 1 f) . (5)

   of Iris images which assures better recognition rate.

2. <>PROPOSED FBS DESIGN USING EULER FROBENIUS POLYNOMIALS (EFP) AND LIFTING SCHEME

   In this section, we give design for two channel wavelet filterbanks using Euler Frobenius polynomial. The detailed design is given [13].

   1. Background of two channel Filterbanks

      Fig. 1 shows the general structure for two channel bi- orthogonal filterbanks. The four filters that form two channel filterbanks are analysis low-pass (H0(z)), analysis high-pass (H1(z)), synthesis low-pass (F0(z)) and synthesis high-pass (F1(z)). The two channel FBs is called PR FBs if it satisfy the following equation

      l

      l

      H (z)F (z) + H (z)F (z) = cz (1)

      In this work, we have used EFP to design the required halfband polynomial. The odd-length EFP are combined with VMs (zeros at z = 1) and introduced some independent parameters i so as to convert them into halfband polynomial. This new polynomial is called as Euler Frobenius halfband polynomial (EFHP) and given by

      L

      P (z) = (1 + z1) Ef (z) izi (6)

      i=0

      E

      E

      where, represents the number of VMs. The mth order EFP is represented by f (z). The product filter P (z) have order K = + m + L. The order of free polynomial is L = K/2

      1. The free parameters i are formulated such that the PR condition given in equation (1) is satisfied. The required Kth order kernel of the lifting scheme is given by

   0 0 0 0

   where, l is the amount of delay. The PR condition can always

   T(z) = zK/2P (z) 1 (7)

   We consider above equation to design the lifting kernels.

   Input

   T0

   T0

   Z-1

   P

   P0 H0

   T1

   T2

   T1

   T2

   0

   0

   P1 H1

   Fig. 2. A general structure of three step lifting.

   1. Lifting Scheme

      R l

      R l

      The proposed filters are constructed via three-step and four-step lifting structure. Fig. 2 shows the lifting structure for analysis filters. It is parametrized with three and four halfband filters. The analysis filterbank can be expressed in the polyphase matrix form

      = H0even H0odd . (8)

      H1even H1odd

      From polyphase matrix, we can find the filters H0 and H1 as

      H0(z) = H0even(z2) + z1H0odd(z2) (9)

      H1(z) = H1even(z2) + z1H1odd(z2). (10)

      Three-Step Lifting Scheme:: The analysis and synthesis low pass filters constructed with three lifting steps are given by

      2 2

      2 2

      0 0 1 0

      0 0 1 0

      H (z) = C { 1 + p + 1 T (z)(1 pT (z))} (11)

      1 + pT0(z) 1 p

      Fig. 3. Steps for iris recognition

      at = /2. Particularly, when p = 2 1, the frequency

      at = /2. Particularly, when p = 2 1, the frequency

      response magnitude at /2 is 1/2 for both analysis and synthesis low-pass filters.

3. PROPOSED METHODOLOGY FOR EFFICIENT IRIS FEATURE EXTRACTION USING BIORTHOGONAL WAVELET

   FILTERS

   The Figure 1 shows the steps to be followed for iris recogni- tion. The system is divided into enrollment and authentication modules. The enrollment process consists of iris acquisition, segmentation, normalization, and extraction of features from the iris image. These features are stored in the database as reference. During the recognition (decision) process, the test iris feature is compared with stored features. The first stage

   F0(z) = C1{(

   + T2(z)

   1 + p 1 + p

   in iris recognition is dealing with segmentation of iris. The

   main aim of this process is to localize the pupil (inner) and

   1 + p 1

   ×( 2 2 T1(z)(1 + pT0(z)))} (12)

   where, the kernels T0(z), T1(z) and T2(z) are designed from Kth order proposed halfband polynomial. The aim is to design lifting kernels T(z) with good frequency selectivity and

   regularity. The high-pass filters are obtained by using equation (3). The lifting parameter p is the degree of freedom which provides the flexibility for choosing the magnitude at = /2.

   1. Choice of lifting parameters

   Note that the filters and kernels obtained from above equa- tions are noncausal filters. Therefore, the causal kernels Ti(z) are obtained by applying /2 delays as:

   Ti(z) = z/2Pi(z) 1. (13)

   The parameters p0, p1 and p2 are determined by examining the passband and stopband response the analysis low-pass filter (H0(z)) and high-pass filter (H1(z)) as: p0 = p1 = (1 + p)/2 and p2 = (1 p)/(1 + p). The free parameter pi can be used provide flexibility for shaping the frequency response of the resulting filters and its value is set in the range of 0 < p < 1 . With the appropriate value of p, we can set the frequency response of designed filters to any desired value

   the scleric (outer) borders. The shape can be assumed either elliptical or circular in shape for two detected borders. It is required to compensate for variations in pupil size and the acquired image capturing distances. This is done by translating the region of the iris which is segmented into a defined length and polar coordinates system which are dimensionless. This stage is mostly implemented by the method proposed by Daugman [14]. The feature extraction methods in the iris recognition system can be divided into three main categories: texture analysis based methods [15], phase-based methods [16], zero-crossing method [17]. In the final stage, a com- parison between the signatures of the iris is made, which produces a numerically non-similar value. If the obtained value is greater than the specified value or threshold, the system generates output as not-matched, In another case, the output is matched which means that both features/signatures were taken from the iris of the same eye.

   1. Step 1: Iris Segmentation/Localization

      The most relevant method/procedure for iris segmentation was proposed by J. Daugman [18] in 1993. This method is consisted of the basis of the majority of functioning systems. Daugman introduced an integro-differential [19] operator to

      (r,xp,yp)

      (r,xp,yp)

      r

      r

      find the outer boundary and iris. The equation(1) is Daugmans intergro-differential operator.

      max

      G (r) f

      I(x, y)

      2r

      2r

      dS (14)

      r,x0,y0

      r,x0,y0

      Here I(x, y),r, G(r) and s are the eye image, radius, Gaussian smoothing function and the contour of the circle respectively. The function of this operator is to search for the circular path where the change in x and y position to get the perfect location of eyelids. The main objective of this method is maximizing the equation so that we are able to identify the iris boundaries. The operator detects the pupil region of eye and the center of the pupil is considered to draw a circular region. The region includes the iris also, the process of detecting features starts from here itself. Preprocessing of the image is necessary so that undesirable features are added while the acquisition of the image like noise, reflection,eyelashes, eyelids, etc are removed before actual processing of the image. Iris segmentation can be also done by gradient-based binary image edge-map after which Hough transform is applied. This method is the most commonly used method for circle detection. In the next stage normalization of image takes place.

   2. Step 2: Iris Normalization

      After successful segmentation the next stage is normaliza- tion. There are variations in the captured iris image. The varia- tion may be in the form of the size of the pupil and the change in the distance and also the angle of capturing the image. The images with variations are difficult to process, as the size of the iris in the captured image can have complex variations. Due to this complex variation, the process of recognition becomes more difficult. A well-captured image of the iris that is capable of recognition must be invariant. Invariant here means it hould be a perfect image, which qualifies acceptable size, the orientation of patterns and, positioning. The above described invariant factors can be achieved through, the conversion of the captured iris images into a double dimensionless polar coordinate system. The variables which are required for the conversion process are polar() and radial(r). The rubber sheet model refer fig.2 provides each point on the iris image, the assignment is independent of its size and the dilation of the pupil region. There are pair of real coordinates and angles.The real coordinate system has (r, ), r here is on the unit interval [0, 1]. The other used angle system lies between [0, 2]. The relation between the iris image (x,y) and polar coordinates can be shown in for of the equation(2) below.

      I(x(r, ), (y, )) I(r, ) (15) where x(r,) and y(r,) are linear combinations of pupil boundary coordinates (xp(), yp()) and the other region

      including the limbus boundary also the outer circumference

      of the iris (xs(), ys()) which surround the detected area in the region of iris. Mathematically equation (3 & 4) the stages of this methods are as follows:

      x(r, ) = (1 r) xp () + (1 r) xs() (16)

      y(r, ) = (1 r) yp () + (1 r) ys() (17)

      Fig. 4. Rubber sheet model [24]

   3. Step 3: Iris Feature Extraction

      The image of the iris has been processed through the above-stated steps segmentation and normalization, now it will be used for feature extraction. As discussed above major methods used for feature extraction and approach towards recognition. The methods are phase-based, zero-crossing and texture analysis. Haar wavelet is most commonly used for the feature extraction process.

   4. Step 4: Iris Matching

   Iris features are extracted in above step. Now the final step is to match the processed image with an input image. There are various methods that can be used for matching of iris features. The feature comparison/matching is usually done by distance metrics. Hamming distance is the most widely used method.The other methods used are Euclidean and Weighted Euclidean distance.

   The above steps can be summarized as follows:

   Step 1: Image acquiring, the primary section, is one among them key challenges iris recognition since we require a high- quality image of the iris whereas remaining noninvasive to the human operator.

   Step 2: Segmentation/Localization process is required for isolating the iris region from the pupil and other noise that are undesirable.

   Step 3: Normalization is employed to convert and the segmented image into rubbersheet model which can be stored in the form of database of a persons eye.

   Step 4: Finally, its time to extract the foremost discrimi- nating feature within the iris pattern so a comparison between templates is often done. Therefore, the obtained iris region is encoded wavelets to construct the iris code.

4. EXPERIMENTAL RESULTS

   In this section evaluates the proposed method/approach using CASIA database [25]. The above proposed method is applied with iris recognition algorithms of J. Daugman.

   1. Database

      CASIA Iris Image Database (CASIA-Iris) developed by the research group which were released to the international biometrics community and were updated from CASIA-IrisV1 to CASIA-IrisV3 since 2002. About More than 3,000 users from about 70 countries uses this database. This database in fig.4 provides excellent work on iris recognition has been

      done based on these iris image databases. There are also other database available online for example IIT Delhi (IITD) database. The IIT Delhi (IITD) database is the first indian database consisting of a total of 1120 iris images from 224 subjects.

      Fig. 5. CASIA database.

   2. localization/segmentation

      The CASIA database eye image is used for the processing purpose. The first step is localization/segmentation, by this process the required region from the eye is obtained i.e the red concentric circle shown in fig.5. The eyelids, eyelashes, pupil and any light reflection in the image is considered as noise. The equation(1) is used to complete this process of localization.

      Fig. 6. Iris localization.

   3. Normalization

      After the localization of the image i.e selection of required area, normalization is done. Normalization uses the localized image and converts it from the polar form to Cartesian form (circular to rectangle) shown in fig.6. This is called as rubbersheet model of iris as proposed by J.Daugman. This model consists of unique features.The equation(2) is used to carry out the process of normalization.

   4. Feature Extraction

      The rubbersheet model is used to extract features by using wavelet transform. By using proposed by the author [26].

   5. Recognition

   The fig 9 shows the GUI for the recognition of the iris and the selection of images from the database is also shown.

   Fig. 7. Iris Rubbersheet model.

   Fig. 8. Wavelet transform.

   Fig. 9. GUI for iris recognition.

5. CONCLUSION

In this paper we have used halfband filterbank which is designed using Euler Frobenius halfband polynomial (EFHP). We have extracted iris features with the help of discrete wavelet transform which assures better recognition rate. The above fig 9 shows the GUI for the recognition of the iris. The features ectracted from the iris images are shown in the fig 8.

REFERENCES

1. J. G. Daugman, High confidence visual recognition of persons by a test of statistical independence, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, pp. 11481161, November 1993.

2. J. G. Daugman, How iris recognition works, IEEE Transactions on Circuits and Systems for Video Technology, vol. 14, pp. 2130, January 2004.

3. J. G. Daugman, The imporance of being random: statistical principles of iris recognition, Pattern Recognition, vol. 36, pp. 279291, February 2003.

4. A. D. Rahulkar and R. S. Holambe, Half-iris feature extraction and recognition using a new class of biorhtogonal triplet half-band filter band and flexible k-out-of-n:A postclassifier, IEEE Transactions on Information Forensic and Security, vol. 7, pp. 230-240, February 2012.

5. M. B. Nagare, B. D. Patil, and R. S. Holambe, Design of two channel biorthogonal filterbanks using euler frobenius polynomial, Journal of Signal Processing Systems, Jan 2020.

6. M. B. Nagare, B. D. Patil, and R. S. Holambe, On the design of biorthogonal halfband filterbanks with almost tight rational coecients, IEEE Transactions on Circuits and Systems II: Express Briefs, pp. 11, 2019.

7. J. P. Gawande, A. D. Rahulkar, and R. S. Holambe, A new approach to design triplet halfband filter banks based on balanced-uncertainty optimization, Digital Signal Processing, vol. 56, pp. 123 131, 2016.

8. B. Patil, P. Patwardhan, and V. Gadre, On the design of FIR wavelet filter banks using factorization of a halfband polynomial, IEEE Signal Processing Letters, vol. 15, pp. 485488, 2008.

9. J. McClellan and D. Chan, A 2-D FIR filter structure derived from the chebyshev recursion, IEEE Transactions on Circuits and Systems, vol. 24, no. 7, pp. 372378, 1997.

10. R. Ansari, C. Kim, and M. Dedovic, Structure and design of two- channel filter banks derived from a triplet of halfband filters, IEEE Transaction on circuits and systems-II: Analog and Digital Signal Processing, vol. 46, pp. 1487-1496, December 1999.

11. A. D. Rahulkar and R. S. Holambe, Partial iris feature extraction and recognition based on a new combined directional and rotated directional wavelet filter banks, Neurocomputing, Elseveir, vol. 81, pp. 12-23, April 2012.

12. J. G. Daugman, New methods in iris recognition, IEEE Transactions on Syst. , Man and Cyber. B, vol. 37, pp. 11671175, October 2007.

13. Nagare, M.B., Pail, B.D. Holambe, R.S. Design of Two Channel Biorthogonal Filterbanks using Euler Frobenius Polynomial. J Sign Process Syst (2020). https://doi.org/10.1007/s11265-019-01515-z

14. J. Daugman. How iris recognition works. Proceedings of 2002 Interna- tionalConference on Image Processing, Vol. 1, pp 16-22 2002.

15. Hamouchene, Izem and Aouat, Saliha. (2014). A New Texture Analysis Approach for Iris Recognition. AASRI Procedia. 9. 27. 10.1016/j.aasri.2014.09.002.

16. Miyazawa K., Ito K., Aoki T., Kobayashi K., Nakajima H. (2005) A Phase-Based Iris Recognition Algorithm. In: Zhang D., Jain A.K. (eds) Advances in Biometrics. ICB 2006. Lecture Notes in Computer Science, vol 3832. Springer, Berlin, Heidelberg

17. Yu L., Zhou X. (2012) A Novel Method for Iris Recognition Based on Zero-Crossing Detection. In: Zhang T. (eds) Instrumentation, Measure- ment, Circuits and Systems. Advances in Intelligent and Soft Computing, vol 127. Springer, Berlin, Heidelberg

18. Daugman, John. (2004). How Iris Recognition Works. Circuits and Systems for Video Technology, IEEE Transactions on. 14. 21 – 30. 10.1109/TCSVT.2003.818350

19. International Journal of Computer Applications (0975 8887) Volume 93 No 3, May 2014/Iris Localization using Daugmans Intero- Differ- ential Operator.

20. Pan Lili and Xie Mei, The algorithm of iris image preprocessing, Fourth IEEE Workshop on Automatic Identification Advanced Tech- nologies (AutoID05), Buffalo, NY, USA, 2005, pp. 134-138. doi: 10.1109/AUTOID.2005.47

21. Jimnez L., Fabi´an PardoBeainy, Camilo Mendez, Oscar. (2013). Biometric iris recognition using Hough Transform. 1-6. 10.1109/STSIVA.2013.6644905

22. Kazakov, Todor. (2011). Iris Detection and Normalization

23. Adaptive Fuzzy Switching Noise Reduction Filter for Iris Pat- tern Recognition Scientific Figure on ResearchGate. Available from: https://www.researchgate.net/figure /DaugmansRubbersheetmod- elforthenormalizationoftheirisregionfig1275036767 [accessed 6 Nov, 2019]

24. https://www.researchgate.net/figure /DaugmansRubberSheetMod- elforIrisNormalization9fig2281372269

25. CASIA-IrisV3 database [Online]. Available: www.cbsr.ia.ac.cn/ Databases.htm

26. Nagare, M.B., Patil, B.D. Holambe, R.S. Design of Two Channel Biorthogonal Filterbanks using Euler Frobenius Polynomial. J Sign Process Syst (2020). https://doi.org/10.1007/s11265-019-01515-z