A k-segments algorithm for finding principal curves

Reference : A k-segments algorithm for finding principal curves


	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/11072

Title :	A k-segments algorithm for finding principal curves
Language :	English
Author, co-author :	Verbeek, J. J. [> >]
	Vlassis, Nikos [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
	Kröse, B. [> >]
Publication date :	2002
Journal title :	Pattern Recognition Letters
Publisher :	Elsevier Science
Volume :	23
Issue/season :	8
Pages :	1009-1017
Peer reviewed :	Yes (verified by ORBi^lu)
ISSN :	0167-8655
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.
Permalink :	http://hdl.handle.net/10993/11072

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	download.pdf		Author postprint	183.66 kB	View/Open

All documents in ORBi^lu are protected by a user license.