.png){kind=icon}
返回
Geodesic-like features for point matching
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.08.092.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Point matching problem seeks the optimal correspondences between two sets of points via minimizing the dissimilarities of the corresponded features. The features are widely represented by a graph model consisting of nodes and edges, where each node represents one key point and each edge describes the pair-wise relations between its end nodes. The edges are typically measured depending on the Euclidian distances between their end nodes, which is, however, not suitable for objects with non-rigid deformations. In this paper, we notice that all the key points are spanning on a manifold which is the surface of the target object. The distance measurement on a manifold, geodesic distance, is robust under non-rigid deformations. Hence, we first estimate the manifold depending on the key points and concisely represent the estimation by a graph model called the Geodesic Graph Model (GGM). Then, we calculate the distance measurement on GGM, which is called the geodesic-like distance, to approximate the geodesic distance. The geodesic-like distance can better tackle non-rigid deformations. To further improve the robustness of the geodesic-like distance, a weight setting process and a discretization process are proposed. The discretization process produces the geodesic-like features for the point matching problem. We conduct multiple experiments over widely used datasets and demonstrate the effectiveness of our method. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Point matching
Non-rigid deformation
Geodesic distance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
分享收藏A Review of Technical Impact of Electrical Vehicle Charging Stations on Distribution Grid电动汽车充电站对配电网的技术影响研究综述
PREAI
分享收藏
查看更多内容