.png){kind=icon}
返回
A fast expected time algorithm for the 2-D point pattern matching problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2003.12.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Point set pattern matching is an integral part of many pattern recognition problems. We study a randomized algorithm for the alignment approach to model-based recognition. Under certain mild assumptions we show that if our scene is a set of n points and our model is a set of m < n points our algorithm has expected running time O(n(log m)(3/2)) for finding an occurrence of the model in the scene. This is significantly faster than any existing algorithms in the literature. We then describe some experimental results on randomly generated data using a practical version of our algorithm. These results agree well with the theoretical analysis. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
point pattern matching expected time algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
Fast algorithm for point pattern matching: Invariant to translations, rotations and scale changes.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容