Threshold selection based on fuzzy c-partition entropy approach

被引:195
作者
Cheng, HD [1 ]
Chen, JR [1 ]
Li, JG [1 ]
机构
[1] Utah State Univ, Dept Comp Sci, Logan, UT 84322 USA
关键词
thresholding; fuzzy logic; fuzzy c-partition; maximum entropy principle; simulated annealing;
D O I
10.1016/S0031-3203(97)00113-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Thresholding is an important topic for image processing, pattern recognition and computer vision. Selecting thresholds is a critical issue for many applications. The fuzzy set theory has been successfully applied to many areas, such as control, image processing, pattern recognition, computer vision, medicine, social science, etc. It is generally believed that image processing bears some fuzziness in nature. In this paper, we use the concept of fuzzy c-partition and the maximum fuzzy entropy principle to select threshold values for gray-level images. We have conducted experiments on many images. The experimental results demonstrate that the proposed approach can select the thresholds automatically and effectively, and the resulting images can preserve the main features of the components of the original images very well. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:857 / 870
页数:14
相关论文
共 23 条
[1]  
Bezdek J.C., 2013, Pattern Recognition With Fuzzy Objective Function Algorithms
[2]  
Bezdek JC., 1992, FUZZY MODELS PATTERN
[3]  
BEZDEK JC, 1987, ANAL FUZZY INFORMATI, V3, P81
[4]  
CHENG HD, 1994, INT JOINT C INF SCI
[5]  
CHENG HD, 1995, 1995 INT C IM PROC W
[6]  
CHENG HD, 1996, VISION INTERFACE 96
[7]   OPERATIONS USEFUL FOR SIMILARITY-INVARIANT PATTERN RECOGNITION [J].
DOYLE, W .
JOURNAL OF THE ACM, 1962, 9 (03) :259-&
[8]  
Goldberg DE, 1989, GENETIC ALGORITHMS S
[9]  
Gonzalez R.C., 1992, DIGITAL IMAGE PROCES
[10]   A NEW METHOD FOR GRAY-LEVEL PICTURE THRESHOLDING USING THE ENTROPY OF THE HISTOGRAM [J].
KAPUR, JN ;
SAHOO, PK ;
WONG, AKC .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1985, 29 (03) :273-285