Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:4795025
Jump to:navigation, search

DOI10.1016/S0167-8655(00)00138-0zbMath1010.68875OpenAlexW1974329794MaRDI QIDQ4795025

Hong Yan, Ju Jia Zou, Yi Xiao

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 compressioncontour representationpolygonal approximationsplit-and-merge


Mathematics Subject Classification ID

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


Related Items (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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4795025&oldid=19094629"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 00:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki