DocumentCode
2267610
Title
Mahalanobis distance Minimization Mapping: M3
Author
Oka, Aiko ; Wada, Toshikazu
Author_Institution
Fac. of Syst. Eng., Wakayama Univ., Wakayama, Japan
fYear
2009
fDate
Sept. 27 2009-Oct. 4 2009
Firstpage
93
Lastpage
100
Abstract
This paper presents a versatile linear regression method between high-dimensional spaces based on Mahalanobis distance minimization criterion. Standard regression methods suffer from ¿multi-collinearity¿ problem, which makes regressions unstable and unreliable. For solving this problem, dimensionality reduction methods, such as PCR, PLS, and CCA, are widely used. These dimensionality reduction methods can robustly capture the major correlations between input and output variables by suppressing the minor correlations. However, the minor correlations are sometimes necessary for estimating natural outputs. In this paper, we propose Mahalanobis-distance Minimization Mapping (M3), which avoids multi-collinearity problem without reducing the dimensionality. M3 estimates the most likely output according to the training sample distribution. We conducted experiments for comparing the accuracy among M3, CCA, and other methods, and we confirmed that M3 always estimates the most accurate outputs among them.
Keywords
image processing; regression analysis; dimensionality reduction methods; linear regression method; mahalanobis distance minimization mapping; multicollinearity problem; Computer vision; Conferences; Frequency estimation; Input variables; Least squares methods; Linear regression; Minimization methods; Pixel; Robustness; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision Workshops (ICCV Workshops), 2009 IEEE 12th International Conference on
Conference_Location
Kyoto
Print_ISBN
978-1-4244-4442-7
Electronic_ISBN
978-1-4244-4441-0
Type
conf
DOI
10.1109/ICCVW.2009.5457712
Filename
5457712
Link To Document