An efficient implementation of GLCM algorithm in FPGA - Archive ouverte HAL Access content directly
Conference Papers Year :

An efficient implementation of GLCM algorithm in FPGA


This paper presents hardware (HW) architecture for fast parallel computation of Gray Level Co-occurrence Matrix (GLCM) in high throughput image analysis applications. GLCM has proven to be a powerful basis for use in texture classification. Various textural parameters calculated from the GLCM help understand the details about the overall image content. However, the calculation of GLCM is very computationally intensive. In this paper, an FPGA accelerator for fast calculation of GLCM is designed and implemented. We propose an FPGA-based architecture for parallel computation of symmetric co-occurrence matrices. This architecture was implemented on a Xilinx Zedboard and Virtex 5 FPGAs using Vivado HLS. The performance is then compared against other implementations. The validation results show an optimization on the order of 33% in latency number by contribution to the literature implementation.
Fichier principal
Vignette du fichier
RK_GLCM_FPGA_1.pdf (655.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01955368 , version 1 (14-12-2018)



M a Ben Atitallah, Rostom Kachouri, H. Mnif, M Kammoun. An efficient implementation of GLCM algorithm in FPGA. IEEE International Conference on Internet of Things, Embedded Systems and Communications (IINTEC), Dec 2018, Hammamet, Tunisia. ⟨10.1109/IINTEC.2018.8695275⟩. ⟨hal-01955368⟩
97 View
1461 Download



Gmail Facebook Twitter LinkedIn More