A k-segments algorithm for finding principal curves

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.

Saved in:
Bibliographic Details
Published inPattern recognition letters Vol. 23; no. 8; pp. 1009 - 1017
Main Authors Verbeek, J.J., Vlassis, N., Kröse, B.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.06.2002
Elsevier
Subjects
Computer Science
Dimension reduction
Feature extraction
Machine Learning
Polygonal line
Principal curve
Unsupervised learning
Dimension reduction
Feature extraction
Principal curve
Unsupervised learning
Polygonal line
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0167-8655
1872-7344
DOI:10.1016/S0167-8655(02)00032-6