Accelerating digital halftoning using the local exhaustive search on the GPU

• Published in: Concurrency and computation Vol. 29; no. 2; pp. np - n/a
• Main Authors: Kouge, Hiroaki, Honda, Takumi, Fujita, Toru, Ito, Yasuaki, Nakano, Koji, Bordim, Jacir L.
• Format: Journal Article
• Language: English
• Published: Hoboken Wiley Subscription Services, Inc 25.01.2017
• Subjects: Architecture; cluster‐dot halftoning; Computational efficiency; Computing time; Concurrency; Digital; digital halftoning; Digital imaging; GPGPU; Graphics boards; Graphics processing units; image processing; Image quality; local exhaustive search; Programming; Searching; United States > US
• ISSN: 1532-0626; 1532-0634
• DOI: 10.1002/cpe.3781

Summary Digital halftoning is an important process to convert a grayscale image into a binary image with black and white pixels. Local exhaustive search‐based halftoning is one of the halftoning methods that can generate high‐quality binary images. However, considering the computing time, it is not realistic for most applications. As a first contribution, this paper proposes a graphics processing unit (GPU) implementation for digital halftoning employing local exhaustive search to produce high‐quality binary images. Programming issues of the GPU architecture have been carefully assessed for implementing the proposed method. Experimental results show that the proposed GPU implementation on NVIDIA (Santa Clara, CA, USA) GeForce GTX TITAN X attains a speed‐up factor of up to 48 over a CPU implementation. Our second contribution is a GPU implementation for cluster‐dot halftoning tailored for local exhaustive search. This implementation attains a speed‐up factor of 92 over a sequential CPU implementation. Copyright © 2016 John Wiley & Sons, Ltd.