Parallel implementation of Gray Level Co-occurrence Matrices and Haralick texture features on cell architecture

  • Authors:
  • Asadollah Shahbahrami;Tuan Anh Pham;Koen Bertels

  • Affiliations:
  • Department of Computer Engineering, Faculty of Engineering, University of Guilan, Rasht, Iran;Computer Engineering Laboratory, Faculty of EEMCS, Delft University of Technology, Delft, The Netherlands 2628 CD;Computer Engineering Laboratory, Faculty of EEMCS, Delft University of Technology, Delft, The Netherlands 2628 CD

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Texture features extraction algorithms are key functions in various image processing applications such as medical images, remote sensing, and content-based image retrieval. The most common way to extract texture features is the use of Gray Level Co-occurrence Matrices (GLCMs). The GLCM contains the second-order statistical information of spatial relationship of the pixels of an image. Haralick texture features are extracted using these GLCMs. However, the GLCMs and Haralick texture features extraction algorithms are computationally intensive. In this paper, we apply different parallel techniques such as task- and data-level parallelism to exploit available parallelism of those applications on the Cell multi-core processor. Experimental results have shown that our parallel implementations using 16 Synergistic Processor Elements significantly reduce the computational times of the GLCMs and texture features extraction algorithms by a factor of 10脳 over non-parallel optimized implementations for different image sizes from 128脳128 to 1024脳1024.