ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login


Journal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.4, No. 9)

Publication Date:

Authors : ;

Page : 642-648

Keywords : KEYWORDS: Compression; Dictionary learning; Fingerprint; Matching pursuit; Sparse coding.;

Source : Downloadexternal Find it from : Google Scholarexternal


Recognition of person by means of their biometric characteristics is very popular among the society. Among this, for personal identification fingerprint recognition is an important technology due to its unique structure. Human fingerprints are rich in details called minutiae. This can be used for identification marks for fingerprint verification. Large volume of fingerprint images are collected and stored day by day from a wider range of applications. Compression of data is commanding of under certain circumstances due to large amount of data transmission and efficient memory utilization. A new and efficient fingerprint compression algorithm using sparse representation is proposed. 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, first construct a dictionary for predefined fingerprint image patches. For a new given fingerprint images, represent its patches according to the dictionary by computing l0- minimization and then quantize and encode the coefficients and other related information using lossless coding methods. A fast Fourier filtering transformation for image post processing helped to improve the contrast ratio of the regenerated image The effect of various factors on compression results robust to extract minutiae, better PSNR, verbosity for reconstructed images and better compression ratio.

Last modified: 2015-09-27 15:30:32