A short survey of recent advances in graph matching
Graph matching, which refers to a class of computational problems of finding an optimal
correspondence between the vertices of graphs to minimize (maximize) their node and edge …
correspondence between the vertices of graphs to minimize (maximize) their node and edge …
Learning two-view correspondences and geometry using order-aware network
Establishing correspondences between two images requires both local and global spatial
context. Given putative correspondences of feature points in two views, in this paper, we …
context. Given putative correspondences of feature points in two views, in this paper, we …
Guaranteed outlier removal for point cloud registration with correspondences
AP Bustos, TJ Chin - IEEE transactions on pattern analysis and …, 2017 - ieeexplore.ieee.org
An established approach for 3D point cloud registration is to estimate the registration
function from 3D keypoint correspondences. Typically, a robust technique is required to …
function from 3D keypoint correspondences. Typically, a robust technique is required to …
Diffusion processes for retrieval revisited
In this paper we revisit diffusion processes on affinity graphs for capturing the intrinsic
manifold structure defined by pairwise affinity matrices. Such diffusion processes have …
manifold structure defined by pairwise affinity matrices. Such diffusion processes have …
A game-theoretic approach to hypergraph clustering
Hypergraph clustering refers to the process of extracting maximally coherent groups from a
set of objects using high-order (rather than pairwise) similarities. Traditional approaches to …
set of objects using high-order (rather than pairwise) similarities. Traditional approaches to …
A scale independent selection process for 3d object recognition in cluttered scenes
During the last years a wide range of algorithms and devices have been made available to
easily acquire range images. The increasing abundance of depth data boosts the need for …
easily acquire range images. The increasing abundance of depth data boosts the need for …
Pairwise registration of TLS point clouds using covariance descriptors and a non-cooperative game
It is challenging to automatically register TLS point clouds with noise, outliers and varying
overlap. In this paper, we propose a new method for pairwise registration of TLS point …
overlap. In this paper, we propose a new method for pairwise registration of TLS point …
Learning and matching multi-view descriptors for registration of point clouds
Critical to the registration of point clouds is the establishment of a set of accurate
correspondences between points in 3D space. The correspondence problem is generally …
correspondences between points in 3D space. The correspondence problem is generally …
Graph matching with adaptive and branching path following
Graph matching aims at establishing correspondences between graph elements, and is
widely used in many computer vision tasks. Among recently proposed graph matching …
widely used in many computer vision tasks. Among recently proposed graph matching …
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and
computer vision problems, such as graph matching, object recognition, image segmentation …
computer vision problems, such as graph matching, object recognition, image segmentation …