学术探索
学术期刊
新闻热点
数据分析
智能评审
立即登录
CONSTRUCTING TREES FOR REGION DESCRIPTION
被引:4
作者
:
MILGRAM, DL
论文数:
0
引用数:
0
h-index:
0
机构:
Computer Science Center, University of Maryland, College Park
MILGRAM, DL
机构
:
[1]
Computer Science Center, University of Maryland, College Park
来源
:
COMPUTER GRAPHICS AND IMAGE PROCESSING
|
1979年
/ 11卷
/ 01期
关键词
:
D O I
:
10.1016/0146-664X(79)90078-9
中图分类号
:
TP31 [计算机软件];
学科分类号
:
081202 ;
0835 ;
摘要
:
A threshold (binary) image can be represented as a region tree in which each node corresponds to a component of 1's (object) or 0's (background). If regions O and B share a border, then one encloses the other. This enclosure relation defines the tree. The chain code of the component and a description based on statistical features are stored at each node. The region tree is built in a single pass over the image. © 1979 Academic Press, Inc.
引用
收藏
页码:88 / 99
页数:12
相关论文
共 1 条
[1]
Agrawala, Kulkarni, A sequential approach to the extraction of shape features, Computer Graphics and Image Processing, pp. 538-557, (1977)
←
1
→
共 1 条
[1]
Agrawala, Kulkarni, A sequential approach to the extraction of shape features, Computer Graphics and Image Processing, pp. 538-557, (1977)
←
1
→