Algorithms for straight line fitting using k-means

DOI10.1016/S0167-8655(97)00154-2MaRDI QIDQ4216205zbMATH OpenWikidataFDO

Authors Peng-Yeng Yin

Publication date 2 March 1999

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

Full work available at URL https://doi.org/10.1016/S0167-8655(97)00154-2

zbMATH Keywords

clusteringline fitting methods

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)

Recommendations

• A fast and efficient method for solving the multiple line detection problem
• A k-segments algorithm for finding principal curves
• \(k\)-means algorithm
• Analytic line fitting in the presence of uniform random noise
• A practical approximation algorithm for the LMS line estimator

Cited in

(4)

• Convex piecewise-linear fitting
• Analytic line fitting in the presence of uniform random noise
• Multiple straight-line fitting using a Bayes factor
• An efficient evolutionary algorithm for accurate polygonal approximation

This page was built for publication: Algorithms for straight line fitting using k-means

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