返回
An adaptive split-and-merge method for binary image contour data compression
DOI:10.1016/S0167-8655(00)00138-0.png)
摘要
En 中文
The split-and-merge method is a well-known algorithm for polygonal approximation in computer Vision applications such as feature extracting and pattern matching. Its accuracy depends on the tolerance, that is the error threshold value. This study presents a split-and-merge method with an adaptive tolerance value for compressing image contours. The tolerance value, which depends on the grid constant D and the line length of line L in a collinearity test, is adopted to reduce quantization error while keeping its original shape. A contour tracing method that achieves the right shape representation of binary images is also discussed. Experimental results for real binary contours show the method is effective for compression of a binary image. The proposed method allows a precise description of the original image and can smooth coarse contours. It is also computationally efficient. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
contour representation
data compression
polygonal approximation
split-and-merge
tolerance
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
暂无机构信息
引用论文
Vectorization of hand-drawn image using piecewise cubic Bezier curves fitting
PATTERN RECOGNITION
IF7.6
Reliable polygonal approximations of imaged real objects through dominant point detection
PATTERN RECOGNITION
IF7.6
Linking broken character borders with variable sized masks to improve recognition
PATTERN RECOGNITION
IF7.6
Candida norvegensis fungaemia in a neutropenic patient with acute non-lymphoblastic leukaemia
Mycoses
IF0

