快速的基于光滑的l0范数的过完备的稀疏分解，其速度比L1范数快，恢复效果好-Rapid decomposition overcomplete sparse smooth l0 norm-based, its speed is faster than the L1 norm, restore good effect

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 th