|
|
|
|
|
|
by ansgri
3482 days ago
|
|
|
It is called Generalised Hough Transform [0] (google and wiki also know it), the problem is, even circle space is 3-dimensional (x, y, r), and therefore cannot be computed faster than O(n³). Even that cannot be achieved without some magic since the circle perimeter is O(n), making a naïve solution O(n⁴). So we can hope for something like O(n³log²n). Our lab has done some research on fast GHT using general-purpose computation scheme optimisation, but I cannot find any publications in English from that distant period. For 3D Hough transform, there's an efficient solution for finding the argmax (3d line), also by my colleagues [1] [0] pdf https://web.eecs.umich.edu/~silvio/teaching/EECS598/papers/B... [1] pdf http://www.scs-europe.net/dlib/2016/ecms2016acceptedpapers/0... |
|
|