scholarly journals Texture classification: are filter banks necessary?

Author(s):  
M. Varma ◽  
A. Zisserman
2001 ◽  
Vol 56 (12) ◽  
pp. 8 ◽  
Author(s):  
Oscar G. Ibarra-Manzano ◽  
Yuriy V. Shkvarko ◽  
Rene Jaime-Rivas ◽  
Jose A. Andrade-Lucio ◽  
Gordana Jovanovic-Dolecek

2020 ◽  
Vol 2020 (10) ◽  
pp. 310-1-310-7
Author(s):  
Khalid Omer ◽  
Luca Caucci ◽  
Meredith Kupinski

This work reports on convolutional neural network (CNN) performance on an image texture classification task as a function of linear image processing and number of training images. Detection performance of single and multi-layer CNNs (sCNN/mCNN) are compared to optimal observers. Performance is quantified by the area under the receiver operating characteristic (ROC) curve, also known as the AUC. For perfect detection AUC = 1.0 and AUC = 0.5 for guessing. The Ideal Observer (IO) maximizes AUC but is prohibitive in practice because it depends on high-dimensional image likelihoods. The IO performance is invariant to any fullrank, invertible linear image processing. This work demonstrates the existence of full-rank, invertible linear transforms that can degrade both sCNN and mCNN even in the limit of large quantities of training data. A subsequent invertible linear transform changes the images’ correlation structure again and can improve this AUC. Stationary textures sampled from zero mean and unequal covariance Gaussian distributions allow closed-form analytic expressions for the IO and optimal linear compression. Linear compression is a mitigation technique for high-dimension low sample size (HDLSS) applications. By definition, compression strictly decreases or maintains IO detection performance. For small quantities of training data, linear image compression prior to the sCNN architecture can increase AUC from 0.56 to 0.93. Results indicate an optimal compression ratio for CNN based on task difficulty, compression method, and number of training images.


2012 ◽  
Vol 58 (2) ◽  
pp. 177-192 ◽  
Author(s):  
Marek Parfieniuk ◽  
Alexander Petrovsky

Near-Perfect Reconstruction Oversampled Nonuniform Cosine-Modulated Filter Banks Based on Frequency Warping and Subband MergingA novel method for designing near-perfect reconstruction oversampled nonuniform cosine-modulated filter banks is proposed, which combines frequency warping and subband merging, and thus offers more flexibility than known techniques. On the one hand, desirable frequency partitionings can be better approximated. On the other hand, at the price of only a small loss in partitioning accuracy, both warping strength and number of channels before merging can be adjusted so as to minimize the computational complexity of a system. In particular, the coefficient of the function behind warping can be constrained to be a negative integer power of two, so that multiplications related to allpass filtering can be replaced with more efficient binary shifts. The main idea is accompanied by some contributions to the theory of warped filter banks. Namely, group delay equalization is thoroughly investigated, and it is shown how to avoid significant aliasing by channel oversampling. Our research revolves around filter banks for perceptual processing of sound, which are required to approximate the psychoacoustic scales well and need not guarantee perfect reconstruction.


Sign in / Sign up

Export Citation Format

Share Document