Image thresholding using Tsallis entropy

被引:426
作者
de Albuquerque, MP
Esquef, IA
Mello, ARG
de Albuquerque, MP
机构
[1] CBPF, MCT, BR-229018 Rio De Janeiro, Brazil
[2] Univ Estadual N Fluminen, Campos dos Goytacazes, RJ, Brazil
关键词
Tsallis entropy; entropic segmentation; image thresholding;
D O I
10.1016/j.patrec.2004.03.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Image analysis usually refers to processing of images with the goal of finding objects presented in the image. Image segmentation is one of the most critical tasks in automatic image analysis. The nonextensive entropy is a recent development in statistical mechanics and it is a new formalism in which a real quantity q was introduced as parameter for physical systems that present long range interactions, long time memories and fractal-type structures. In image processing, one of the most efficient techniques for image segmentation is entropy-based thresholding. This approach uses the Shannon entropy originated from the information theory considering the gray level image histogram as a probability distribution. In this paper, Tsallis entropy is applied as a general entropy formalism for information theory. For the first time image thresholding by nonextensive entropy is proposed regarding the presence of nonadditive information content in some image classes. Some typical results are presented to illustrate the influence of the parameter q in the thresholding. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:1059 / 1065
页数:7
相关论文
共 11 条
[1]   AUTOMATIC THRESHOLDING OF GRAY-LEVEL PICTURES USING TWO-DIMENSIONAL ENTROPY [J].
ABUTALEB, AS .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1989, 47 (01) :22-32
[2]  
[Anonymous], 2001, NONEXTENSIVE STAT ME
[3]   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
[4]   MINIMUM CROSS ENTROPY THRESHOLDING [J].
LI, CH ;
LEE, CK .
PATTERN RECOGNITION, 1993, 26 (04) :617-625
[5]   On minimum cross-entropy thresholding [J].
Pal, NR .
PATTERN RECOGNITION, 1996, 29 (04) :575-580
[6]   ENTROPIC THRESHOLDING, A NEW APPROACH [J].
PUN, T .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1981, 16 (03) :210-239
[7]   Unimodal thresholding [J].
Rosin, PL .
PATTERN RECOGNITION, 2001, 34 (11) :2083-2096
[8]   A SURVEY OF THRESHOLDING TECHNIQUES [J].
SAHOO, PK ;
SOLTANI, S ;
WONG, AKC ;
CHEN, YC .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1988, 41 (02) :233-260
[9]   When non-extensive entropy becomes extensive [J].
Tatsuaki, W ;
Takeshi, S .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2001, 301 (1-4) :284-290
[10]   Are citations of scientific papers a case of nonextensivity? [J].
Tsallis, C ;
de Albuquerque, MP .
EUROPEAN PHYSICAL JOURNAL B, 2000, 13 (04) :777-780