Parallel Processing Approaches to Image Correlation
L. Siegel, Howard Jay Siegel, Arthur E. Feathe · IEEE Transactions on Computers · 1982
Image correlation is representative of a wide variety of window-based image processing tasks. The way in which multimi-croprocessor systems (e.g., PASM) can use SIMD parallelism to perform image correlation is examined. Two fundamental algorithm strategies are explored. In one approach, all of the data that will be needed in a processor are transferred to the processor and operated on there. In the other, each processor performs all possible operations on its local data, generating partial results which are then transferred to the processor in which they are needed. The "time/space/inter-processor-transfer" complexities of the two algorithm approaches are analyzed in order to quantify the differences resulting from the two -strategies. For both approaches, the asymptotic time complexity of the N-processor SIMD algorithms is (1/N)th that of the corresponding serial algorithms.
Cited by 56 works. doi:10.1109/tc.1982.1675976
Authors
References
- Pattern classification and scene analysis
- Digital Picture Processing
- Pattern classification and scene analysis
- Access and Alignment of Data in an Array Processor
- Very high-speed computing systems
- The Indirect Binary n-Cube Microprocessor Array
- Study of multistage SIMD interconnection networks
- Correlation Techniques of Image Registration
- The Multidimensional Access Memory in STARAN
- The Illiac IV system