Abstract : We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines. New segments are inserted until a performance criterion is met. Experimental results illustrate the performance of the method compared to other existing approaches.
https://hal.inria.fr/inria-00321517
Contributeur : Jakob Verbeek
<>
Soumis le : mercredi 16 février 2011 - 17:02:29
Dernière modification le : lundi 25 septembre 2017 - 10:08:04
Document(s) archivé(s) le : mardi 17 mai 2011 - 02:38:20
Jakob Verbeek, Nikos Vlassis, Ben Krose. A k-segments algorithm for finding principal curves. [Technical Report] IAS-UVA-00-11, 2000, pp.12. 〈inria-00321517〉
