An Analysis of Computational Cost in Image Processing: A Case Study
- 1 October 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-27 (10) , 904-910
- https://doi.org/10.1109/tc.1978.1674969
Abstract
Picture processing includes a variety of algorithms employed at different stages within a recognition process. Although single parallel algorithms have been suggested, no systematic comparison with sequential algorithms is available. We propose here some parallel algorithms solving a selected set of picture-processing tasks and compare their speed, when implemented on a CLIP machine, with that of the equivalent sequential algorithms implemented on a standard minicomputer. It is shown that parallel algorithms are faster than the sequential ones by a factor depending on the size of the digitization matrix, even when arithmetical operations are widely involved.Keywords
This publication has 15 references indexed in Scilit:
- Thresholding: A challenge for parallel processingComputer Graphics and Image Processing, 1977
- A characterization of parallel thinning algorithmsInformation and Control, 1975
- Parallel thinning of binary picturesElectronics Letters, 1975
- Concavity Point Detection by Iterative ArraysComputer Graphics and Image Processing, 1974
- A Parallel Picture Processing MachineIEEE Transactions on Computers, 1973
- A cellular logic array for image processingPattern Recognition, 1973
- Thinning algorithms on rectangular, hexagonal, and triangular arraysCommunications of the ACM, 1972
- Some Computer Organizations and Their EffectivenessIEEE Transactions on Computers, 1972
- On shrinking binary picture patternsCommunications of the ACM, 1972
- Hexagonal Parallel Pattern TransformationsIEEE Transactions on Computers, 1969