Efficient high‐speed framework for sparse representation‐based iris recognition
Abstract While various frameworks for iris recognition have been proposed, most lack efficiency and high speed. A new framework for iris recognition is presented that is both efficient and fast. Feature extraction is performed by extracting Gabor features and then applying supervised locality‐preser...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-05-01
|
| Series: | IET Biometrics |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/bme2.12022 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Abstract While various frameworks for iris recognition have been proposed, most lack efficiency and high speed. A new framework for iris recognition is presented that is both efficient and fast. Feature extraction is performed by extracting Gabor features and then applying supervised locality‐preserving projections with heat kernel weights, which improves the recognition rate in comparison with the results from unsupervised dimensionality reduction techniques such as principal component analysis, locality‐preserving projections, and random projections. Afterwards, a classification is performed using the recently proposed sparse representation‐based classification (SRC). To considerably improve classification performance, SRC is proposed, using a greedy compressed‐sensing recovery algorithm, as opposed to employing the traditional computationally expensive ℓ1 minimisation. The proposed framework achieves a recognition rate of about 99.5% using two iris databases, with a significant improvement in speed over related frameworks. |
|---|---|
| ISSN: | 2047-4938 2047-4946 |