Skip to main content

Two Parallel Algorithms for the Analysis of Random Images

  • Conference paper
Real-Time Object Measurement and Classification

Part of the book series: NATO ASI Series ((NATO ASI F,volume 42))

  • 86 Accesses

Abstract

Aim of the paper is to show a computational paradigm, that reduces some algorithms on undirected graphs into image analysis algorithms. In particular two parallel algorithms on undirected weighted graphs, often used in the analysis of sparse images, are described.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. De Biase, V. Di Gesu’, B. Sacco: “Detection of diffuse clusters in noise background.”, Pattern Recognition Letters, 4, pp. 39–44, 1986.

    Article  Google Scholar 

  2. M.J.B. Duff, “CLIP4: a large scale integrated circuit array parallel processor”. In Proc. 3rd Int. Joint Conf. on Pattern Recognition, pp. 728–733, 1984.

    Google Scholar 

  3. K.E. Batcher, “Design of a Massively Parallel Processor”, IEEE Trans, on Computers, vol. C-29, pp 836–840, September 1980.

    Article  Google Scholar 

  4. V. Cantoni et al.,“The PAPIA Image Analysis System”, 2nd International Technical Symposium ANRT-SPIE. Cannes, November 1985.

    Google Scholar 

  5. M. J. Atallah, S.R. Kosaraju: “Graph problems on a Mesh-Connected Processor Array”, Proc. of the 14th Ann. Symp. on Theory of Comput. pp. 354–353, 1982.

    Google Scholar 

  6. S.E. Hambrush: “The complexity of Graph Problems in VLSI”, Ph.P.Thesis. The Pennsylvania State University, 1982.

    Google Scholar 

  7. S.E. Hambrush, J. Simon, “Lower Bounds for solving Undirected Graph problems on VLSI”, Lecture Notes in Computer Science. Automata Languages and Programming Ed by J. Diar, pp. 292–303, 1983.

    Google Scholar 

  8. R. Miller, Q. Stout: “Pyramid Computer Algorithms for Determining Geometric Properties of Images”, Proc. of the Symp. on Computational Geometry. June 1985, ACM, 263–271.

    Google Scholar 

  9. J. Serra, “Image Analysis and Mathematical Morphology”, Academic Press, London, 1982.

    MATH  Google Scholar 

  10. J.L. Bentley, J. Friedman, “Fast Algorithms for Constructing Minimal Spannig Trees in Coordinate Spaces”, IEEE Trans on Computers. Vol C27, N.2, pp.97–105, February 1978.

    Article  Google Scholar 

  11. J. Friedman, F. Basket, L.J. Shustek, “A relatively Efficient Algorithm for Finding Nearest Neighbors”, SLAC-PUB-1448. CS–445. June 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Gesu, V., Machi, A. (1988). Two Parallel Algorithms for the Analysis of Random Images. In: Jain, A.K. (eds) Real-Time Object Measurement and Classification. NATO ASI Series, vol 42. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83325-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-83325-0_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-83327-4

  • Online ISBN: 978-3-642-83325-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics