Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/220009
Title: An Efficient Globally Optimal Algorithm for Asymmetric Point Matching
Authors: Wei Lian;Lei Zhang;Ming-Hsuan Yang
Year: 2017
Publisher: IEEE
Abstract: Although the robust point matching algorithm has been demonstrated to be effective for non-rigid registration, there are several issues with the adopted deterministic annealing optimization technique. First, it is not globally optimal and regularization on the spatial transformation is needed for good matching results. Second, it tends to align the mass centers of two point sets. To address these issues, we propose a globally optimal algorithm for the robust point matching problem in the case that each model point has a counterpart in scene set. By eliminating the transformation variables, we show that the original matching problem is reduced to a concave quadratic assignment problem where the objective function has a low rank Hessian matrix. This facilitates the use of large scale global optimization techniques. We propose a modified normal rectangular branch-and-bound algorithm to solve the resulting problem where multiple rectangles are simultaneously subdivided to increase the chance of shrinking the rectangle containing the global optimal solution. In addition, we present an efficient lower bounding scheme which has a linear assignment formulation and can be efficiently solved. Extensive experiments on synthetic and real datasets demonstrate the proposed algorithm performs favorably against the state-of-the-art methods in terms of robustness to outliers, matching accuracy, and run-time.
URI: http://localhost/handle/Hannan/220009
volume: 39
issue: 7
More Information: 1281,
1293
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7555337.pdf1.7 MBAdobe PDF
Title: An Efficient Globally Optimal Algorithm for Asymmetric Point Matching
Authors: Wei Lian;Lei Zhang;Ming-Hsuan Yang
Year: 2017
Publisher: IEEE
Abstract: Although the robust point matching algorithm has been demonstrated to be effective for non-rigid registration, there are several issues with the adopted deterministic annealing optimization technique. First, it is not globally optimal and regularization on the spatial transformation is needed for good matching results. Second, it tends to align the mass centers of two point sets. To address these issues, we propose a globally optimal algorithm for the robust point matching problem in the case that each model point has a counterpart in scene set. By eliminating the transformation variables, we show that the original matching problem is reduced to a concave quadratic assignment problem where the objective function has a low rank Hessian matrix. This facilitates the use of large scale global optimization techniques. We propose a modified normal rectangular branch-and-bound algorithm to solve the resulting problem where multiple rectangles are simultaneously subdivided to increase the chance of shrinking the rectangle containing the global optimal solution. In addition, we present an efficient lower bounding scheme which has a linear assignment formulation and can be efficiently solved. Extensive experiments on synthetic and real datasets demonstrate the proposed algorithm performs favorably against the state-of-the-art methods in terms of robustness to outliers, matching accuracy, and run-time.
URI: http://localhost/handle/Hannan/220009
volume: 39
issue: 7
More Information: 1281,
1293
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7555337.pdf1.7 MBAdobe PDF
Title: An Efficient Globally Optimal Algorithm for Asymmetric Point Matching
Authors: Wei Lian;Lei Zhang;Ming-Hsuan Yang
Year: 2017
Publisher: IEEE
Abstract: Although the robust point matching algorithm has been demonstrated to be effective for non-rigid registration, there are several issues with the adopted deterministic annealing optimization technique. First, it is not globally optimal and regularization on the spatial transformation is needed for good matching results. Second, it tends to align the mass centers of two point sets. To address these issues, we propose a globally optimal algorithm for the robust point matching problem in the case that each model point has a counterpart in scene set. By eliminating the transformation variables, we show that the original matching problem is reduced to a concave quadratic assignment problem where the objective function has a low rank Hessian matrix. This facilitates the use of large scale global optimization techniques. We propose a modified normal rectangular branch-and-bound algorithm to solve the resulting problem where multiple rectangles are simultaneously subdivided to increase the chance of shrinking the rectangle containing the global optimal solution. In addition, we present an efficient lower bounding scheme which has a linear assignment formulation and can be efficiently solved. Extensive experiments on synthetic and real datasets demonstrate the proposed algorithm performs favorably against the state-of-the-art methods in terms of robustness to outliers, matching accuracy, and run-time.
URI: http://localhost/handle/Hannan/220009
volume: 39
issue: 7
More Information: 1281,
1293
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7555337.pdf1.7 MBAdobe PDF