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. 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 :
Reports
Complete list of metadatas


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

Files

verbeek00tr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00321517, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

292

Files downloads

427