关键词: 点匹配 形状匹配 加权邻居关系 形状上下文 松弛迭代法

Abstract:

Shape matching typically formulated as a point matching problem by describing shape contour as a set of points. The neighborhood structure in point se ts is often more stable than other global relationships in varied transformations. We improve the point matching approach which preserves the local neighborhood structures by weighting neighborhood relationships. Relationships of a point and its neighbors are weighted by the distance between them. By in troducing shape context, the point sets are then formulated to directed Attributed Relational Graphs, which are matched using relaxation labeling approa eh. Weighting neighborhood relationships makes the matching not only keep the coherence between two matched points; neighbors, but also preserve the ord er of them. Experiment result shows that our approach can improve the matching efficiency and the converging speed.

Key words: point matching;shape matching, weighted neighborhood structure, shape context, relaxation labeling