Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
535773 | Pattern Recognition Letters | 2006 | 9 Pages |
Abstract
This paper studies the k-segments algorithm proposed by Verbeek et al. [Verbeek, J.J., Vlassis, N., Krose, B., 2002. A k-segments algorithm for finding principal curves, Pattern Recognition Lett. 23, 1009–1017] for computing principal curves. In particular an automatic method for choosing the “free” parameters in this k-segments algorithm is proposed. Experimental results are provided to demonstrate the performance of this proposed method.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Vision and Pattern Recognition
Authors
Haonan Wang, Thomas C.M. Lee,