Skip to main content
. 2012 Apr 3;39(4):2275–2289. doi: 10.1118/1.3682173

Figure 1.

Figure 1

The steps of Isomap algorithm used for mapping data into lower dimension d: (1) find K nearest neighbors for each data point Xi; (2) calculate pair-wise geodesic distance matrix and reconstruct neighborhood graph using Dijkstra search algorithm; (3) apply Multidimensional scaling (MDS) on the reconstructed neighborhood graph (matrix D) to compute the low-dimensional embedding vectors.