A k-segments algorithm for finding principal curves

DOI10.1016/S0167-8655(02)00032-6zbMath1015.68164MaRDI QIDQ4537346

Jakob Verbeek, Nikos Vlassis, Ben Kröse

Publication date: 27 June 2002

Published in: Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00032-6

zbMATH Keywords

principal curves; polygonal lines

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T10: Pattern recognition, speech recognition

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Modeling local nonlinear correlations using subspace principal curves, Robust nonlinear principal components, Moving multiple curves/surfaces approximation of mixed point clouds, Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map, Constraint local principal curve: concept, algorithms and applications, Multiple penalized principal curves: analysis and computation, A bottom-up algorithm for finding principal curves with applications to image skeletonization, Principal curves of oriented points: theoretical and computational improvements, Data clustering based on principal curves, Local curve and surface detection in spatial data using Gaussian mixtures, Rough Geometry and Its Applications in Character Recognition