Fingerprint Compression Standards Based on Sparse Representation: A Survey

A new fingerprint compression algorithm based on sparse representation is introduced. Obtaining an over complete dictionary from a set of fingerprint patches allows us to represent them as a sparse linear combination of dictionary atoms. In the algorithm, we first construct a dictionary for predefined fingerprint image patches. The identification of individuals by means that of their biometric characteristics very hip among the society. Among fingerprint recognition is a very important technology for private identification. The compression of that information might become imperative beneath bound circumstances because of the massive amounts of information concerned. This paper compare completely difference compression standards like JPEG, JPEG-2000, WSQ, K-SVD etc. A new compression standards based on sparse representation also introduced, especially at high compression ratios. I. Introduction