Translator Disclaimer
7 November 2005 Fast grey-level co-occurrence matrix calculations for texture analysis
Author Affiliations +
Characterizing the surface texture of objects or moving webs is sometimes important in identifying and/or determining the quality of products. Fourier analysis is often used for this in laboratory situations, but inspection algorithms using the FFT are too slow for many production situations, even when implemented on fast computers. An alternative technique pioneered in the 1970s by Haralick [1] operates in the time domain and uses grey-level cooccurrence matrices (GLCMs) as a first step toward obtaining useful measures characterizing textures. Although the GLCM approach is much less computationally-intensive than the FFT, it nonetheless requires massive amounts of calculation. Most of this computation time is spent in stepping through the input image and compiling the matrices themselves. Therefore, if the calculation time for these matrices could be reduced, the GLCM technique would become more practical. This paper applies the SKIPSM paradigm to the calculation of GLCMs, and provides execution times for this implementation.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Frederick M. Waltz and John W. V. Miller "Fast grey-level co-occurrence matrix calculations for texture analysis", Proc. SPIE 6000, Two- and Three-Dimensional Methods for Inspection and Metrology III, 600004 (7 November 2005);


Job-shop scheduling applied to computer vision
Proceedings of SPIE (September 19 1997)
Space-filling curves for image compression
Proceedings of SPIE (August 01 1991)
Software SKIPSM implementation for template matching
Proceedings of SPIE (February 12 2001)
Computerized image quality inspection system
Proceedings of SPIE (May 06 1993)

Back to Top