211 research outputs found
Quadratic Projection Based Feature Extraction with Its Application to Biometric Recognition
This paper presents a novel quadratic projection based feature extraction
framework, where a set of quadratic matrices is learned to distinguish each
class from all other classes. We formulate quadratic matrix learning (QML) as a
standard semidefinite programming (SDP) problem. However, the con- ventional
interior-point SDP solvers do not scale well to the problem of QML for
high-dimensional data. To solve the scalability of QML, we develop an efficient
algorithm, termed DualQML, based on the Lagrange duality theory, to extract
nonlinear features. To evaluate the feasibility and effectiveness of the
proposed framework, we conduct extensive experiments on biometric recognition.
Experimental results on three representative biometric recogni- tion tasks,
including face, palmprint, and ear recognition, demonstrate the superiority of
the DualQML-based feature extraction algorithm compared to the current
state-of-the-art algorithm
The fundamentals of unimodal palmprint authentication based on a biometric system: A review
Biometric system can be defined as the automated method of identifying or authenticating the identity of a living person based on physiological or behavioral traits. Palmprint biometric-based authentication has gained considerable attention in recent years. Globally, enterprises have been exploring biometric authorization for some time, for the purpose of security, payment processing, law enforcement CCTV systems, and even access to offices, buildings, and gyms via the entry doors. Palmprint biometric system can be divided into unimodal and multimodal. This paper will investigate the biometric system and provide a detailed overview of the palmprint technology with existing recognition approaches. Finally, we introduce a review of previous works based on a unimodal palmprint system using different databases
Iris Recognition Using Scattering Transform and Textural Features
Iris recognition has drawn a lot of attention since the mid-twentieth
century. Among all biometric features, iris is known to possess a rich set of
features. Different features have been used to perform iris recognition in the
past. In this paper, two powerful sets of features are introduced to be used
for iris recognition: scattering transform-based features and textural
features. PCA is also applied on the extracted features to reduce the
dimensionality of the feature vector while preserving most of the information
of its initial value. Minimum distance classifier is used to perform template
matching for each new test sample. The proposed scheme is tested on a
well-known iris database, and showed promising results with the best accuracy
rate of 99.2%
Fingerprint Recognition Using Translation Invariant Scattering Network
Fingerprint recognition has drawn a lot of attention during last decades.
Different features and algorithms have been used for fingerprint recognition in
the past. In this paper, a powerful image representation called scattering
transform/network, is used for recognition. Scattering network is a
convolutional network where its architecture and filters are predefined wavelet
transforms. The first layer of scattering representation is similar to sift
descriptors and the higher layers capture higher frequency content of the
signal. After extraction of scattering features, their dimensionality is
reduced by applying principal component analysis (PCA). At the end, multi-class
SVM is used to perform template matching for the recognition task. The proposed
scheme is tested on a well-known fingerprint database and has shown promising
results with the best accuracy rate of 98\%.Comment: IEEE Signal Processing in Medicine and Biology Symposium, 201
Joint & Progressive Learning from High-Dimensional Data for Multi-Label Classification
Despite the fact that nonlinear subspace learning techniques (e.g. manifold
learning) have successfully applied to data representation, there is still room
for improvement in explainability (explicit mapping), generalization
(out-of-samples), and cost-effectiveness (linearization). To this end, a novel
linearized subspace learning technique is developed in a joint and progressive
way, called \textbf{j}oint and \textbf{p}rogressive \textbf{l}earning
str\textbf{a}teg\textbf{y} (J-Play), with its application to multi-label
classification. The J-Play learns high-level and semantically meaningful
feature representation from high-dimensional data by 1) jointly performing
multiple subspace learning and classification to find a latent subspace where
samples are expected to be better classified; 2) progressively learning
multi-coupled projections to linearly approach the optimal mapping bridging the
original space with the most discriminative subspace; 3) locally embedding
manifold structure in each learnable latent subspace. Extensive experiments are
performed to demonstrate the superiority and effectiveness of the proposed
method in comparison with previous state-of-the-art methods.Comment: accepted in ECCV 201
- …