Open AccessPosted Content
Distributable Consistent Multi-Object Matching.
TL;DR: The central idea of the approach is to divide the input object collection into overlapping sub-collections and enforce map consistency among each sub-collection, which leads to a distributed formulation, which is scalable to large-scale datasets.
read more
Abstract: In this paper we propose an optimization-based framework to multiple object matching. The framework takes maps computed between pairs of objects as input, and outputs maps that are consistent among all pairs of objects. The central idea of our approach is to divide the input object collection into overlapping sub-collections and enforce map consistency among each sub-collection. This leads to a distributed formulation, which is scalable to large-scale datasets. We also present an equivalence condition between this decoupled scheme and the original scheme. Experiments on both synthetic and real-world datasets show that our framework is competitive against state-of-the-art multi-object matching techniques.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Image Matching from Handcrafted to Deep Features: A Survey
TL;DR: This survey introduces feature detection, description, and matching techniques from handcrafted methods to trainable ones and provides an analysis of the development of these methods in theory and practice, and briefly introduces several typical image matching-based applications.
MultiBodySync: Multi-Body Segmentation and Motion Estimation via 3D Scan Synchronization
Jiahui Huang,He Wang,Tolga Birdal,Minhyuk Sung,Federica Arrigoni,Shi-Min Hu,Leonidas J. Guibas +6 more
- 01 Jun 2021
TL;DR: MultiBodySync as discussed by the authors proposes an end-to-end trainable multi-body motion segmentation and rigid registration framework for multiple input 3D point clouds, which incorporates spectral synchronization into an iterative deep declarative network.
Quantum Permutation Synchronization
Tolga Birdal,Vladislav Golyanik,Christian Theobalt,Leonidas J. Guibas +3 more
- 01 Jun 2021
TL;DR: In this paper, the first quantum algorithm for solving a synchronization problem in the context of computer vision is presented, which involves solving a non-convex optimization problem in discrete variables.
Probabilistic Permutation Synchronization Using the Riemannian Structure of the Birkhoff Polytope
Tolga Birdal,Umut Simsekli +1 more
- 11 Apr 2019
TL;DR: In this article, a new geometric and probabilistic approach to synchronization of correspondences across multiple sets of objects or images is presented, based on the first order retraction operators.
Synchronisation of Partial Multi-Matchings via Non-negative Factorisations
TL;DR: This work derives an algorithm to tackle the permutation synchronisation problem based on non-negative factorisations based on a novel rotation scheme applied to the solution of the spectral relaxation and achieves better results compared to existing methods.
33
References
Distinctive Image Features from Scale-Invariant Keypoints
TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
TL;DR: It is shown that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space.
4.4K
A Comparison of Affine Region Detectors
Krystian Mikolajczyk,Tinne Tuytelaars,Cordelia Schmid,Andrew Zisserman,Jiri Matas,Frederik Schaffalitzky,Timor Kadir,L. Van Gool +7 more
TL;DR: A snapshot of the state of the art in affine covariant region detectors, and compares their performance on a set of test images under varying imaging conditions to establish a reference test set of images and performance software so that future detectors can be evaluated in the same framework.
Vlfeat: an open and portable library of computer vision algorithms
Andrea Vedaldi,Brian Fulkerson +1 more
- 25 Oct 2010
TL;DR: VLFeat is an open and portable library of computer vision algorithms that includes rigorous implementations of common building blocks such as feature detectors, feature extractors, (hierarchical) k-means clustering, randomized kd-tree matching, and super-pixelization.
Computing Persistent Homology
TL;DR: In this article, it was shown that the persistent homology of a filtered d-dimensional simplicial complex is simply the standard homology over a polynomial ring of a particular graded module.