Direct binary search (DBS) algorithm with constraints

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

doi:10.1117/12.2002554

4 February 2013 Direct binary search (DBS) algorithm with constraints

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

Proceedings Volume 8652, Color Imaging XVIII: Displaying, Processing, Hardcopy, and Applications; 86520K (2013) https://doi.org/10.1117/12.2002554
Event: IS&T/SPIE Electronic Imaging, 2013, Burlingame, California, United States

Abstract

In this paper, we describe adding constraints to the Direct Binary Search (DBS) algorithm. An example of a useful constraint, illustrated in this paper, is having only one dot per column and row. DBS with such constraints requires greater than two toggles during each trial operation. Implementations of the DBS algorithm traditionally limit operations to either one toggle or swap during each trial. The example case in this paper produces a wrap-around pattern with uniformly distributed ON pixels which will have a pleasing appearance with precisely one ON pixel per each column and row. The algorithm starts with an initial continuous tone image and an initial pattern having only one ON pixel per column and row. The auto correlation function of Human Visual System (HVS) model is determined along with an initial perceived error. Multiple operation pixel error processing during each iteration is used to enforce the one ON pixel per column and row constraint. The constraint of a single ON pixel per column and row is used as an example in this paper. Further modification of the DBS algorithm for other constraints is possible, based on the details given in the paper. A mathematical framework to extend the algorithm to the more general case of Direct Multi-bit Search (DMS) is presented.

Citation Download Citation

Kartheek Chandu, Mikel Stanich, Chai Wah Wu, and Barry Trager "Direct binary search (DBS) algorithm with constraints", Proc. SPIE 8652, Color Imaging XVIII: Displaying, Processing, Hardcopy, and Applications, 86520K (4 February 2013); https://doi.org/10.1117/12.2002554

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