Two-dimensional dispersion entropy: An information-theoretic method for irregularity analysis of images

被引:41
作者
Azami, Hamed [1 ,2 ]
Virgilio da Silva, Luiz Eduardo [3 ]
Mieko Omoto, Ana Carolina [3 ]
Humeau-Heurtier, Anne [4 ]
机构
[1] Harvard Univ, Dept Neurol, Boston, MA 02115 USA
[2] Harvard Univ, Massachusetts Gen Hosp, Boston, MA 02115 USA
[3] Univ Sao Paulo, Dept Physiol, Sch Med Ribeirao Preto, Ribeirao Preto, SP, Brazil
[4] Univ Angers, LARIS, 62 Ave Notre Dame Lac, F-49000 Angers, France
关键词
Biomedical image processing; Texture analysis; Irregularity; Two-dimensional dispersion entropy; Two-dimensional sample entropy; PERMUTATION ENTROPY; SAMPLE ENTROPY; SERIES; VARIABILITY; COMPLEXITY; DISEASE; SYSTEM;
D O I
10.1016/j.image.2019.04.013
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Two-dimensional sample entropy (SampEn(2D)) is a recently developed method in the field of information theory for evaluating the regularity or predictability of images. SampEn(2D), though powerful, has two key limitations: (1) SampEn(2D) values are undefined for small-sized images; and (2) SampEn(2D) is computationally expensive for several real-world applications. To overcome these drawbacks, we introduce the two-dimensional dispersion entropy (DispEn(2D)) measure. To evaluate the ability of DispEn(2D) , in comparison with SampEn(2D), we use various synthetic and real datasets. The results demonstrate that DispEn(2D) distinguishes different amounts of white Gaussian and salt and pepper noise. The periodic images, compared with their corresponding synthesized ones, have lower DispEn(2D) values. The results for Kylberg texture dataset show the ability of DispEn(2D) to differentiate various textures. Although the results based on DispEn(2D) and SampEn(2D) for both the synthetic and real datasets are consistent in that they lead to similar findings about the irregularity of images, DispEn(2D) has three main advantages over SampEn(2D): (1) DispEn(2D), unlike SampEn(2D), does not lead to undefined values; (2) DispEn(2D) is noticeably quicker; and (3) The coefficient of variations and Mann-Whitney U test-based p-values for DispEn(2D) are considerably smaller, showing the more stability of the DispEn(2D) results. Overall, thanks to its successful performance and low computational time, DispEn(2D) opens up a new way to analyze the uncertainty of images.
引用
收藏
页码:178 / 187
页数:10
相关论文
共 40 条
[1]   Entropy analysis of the EEG background activity in Alzheimer's disease patients [J].
Abásolo, D ;
Hornero, R ;
Espino, P ;
Alvarez, D ;
Poza, J .
PHYSIOLOGICAL MEASUREMENT, 2006, 27 (03) :241-253
[2]   Amplitude- and Fluctuation-Based Dispersion Entropy [J].
Azami, Hamed ;
Escudero, Javier .
ENTROPY, 2018, 20 (03)
[3]   Bidimensional Distribution Entropy to Analyze the Irregularity of Small-Sized Textures [J].
Azami, Hamed ;
Escudero, Javier ;
Humeau-Heurtier, Anne .
IEEE SIGNAL PROCESSING LETTERS, 2017, 24 (09) :1338-1342
[4]   Amplitude-aware permutation entropy: Illustration in spike detection and signal segmentation [J].
Azami, Hamed ;
Escudero, Javier .
COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, 2016, 128 :40-51
[5]   Permutation entropy: A natural complexity measure for time series [J].
Bandt, C ;
Pompe, B .
PHYSICAL REVIEW LETTERS, 2002, 88 (17) :4
[6]   Admission control in cloud computing using game theory [J].
Baranwal, Gaurav ;
Vidyarthi, Deo Prakash .
JOURNAL OF SUPERCOMPUTING, 2016, 72 (01) :317-346
[7]  
Brodatz P., 1966, Textures: A Photographic Album for Artists and Designers
[8]   Scale- and rotation-invariant texture description with improved local binary pattern features [J].
Davarzani, Reza ;
Mozaffari, Saeed ;
Yaghmaie, Khashayar .
SIGNAL PROCESSING, 2015, 111 :274-293
[9]   Uncertainty of data, fuzzy membership functions, and multilayer perceptrons [J].
Duch, W .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2005, 16 (01) :10-23
[10]   Fractal descriptors based on Fourier spectrum applied to texture analysis [J].
Florindo, Joao Batista ;
Bruno, Odemir Martinez .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (20) :4909-4922