Theoretical & Experimental Considerations on the Detectability of Lines for Randomized Voting Hough Transform

5 Citations 7 References

Bibliographic Information

Other Title
  • ランダム投票による高速化 Hough 変換アルゴリズムRVHTにおける直線検出性能の理論的実験的考察

Search this article

Description

In order to reduce the computation cost of Hough transform (HT) and also to enforce the detectabilities of edge lines, PHT (Probabilistic HT) and RHT (Randomized HT) algorithms had been proposed. In this paper, we propose a new algorithm RVHT (Randomized Voting HT). RVHT is an improved PHT, in which edge points are deleted from the edge image according to the sequential line detection process of PHT. The relations between RVHT and RHT algorithms were discussed both experimentally and theoretically. It was clarified theoretically that RVHT becomes strictly equivalent to RHT when the sequence of the combinations of two edge points is selected in a specified order, and experimentally that the proposed RVHT can detect shorter edge lines than RHT by using real microscopic images. As a result, several practical knowledges were presented for the practical use of Hough transform.

Journal

  • Technical report of IEICE. PRMU

    Technical report of IEICE. PRMU 96 (384), 53-60, 1996-11-21

    The Institute of Electronics, Information and Communication Engineers

Citations (5)*help

See more

References(7)*help

See more

Keywords

Details 詳細情報について

  • CRID
    1571135652440011904
  • NII Article ID
    110003274568
  • NII Book ID
    AN10541106
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top