An adaptive split-and-merge method for binary image contour data compression

DOI10.1016/S0167-8655(00)00138-0MaRDI QIDQ4795025zbMATH OpenOpenAlexFDO

Authors Yi Xiao, Ju Jia Zou, Hong Yan

Publication date 20 February 2003

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(00)00138-0

zbMATH Keywords

tolerancedata compressionpolygonal approximationcontour representationsplit-and-merge

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Machine vision and scene understanding (68T45)

Recommendations

• A split/merge method with ranking selection for polygonal approximation of digital curve
• A minimum entropy approach to adaptive image polygonization
• Split-and-merge algorithms defined on topological maps for 3D image segmentation
• Polygonal approximation of digital planar curves through break point suppression
• An efficient algorithm for the optimal polygonal approximation of digitized curves

Cited in

(2)

• A contour tracing and coding algorithm for generating 2D contour codes from 3D classified objects
• Data reduction of large vector graphics

This page was built for publication: An adaptive split-and-merge method for binary image contour data compression

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