Constan t-Time Hough Transform On A 3D Reconfigurable Mesh Using Fewer Processors

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1800)


The Hough transform has many applications in image processing and computer vision, including line detection, shape recognition and range alignment for moving imaging objects. Many constant-time algorithms for computing the Hough transform have been proposed on reconfigurable meshes [1, 5, 6, 7, 9, 10]. Among them, the ones described in [1, 10] are the most efficient. For a problem with an N × N image and an n × n parameter space, the algorithm in [1] runs in a constant time on a 3D nN × N × N reconfigurable mesh, and the algorithm in [10] runs in a constant time on a 3D n2 × N × N reconfigurable mesh. In this paper, a more efficient Hough transform algorithm on a 3D reconfigurable mesh is proposed. For the same problem, our algorithm runs in constant time on a 3D n log2N × N × N reconfigurable mesh.


Black Pixel Hough Transform Shape Recognition Switch Setting Local Switch 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K.-L. Chung and H.-Y. Lin, “Hough transform on reconfigurable meshes,” Computer Vision and Image Understanding, vol. 61, no. 2, 1995, pp. 278–284.CrossRefGoogle Scholar
  2. 2.
    P. V. C. Hough, “Methods and means to recognize complex patterns,” U.S. Patent 3069654, 1962.Google Scholar
  3. 3.
    H.A.H. Ibrahim, J.R. Render, and D.E. Shaw, “The analysis and performance of two middle-level vision tasks on a fine-grained SIMD tree machine,” Proc. IEEE Computer Society Conf. on Computer Vision and Pattern Recognition, pp. 387–393, June 1985.Google Scholar
  4. 4.
    J. F. Jeng and S. Sahni, “Reconfigurable mesh algorithms for the Hough transform,” International Conference on Parallel Processing, vol. III, pp. 34–41, Aug. 12–16, 1991.Google Scholar
  5. 5.
    T.-W. Kao, S.-J. Horng, Y.-L. Wang, “An O(1) time algorithm for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors,” IEEE Transactions on Systems, Man and Cybernetics, Vol. 25, No. 4, April 1995, pp. 681–687CrossRefGoogle Scholar
  6. 6.
    S.S. Lin, “Constant-time Hough transform on the processor arrays with reconfigurable bus systems,” Computing, vol. 52, pp. 1–15, 1994.MathSciNetCrossRefGoogle Scholar
  7. 7.
    M. Merry and J. W. Baker, “Constant time algorithm for computing Hough transform on a reconfigurable mesh,” Image and Vision Computing, Vol. 14, pp. 35–37, 1996.CrossRefGoogle Scholar
  8. 8.
    S. Olariu, J. L. Schwing, and J. Zhang, “Computing the Hough transform on reconfigurable meshes,” Image and Vision Computing, vol. 11, no.10, pp.623–628, Dec. 1993.CrossRefGoogle Scholar
  9. 9.
    Y. Pan, “A More Efficient Constant Time Algorithm for Computing the Hough Transform,” Parallel Processing Letters, vol. 4, no. 1/2, pp. 45–52, 1994.MathSciNetCrossRefGoogle Scholar
  10. 10.
    Y. Pan, K. Li, and M. Hamdi, “An improved constant time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh,” IEEE Transactions on Systems, Man, and Cybernetics: (Part A), Vol. 29, No. 04, July 1999, pp. 417–421. (A preliminary version also appeared in Proceedings of the 8th International Conference on Parallel and Distributed Computing and Systems, 1996, pp. 82–86.)CrossRefGoogle Scholar
  11. 11.
    H. Park, H. J. Kim, and V. K. Prasanna, “An O(l) time optimal algorithm for multiplying matrices on reconfigurable mesh,” Information Processing Letters Vol. 47, August 1993, pp. 109–113.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Yi Pan
    • 1
  1. 1.Department of Computer ScienceUniversity of DaytonDaytonUSA

Personalised recommendations