A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The decomposition of binary images using rectangular blocks of foreground pixels as primitives is considered. Based on this type of decomposition, a fast method for evaluating the Hough transform is introduced. A complexity analysis of the proposed block Hough transform algorithm sets constraints on the complexity of algorithms used for block decomposition, so that the total decomposition and Hough transform application time is much less than the time consumed by the usual point Houghdoi:10.1016/s0031-3203(98)00125-3 fatcat:sdmshalmnngijmlzghpexcgqga