Low dimensional adaptive texture feature vectors from class distance and class difference matrices
Related Experiment Videos
Birgitte Nielsen1, Fritz Albregtsen, Håvard E Danielsen
1Department of Informatics, University of Oslo, P.O. Box 1080 Blindern, N-03 16 Oslo, Norway. birgitn@ifi.uio.no
Abstract:
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.
Related Concept Videos
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Difference from Background: Limit of Detection
The LOD indicates the presence or absence...
Classification of Signals
A continuous-time signal holds a value at every instant in time, representing information seamlessly. In contrast, a discrete-time signal holds values only at specific moments, often denoted as x(n), where...
Vector Components in the Cartesian Coordinate System
Depth Perception and Spatial Vision
Relative Velocity in One Dimension