Skip to main content
Log in

Parallel stereocorrelation on a reconfigurable multi-ring network

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

A reconfigurable network termed as the reconfigurable multi-ring network (RMRN) is described. The RMRN is shown to be a truly scalable network in that each node in the network has a fixed degree of connectivity and the reconfiguration mechanism ensures a network diameter of O(log2 N) for anN-processor network. Algorithms for the two-dimensional mesh and the SIMD or SPMD n-cube are shown to map very elegantly onto the RMRN. Basic message passing and reconfiguration primitives for the SIMD/SPMD RMRN are designed for use as building blocks for more complex parallel algorithms. The RMRN is shown to be a viable architecture for image processing and computer vision problems using the parallel computation of the stereocorrelation imaging operation as an example. Stereocorrelation is one of the most computationally intensive imaging tasks. It is used as a visualization tool in many applications, including remote sensing, geographic information systems and robot vision.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. R. Arabnia. A transputer-based reconfigurable parallel system. InTransputer Research and Applications (NATUG6), pp. 153–169. IOS Press, Vancouver, Canada, 1993.

    Google Scholar 

  2. H.R. Arabnia and J. W. Smith. A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. InProceedings, 1993 International Conference on High Performance Computing: New Horizons, pp. 349–357, Alberta, Canada, 1993.

  3. S. T. Barnard. Stereo matching. In R. Chellappa and A. K. Jain, eds., Markov Random Fields—Theory and Applications, pp. 245–271. Academic Press, 1993.

  4. S.M. Bhandarkar and H.R. Arabnia. The REFINE multiprocessor—Theoretical properties and algorithms. Parallel Computing, 21 (11): 1783–1806, 1995.

    Google Scholar 

  5. BBN Advanced Computers, Inc. TC2000 Technical Product Summary. Cambridge, Mass., November 1989.

  6. G. S. Cox and G. de Jager. Automatic registration of temporal image pairs for digital subtraction angiography. Technical report, University of Cape Town, Department of Electrical Engineering, South Africa, 1993.

    Google Scholar 

  7. G. S. Cox and G. de Jager. Invariance in template matching. Technical report, University of Cape Town, Department of Electrical Engineering, South Africa, 1993.

    Google Scholar 

  8. A. Faridani and K. R. Dimond. A transputer-based vision system for mobile robots. In H. R. Arabnia, ed., Transputer Research and Applications (NATUG 7), pp. 68–78. IOS Press, 1995.

  9. R. Goke and G.J. Lipovski. Banyan networks for partitioning on multiprocessor systems. InProceeedings, First Annual Symposium on Computer Architecture, pp. 21–30, 1973.

  10. A. Gottleib, R. Grishman, C.P. Kruskal, K.P. McAuliffe, L. Rudolf, and M. Snir. The NYU Ultracomputer—Designing an MIMD shared memory parallel computer. IEEE Transactions on Computers, 32 (2): 175–189, February 1986.

    Google Scholar 

  11. D.J. Kuck, E.S. Davidson, D.H. Lawrie, and A.H. Sameh. Parallel supercomputing today—The Cedar approach. Science, 231 (4741): 967–974, February 1986.

    Google Scholar 

  12. D.H. Lawrie. Access and alignment of data in an array processor. IEEE Transactions on Computers, 24 (12): 1145–1155, December 1975.

    Google Scholar 

  13. F. T. Leighton. Introduction to Parallel Algorithms and Architectures—Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo, Calif., 1992.

    Google Scholar 

  14. G. Medioni and R. Nevatia. Segment-based stereo matching. Computer Vision, Graphics, and Image Processing, 31: 2–18, 1985.

    Google Scholar 

  15. J.H. Patel. Performance of processor-memory interconnections for multiprocessors. IEEE Transactions on Computers, 27 (10): 771–780, October 1981.

    Google Scholar 

  16. M.C. Pease. The indirect binary n-cube microprocessor array. IEEE Transactions on Computers, 25 (5): 458–473, 1977.

    Google Scholar 

  17. G.F. Pfister and V.A. Norton. Hot spot contention and combining in multistage interconnection networks. InProceedings, International Conference on Parallel Processing, pp. 790–797, August 1985.

  18. M.R. Saradjian Maralan. Automated motion analysis within sequential satellite infrared images using fast translated, rotated and deformed pattern recognition techniques on a shared memory MIMD parallel computer system. Ph.D. thesis, University of Dundee, Department of Applied Physics and Electronic and Mechanical Engineering, Dundee, DD1 4HN, Scotland, April 1995. (Also available from The British Library, London, England).

    Google Scholar 

  19. C.L. Wu and T. Y. Feng. On a class of multistage interconnection networks. IEEE Transactions on Computers, 26 (8): 696–702, August 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arabnia, H.R., Bhandarkar, S.M. Parallel stereocorrelation on a reconfigurable multi-ring network. J Supercomput 10, 243–269 (1996). https://doi.org/10.1007/BF00130109

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00130109

Keywords

Navigation