K-SVD: ALGORITHM FOR FINGERPRINT COMPRESSION BASED ON SPARSE REPRESENTATION

Main Article Content

Trishala K. Balsaraf
Mahesh N. Karanjkar

Abstract

In current years there has been an increasing interest in the study of sparse representation of signals. Using an overcomplete glossary that contains prototype signal-atoms, signals are described by sparse linear combinations of these atoms. Recognition of persons by means of biometric description is an important technology in the society, because biometric identifiers cannot be shared and they intrinsically characterize the individual’s bodily distinctiveness. Among several biometric recognition technologies, fingerprint compression is very popular for personal identification. One more fingerprint compression algorithm based on sparse representation using K-SVD algorithm is introduced.

Downloads

Download data is not yet available.

Article Details

How to Cite
Trishala K. Balsaraf, & Mahesh N. Karanjkar. (2021). K-SVD: ALGORITHM FOR FINGERPRINT COMPRESSION BASED ON SPARSE REPRESENTATION . International Journal of Innovations in Engineering Research and Technology, 2(9), 1-10. https://repo.ijiert.org/index.php/ijiert/article/view/546
Section
Articles

How to Cite

Trishala K. Balsaraf, & Mahesh N. Karanjkar. (2021). K-SVD: ALGORITHM FOR FINGERPRINT COMPRESSION BASED ON SPARSE REPRESENTATION . International Journal of Innovations in Engineering Research and Technology, 2(9), 1-10. https://repo.ijiert.org/index.php/ijiert/article/view/546

Similar Articles

You may also start an advanced similarity search for this article.