GENERALIZED HOUGH ALGORITHM
In general many important shapes do not have an analytic form f(x,y,a1,a2,…,an).
How do we incorporate general shape matching into this modified scheme for the Hough Algorithm ?
ANSWER: Use an R-Table to represent a general shape relating edge orientation, f, at a boundary point (Bx,By) to the ‘center’ (Xc,Yc) using vector displacement, r=(Xc-Bx,Yc-By).