Article (Scientific journals)
A k-segments algorithm for finding principal curves
Verbeek, J. J.; VLASSIS, Nikos; Kröse, B.
2002In Pattern Recognition Letters, 23 (8), p. 1009-1017
Peer Reviewed verified by ORBi
 

Files


Full Text
download.pdf
Author postprint (188.06 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Abstract :
[en] 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.
Disciplines :
Computer science
Author, co-author :
Verbeek, J. J.
VLASSIS, Nikos ;  University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB)
Kröse, B.
Language :
English
Title :
A k-segments algorithm for finding principal curves
Publication date :
2002
Journal title :
Pattern Recognition Letters
ISSN :
0167-8655
eISSN :
1872-7344
Publisher :
Elsevier Science
Volume :
23
Issue :
8
Pages :
1009-1017
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBilu :
since 17 November 2013

Statistics


Number of views
197 (0 by Unilu)
Number of downloads
236 (0 by Unilu)

Scopus citations®
 
99
Scopus citations®
without self-citations
99
OpenAlex citations
 
111
WoS citations
 
76

Bibliography


Similar publications



Contact ORBilu