A Concave Optimization Algorithm for Matching Partially Overlapping Point Sets

01/04/2017
by   Wei Lian, et al.
0

Point matching refers to the process of finding spatial transformation and correspondences between two sets of points. In this paper, we focus on the case that there is only partial overlap between two point sets. Following the approach of the robust point matching method, we model point matching as a mixed linear assignment-least square problem and show that after eliminating the transformation variable, the resulting problem of minimization with respect to point correspondence is a concave optimization problem. Furthermore, this problem has the property that the objective function can be converted into a form with few nonlinear terms via a linear transformation. Based on these properties, we employ the branch-and-bound (BnB) algorithm to optimize the resulting problem where the dimension of the search space is small. To further improve efficiency of the BnB algorithm where computation of the lower bound is the bottleneck, we propose a new lower bounding scheme which has a k-cardinality linear assignment formulation and can be efficiently solved. Experimental results show that the proposed algorithm outperforms state-of-the-art methods in terms of robustness to disturbances and point matching accuracy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/05/2020

Aligning Partially Overlapping Point Sets: an Inner Approximation Algorithm

Aligning partially overlapping point sets where there is no prior inform...
research
01/19/2021

Hybrid Trilinear and Bilinear Programming for Aligning Partially Overlapping Point Sets

Alignment methods which can handle partially overlapping point sets and ...
research
03/17/2020

Linear Regression without Correspondences via Concave Minimization

Linear regression without correspondences concerns the recovery of a sig...
research
01/28/2019

Globally Optimal Registration based on Fast Branch and Bound

The problem of planar registration consists in finding the transformatio...
research
04/20/2021

An Exact Hypergraph Matching Algorithm for Nuclear Identification in Embryonic Caenorhabditis elegans

Finding an optimal correspondence between point sets is a common task in...
research
08/19/2022

A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems

In this article, we discuss an exact algorithm for solving mixed integer...
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...

Please sign up or login with your details

Forgot password? Click here to reset