A k-segments algorithm for finding principal curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2000

A k-segments algorithm for finding principal curves

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


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.
Fichier principal
Vignette du fichier
verbeek00tr.pdf (282.55 Ko) Télécharger le fichier
Vignette du fichier
VVK00.png (29.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

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


  • HAL Id : inria-00321517 , version 1


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⟩


187 View
313 Download


Gmail Facebook X LinkedIn More