A soft k-segments algorithm for principal curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

A soft k-segments algorithm for principal curves

Jakob Verbeek
Nikos Vlassis
  • Function : Author
  • PersonId : 853678
Ben Krose
  • Function : Author
  • PersonId : 853721


We propose a new method to find principal curves for data sets. The method repeats three steps until a stopping criterion is met. In the first step, k (unconnected) line segments are fitted on the data. The second step connects the segments to form a polygonal line, and evaluates the quality of the resulting polygonal line. The third step inserts a new line segment. We compare the performance of our new method with other existing methods to find principal curves.
Fichier principal
Vignette du fichier
verbeek01icann2.pdf (180.2 Ko) Télécharger le fichier
Vignette du fichier
VVK01.png (13.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

inria-00321506 , version 1 (16-02-2011)



Jakob Verbeek, Nikos Vlassis, Ben Krose. A soft k-segments algorithm for principal curves. International Conference on Artificial Neural Networks, Aug 2001, Vienna, Austria. pp.450-456, ⟨10.1007/3-540-44668-0_63⟩. ⟨inria-00321506⟩
80 View
499 Download



Gmail Facebook X LinkedIn More