Abstract—Existing methods for surface matching are limited by the trade-off between precision and computational efficiency. Here we present an improved algorithm for dense vertex-to-vertex correspondence that uses direct matching of features defined on a surface and improves it by using spectral correspondence as a regularization. This algorithm has the speed of both feature matching and spectral matching while exhibiting greatly improved precision (distance errors of 1.4%). The method, FOCUSR, incorporates implicitly such additional features to calculate the correspondence and relies on the smoothness of the lowest-frequency harmonics of a graph Laplacian to spatially regularize the features. In its simplest form, FOCUSR is an improved spe...
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching b...
This paper presents a nonrigid coarse correspondence computation algorithm for volumetric images. Ou...
We consider the problem of localizing relevant subsets of non-rigid geometric shapes given only a pa...
Abstract. Accurate matching of cortical surfaces is necessary in many neu-roscience applications. In...
Spectral matching (SM) is an efficient and effective greedy algorithm for solving the graph matching...
Establishing a correspondence between two surfaces is a basic ingredient in many geometry processing...
This paper addresses the problem of establishing point correspondences between two object instances ...
International audienceThe cerebral cortex is the largest part of the human brain and is critical for...
This project presents an innovative way of solving the inexact graph matching problem of weighted gr...
NeurIPS 2022. Code and data: https://github.com/craigleili/AttentiveFMapsInternational audienceIn th...
Finding correspondences between two related feature point sets is a basic task in computer vision an...
Establishing consistent correspondence (or mapping) [Sumner and Popovic?? 2004; Kraevoy and Sheffer ...
This paper presents a nonrigid coarse correspondence computation algorithm for volumetric images. Ou...
International audienceIn this paper we propose an inexact spectral matching algorithm that embeds la...
Graph matching is a fundamental problem in Computer Vision and Machine Learning. We present two cont...
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching b...
This paper presents a nonrigid coarse correspondence computation algorithm for volumetric images. Ou...
We consider the problem of localizing relevant subsets of non-rigid geometric shapes given only a pa...
Abstract. Accurate matching of cortical surfaces is necessary in many neu-roscience applications. In...
Spectral matching (SM) is an efficient and effective greedy algorithm for solving the graph matching...
Establishing a correspondence between two surfaces is a basic ingredient in many geometry processing...
This paper addresses the problem of establishing point correspondences between two object instances ...
International audienceThe cerebral cortex is the largest part of the human brain and is critical for...
This project presents an innovative way of solving the inexact graph matching problem of weighted gr...
NeurIPS 2022. Code and data: https://github.com/craigleili/AttentiveFMapsInternational audienceIn th...
Finding correspondences between two related feature point sets is a basic task in computer vision an...
Establishing consistent correspondence (or mapping) [Sumner and Popovic?? 2004; Kraevoy and Sheffer ...
This paper presents a nonrigid coarse correspondence computation algorithm for volumetric images. Ou...
International audienceIn this paper we propose an inexact spectral matching algorithm that embeds la...
Graph matching is a fundamental problem in Computer Vision and Machine Learning. We present two cont...
We propose a graph-based semi-supervised symmetric matching framework that performs dense matching b...
This paper presents a nonrigid coarse correspondence computation algorithm for volumetric images. Ou...
We consider the problem of localizing relevant subsets of non-rigid geometric shapes given only a pa...