MSClique: Multiple structure discovery through the maximum weighted clique problem

Identificador:  imarina:9282598

Handle: https://hdl.handle.net/20.500.11797/imarina9282598

Autors:  Sanroma, G; Penate-Sanchez, A; Alquézar, R; Serratosa, F; Moreno-Noguer, F; Andrade-Cetto, J; Ballester, MAG

Resum:
We present a novel approach for feature correspondence and multiple structure discovery in computer vision. In contrast to existing methods, we exploit the fact that point-sets on the same structure usually lie close to each other, thus forming clusters in the image. Given a pair of input images, we initially extract points of interest and extract hierarchical representations by agglomerative clustering. We use the maximum weighted clique problem to find the set of corresponding clusters with maximum number of inliers representing the multiple structures at the correct scales. Our method is parameter-free and only needs two sets of points along with their tentative correspondences, thus being extremely easy to use. We demonstrate the effectiveness of our method in multiple-structure fitting experiments in both publicly available and in-house datasets. As shown in the experiments, our approach finds a higher number of structures containing fewer outliers compared to state-of-the-art methods. © 2016 Sanroma et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.