Towards Discrete Solution: A Sparse Preserving Method for Correspondence Problem

09/20/2018
by   Bo Jiang, et al.
0

Many problems of interest in computer vision can be formulated as a problem of finding consistent correspondences between two feature sets. Feature correspondence (matching) problem with one-to-one mapping constraint is usually formulated as an Integral Quadratic Programming (IQP) problem with permutation (or orthogonal) constraint. Since it is NP-hard, relaxation models are required. One main challenge for optimizing IQP matching problem is how to incorporate the discrete one-to-one mapping (permutation) constraint in its quadratic objective optimization. In this paper, we present a new relaxation model, called Sparse Constraint Preserving Matching (SPM), for IQP matching problem. SPM is motivated by our observation that the discrete permutation constraint can be well encoded via a sparse constraint. Comparing with traditional relaxation models, SPM can incorporate the discrete one-to-one mapping constraint straightly via a sparse constraint and thus provides a tighter relaxation for original IQP matching problem. A simple yet effective update algorithm has been derived to solve the proposed SPM model. Experimental results on several feature matching tasks demonstrate the effectiveness and efficiency of SPM method.

READ FULL TEXT
research
05/17/2017

DS++: A flexible, scalable and provably tight relaxation for matching problems

Correspondence problems are often modelled as quadratic optimization pro...
research
04/28/2010

Many-to-Many Graph Matching: a Continuous Relaxation Approach

Graphs provide an efficient tool for object representation in various co...
research
09/30/2021

Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation

We address the non-convex optimisation problem of finding a sparse matri...
research
05/13/2014

Graph Matching: Relax at Your Own Risk

Graph matching---aligning a pair of graphs to minimize their edge disagr...
research
06/12/2016

A constrained clustering based approach for matching a collection of feature sets

In this paper, we consider the problem of finding the feature correspond...
research
11/02/2016

Initialization and Coordinate Optimization for Multi-way Matching

We consider the problem of consistently matching multiple sets of elemen...
research
08/29/2013

GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure

In this paper we propose the Graduated NonConvexity and Graduated Concav...

Please sign up or login with your details

Forgot password? Click here to reset