Low dimensional adaptive texture feature vectors from class distance and class difference matrices

被引:27
作者
Nielsen, B
Albregtsen, F
Danielsen, HE
机构
[1] Univ Oslo, Dept Informat, N-0316 Oslo, Norway
[2] Norwegian Radium Hosp, Sect Digital Pathol, N-0310 Oslo, Norway
[3] Norwegian Radium Hosp, Sect Digital Pathol, N-0310 Oslo, Norway
[4] Univ Sheffield, Div Genom Med, Sheffield S10 2TN, S Yorkshire, England
关键词
adaptive features; Brodatz textures; class distance matrices; early ovarian cancer; image texture analysis; low dimensionality; pattern classification;
D O I
10.1109/TMI.2003.819923
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In many popular texture analysis methods, second or higher order statistics on the relation between pixel gray level values are stored in matrices. A high dimensional vector of predefined, nonadaptive features is then extracted from these matrices. Identifying a few consistently valuable features is important, as it improves classification reliability and enhances our understanding of the phenomena that we are modeling. Whatever sophisticated selection algorithm we use, there is a risk of selecting purely coincidental "good" feature sets, especially if we have a large number of features to choose from and the available data set is limited. In a unified approach to statistical texture feature extraction, we have used class distance and class difference matrices to obtain low dimensional adaptive feature vectors for texture classification. We have applied this approach to four relevant texture analysis methods. The new adaptive features outperformed the classical features when applied to the most difficult set of 45 Brodatz texture pairs. Class distance and difference matrices also clearly illustrated the difference in texture between cell nucleus images from two different prognostic classes of early ovarian cancer. For each of the texture analysis methods, one adaptive feature contained most of the discriminatory power of the method.
引用
收藏
页码:73 / 84
页数:12
相关论文
共 33 条
[1]  
Albrecht J, 2000, COMB OPT (SER), V6, P1
[2]  
ALBREGTSEN F, 2000, P 15 INT C PATT REC, V3, P746
[3]   New texture features based on the complexity curve [J].
Baheerathan, S ;
Albregtsen, F ;
Danielsen, HE .
PATTERN RECOGNITION, 1999, 32 (04) :605-618
[4]  
Brodatz P, 1966, TEXTURES PHOTOGRAPHI
[5]  
CARSTENSEN JM, 1992, THESIS TU DENMARK LY
[6]   USE OF GRAY VALUE DISTRIBUTION OF RUN LENGTHS FOR TEXTURE ANALYSIS [J].
CHU, A ;
SEHGAL, CM ;
GREENLEAF, JF .
PATTERN RECOGNITION LETTERS, 1990, 11 (06) :415-419
[7]   SEGMENTATION OF A HIGH-RESOLUTION URBAN SCENE USING TEXTURE OPERATORS [J].
CONNERS, RW ;
TRIVEDI, MM ;
HARLOW, CA .
COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1984, 25 (03) :273-310
[8]  
Duda R.O., 2001, Pattern Classification, V2nd
[9]  
Galloway MM., 1975, COMPUTER GRAPHICS IM, V4, P172, DOI DOI 10.1016/S0146-664X(75)80008-6
[10]  
Hand D.J., 1981, DISCRIMINATION CLASS