On the Inverse Hough Transform

  • Authors:
  • Anastasios L. Kesidis;Nikos Papamarkos

  • Affiliations:
  • Democritus Univ. of Thrace, Xanthi, Greece;Democritus Univ. of Thrace, Xanthi, Greece

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.14

Visualization

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.