Translator Disclaimer
1 November 1990 Parallel architectures for binary image algebra
Author Affiliations +
Image processing afid image analysis tasks have large (lata processing requirements and inherent parallelism. Because they involve a large amount of data, their operations can he extremely complex. During the past few years, numerous papers lave used an algebraic approach to aid in image processing [Serra82, Lotigheed8o, JUL Lcr87, Ciardina8i, Agui82, lluang87aJ. A simple algebraic system for expressing parallel image transformations would be very helpful for people to learn the art of parallel image processing, to compare different algorithms and architectures, arid to design a special-purpose image processor. Iii this paper, we use a binary image algebra (}31A) [ llnang89a, iluang9OJ, an axiomatic algebraic structure, to serve as a standar(l mathematical structure for the processing of binary images. Some parallel binary image processing architures can then be derived and compared. Section 2 reviews BEA and discusses the requirements for implementing A. Section 3 (liscusses three kinds of parallel architectures for f3JA: near-neighbor array architectures, hypercube architectures, and pipeline architectures. Section 4 discusses their implementation techniques. Section 5 gives a conclusion.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kung-Shiuh Huang "Parallel architectures for binary image algebra", Proc. SPIE 1350, Image Algebra and Morphological Image Processing, (1 November 1990);


Fast computation of the grassfire transform using SKIPSM
Proceedings of SPIE (October 02 1994)
Poset approach to 3D parallel thinning
Proceedings of SPIE (September 22 1999)
Fast one pass algorithm to label objects and compute their...
Proceedings of SPIE (November 30 1991)
Optical Logic Array Processor
Proceedings of SPIE (April 14 1983)
Fault diagnosis of dynamic memory board
Proceedings of SPIE (August 27 1995)

Back to Top