Share Email Print

Proceedings Paper

Parallel processing of run-length-encoded Boolean imagery: RLE transformation, arithmetic, and global-reduce operations
Author(s): Mark S. Schmalz
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The processing of Boolean imagery compressed by runlength encoding (RLE) frequently exhibits greater computational efficiency than the processing of uncompressed imagery, due to the data reduction inherent in RLE. In a previous publication, we outlined general methods for developing operators that compute over RLE Boolean imagery. In this paper, we present sequential and parallel algorithms for a variety of operations over RLE imagery, including the customary arithmetic and logical Hadamard operations, as well as the global reduce functions of image sum and maximum. RLE neighborhood-based operations, as well as the more advanced RLE operations of linear transforms, connected component labelling, and pattern recognition are presented in the companion paper.

Paper Details

Date Published: 3 September 1993
PDF: 13 pages
Proc. SPIE 1955, Signal Processing, Sensor Fusion, and Target Recognition II, (3 September 1993); doi: 10.1117/12.154992
Show Author Affiliations
Mark S. Schmalz, Univ. of Florida (United States)

Published in SPIE Proceedings Vol. 1955:
Signal Processing, Sensor Fusion, and Target Recognition II
Ivan Kadar; Vibeke Libby, Editor(s)

© SPIE. Terms of Use
Back to Top