Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling
From MaRDI portal
Publication:898320
DOI10.1016/J.PATCOG.2013.09.002zbMATH Open1326.68310OpenAlexW2082412337MaRDI QIDQ898320FDOQ898320
T. Kauranne, Alexander V. Kolesnikov
Publication date: 8 December 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.09.002
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
Numerical smoothing, curve fitting (65D10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimum polygonal approximation of digitized curves
- Title not available (Why is that?)
- An adaptive method for detecting dominant points.
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- An efficient algorithm for the optimal polygonal approximation of digitized curves
- Corner detection and curve segmentation by multiresolution chain-code linking
- Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
- Data reduction of large vector graphics
- 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)
