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
相关论文
共 50 条
  • [1] Fractal Signature Vectors and Lacunarity Class Distance Matrices to extract new adaptive texture features from cell nuclei
    Nielsen, B
    Albregtsen, F
    Danielsen, HE
    FRACTALS IN BIOLOGY AND MEDICINE, VOL III, 2002, : 55 - 65
  • [2] Adaptive gray level run length features from class distance matrices
    Albregtsen, F
    Nielsen, B
    Danielsen, HE
    15TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 3, PROCEEDINGS: IMAGE, SPEECH AND SIGNAL PROCESSING, 2000, : 738 - 741
  • [3] On cell matrices: A class of Euclidean distance matrices
    Tarazaga, Pablo
    Kurata, Hiroshi
    APPLIED MATHEMATICS AND COMPUTATION, 2014, 238 : 468 - 474
  • [4] Adaptive weighting distance for feature vectors of biological sequences
    Kuo, Huang-Cheng
    Jou, Pei-Yuan
    Huang, Jen-Peng
    PROCEEDINGS OF 2007 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2007, : 2269 - +
  • [5] Distance learning - A class away from class
    不详
    COMMUNICATIONS NEWS, 1997, 34 (10): : 75 - 75
  • [6] On a class of matrices with low displacement rank
    Barnabei, M
    Montefusco, LB
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2001, 325 (1-3) : 161 - 176
  • [7] Multi-class feature selection for texture classification
    Chen, Xue-wen
    Zeng, Xiangyan
    van Alphen, Deborah
    PATTERN RECOGNITION LETTERS, 2006, 27 (14) : 1685 - 1691
  • [8] Distance and Detour Matrices of an Infinite Class of Dendrimer Nanostars
    Karbasioun, A.
    Ashrafi, A. R.
    Diudea, M. V.
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2010, 63 (01) : 239 - 246