A new compression algorithm adapted to fingerprint images is introduced. Despite the simplicity of our proposed algorithms, they compare favorably with existing more sophisticated algorithms, especially at high compression ratios. Due to the block-by-block processing mechanism, however, the algorithm has higher complexities. The proposed method has the ability by updating the dictionary. The specific process is as follows: construct a base matrix whose columns represent features of the fingerprint images, referring the matrix dictionary whose columns are called atoms; for a given whole fingerprint, divide it into small blocks called patches whose number of pixels are equal to the dimension of the atoms; use the method of sparse representation to obtain the coefficients; then, quantize the coefficients; last, encode the coefficients and other related information using lossless coding methods. We will take it into consideration. In most Automatic Fingerprint identification System (AFIS), the main feature used to match two fingerprint images are minutiae (ridges endings and bifurcations). Therefore, the difference of the minutiae between pre- and post-compression is considered in this abstract. The experiments show that the block effect of our algorithm is less serious than that of JPEG.
You are here: / / A NOVEL FINGERPRINT COMPRESSION ALGORITHM BASED ON SPARSE REPRESENTATION