排序方式: 共有6条查询结果,搜索用时 15 毫秒
1
1.
为了减少考场的作弊行为,保证考试的公平性,提出了一种将背景消减法应用于考场作弊行为检测的方法。通过分析交换物品的行为特点,提出了一种基于动态阈值的作弊行为检测算法:采用迭代阈值法确定动态阈值对差分图像进行分割,利用分割的结果指导背景的更新,得到良好稳定的背景模型,并基于背景减除算法完成了考场作弊行为的检测。实验结果表明,这种方法能够较好地检测出交换物品的作弊行为,并能克服光线等因素的影响,有效甄别考场的作弊行为。 相似文献
2.
3.
结合树型结构和正交匹配追踪算法,提出一种信号稀疏分解的新方法.该方法的基本思想是在基于树型结构的匹配搜索过程中引入正交化过程,其中树型结构可以快速有效地实现稀疏分解,正交匹配追踪算法提高了信号分解的收敛速度和稀疏性.对语音和地震信号的测试实验结果表明,该算法能以较快的速度收敛到零. 相似文献
4.
5.
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. 相似文献
6.
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. 相似文献
1