Abstract
The locally linear embedding (LLE) is an effective algorithm for dimensional reduction, visualization and classification, which can automatically discover the low-dimensional nonlinear manifold in a high-dimensional data space and then embed the data points into a low-dimensional embedding space, using tractable linear algebraic techniques that are easy to implement. Despite its appealing properties, LLE is not robust against outliers in the data, yet so far very little has been done to address the robustness problem. To improve the performance of LLE, some modified LLE algorithms were proposed by rigidly restraining the influence of the noise and outliers in the data embedding. In this paper, a weighted LLE (WLLE) is proposed. The experiments on synthetic data and real plant leaf image data demonstrate that WLLE is effective and feasible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tenenbaum, J.B., Silva, V., de Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000)
Balasubramanian, M., Schwartz, E.L.: The LLE algorithm and topological stability. Science 295(5552), 7 (2000)
Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)
Brand, M.: Charting a manifold. In: Advances in Neural Information Processing Systems, vol. 15. MITPress, Cambridge (2003)
Donoho, D., Grimes, C.: Hessian eigenmaps: new tools for nonlinear dimensionality reduction. Proceedings of National Academy of Science, 5591–5596 (2003)
Chang, H., Yeung, D.Y.: Robust locally linear embedding. Pattern recognition 39(6), 1053–1065 (2006)
Zhang, Z.Y., Wang, J.: MLLE: Modified locally linear embedding using multiple weights. In: Advances in Neural Information Processing Systems, vol. 19, pp. 171–181. MIT Press, Cambridge (2007)
Wang, J., Zhang, Z.Y., Zha, H.Y.: Adaptive manifold learning. In: Advances in Neural Information Processing Systems, vol. 17, pp. 1473–1480. MIT Press, Cambridge (2005)
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and Clustering. In: Advances in Neural Information Processing Systems, vol. 14, pp. 585–591. MIT Press, Cambridge (2001)
Hadid, P.M.: Efficient locally linear embeddings of imperfect manifolds. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNCS, vol. 2734, pp. 188–201, 5–7. Springer, Heidelberg (2003)
Zhang, Z., Zha, H.: Local linear smoothing for nonlinear manifold learning. CSE-03-003, Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA, USA (2003)
Park, J., Zhang, Z., Zha, H., Kasturi, R.: Local smoothing for manifold learning. In: CVPR’04, vol. 2, pp. 452–459 (2004)
Chang, H., Yeung, D.Y.: Robust locally linear embedding. Pattern Recognition 39(6), 1053–1065 (2006)
Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, SW., Liu, J. (2010). Weighted Locally Linear Embedding for Plant Leaf Visualization. In: Huang, DS., Zhang, X., Reyes García, C.A., Zhang, L. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2010. Lecture Notes in Computer Science(), vol 6216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14932-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-14932-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14931-3
Online ISBN: 978-3-642-14932-0
eBook Packages: Computer ScienceComputer Science (R0)