Parallel processing of run-length-encoded Boolean imagery: linear transformations and high-level image operations

Mark S. Schmalz

doi:10.1117/12.154993

3 September 1993 Parallel processing of run-length-encoded Boolean imagery: linear transformations and high-level image operations

Mark S. Schmalz

Author Affiliations +

Proceedings Volume 1955, Signal Processing, Sensor Fusion, and Target Recognition II; (1993) https://doi.org/10.1117/12.154993
Event: Optical Engineering and Photonics in Aerospace Sensing, 1993, Orlando, FL, United States

Abstract

This is the second of two papers which describe algorithms for the processing of Boolean imagery compressed by runlength encoding (RLE). In the previous paper, we presented 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. In this paper, we discuss RLE neighborhood-based operations, as well as the more advanced RLE operations of linear transforms, connected component labelling, and pattern recognition.

Citation Download Citation

Mark S. Schmalz "Parallel processing of run-length-encoded Boolean imagery: linear transformations and high-level image operations", Proc. SPIE 1955, Signal Processing, Sensor Fusion, and Target Recognition II, (3 September 1993); https://doi.org/10.1117/12.154993

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