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

DOI10.1016/j.patcog.2013.09.002zbMath1326.68310OpenAlexW2082412337MaRDI QIDQ898320

Tuomo 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

zbMATH Keywords

shapecurve fittingpiecewise linear approximationgraphical model

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adaptive method for detecting dominant points.
• Data reduction of large vector graphics
• Corner detection and curve segmentation by multiresolution chain-code linking
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• Optimum polygonal approximation of digitized curves
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Structural, Syntactic, and Statistical Pattern Recognition
• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion

This page was built for publication: Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling