A k-segments algorithm for finding principal curves - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Pattern Recognition Letters Year : 2002

A k-segments algorithm for finding principal curves

Jakob Verbeek
Nikos Vlassis
  • Function : Author
  • PersonId : 853678


We propose an incremental method to find principal curves. Line segments are fitted and connected to form polygonal lines (PLs). 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 (183.66 Ko) Télécharger le fichier
Vignette du fichier
VVK02.png (20.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

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



Jakob Verbeek, Nikos Vlassis, Ben Krose. A k-segments algorithm for finding principal curves. Pattern Recognition Letters, 2002, 23 (8), pp.1009--1017. ⟨10.1016/S0167-8655(02)00032-6⟩. ⟨inria-00321497⟩
368 View
585 Download



Gmail Facebook X LinkedIn More