inria-00321497, version 1
A k-segments algorithm for finding principal curves
Jakob Verbeek
1Nikos Vlassis 1Ben Krose 1
Pattern Recognition Letters 23, 8 (2002) 1009--1017
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.
- 1: Instituut voor Informatica (IvI)
- Universiteit van Amsterdam
- Domain : Computer Science/Learning
- Keywords : Dimension reduction – Feature extraction – Polygonal line – Principal curve – Unsupervised learning
- inria-00321497, version 1
- http://hal.inria.fr/inria-00321497
- oai:hal.inria.fr:inria-00321497
- From: Jakob Verbeek
- Submitted on: Wednesday, 16 February 2011 16:47:38
- Updated on: Friday, 18 February 2011 14:08:29
Associated documents
Export