Natural morphological extraction based on the nonlinear manifold pursuit (NMP) algorithm

A manifold defined as a smooth curve passing through the middle of data points can be a good morphological representation for the data feature extraction. In this paper, a new algorithm called nonlinear manifold pursuit (NMP) is introduced to find an ID nonlinear manifold embedded in the 2D Euclidean space. Based on virtual principal direction, the algorithm constructs the global topology from the continuous increment of the local topology. The corresponding nonlinear manifold is, then, developed by a set of piecewise lines passing through the middle of global topology. NMP is applied to both synthetic and real data in many applications such as skeletonization, object detection, and curve fitting

[1]  C. Lursinsap,et al.  Non-Euclidean self-organizing classification using natural manifold distance , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[2]  Adam Krzyzak,et al.  Piecewise Linear Skeletonization Using Principal Curves , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Hong Yan Fuzzy curve-tracing algorithm , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[4]  Baback Moghaddam,et al.  Principal Manifolds and Probabilistic Subspaces for Visual Recognition , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Joachim M. Buhmann,et al.  Path-Based Clustering for Grouping of Smooth Curves and Texture Segmentation , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Adam Krzyzak,et al.  Learning and Design of Principal Curves , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  C. Lursinsap,et al.  Adaptive second order self-organizing mapping for 2D pattern representation , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).