A parallel computing array algorithm for GLC matrix calculations

Abstract

The gray-level co-occurrence (GLC) method, a texture analysis algorithm in which GLC matrices are computed on subregions of an image, is considered. The large number of calculations required to find the matrices for an image of any practical size precludes use of the GLC method in real-time systems. The author defines the GLC matrix and shows that the computation of all GLC matrices for an image has time complexity O(N/sup 4/) for an image of size N /spl times/ N when conventional methods are used. A parallel computing array for use in calculating GLC matrices is presented, and an associated GLC matrix calculation is explained. The algorithm is shown to have time complexity O(N/sup 2/) for large N.