Some algorithms under non-parametric framework versus an unsupervised approach

DOI10.1016/J.COSREV.2020.100321zbMath1484.68281OpenAlexW3111071209MaRDI QIDQ826309

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

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

Cites Work

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

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