This Article 
 Bibliographic References 
 Add to: 
On the Inverse Hough Transform
December 1999 (vol. 21 no. 12)
pp. 1329-1343

Abstract—In this paper, an Inverse Hough Transform algorithm is proposed. This algorithm reconstructs correctly the original image, using only the data of the Hough Transform space and it is applicable to any binary image. As a first application, the Inverse Hough Transform algorithm is used for straight-line detection and filtering. The lines are detected not just as continuous straight lines, which is the case of the standard Hough Transform, but as they really appear in the original image, i.e., pixel by pixel. To avoid the quantization effects in the Hough Transform space, inversion conditions are defined, which are associated only with the dimensions of the images. Experimental results indicate that the Inverse Hough Transform algorithm is robust and accurate.

[1] P.V.C. Hough, “Methods and Means for Recognizing Complex Patterns,” U.S. Patent 069654, 1962.
[2] R.O. Duda and P.E. Hart, "Use of the Hough transforms to detect lines and curves in pictures," Comm. ACM, vol. 15, no. 1, pp. 11-15, 1972
[3] D.H. Ballard, “Generalizing the Hough Transform to Detect Arbitrary Shapes,” Pattern Recognition, vol. 13, pp. 111-122, 1981.
[4] T. Van Veen and F. Groen, “Discretisation Errors in Hough Transform,” Pattern Recognition, vol.14, pp. 137-145, 1981.
[5] W. Niblack and D. Petrovic, “On Improving the Accuracy of the Hough Transform: Theory, Simulations and Experiments,” Proc IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 574-579, 1988.
[6] J. Illingworth, E.J. Kittler, “The Adaptive Hough Transform,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 5, pp. 690-697, May 1987.
[7] P. Palmer, J. Kittler, and M. Petrou, “Using Focus of Attention with the Hough Transform for Accurate Line Parameter Estimation,” Pattern Recognition, vol. 27, pp. 1,127-1,134, 1994.
[8] N. Kiryati, Y. Eldar, and A.M. Bruckstein, “A Probabilistic Hough Transform,” Pattern Recognition, vol. 24, no. 4, pp. 303-316, 1991.
[9] L. Xu, E. Oja, and P. Kultanen, “A New Curve Detection Method: Randomized Hough Transform (RHT),” Pattern Recognition Letters, vol. 11, pp. 331-338, May 1990.
[10] B. Gatos, S.J. Perantonis, and N. Papamarkos, “Accelerated Hough Transform Using Rectangular Image Decomposition,” Electronics Letters, vol. 32, no. 8, pp. 730-732, 1996.
[11] S.J. Perantonis, B. Gatos, and N. Papamarkos, “Block Decomposition and Segmentation for Fast Hough Transform Evaluation,” Pattern Recognition, vol. 32, no. 5, pp. 811-824, 1999.
[12] D. Ben-Tzvi, V.F. Leavers, and M.B. Sandler, “A Dynamic Combinatorial Hough Transform,” Proc. Fifth Int'l Conf. Image Analysis, pp. 152-159, 1990.
[13] Y. Zhang and R. Webber, “A Windowing Approach to Detecting Line Segments Using Hough Transform,” Pattern Recognition, vol. 29, pp. 255-265, 1996.
[14] D. Leung, L. Lam, and W. Lam, “Diagonal Quantization of the Hough Transform,” Pattern Recognition Letters, vol. 14, pp. 181-189, 1993.
[15] W. Lam, L. Lam, K. Yuen, and D. Leung, “An Analysis on Quantizing the Hough Space,” Pattern Recognition Letters, vol. 15, pp. 1,127-1,135, 1994.
[16] E.R. Davies, Machine Vision, second ed. Academic Press, 1997.
[17] A. Neri, “Optimal Detection and Estimation of Straight Patterns,” IEEE Trans. Image Processing, vol. 5, no. 5, pp. 787-792, 1996.
[18] F.T.S. Yu, Optical Information Processing. New York: Wiley, 1983.
[19] G. Beylkin, “Discrete Radon Transform,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 35, no. 2, pp. 162-172, 1987.
[20] V.A. Shapiro, “On the Hough Transform of Multi-Level Pictures,” Pattern Recognition, vol. 29, no. 4, pp. 589-602, 1996.
[21] B. Gustafsson, “Mathematics for Computer Tomography,” Physica Scripta, vol. T61, pp. 38-43, 1996.
[22] K. Hansen and P. Toft, “Fast Curve Estimation Using Preconditioned Generalized Radon Transform,” IEEE Trans. Image Processing, vol. 5, no. 12, pp. 1,651-1,661, 1996.
[23] P. Toft, “The Radon Transform: Theory and Implementation,” PhD thesis, Dept. of Math. Modelling Section for Digital Signal Processing, Technical Univ. of Denmark, 1996.
[24] D. Dageon and R. Mersereau, Multidimensional Digital Signal Processing. Englewood Cliffs, N.J.: Prentice Hall, 1984.
[25] A.K. Jain, Fundamentals of Digital Image Processing. Prentice Hall, 1989.
[26] I.D. Svalbe, “Natural Representations for Straight Lines and the Hough Transform on Discrete Arrays,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 9, Sept. 1989.
[27] N. Kiryati and A.M. Bruckstein, “Antialiasing the Hough Transform,” CVGIP Graphical Models and Image Processing, vol. 53, no. 3, pp. 213-222, May 1991.
[28] M. Soffer and N. Kiryati, "Guaranteed Convergence of the Hough Transform," Computer Vision and Image Understanding, vol. 69, no. 2, pp. 119-134, 1998.
[29] T. Risse, “Hough Transform for Line Recognition: Complexity of Evidence Accumulation and Cluster Detection,” Computer Vision Graphics and Image Processing, vol. 46, pp. 327-345, 1989.
[30] L. Guo and O. Chutatape, “Influence of Discretization in Image Space on Hough Transform,” Pattern Recognition, vol. 32, pp. 635-644, 1999.
[31] S. Yuen, “An Approach to Quantization of Hough Space,” Proc. Seventh Scandinavian Conf. Image Analysis, pp. 733-740, 1991.
[32] J. Canny, “A Computational Approach to Edge Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679-698, June 1986.

Index Terms:
Hough Transform, edge extraction, line detection, nonlinear filtering.
Anastasios L. Kesidis, Nikos Papamarkos, "On the Inverse Hough Transform," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 21, no. 12, pp. 1329-1343, Dec. 1999, doi:10.1109/34.817411
Usage of this product signifies your acceptance of the Terms of Use.