Skip to main content

Massively Parallel Processing of Image Contours

  • Chapter
Visual Form

Abstract

The past three decades have seen the emergence of powerful new methods for image analysis and of novel architectural concepts for the design and construction of massively parallel machines, many motivated by the need to process images at high speeds. However, with some notable exceptions (the Image Understanding Architecture [1] for example, and the Connection Machine [2], to a lesser extent), research on architectures for image understanding has been driven more by classical models of image processing (essentially, image-to-image transformations and global feature extraction) than by the more powerful image representations and processing methods developed by the image understanding community.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. Charles C. Weems, Steven P. Levitan, Allen R. Hanson, and Edward M. Riseman. The Image Understanding Architecture. International Journal of Computer Vision, 2(3):251–282, January 1989.

    Article  Google Scholar 

  2. W. Daniel Hillis. The Connection Machine. MIT Press, Cambridge, MA, 1985.

    Google Scholar 

  3. Ling Tony Chen and Larry S. Davis. A Parallel Algorithm for List Ranking Image Curves in O(log N) Time. Technical Report CAR-TR-501/CS-TR-2458, Center for Automation Research, April 1990.

    Google Scholar 

  4. Ling Tony Chen and Larry S. Davis. A Parallel Algorithm for List Ranking Image Curves in O(log N) Time. DARPA Image Understanding Workshop, pages 805-815, September 1990.

    Google Scholar 

  5. J. C. Wyllie. The Complexity of Parallel Computation. PhD thesis, Cornell University, 1979.

    Google Scholar 

  6. Yubin Hung. Parallel Processing of Geometric Representations on SIMD Computers. PhD thesis, University Of Maryland, College Park, 1988.

    Google Scholar 

  7. Angela Y. Wu, S. K. Bhaskar, and Azriel Rosenfeld. Parallel processing of region boundaries. Pattern Recognition, 22:165–172, 1989.

    Article  Google Scholar 

  8. Ajit Agrawal, Lena Nekludova, and Willie Lim. A Parallel O(log N) Algorithm for Finding Connected Components in Planar Images. In International Conference on Parallel Processing, pages 783-786, August 1987.

    Google Scholar 

  9. R. Cole and U. Vishkin. Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM Journal of Computing, 17(1):128–142, February 1988.

    Article  MathSciNet  MATH  Google Scholar 

  10. R. Anderson and G. Miller. Deterministic Parallel List Ranking. In Proceedings of the 3rd Aegean Workshop on Computing, pages 81-90, New York, June/July 1988. Springer-Verlag.

    Google Scholar 

  11. Clyde P. Kruskal, Larry Rudolph, and Marc Snir. The Power of Parallel Prefix. IEEE Transactions on Computers, 34:965–968, 1985.

    Article  Google Scholar 

  12. R. E. Ladner and M. J. Fischer. Parallel prefix computation. J. ACM, 27:831–838, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  13. James J. Little, Guy E. Blelloch, and Todd A. Cass. Algorithmic techniques for computer vision on a fine-grained parallel machine. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11:244–256, 1989.

    Article  Google Scholar 

  14. Guy E. Blelloch. Scan Primitives and Parallel Vector Models. PhD thesis, Massachusetts Institute of Technology, November 1988.

    Google Scholar 

  15. U. Ramer. Extraction of line structures from photographs of curved objects. Computer Graphics and Image Processing, 4:81–103, 1975.

    Article  Google Scholar 

  16. T. Pavlidis. Structural Pattern Recognition. Springer-Verlag, New York, 1977.

    MATH  Google Scholar 

  17. Ling Tony Chen and Larry S. Davis. Parallel Algorithms for Testing If a Point is Inside a Closed Curve. Pattern Recognition Letters, 12(2):73–77, February 1991.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media New York

About this chapter

Cite this chapter

Chen, L.T., Davis, L.S., Kruskal, C.P. (1992). Massively Parallel Processing of Image Contours. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds) Visual Form. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0715-8_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-0715-8_15

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-0717-2

  • Online ISBN: 978-1-4899-0715-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics