DocumentCode :
1056147
Title :
On 3-D Point Set Matching With MAE and SAE Cost Criteria
Author :
Calafiore, Giuseppe C.
Author_Institution :
Politecnico di Torino, Turin
Volume :
38
Issue :
2
fYear :
2008
fDate :
3/1/2008 12:00:00 AM
Firstpage :
443
Lastpage :
450
Abstract :
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.
Keywords :
computational complexity; iterative methods; pattern matching; set theory; MAE cost criteria; SAE cost criteria; iterative convexification technique; maximum absolute error; optimal 3D point set matching; ordered sets; polynomial time algorithms; rigid displacement; Least squares fitting; maximum absolute error (MAE); point set matching; sum of absolute error (SAE);
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on
Publisher :
ieee
ISSN :
1083-4427
Type :
jour
DOI :
10.1109/TSMCA.2007.914774
Filename :
4445701
Link To Document :
بازگشت