An efficient implementation of GLCM algorithm in FPGA

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01955368
Contributor : Rostom Kachouri <>
Submitted on : Friday, December 14, 2018 - 12:10:32 PM
Last modification on : Tuesday, March 19, 2019 - 11:43:25 PM
Long-term archiving on : Friday, March 15, 2019 - 2:33:24 PM

File

RK_GLCM_FPGA_1.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01955368, version 1

Citation

M 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. ⟨hal-01955368⟩

Share

Metrics

Record views

117

Files downloads

383