This paper addresses the problem of matching common node correspondences among
multiple graphs referring to an identical or related structure. This multi-graph matching …

In this paper we propose a global optimization-based approach to jointly matching a set of
images. The estimated correspondences simultaneously maximize pairwise feature affinities …

The problem of graph matching (GM) in general is nondeterministic polynomial-complete
and many approximate pairwise matching techniques have been proposed. For a general …

The alignment of a set of objects by means of transformations plays an important role in
computer vision. Whilst the case for only two objects can be solved globally, when multiple …

Graph matching has a wide spectrum of real-world applications and in general is known NP-
hard. In many vision tasks, one realistic problem arises for finding the global node mappings …

Kernel methods provide a convenient way to apply a wide range of learning techniques to
complex and structured data by shifting the representational problem from one of finding an …

The theory of shapes, as proposed by David Kendall, is concerned with sets of labeled
points in the Euclidean space R^ d R d that define a shape regardless of translations …

Transitive consistency is an intrinsic property for collections of linear invertible
transformations between Euclidean coordinate frames. In practice, when the transformations …

This paper addresses the problem of matching $ N $ weighted graphs referring to an
identical object or category. More specifically, matching the common node correspondences …

摘要在概率图模型框架下提出了一种将回归分析和聚类分析相结合的贝叶斯点集匹配方法,
其中, 回归分析用来估计两个点集之间的映射函数, 而聚类分析用来建立两个点集中点与点之间 …