A new fast line detection algorithm
暂无分享,去创建一个
Linear feature detection is very important in computer vision, image segmentation and pattern recognition. The traditional line detection method is Hough transform, which must calculate the sine cosine function and its computational complexity is high. A fast discrete mathematical transform is proposed in this paper, which can detect lines with any orientation, location. The key advantages of this method are its simple implementation and its low computational complexity and the time our method takes is less than 1/3 Hough transform does at the same precision. At the same time the algorithm is not sensitive to noise
[1] E. Candès,et al. Ridgelets: a key to higher-dimensional intermittency? , 1999, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.
[2] Richard O. Duda,et al. Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.
[3] M. B. Clowes,et al. Finding Picture Edges Through Collinearity of Feature Points , 1973, IEEE Transactions on Computers.
[4] S. Deans. The Radon Transform and Some of Its Applications , 1983 .