Title :
Singularity resolution for dimension reduction
Author :
Martin, Sebastien ; Szymanski, Lech
Author_Institution :
Sandia Nat. Labs., Albuquerque, NM, USA
Abstract :
Manifold clustering is often used to partition a multiple manifold dataset prior to the application of manifold learning. Thus manifold clustering can be seen as a preprocessing step for eliminating singularities in a dataset before doing dimension reduction. In this paper, we propose an algorithm for resolving singularities prior to dimension reduction. We achieve singularity resolution using algebraic blow ups as motivation. With this type of singularity resolution, we are able to simultaneously perform manifold clustering and learning. The algorithm is based on a simple modification of Isomap which identifies and treats singularities before providing reduced dimensional representations. We demonstrate our algorithm with various examples and apply it to problems in molecular conformation, motion segmentation, and face clustering.
Keywords :
algebra; computational geometry; data reduction; data visualisation; differential geometry; learning (artificial intelligence); pattern clustering; Isomap; algebraic blow ups; algebraic geometry; face clustering; low-dimensional representations; low-dimensional visualizations; manifold clustering; manifold learning; molecular conformation; motion segmentation; nonlinear dimensionality reduction algorithm; singularity elimination; singularity resolution; Accuracy; Clustering algorithms; Computer vision; Manifolds; Motion segmentation; Noise; Visualization;
Conference_Titel :
Image and Vision Computing New Zealand (IVCNZ), 2013 28th International Conference of
Conference_Location :
Wellington
Print_ISBN :
978-1-4799-0882-0
DOI :
10.1109/IVCNZ.2013.6726986