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 …
We consider the problem of finding consistent matches across multiple images. Current state- of-the-art solutions use constraints on cycles of matches together with convex optimization …
P Swoboda, A Mokarian, C Theobalt… - Proceedings of the …, 2019 - openaccess.thecvf.com
We present a convex relaxation for the multi-graph matching problem. Our formulation allows for partial pairwise matchings, guarantees cycle consistency, and our objective …
Joint matching over a collection of objects aims at aggregating information from a large collection of similar instances (eg images, graphs, shapes) to improve maps between pairs …
O Collier, AS Dalalyan - The Journal of Machine Learning Research, 2016 - jmlr.org
The problem of matching two sets of features appears in various tasks of computer vision and can be often formalized as a problem of permutation estimation. We address this …
In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and …
A Mahmood, S Khan - IEEE Transactions on Image Processing, 2010 - ieeexplore.ieee.org
Elimination Algorithms are often used in template matching to provide a significant speed-up by skipping portions of the computation while guaranteeing the same best-match location as …
M Okutomi, T Kanade - International journal of computer vision, 1992 - Springer
This article presents a signal matching algorithm that can select an appropriate window size adaptively so as to obtain both precise and stable estimation of correspondences. Matching …
J Weng - International Journal of Computer Vision, 1993 - Springer
A theoretical framework is presented in which windowed Fourier phase (WFP) is introduced as the primary matching primitive. Zero-crossings and peaks correspond to special values of …