Share Email Print

Optical Engineering

Relaxed maximum-variance unfolding
Author(s): Chenping Hou; Yuanyuan Jiao; Yi Wu; Dongyun Yi
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Nonlinear dimensionality reduction (recently called manifold learning) is crucial in many research fields. Maximum-variance unfolding (MVU) is one of the most important approaches to it. Unfortunately, due to too strict local constraints, MVU cannot unfold the manifold when short-circuit edges appear or the embedded mapping is conformal but not isometric. A relaxed version, relaxed MVU (RMVU), is proposed. Neighbors are adaptively assigned when short-circuit edges appear, and local distance is rescaled when the manifold is assumed to be angle-preserving. RMVU can effectively solve the preceding problems with MVU. More importantly, RMVU also performs better than MVU in general cases, and hence it has huge potential in many fields. Additionally, the proposed two strategies can also be used in other manifold learning algorithms. Experiments, accompanied with numerical comparisons, were performed on both synthetic and real data sets to demonstrate the effectiveness of RMVU.

Paper Details

Date Published: 1 July 2008
PDF: 12 pages
Opt. Eng. 47(7) 077202 doi: 10.1117/1.2956373
Published in: Optical Engineering Volume 47, Issue 7
Show Author Affiliations
Chenping Hou, National Univ. of Defense Technology (China)
Yuanyuan Jiao, National Univ. of Defense Technology (China)
Yi Wu, National Univ. of Defense Technology (China)
Dongyun Yi, National Univ. of Defense Technology (China)

© SPIE. Terms of Use
Back to Top