{"title":"Fast multidimensional binary image processing with OpenCL","authors":"Daniel Oliveira Dantas, H. Leal","doi":"10.1109/HPCS48598.2019.9188210","DOIUrl":null,"url":null,"abstract":"Binary images are often used in image processing pipelines, and are usually stored in the unpacked format, i.e., 8 bits per pixel. The packed format uses 1 bit per pixel, 8 times less memory, and is a good option when dealing with images too big to fit in RAM. This paper presents a parallel implementation of pixelwise and window operators for packed binary images. The implementation, written in OpenCL, can run in GPUs or multiple core CPUs. The proposed Destination Word Accumulation (DWA) implementation of morphological operations is faster than Leptonica in 2D and up to two orders of magnitude faster than Python and MATLAB in 1D to 5D.","PeriodicalId":371856,"journal":{"name":"2019 International Conference on High Performance Computing & Simulation (HPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on High Performance Computing & Simulation (HPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPCS48598.2019.9188210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Binary images are often used in image processing pipelines, and are usually stored in the unpacked format, i.e., 8 bits per pixel. The packed format uses 1 bit per pixel, 8 times less memory, and is a good option when dealing with images too big to fit in RAM. This paper presents a parallel implementation of pixelwise and window operators for packed binary images. The implementation, written in OpenCL, can run in GPUs or multiple core CPUs. The proposed Destination Word Accumulation (DWA) implementation of morphological operations is faster than Leptonica in 2D and up to two orders of magnitude faster than Python and MATLAB in 1D to 5D.