A k-segments algorithm for finding principal curves

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas


https://hal.inria.fr/inria-00321497
Contributor : Jakob Verbeek <>
Submitted on : Wednesday, February 16, 2011 - 4:47:38 PM
Last modification on : Monday, September 25, 2017 - 10:08:04 AM
Long-term archiving on : Tuesday, May 17, 2011 - 2:30:20 AM

Files

10.1.1.20.291.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

384

Files downloads

704