Abstract
Many low-level image processing algorithms which are posed as variational problems can be numerically solved using local and iterative relaxation algorithms. Because of the structure of these algorithms, processing time will decrease nearly linearly with the addition of processing nodes working in parallel on the problem. In this article, we discuss the implementation of a particular application from this class of algorithms on the 8×8 processing array of the AT&T Pixel system. In particular, a case study for a image interpolation algorithm is presented. The performance of the implementation is evaluated in terms of the absolute processing time. We show that near linear speedup is achieved for such iterative image processing algorithms when the processing array is relatively small.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Poggio, V. Torre and C. Koch, “Computational vision and regularization theory,”Nature, vol. 317, no. 26, 1985, pp. 314–319.
A.N. Tikhonov and V.Y. Arsenin,Solutions of Ill-Posed Problems, Washington, D.C.: V.H. Winston & Sons, 1977.
R.L. Stevenson, G.B. Adams, HI, L.H. Jamieson and E.J. Delp, “Three-dimensional surface reconstruction on the AT&T Pixel Machine,”Proceedings of the 24th Asilomar Conference on Signals, Systems, and Computers, 1990.
J. Hadamard,Lectures on the Cauchy Problem in Linear Partial Differential Equations, New Haven, CT: Yale University Press, 1923.
A.N. Tikhonov and A.V. Goncharsky, eds.,Ill-Posed Problems in the Natural Sciences, Moscow: MIR Publishers, 1987.
R.L. Stevenson and E.J. Delp, “Invariant recovery of curves inm-dimensional space from sparse data”Journal of the Optical Society of America A, vol. 7, 1990, pp. 480–490.
R.L. Stevenson and E.J. Delp, “Invariant reconstruction of visual surfaces,”Proceedings of the IEEE Workshop in Interpretation of 3D Scenes, 1989, pp. 131–137.
R.L. Stevenson and E.J. Delp, “Invariant recovery of curves inm-dimensional space from sparse data,”Journal of the Optical Society of America A, vol. 7, 1990, pp. 480–490.
R.L. Stevenson and E.J. Delp, “Fitting curves with discontinuities,”Proceedings of the 1990 IEEE International Workshop on Robust Computer Vision, 1990, pp. 127–136.
R.L. Stevenson and E.J. Delp, “Invariant reconstruction of 3D curves and surfaces,”Proceedings of the SPIE Conference on Intelligent Robots and Computer Vision IX: Neural, Biological, and 3D Methods, 1990, pp. 364–375.
R.L. Stevenson and E.J. Delp, “Viewpoint invariant recovery of visual surface from sparse data,”Proceedings of the 1990 International Conference on Computer Vision, 1990, pp. 309–312.
R.R. Schultz and R.L. Stevenson, “Improved definition image expansion,”Proceedings of the International Conference on Acoustics, Speech and Signal Processing, 1992.
D. Terzopoulos, “The computation of visible-surface representations,”IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-10, 1988, pp. 417–438.
R. Courant and D. Hilbert,Methods of Mathematical Physics, New York: Interscience Publishers, Inc., vol. I, 1953.
W.E.L. Grimson,From Images to Surfaces: A Computational Study of the Human Early Visual System, Cambridge, MA: MIT Press, 1981.
A. Katsaggelos, “Iterative image restoration algorithms,”Optical Engineering, vol. 28, no. 7, 1989.
R.L. Stevenson, “A nonlinear filtering structure for smoothing discontinuous signals corrupted with Gaussian noise,”Proceedings of the SPIE Conference on Electronic Imaging, 1992, pp. 210–221.
K.D. Sauer and C. Bouman, “A local update strategy for iterative reconstruction from projections,” inIEEE Transactions on Signal Processing, vol. 41, no. 2, February, 1993.
R.N. Kershaw, et al., “A programmable digital signal processor with 32-bit floating point arithmetic,”Proceedings of the IEEE International Solid-State Circuits Conference, 1985, pp. 92–93.
M. Potmesil and E.M. Hoffert, “The Pixel Machine: A parallel image computer,”SIGGRAPH, 1989, pp. 69–78.
L.H. Jamieson, “Making parallel computers usable: A software environment of parallel computer vision,” in Sanz, ed.,Opportunities and Constraints of Parallel Computing, New York: Springer-Verlag, 1990, pp. 69–72.
P.J. Denning and G.B. Adams, III, “Research questions for performance analysis of supercomputers,” in J. Martin, ed.,Performance Evaluation of Supercomputers, Amsterdam, Netherlands, North-Holland, 1988, pp. 403–419.
L.H. Jamieson and E.J. Delp, “Characteristics of medical imaging algorithms,”Proceedings of the IEEE Conference on Engineering in Medicine and Biology, 1990.
G.M. Amdahl, “Validity of the single processor approach to achieving large scale computing capabilities,”Proceedings of the AFIPS 1967 Spring Joint Computer Conference, 1967, pp. 483–485.
Author information
Authors and Affiliations
Additional information
This work was made possible by a grant from the AT&T University Equipment Program.
Rights and permissions
About this article
Cite this article
Stevenson, R.L., Adams, G.B., Jamieson, L.H. et al. Parallel implementation for iterative image restoration algorithms on a parallel DSP machine. J VLSI Sign Process Syst Sign Image Video Technol 5, 261–272 (1993). https://doi.org/10.1007/BF01581300
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01581300