go-v.orgdoi

Another Parallelism Technique of GLCM Implementation Using CUDA Programming

Teamsar Muliadi Panggabean, Mario E. S. Simaremare, Rusmina Siahaan, Chandro Pardede, Wiwin Putri Gurning · International Conference on Advances in Image Processing (ICAIP) · 2020

  • DOI 10.1145/3441250.3441251
  • Publisher OpenAlex
  • Type conference-paper
  • Issued 2020

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

International Conference on Advances in Image Processing (ICAIP) · OpenAlex · conference-paper · 2020

Abstract

In pattern recognition and image processing feature extraction is one of essential parts as it facilitates the subsequent learning and generalization steps. Feature extraction aims to get the special characteristics of an object that can be applied to produce the desired information. One of commonly used algorithm for feature extraction is Gray Level Co-occurrence Matrix (GLCM). Though this algorithm produces a good result, the twelve Haralick texture features requires high computation if CPUs are used. The emergence of the Graphics Processing Unit (GPU) helps cope with all that requires high computation and running GLCM calculations in GPU is just a matter of seconds.

To benefit greatly from thousands of CUDA cores, one should be able to appropriately implement GLCM algorithm. GPU for GLCM had been done in several studies and each offered various improvement in computation times. In this research, we propose another technique of implementing GLCM algorithm and it shows that the computation time of the twelve Haralick texture features is 450 times faster than using CPU.

Open the resolved locator · 10.1145/3441250.3441251

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-19 22:15 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.1145/3441250.3441251
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.