Compressing the parameter space of the generalised Hough transform
暂无分享,去创建一个
Abstract The storage requirement, and hence the computational load, of the generalised Hough transform increases considerably when the orientation of the sought-after shape in unknown. A method is described which, by compressing the parameter space by one degree of freedom, allows the location of arbitrary non-analytic shapes at random orientations using only one plane of parameter space.
[1] E. R. Davies,et al. A modified Hough scheme for general circle location , 1988, Pattern Recognit. Lett..
[2] Edward Roy Davies. Minimising the search space for polygon detection using the generalised Hough transform , 1989, Pattern Recognit. Lett..
[3] Dana H. Ballard,et al. Generalizing the Hough transform to detect arbitrary shapes , 1981, Pattern Recognit..
[4] Edward Roy Davies. Finding ellipses using the generalised Hough transform , 1989, Pattern Recognit. Lett..