In this paper we consider a method for detecting end-to-end curves of limited curvature like the k-link polylineswith bending angle between adjacent segments in a given range. The approximation accuracy is achieved bymaximization of the quality function in the image matrix. The method is based on a dynamic programming schemeconstructed over Fast Hough Transform calculation results for image bands. The proposed method asymptoticcomplexity is O(h?(w+h/k)?log(h/k)), where h and w are the image size, and k is the approximating polyline linksnumber, which is an analogue of the complexity of the fast Fourier transform or the fast Hough transform. We alsoshow the results of the proposed method on synthetic and real data.
展开▼
