FIHT2 Algorithm: A Fast Incremental Hough Transform

Hiroyasu KOSHIMIZU  Munetoshi NUMADA  

IEICE TRANSACTIONS on Information and Systems   Vol.E74-D   No.10   pp.3389-3393
Publication Date: 1991/10/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Computer Vision and Its Applications)

Full Text: PDF(535.4KB)>>
Buy this Article

FITH2 algorithm defined by the equations ρ=x・cosθy・sinθ(π/(2K)). x・sinθ at 0θπ/2 and ρ=x・cosθy・sinθ(π/(2K))・y・cosθ at π/2θπ is a Hough transform which requires nothing of the trigonometric and functional operations to generate the Hough distributions. It is demonstrated in ths paper that the FIHT2 is a complete alternative of the usual Hough transform (HT) defined by ρ=x・cosθy・sinθin the sense that the both tranforms could work perfectly as a line detector. It is easy to show that the Hough curves of the FIHT2 can be generated in an incremental way where only addition operations are needed. It is also investigated that the difference between HT and FIHT2 could be estimated to be neglected.