Q–MAF shape decomposition

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper address the problems of generating a low dimensional representation of the shape variation present in a set of shapes represented by a number of landmark points. First, we will present alternatives to the featured Least-Squares Procrustes alignment based on the L∞-norm and the L1-norm. Second, we will define a new shape decomposition based on the Maximum Autocorrelation Factor (MAF) analysis, and investigate and compare its properties to the Principal Components Analysis (PCA). It is shown that Molgedey-Schuster algorithm for Independent Component Analysis (ICA) is equivalent to the MAF analysis. The shape MAF analysis utilises the natural order of landmark points along shape contours.

Cite

CITATION STYLE

APA

Larsen, R., Eiriksson, H., & Stegmann, M. B. (2001). Q–MAF shape decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2208, pp. 837–844). Springer Verlag. https://doi.org/10.1007/3-540-45468-3_100

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free