CLUSTERING EDGE VALUES FOR THRESHOLD SELECTION

被引:8
作者
MILGRAM, DL
HERMAN, M
机构
[1] Computer Science Center, University of Maryland, College Park
来源
COMPUTER GRAPHICS AND IMAGE PROCESSING | 1979年 / 10卷 / 03期
关键词
D O I
10.1016/0146-664X(79)90006-6
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Thresholds may be chosen for images containing several object classes by clustering thinned edge points in a 2-D histogram, whose axes represent gray level value and edge value. Each such edge cluster suggests its average gray level as a threshold. Interior clusters may also be defined as representatives of object class interiors. The relation of edge clusters to interior clusters gives rise to a classification strategy based on partitioning the 2-D histogram into disjoint regions labeled as to object class. Each partition is a classification domain for points of the original gray level image. © 1979 Academic Press, Inc.
引用
收藏
页码:272 / 280
页数:9
相关论文
共 4 条
[1]  
Rosenfeld, Kak, Digital Picture Processing, (1976)
[2]  
Weszka, Nagel, Rosenfeld, A threshold selection technique, IEEE Transactions on Computers, 100-123, pp. 1322-1326, (1974)
[3]  
Algorithms and Hardware Technology for Image Recognition, First Semi-Annual Report on Contract DAAG53-76C-0138, (1976)
[4]  
Panda, Statistical Analysis of Some Edge Operators, (1977)