3 ms·
Yet still no mention of the Fast Hough Transform. Not the randomized approximate one, but fast as in FFT, n²log n fast. We've been using it a lot in, e.g. the a
by ansgri 10y ago
Yet still no mention of the Fast Hough Transform. Not the randomized approximate one, but fast as in FFT, n²log n fast. We've been using it a lot in, e.g. the automatic vehicle classifier [0, 1]. It has been recently contributed to OpenCV [2] by my colleagues.
The title of the paper (by my company's CTO) "Hough Transform: Underestimated Tool In The Computer Vision Field" [3] still holds true. It describes the FHT algorithm rather well.
[0] http://visillect.com/en/avc http://visillect.com/en/avc
[1] pdf http://www.scs-europe.net/dlib/2015/ecms2015acceptedpapers/0521-is_ECMS2015_0089.pdf http://www.scs-europe.net/dlib/2015/ecms2015acceptedpapers/0...
[2] http://docs.opencv.org/3.1.0/d9/d29/namespacecv_1_1ximgproc.html#a401697bbdcf6c4a4c7d385beda75e849 http://docs.opencv.org/3.1.0/d9/d29/namespacecv_1_1ximgproc....
[3] https://www.researchgate.net/publication/228573007_Hough_Transform_Underestimated_Tool_In_The_Computer_Vision_Field https://www.researchgate.net/publication/228573007_Hough_Tra...