Maximal Linear Embedding for Dimensionality Reduction

Over the past few decades, dimensionality reduction has been widely exploited in computer vision and pattern analysis. This paper proposes a simple but effective nonlinear dimensionality reduction algorithm, named Maximal Linear Embedding (MLE). MLE learns a parametric mapping to recover a single gl...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 33(2011), 9 vom: 24. Sept., Seite 1776-92
1. Verfasser: Wang, Ruiping (VerfasserIn)
Weitere Verfasser: Shan, Shiguang, Chen, Xilin, Chen, Jie, Gao, Wen
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2011
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM206209878
003 DE-627
005 20231223235439.0
007 cr uuu---uuuuu
008 231223s2011 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2011.39  |2 doi 
028 5 2 |a pubmed24n0687.xml 
035 |a (DE-627)NLM206209878 
035 |a (NLM)21358001 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Wang, Ruiping  |e verfasserin  |4 aut 
245 1 0 |a Maximal Linear Embedding for Dimensionality Reduction 
264 1 |c 2011 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 27.11.2015 
500 |a Date Revised 10.09.2015 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Over the past few decades, dimensionality reduction has been widely exploited in computer vision and pattern analysis. This paper proposes a simple but effective nonlinear dimensionality reduction algorithm, named Maximal Linear Embedding (MLE). MLE learns a parametric mapping to recover a single global low-dimensional coordinate space and yields an isometric embedding for the manifold. Inspired by geometric intuition, we introduce a reasonable definition of locally linear patch, Maximal Linear Patch (MLP), which seeks to maximize the local neighborhood in which linearity holds. The input data are first decomposed into a collection of local linear models, each depicting an MLP. These local models are then aligned into a global coordinate space, which is achieved by applying MDS to some randomly selected landmarks. The proposed alignment method, called Landmarks-based Global Alignment (LGA), can efficiently produce a closed-form solution with no risk of local optima. It just involves some small-scale eigenvalue problems, while most previous aligning techniques employ time-consuming iterative optimization. Compared with traditional methods such as ISOMAP and LLE, our MLE yields an explicit modeling of the intrinsic variation modes of the observation data. Extensive experiments on both synthetic and real data indicate the effectivity and efficiency of the proposed algorithm 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Shan, Shiguang  |e verfasserin  |4 aut 
700 1 |a Chen, Xilin  |e verfasserin  |4 aut 
700 1 |a Chen, Jie  |e verfasserin  |4 aut 
700 1 |a Gao, Wen  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 33(2011), 9 vom: 24. Sept., Seite 1776-92  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:33  |g year:2011  |g number:9  |g day:24  |g month:09  |g pages:1776-92 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2011.39  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 33  |j 2011  |e 9  |b 24  |c 09  |h 1776-92