Angular Embedding: A Robust Quadratic Criterion

作者：Yu Stella X^*

来源：IEEE Transactions on Pattern Analysis and Machine Intelligence, 2012, 34(1): 158-173.

DOI：10.1109/TPAMI.2011.107

• Least squares methods
• spectral methods
• graph algorithms
• constrained optimization
• linear programming
• statistical computing
• clustering
• modeling and recovery of physical attributes

Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a near-global optimal eigensolution. As a quadratic criterion in the complex domain, AE is remarkably robust to outliers, unlike its real domain counterpart LS, the least squares embedding. Our comparative study of LS and AE reveals that AE%26apos;s robustness is due not to the particular choice of the criterion, but to the choice of representation in the complex domain. When the embedding is encoded in the angular space, we not only have a nonconvex error function that delivers robustness, but also have a Hermitian graph Laplacian that completely determines the optimum and delivers efficiency. The high quality of embedding by AE in the presence of outliers can hardly be matched by LS, its corresponding L(1) norm formulation, or their bounded versions. These results suggest that the key to overcoming outliers lies not with additionally imposing constraints on the embedding solution, but with adaptively penalizing inconsistency between measurements themselves. AE thus significantly advances statistical ranking methods by removing the impact of outliers directly without explicit inconsistency characterization, and advances spectral clustering methods by covering the entire size-confidence measurement space and providing an ordered cluster organization.

• 出版日期2012-1