Some algorithms under non-parametric framework versus an unsupervised approach

DOI10.1016/J.COSREV.2020.100321MaRDI QIDQ826309zbMATH OpenOpenAlexFDO

Authors Bimal Kumar Ray

Publication date 20 December 2021

Published in Computer Science Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cosrev.2020.100321

zbMATH Keywords

rough approximationsmooth approximationnon-parametric frameworkrelative execution timeunsupervised approach

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• A non-parametric sequential method for polygonal approximation of digital curves
• Fast heuristics for polygonal approximation of a 2D shape boundary
• Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
• Publication:3030112
• An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Cites work

• An efficient algorithm for the optimal polygonal approximation of digitized curves
• Optimized polygonal approximation by dominant point deletion
• Optimum polygonal approximation of digitized curves
• Polygonal approximation of digital planar curves through break point suppression
• Segmentation of Plane Curves

Cited in

(1)

• Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling

This page was built for publication: Some algorithms under non-parametric framework versus an unsupervised approach

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