Robust Point Matching Revisited: A Concave Optimization Approach

View Researcher's Other Codes

MATLAB code for the paper: “Robust Point Matching Revisited: A Concave Optimization Approach”.

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Wei Lian and Lei Zhang
Journal/Conference Name European Conference on Computer Vision (ECCV 2012)
Paper Category
Paper Abstract The well-known robust point matching (RPM) method uses deterministic annealing for optimization, and it has two problems. First, it cannot guarantee the global optimality of the solution and tends to align the centers of two point sets. Second, deformation needs to be regularized to avoid the generation of undesirable results. To address these problems, in this paper we first show that the energy function of RPM can be reduced to a concave function with very few non-rigid terms after eliminating the transformation variables and applying linear transformation; we then propose to use concave optimization technique to minimize the resulting energy function. The proposed method scales well with problem size, achieves the globally optimal solution, and does not need regularization for simple transformations such as similarity trans-form. Experiments on synthetic and real data validate the advantages of our method in comparison with state-of-the-art methods.
Date of publication 2012
Code Programming Language MATLAB
Comment

Copyright Researcher 2021