.png){kind=icon}
返回
2-D object recognition by multiscale tree matching
.png){kind=icon}
PRE
AI
DOI：10.1016/S0031-3203(97)00085-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present an efficient 2-D object recognition method that uses multiscale tree representations. A planar object is represented by means of a tree, in which each node corresponds to a boundary segment at some level of resolution and an are connects nodes corresponding to segments at successive levels that are spatially related. The problem of matching an object against a model is formulated as the one of determining the best mapping between nodes at all levels of the two associated trees. The proposed matching algorithm is based on dynamic programming and has optimal O(\T parallel to T'\) time complexity, where \T\ and \T'\ are the number of nodes in the two trees. (C) 1998 Published by Elsevier Science Ltd on behalf of the Pattern Recognition Society. All rights reserved.
Keyword:
shape and object representation
object recognition
tree matching
dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
