Improving fitting quality of polygonal approximation by using the dynamic programming technique

DOI10.1016/S0167-8655(02)00129-0MaRDI QIDQ4792168zbMATH OpenOpenAlexFDO

Authors Ji-Hwei Horng

Publication date 11 February 2003

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

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

zbMATH Keywords

dynamic programmingcurve fittingpolygonal approximationdominant point detectionscale-spacefiltering

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
• An improved method for calculating the no-fit polygon
• Reduced-search dynamic programming for approximation of polygonal curves
• Optimum polygonal approximation of digitized curves
• An optimal algorithm for polygonal approximation of digitized curves
• Optimized polygonal approximation by dominant point deletion
• An efficient evolutionary algorithm for accurate polygonal approximation
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
• scientific article; zbMATH DE number 3228720

Cited in

(6)

• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
• Optimized polygonal approximation by dominant point deletion
• Polygonal approximation of closed discrete curves
• Polygonal approximation of digital planar curves through break point suppression
• Speeding up simplification of polygonal curves using nested approximations
• An adaptive method for detecting dominant points.

This page was built for publication: Improving fitting quality of polygonal approximation by using the dynamic programming technique

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