A GPU based implementation of direct multi-bit search (DMS) screen algorithm

Barry Trager; Kartheek Chandu; Chai Wah Wu; Mikel Stanich

doi:10.1117/12.2002583

19 February 2013 A GPU based implementation of direct multi-bit search (DMS) screen algorithm

Barry Trager, Kartheek Chandu, Chai Wah Wu, Mikel Stanich

Proceedings Volume 8655, Image Processing: Algorithms and Systems XI; 86550Z (2013) https://doi.org/10.1117/12.2002583
Event: IS&T/SPIE Electronic Imaging, 2013, Burlingame, California, United States

Abstract

In this paper, we study the feasibility for using programmable Graphics Processing Unit (GPU) technology for image halftoning, in particular implementing the computationally intense Direct Multi-bit Search (DMS) Screen algorithm. Multi-bit screening is an extension of binary screening, in which every pixel in continuoustone image can be rendered to one among multiple output states. For example, a 2 bit printer is capable of printing with four different drop sizes. In our previous work, we have extended the Direct Binary Search (DBS) to the multi-bit case using Direct Multi-bit Search (DMS) where at every pixel the algorithm chooses the best drop output state to create a visually pleasing halftone pattern without any user defined guidance. This process is repeated throughout the entire range of gray levels while satisfying the stacking constraint to create a high quality multi-bit screen (dither mask). In this paper, we illustrate how employing Graphics Processing Units (GPU) can speed-up intensive DMS image processing operations. Particularly, we illustrate how different modules can be been parallelized. The main goal of many of the previous articles regarding DBS is to decrease the execution time of the algorithm. One of the most common approaches is to decrease the neighborhood size or filter size. The proposed parallel approach allows us to use a large neighborhood and filter size, to achieve the highest halftone quality, while having minimal impact on performance. In addition, we also demonstrate processing several non-overlapping neighborhoods in parallel, by utilizing the GPU's parallel architecture, to further improve the computational efficiency.

Citation Download Citation

Barry Trager, Kartheek Chandu, Chai Wah Wu, and Mikel Stanich "A GPU based implementation of direct multi-bit search (DMS) screen algorithm", Proc. SPIE 8655, Image Processing: Algorithms and Systems XI, 86550Z (19 February 2013); https://doi.org/10.1117/12.2002583

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available