IEEE Trans Image Process. 2014 Feb;23(2):489-501. doi: 10.1109/TIP.2013.2287996. Epub 2013 Nov 1.
A new fingerprint compression algorithm based on sparse representation is introduced. Obtaining an overcomplete 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. For a new given fingerprint images, represent its patches according to the dictionary by computing l(0)-minimization and then quantize and encode the representation. In this paper, we consider the effect of various factors on compression results. Three groups of fingerprint images are tested. The experiments demonstrate that our algorithm is efficient compared with several competing compression techniques (JPEG, JPEG 2000, and WSQ), especially at high compression ratios. The experiments also illustrate that the proposed algorithm is robust to extract minutiae.
提出了一种基于稀疏表示的新指纹压缩算法。从一组指纹补丁中获取过完备字典，使我们能够将它们表示为字典原子的稀疏线性组合。在算法中，我们首先为预定义的指纹图像补丁构建一个字典。对于新的给定指纹图像，通过计算 l(0)-最小化并对表示进行量化和编码，根据字典表示其补丁。在本文中，我们考虑了各种因素对压缩结果的影响。测试了三组指纹图像。实验表明，与几种竞争的压缩技术（JPEG、JPEG 2000 和 WSQ）相比，我们的算法效率更高，特别是在高压缩比下。实验还表明，所提出的算法对提取细节点具有鲁棒性。
