1 July 1992 Processing of compressed imagery: application to morphological and gray-scale computations over transform-, block-, runlength-, and derivative-encoded imagery
Author Affiliations +
Abstract
The processing of compressed imagery exhibits computational advantages due to the processing of fewer data, as well as the advantage of low-level data security afforded by the encoding format. We have elsewhere discussed the general theory of compressive processing, and have presented complexity analyses which support the claim of computational speedup. In this introductory paper, general methods are described for the processing of signals and imagery encoded via transform-, block-, runlength-, and derivative-coding schemes. Operations of interest include unary and binary pointwise operations, the global reduce operation, and neighborhood operations, such as morphological erosion and dilation. Implementational analyses emphasize the relationship between the compression ratio and the time complexity of compressive computation.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mark S. Schmalz, Mark S. Schmalz, } "Processing of compressed imagery: application to morphological and gray-scale computations over transform-, block-, runlength-, and derivative-encoded imagery", Proc. SPIE 1702, Hybrid Image and Signal Processing III, (1 July 1992); doi: 10.1117/12.60546; https://doi.org/10.1117/12.60546
PROCEEDINGS
16 PAGES


SHARE
RELATED CONTENT


Back to Top