TY - JOUR
T1 - Nonlinear dimensionality reduction by topologically constrained isometric embedding
AU - Rosman, Guy
AU - Bronstein, Michael M.
AU - Bronstein, Alexander M.
AU - Kimmel, Ron
N1 - Funding Information:
This research was partly supported by United States–Israel Binational Science Foundation grant No. 2004274, by the Israel Science Foundation (grant no. 623/08) by the Ministry of Science grant No. 3-3414, by the Office of Naval Research (ONR) grant, and by the Elias Fund for Medical Research.
PY - 2010/8
Y1 - 2010/8
N2 - Many manifold learning procedures try to embed a given feature data into a flat space of low dimensionality while preserving as much as possible the metric in the natural feature space. The embedding process usually relies on distances between neighboring features, mainly since distances between features that are far apart from each other often provide an unreliable estimation of the true distance on the feature manifold due to its non-convexity. Distortions resulting from using long geodesics indiscriminately lead to a known limitation of the Isomap algorithm when used to map non-convex manifolds. Presented is a framework for nonlinear dimensionality reduction that uses both local and global distances in order to learn the intrinsic geometry of flat manifolds with boundaries. The resulting algorithm filters out potentially problematic distances between distant feature points based on the properties of the geodesics connecting those points and their relative distance to the boundary of the feature manifold, thus avoiding an inherent limitation of the Isomap algorithm. Since the proposed algorithm matches non-local structures, it is robust to strong noise. We show experimental results demonstrating the advantages of the proposed approach over conventional dimensionality reduction techniques, both global and local in nature.
AB - Many manifold learning procedures try to embed a given feature data into a flat space of low dimensionality while preserving as much as possible the metric in the natural feature space. The embedding process usually relies on distances between neighboring features, mainly since distances between features that are far apart from each other often provide an unreliable estimation of the true distance on the feature manifold due to its non-convexity. Distortions resulting from using long geodesics indiscriminately lead to a known limitation of the Isomap algorithm when used to map non-convex manifolds. Presented is a framework for nonlinear dimensionality reduction that uses both local and global distances in order to learn the intrinsic geometry of flat manifolds with boundaries. The resulting algorithm filters out potentially problematic distances between distant feature points based on the properties of the geodesics connecting those points and their relative distance to the boundary of the feature manifold, thus avoiding an inherent limitation of the Isomap algorithm. Since the proposed algorithm matches non-local structures, it is robust to strong noise. We show experimental results demonstrating the advantages of the proposed approach over conventional dimensionality reduction techniques, both global and local in nature.
KW - Differential geometry
KW - Dimensionality reduction
KW - Image manifolds
KW - Isomap
KW - Machine learning
UR - http://www.scopus.com/inward/record.url?scp=77951298811&partnerID=8YFLogxK
U2 - 10.1007/s11263-010-0322-1
DO - 10.1007/s11263-010-0322-1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:77951298811
VL - 89
SP - 56
EP - 68
JO - International Journal of Computer Vision
JF - International Journal of Computer Vision
SN - 0920-5691
IS - 1
ER -