一种快速稀疏分解图像去噪新方法*

提出了一种基于分层树型结构正交匹配追踪算法的快速图像去噪方法.通过选择高斯函数和墨西哥草帽小波母函数构建混合冗余字典,采用分层树状结构表示字典,结合构正交匹配追踪算法,实现图像稀疏表示,提高了图像表示的稀疏性,降低了算法的复杂度.依据噪音能量阈值,通过多次迭代达到图像去噪的目的.实验结果表明,在相同的噪音水平下,该迭代去噪算法取得了较高的较好的PSNR,获得更好的视觉效果.     

一种快速稀疏分解图像去噪新方法

提出了一种基于分层树型结构正交匹配追踪算法的快速图像去噪方法.通过选择高斯函数和墨西哥草帽小波母函数构建混合冗余字典,采用分层树状结构表示字典,结合构正交匹配追踪算法,实现图像稀疏表示,提高了图像表示的稀疏性,降低了算法的复杂度.依据噪音能量阈值,通过多次迭代达到图像去噪的目的.实验结果表明,在相同的噪音水平下,该迭代去噪算法取得了较高的较好的PSNR,获得更好的视觉效果.     

A novel chaotic stream cipher and its application to palmprint template protection

Based on a coupled nonlinear dynamic filter (NDF), a novel chaotic stream cipher is presented in this paper and employed to protect palmprint templates. The chaotic pseudorandom bit generator (PRBG) based on a coupled NDF, which is constructed in an inverse flow, can generate multiple bits at one iteration and satisfy the security requirement of cipher design. Then, the stream cipher is employed to generate cancelable competitive code palmprint biometrics for template protection. The proposed cancelable palmprint authentication system depends on two factors: the palmprint biometric and the password/token. Therefore, the system provides high-confidence and also protects the user's privacy. The experimental results of verification on the Hong Kong PolyU Palmprint Database show that the proposed approach has a large template re-issuance ability and the equal error rate can achieve 0.02%. The performance of the palmprint template protection scheme proves the good practicability and security of the proposed stream cipher.     

Embedding adaptive arithmetic coder in chaos-based cryptography

In this study an adaptive arithmetic coder is embedded in the Baptista-type chaotic cryptosystem for implementing secure data compression. To build the multiple lookup tables of secure data compression, the phase space of chaos map with a uniform distribution in the search mode is divided non-uniformly according to the dynamic probability estimation of plaintext symbols. As a result, more probable symbols are selected according to the local statistical characters of plaintext and the required number of iterations is small since the more probable symbols have a higher chance to be visited by the chaotic search trajectory. By exploiting non-uniformity in the probabilities under which a number of iteration to be coded takes on its possible values, the compression capability is achieved by adaptive arithmetic code. Therefore, the system offers both compression and security. Compared with original arithmetic coding, simulation results on Calgary Corpus files show that the proposed scheme suffers from a reduction in compression performance less than 12{\%} and is not susceptible to previously carried out attacks on arithmetic coding algorithms.