This paper summarizes ongoing research in the mapping of image compression transforms to SIMD-parallel computers. Three classes of algorithms are considered: (1) streaming, (2) block-oriented, and (3) hierarchically structured. It is shown that classes 1 and 2 are suitable for SIMD computation, particularly where mesh segments can be connected to form a pipeline. Computation is facilitated by modifying a SIMD mesh to form a brute-force synchronous MIMD processor, which is called a multi-SIMD or MSIMD architecture.
One print or electronic copy may be made for personal use only. Systematic reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited. This manuscript is an author version and may be cited as: Caimi, F. M., Schmalz, M. S., & Ritter, G. X. (1998). On the parallel computation of image compression transformations. In M. S. Schmalz (Ed.), Mathematics of data/image coding, compression, and encryption: July 21 - 22, 1998, San Diego, California. Sponsored and published by SPIE, the International Society for Optical Engineering. Proceedings of SPIE, 3456 (pp. 52-60). Bellingham, WA, USA. doi:10.1117/12.330372
Florida Atlantic University. Harbor Branch Oceanographic Institute contribution #1249.