In this paper, we propose a new method for curve detection based on the inverse Hough Transform. The key idea of this method is to make the voting process on the image space instead of that on the parameter space in the conventional method, then convert the local peak detection problem in the parameter space into a parameter optimization problem. This leads to substantial savings, not only in storage requirements but also in the amount of calculation required. The experimental results and qualitative analysis showed that in comparison with the conventional Hough Transform methods, the new method has advantages of high speed, small storage arbitrary parameter range and high parameter resolution.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An inverse voting algorithm for Hough Transform


    Contributors:


    Publication date :

    1994-01-01


    Size :

    410556 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    An Inverse Voting Algorithm for Hough Transform

    Chang, D. / Hashimoto, S. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    On the gray-scale inverse Hough transform

    Kesidis, A. L. / Papamarkos, N. | British Library Online Contents | 2000


    Accuracy of the straight line Hough Transform: The non-voting approach

    Shapiro, V. | British Library Online Contents | 2006


    Which Hough Transform?

    Leavers, V. F. | British Library Online Contents | 1993


    Connective Hough transform

    Yuen, S. Y. K. / Lam, T. S. L. / Leung, N. K. D. | British Library Online Contents | 1993