Graph representation learning meets computer vision: A survey
A graph structure is a powerful mathematical abstraction, which can not only represent
information about individuals but also capture the interactions between individuals for …
information about individuals but also capture the interactions between individuals for …
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 …
GMS: Grid-based motion statistics for fast, ultra-robust feature correspondence
Incorporating smoothness constraints into feature matching is known to enable ultra-robust
matching. However, such formulations are both complex and slow, making them unsuitable …
matching. However, such formulations are both complex and slow, making them unsuitable …
Multi-graph matching via affinity optimization with graduated consistency regularization
This paper addresses the problem of matching common node correspondences among
multiple graphs referring to an identical or related structure. This multi-graph matching …
multiple graphs referring to an identical or related structure. This multi-graph matching …
Feature guided Gaussian mixture model with semi-supervised EM and local geometric constraint for retinal image registration
Retinal image registration, which can be formulated by matching two sets of sparse features
extracted from two observed retinal images, is a crucial step in the diagnosis and treatment …
extracted from two observed retinal images, is a crucial step in the diagnosis and treatment …
A stable analytical framework for isometric shape-from-template by surface integration
Shape-from-Template (SfT) reconstructs the shape of a deforming surface from a single
image, a 3D template and a deformation prior. For isometric deformations, this is a well …
image, a 3D template and a deformation prior. For isometric deformations, this is a well …
Image feature correspondence selection: A comparative study and a new contribution
Image feature correspondence selection is pivotal to many computer vision tasks from object
recognition to 3D reconstruction. Although many correspondence selection algorithms have …
recognition to 3D reconstruction. Although many correspondence selection algorithms have …
[HTML][HTML] Deep shape-from-template: Single-image quasi-isometric deformable registration and reconstruction
Abstract Shape-from-Template (SfT) solves 3D vision from a single image and a deformable
3D object model, called a template. Concretely, SfT computes registration (the …
3D object model, called a template. Concretely, SfT computes registration (the …
Texture-generic deep shape-from-template
Shape-from-Template (SfT) solves the registration and 3D reconstruction of a deformable 3D
object, represented by the template, from a single image. Recently, methods based on deep …
object, represented by the template, from a single image. Recently, methods based on deep …
Deformable surface tracking by graph matching
This paper addresses the problem of deformable surface tracking from monocular images.
Specifically, we propose a graph-based approach that effectively explores the structure …
Specifically, we propose a graph-based approach that effectively explores the structure …