Some trade-offs and a new algorithm for geometric hashing
Some trade-offs and a new algorithm for geometric hashing
复制标题
几何哈希的一些权衡和新算法
DOI：
10.1109/icpr.1998.712050
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
M. Lindenbaum
中科院分区：
文献类型：
--
作者：
Michael Hoffman;M. Lindenbaum
基于模型的物体识别是计算机视觉的一项基本任务。在本文中，我们考虑了基于模型识别的流行几何哈希（GH）算法的性能，并在概率设置中检查了一些设计决策的影响，并在可靠性和时间复杂性两种性能度量之间得出了一些权衡。我们还提出了一种改进的GH算法，该算法缓解了其固有的一些问题，并在实验中证明了其增强的性能。
Model-based object recognition is a fundamental task of computer vision. In this paper we consider the performance of the popular geometric hashing (GH) algorithm for model based recognition and, in a probabilistic setting, examine the influence of some design decisions and derive several trade-offs between two measures of performance: reliability and time complexity. We also propose a variation of the GH algorithm, which alleviates some of its inherent problems and demonstrate its enhanced performance in experiments.