Direct methods for sparse matrices
Direct methods for sparse matrices
C++ how to program
Texture Analysis Using Gaussian Weighted Grey Level Co-Occurrence Probabilities
CRV '04 Proceedings of the 1st Canadian Conference on Computer and Robot Vision
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Retrieving scale from quasi-stationary images
Pattern Recognition Letters
Zero-Crossing-Based Feature Extraction for Voice Command Systems Using Neck-Microphones
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
Multi-Classifier Systems (MCSs) of Remote Sensing Imagery Classification Based on Texture Analysis
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Calculation of grey level co-occurrence matrix-based seismic attributes in three dimensions
Computers & Geosciences
Hi-index | 0.00 |
Calculation of co-occurrence probabilities is a popular method for determining texture features within remotely sensed digital imagery. Typically, the co-occurrence features are calculated by using a grey level co-occurrence matrix (GLCM) to store the co-occurring probabilities. Statistics are applied to the probabilities in the GLCM to generate the texture features. This method is computationally intensive since the matrix is usually sparse leading to many unnecessary calculations involving zero probabilities when applying the statistics. An improvement on the GLCM method is to utilize a grey level co-occurrence linked list (GLCLL) to store only the non-zero co-occurring probabilities. The GLCLL suffers since, to achieve preferred computational speeds, the list should be sorted. An improvement on the GLCLL is to utilize a grey level co-occurrence hybrid structure (GLCHS) based on an integrated hash table and linked list approach. Texture features obtained using this technique are identical to those obtained using the GLCM and GLCLL.The GLCHS method is implemented using the C language in a Unix environment. Based on a Brodatz test image, the GLCHS method is demonstrated to be a superior technique when compared across various window sizes and grey level quantizations. The GLCHS method required, on average, 33.4% (σ = 3.08%) of the computational time required by the GLCLL. Significant computational gains are made using the GLCHS method.