A k-segments algorithm for finding principal curves

DOI10.1016/S0167-8655(02)00032-6MaRDI QIDQ4537346zbMATH OpenOpenAlexFDO

Authors 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

polygonal linesprincipal curves

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)

Recommendations

• scientific article; zbMATH DE number 1843069
• A bottom-up algorithm for finding principal curves with applications to image skeletonization
• Principal curves with bounded turn
• Another look at principal curves and surfaces
• AI 2005: Advances in Artificial Intelligence

Cited in

(22)

• Multiple penalized principal curves: analysis and computation
• Multi-granularity principal curves extraction based on improved spectral clustering of complex distribution data
• 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
• Moving multiple curves/surfaces approximation of mixed point clouds
• Algorithms for straight line fitting using k-means
• scientific article; zbMATH DE number 2013287 (Why is no real title available?)
• Practical constraint \(K\)-segment principal curve algorithms for generating railway GPS digital map
• Principal curves with bounded turn
• scientific article; zbMATH DE number 1843069 (Why is no real title available?)
• Modeling local nonlinear correlations using subspace principal curves
• A case study in pharmacologic colon imaging using principal curves in single-photon emission computed tomography
• AI 2005: Advances in Artificial Intelligence
• Robust nonlinear principal components
• Connectivity of projected high dimensional data charts on one-dimensional curves
• Recent advances in principal component analysis for directional data
• Manifold fitting under unbounded noise
• Some aspects of nonlinear dimensionality reduction
• Constraint local principal curve: concept, algorithms and applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537346)