Paper
3 September 1993 Parallel processing of run-length-encoded Boolean imagery: RLE transformation, arithmetic, and global-reduce operations
Author Affiliations +
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.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mark S. Schmalz "Parallel processing of run-length-encoded Boolean imagery: RLE transformation, arithmetic, and global-reduce operations", Proc. SPIE 1955, Signal Processing, Sensor Fusion, and Target Recognition II, (3 September 1993); https://doi.org/10.1117/12.154992
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Transform theory

Binary data

Image processing

Computer programming

Chromium

Convolution

Back to Top