Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
From MaRDI portal
(Redirected from Publication:898320)
Recommendations
- A non-parametric sequential method for polygonal approximation of digital curves
- A dynamic programming approach for fitting digital planar curves with line segments and circular arcs
- Some algorithms under non-parametric framework versus an unsupervised approach
- An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves
- An optimal algorithm for polygonal approximation of digitized curves
Cites work
- scientific article; zbMATH DE number 425393 (Why is no real title available?)
- scientific article; zbMATH DE number 4074316 (Why is no real title available?)
- scientific article; zbMATH DE number 1994007 (Why is no real title available?)
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- An adaptive method for detecting dominant points.
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- Corner detection and curve segmentation by multiresolution chain-code linking
- Data reduction of large vector graphics
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- Optimum polygonal approximation of digitized curves
- Structural, Syntactic, and Statistical Pattern Recognition
This page was built for publication: Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898320)