By Topic

On 3-D Point Set Matching With MAE and SAE Cost Criteria

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Giuseppe C. Calafiore ; Politecnico di Torino, Turin

This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sum-of-squared-errors criterion is minimized in order to obtain the optimal displacement, we here analyze the use of [maximum absolute error (MAE)] and [sum of absolute errors (SAE)] cost criteria for determining the optimal matching. Two numerically efficient (polynomial time) algorithms are developed in this paper to compute an approximately optimal solution for the MAE and SAE matching problems.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans  (Volume:38 ,  Issue: 2 )