A k-segments algorithm for finding principal curves

DOI10.1016/S0167-8655(02)00032-6zbMath1015.68164OpenAlexW2138675231MaRDI 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 curvespolygonal lines

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (11)

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

This page was built for publication: A k-segments algorithm for finding principal curves