Share Email Print

Proceedings Paper

Optimally efficent implementation of Boolean functions used in 2D binary image processing
Author(s): Chyi-Jou Gau; T. Yung Kong
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

2D binary image processing algorithms frequency require the computation, for a pixel p, of some Boolean function of the values of a few pixels near p. For any such Boolean function over a given probability distribution on the function that is, in a sense, optimally efficient. We introduce a measure for run-time efficiency as a result of generating the optimized C implementation, which is independent of the development platforms and the programming skills. Thus it can be regarded as a tool to measure the run-time efficiency of 2D binary image algorithms before even conducting actual experimental tests. Using a simple data set comparing with the evenly distributed probability data, we present our experimental results using our measure and analyze a number of thinning algorithms based on our measure to evaluate the run-time performance of these binary image processing algorithms.

Paper Details

Date Published: 2 October 1998
PDF: 8 pages
Proc. SPIE 3454, Vision Geometry VII, (2 October 1998); doi: 10.1117/12.323259
Show Author Affiliations
Chyi-Jou Gau, CUNY/Graduate School and University Ctr. (United States)
T. Yung Kong, CUNY/Graduate School and University Ctr. (United States)

Published in SPIE Proceedings Vol. 3454:
Vision Geometry VII
Robert A. Melter; Angela Y. Wu; Longin Jan Latecki, Editor(s)

© SPIE. Terms of Use
Back to Top