Advertisement

Computing the Hough Transform on Arrays with Reconfigurable Optical Buses

  • Sandy D. Pavel
  • Selim G. Akl
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 468)

Abstract

This chapter examines the possibility of implementing the Hough transform for line and circle detection on the array with reconfigurable optical buses (AROB). The AROB combines some of the advantages and characteristics of reconfigurable meshes and meshes with optical pipelined buses. It is shown that the Hough transform for line and circle detection in an N × N image can be implemented optimally in a constant number of steps. The costs of the two algorithms are O(N 2 p) and O(N 2 p 2), respectively, where p is the magnitude of one dimension in the parameter space. These values are optimal with respect to the corresponding time complexities of the best known sequential algorithms.

Keywords

Edge Pixel Line Detection Hough Transform Optical Interconnection Reconfigurable Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S.G. Akl. Parallel Computation: Models and Methods. Prentice Hall, Upper Saddle River, New Jersey, 1997.Google Scholar
  2. [2]
    S. Bhandarkar and H.R. Arabnia. The Hough transform on a reconfigurable multi-ring network. Journal of Parallel and Distributed Computing, 24:107–114, 1995.CrossRefGoogle Scholar
  3. [3]
    Y. Ben-Asher, D. Peleg, R. Ramaswami, and A. Schuster. The power of reconfiguration. Journal of Parallel and Distributed Computing, 13:139–153, 1991.CrossRefMathSciNetGoogle Scholar
  4. [4]
    D.M. Chiarulli, R.G. Melhem, and S.P. Levitan. Using coincident optical pulses for parallel memory addressing. The Computer Journal, 30:48–57, 1987.Google Scholar
  5. [5]
    R.E. Cypher, J.L., Sanz, and L. Snyder. The Hough Transform has O(N) complexity in SIMD N by N mesh array architectures. In Proceedings IEEE Computer Society Workshop on Computer Architectures for Pattern Analysis and Machine Intelligence, pages 115–121, 1987.Google Scholar
  6. [6]
    J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, Massachusetts, 1990.Google Scholar
  7. [7]
    A.L. Fisher and P.T. Highnam. Computing the Hough transform on a scan line array processor. IEEE Transactions on PAMI, 11(3):262–265, 1989.Google Scholar
  8. [8]
    C. Guerra and S. Hambrusch. Parallel algorithms for line detection on a mesh. Journal of Parallel and Distributed Computing, 6:1–9, 1989.CrossRefGoogle Scholar
  9. [9]
    Z. Guo. Sorting on array processors with pipelined buses. In Proceedings 1992 International Conference on Parallel Processing, Vol. III, pages 289–292, 1992.Google Scholar
  10. [10]
    Z. Guo. Optically Interconnected Processor Arrays with Switching Capability. Journal of Parallel and Distributed Computing, 23:314–329, 1994.CrossRefGoogle Scholar
  11. [11]
    Z. Guo, R.M. Melhem, R.W., Hall, D.M., Chiarulli, and S.P. Levitan. Pipelined communications in optically interconnected arrays. Journal of Parallel and Distributed Computing, 12:269–282, 1991.CrossRefGoogle Scholar
  12. [12]
    V.P. Heuring, H.F., Jordan, and J.P. Pratt. Bit-serial architecture for optical computing. Applied Optics, 31(17):3213–3224, 1992.Google Scholar
  13. [13]
    H.A.H. Ibrahim, J.R., Kender, and D.E. Shaw. The analysis and performance of two middle-level vision tasks on a fine-grained SIMD tree machine. In Proceedings IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pages 387–393, 1985.Google Scholar
  14. [14]
    J. Illingworth and J. Kittler. A survey of Hough transform. Computer Vision, Graphics, and Image Processing, 44:87–116, 1988.CrossRefGoogle Scholar
  15. [15]
    J.-W Jang, H. Park, and V.K. Prasanna. A fast algorithm for computing a histogram on reconfigurable mesh. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(2):97–106, 1995.CrossRefGoogle Scholar
  16. [16]
    J.F. Jenq and S. Sahni. Reconfigurable mesh algorithms for the Hough transform. Journal of Parallel and Distributed Computing, 20:69–77, 1994.MATHCrossRefGoogle Scholar
  17. [17]
    J. Jolion and A. Rosenfeld. An O(log n) pyramid Hough transform. Pattern Recognition Letters, 9:343–349, 1989.MATHCrossRefGoogle Scholar
  18. [18]
    C.S. Kannan and H.Y.H. Chuang. Fast Hough transform on a mesh connected processor array. Information Processing Letters, 33:243–248, 1990.MATHCrossRefGoogle Scholar
  19. [19]
    T.-W. Kao, S.-J., Horng, Y.-L., Wang, and K.-L., Chung. A constant time algorithm for computing Hough transform. Pattern Recognition, 26(2):277–286, 1993.CrossRefGoogle Scholar
  20. [20]
    S. Kumar, N. Ranganathan, and D. Goldof. Parallel algorithms for circle detection in images. Pattern Recognition, 27(8):1019–1028, 1994.CrossRefGoogle Scholar
  21. [21]
    S.P. Levitan, D.M. Chiarulli, and R.G. Melhem. Coincident pulse technique for multiprocessor interconnection structures. Applied Optics, 29(14):2024–2033, 1990.Google Scholar
  22. [22]
    K. Li. Constant time boolean matrix multiplication on a linear array with a reconfigurable pipelined bus system. In Proceedings 11th Annual International Symposium on High Performance Computing Systems, pages 179–190, 1997.Google Scholar
  23. [23]
    K. Li, Y. Pan, and S.-Q. Zheng. Simulation of parallel random access machines on a linear array with a reconfigurable pipelined bus system. In Proceedings International Conference on Parallel and Distributed Techniques and Applications, Vol. II, pages 590–599, 1997.Google Scholar
  24. [24]
    R.G. Melhem, D.M. Chiarulli, and S.P. Levitan. Space multiplexing of waveguides in optically interconnected multiprocessor systems. Computer Journal, 32(4):362–369, 1989.CrossRefGoogle Scholar
  25. [25]
    S. Olariu, J.L. Schwing, and J. Zhang. Integer problems on reconfigurable meshes, with application. Journal of Computer and Software Engineering, 1:33–46, 1993.Google Scholar
  26. [26]
    S. Olariu, J.L. Schwing, and J. Zhang. Computing the Hough transform on reconfigurable meshes. Image and Vision Computing, 11:623–628, 1993.CrossRefGoogle Scholar
  27. [27]
    Y. Pan. Hough transform on arrays with an optical bus. In Proceedings 5th ISMM International Conference on Parallel and Distributed Computing and Systems, pages 161–166, 1992.Google Scholar
  28. [28]
    Y. Pan. A more efficient constant time algorithm for computing the Hough transform. Parallel Processing Letters, 4(1–2):45–52, 1994.CrossRefMathSciNetGoogle Scholar
  29. [29]
    Y. Pan and H.Y.H. Chuang. Parallel Hough transform algorithms on SIMD hypercube arrays. In Proceedings 1990 International Conference on Parallel Processing, pages 83–86, 1990.Google Scholar
  30. [30]
    Y. Pan and H.Y.H. Chuang. Faster line detection algorithms on enhanced mesh connected arrays. IEEE Proceedings-E, 2(140):95–100, 1993.Google Scholar
  31. [31]
    S. Pavel. Computation and Communication Aspects of Arrays with Optical Pipelined Buses. Ph.D. thesis, Department of Computing and Information Science, Queen’s University, Kingston, Ontario, 1996.Google Scholar
  32. [32]
    S. Pavel and S.G. Akl. Matrix operations using arrays with reconfigurable optical buses. Journal of Parallel Algorithms and Applications, 8:223–242, 1996.MATHGoogle Scholar
  33. [33]
    S. Pavel and S.G. Akl. Area-time trade-offs in arrays with optical pipelined buses. Applied Optics, 35:1827–1835, 1996.CrossRefGoogle Scholar
  34. [34]
    S. Pavel and S.G. Akl. On the power of arrays with reconfigurable optical buses. In Proceedings International Conference on Parallel and Distributed Processing Techniques and Applications, pages 1443–1454, 1996.Google Scholar
  35. [35]
    S. Pavel and S.G. Akl. Integer sorting and routing in arrays with reconfigurable optical buses. to appear in International Journal of Foundations of Computer Science, Special Issue on Interconnection Networks, 1998.Google Scholar
  36. [36]
    C. Qiao. On designing communication-intensive algorithms for a spanning optical bus based array. Parallel Processing Letters, 5(3):499–511, 1995.CrossRefMathSciNetGoogle Scholar
  37. [37]
    C. Qiao and R.G. Melhem. Time-division communications in multiprocessor arrays. IEEE Transactions on Computers, 42(5):577–590, 1993.CrossRefGoogle Scholar
  38. [38]
    C. Qiao, R.G. Melhem, D.M. Chiarulli, and S.P. Levitan. Optical multicasting in linear arrays. International Journal Optical Computing, 2:31–48, 1991.Google Scholar
  39. [39]
    A. Rosenfeld J. Ornelas, and Y. Hung. Hough transform algorithms for mesh-connected SIMD parallel processors. Computer Vision, Graphics and Image Processing, 41:293–305, 1988.CrossRefGoogle Scholar
  40. [40]
    T.M. Silberberg. The Hough transform on geometric arithmetic parallel processor. In Proceedings IEEE Computer Society Workshop on Computer Architecture for Pattern Analysis and Image Database Management, pages 387–393, 1985.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Sandy D. Pavel
    • 1
  • Selim G. Akl
    • 1
  1. 1.Department of Computing and Information ScienceQueen’s UniversityKingstonCanada

Personalised recommendations