Ordinal Feature Selection for Iris and Palmprint Recognition

• Published in: IEEE transactions on image processing Vol. 23; no. 9; pp. 3922 - 3934
• Main Authors: Sun, Zhenan, Wang, Libin, Tan, Tieniu
• Format: Journal Article
• Language: English
• Published: United States IEEE 01.09.2014; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Artificial Intelligence; Biomedical imaging; Biometry - methods; Boosting; Dermatoglyphics; Drafting; Feature recognition; Hand - anatomy & histology; Humans; Image Enhancement - methods; Image Interpretation, Computer-Assisted - methods; Image processing; Iris - anatomy & histology; Iris recognition; Linear programming; Matching; Mathematical models; Optimization; Pattern Recognition, Automated - methods; Photography - methods; Reporting; Representations; Reproducibility of Results; Sensitivity and Specificity; Skin - anatomy & histology; Software packages; Subtraction Technique; Training; palmprint; Iris; linear programming; ordinal measures; feature selection
• ISSN: 1057-7149; 1941-0042; 1941-0042
• DOI: 10.1109/TIP.2014.2332396

Ordinal measures have been demonstrated as an effective feature representation model for iris and palmprint recognition. However, ordinal measures are a general concept of image analysis and numerous variants with different parameter settings, such as location, scale, orientation, and so on, can be derived to construct a huge feature space. This paper proposes a novel optimization formulation for ordinal feature selection with successful applications to both iris and palmprint recognition. The objective function of the proposed feature selection method has two parts, i.e., misclassification error of intra and interclass matching samples and weighted sparsity of ordinal feature descriptors. Therefore, the feature selection aims to achieve an accurate and sparse representation of ordinal measures. And, the optimization subjects to a number of linear inequality constraints, which require that all intra and interclass matching pairs are well separated with a large margin. Ordinal feature selection is formulated as a linear programming (LP) problem so that a solution can be efficiently obtained even on a large-scale feature pool and training database. Extensive experimental results demonstrate that the proposed LP formulation is advantageous over existing feature selection methods, such as mRMR, ReliefF, Boosting, and Lasso for biometric recognition, reporting state-of-the-art accuracy on CASIA and PolyU databases.