An improved Hough transform voting scheme utilizing surround suppression

被引:55
作者
Guo, Siyu [1 ]
Pridmore, Tony [2 ]
Kong, Yaguang [3 ]
Zhang, Mang [4 ]
机构
[1] Hunan Univ, Coll Elect & Informat Engn, Changsha 410082, Hunan, Peoples R China
[2] Univ Nottingham, Sch Comp Sci, Nottingham NG8 1BB, England
[3] Hangzhou Dianzi Univ, Sch Automat, Hangzhou 310018, Peoples R China
[4] Zhejiang Univ, Womens Hosp, Sch Med, Hangzhou 310006, Peoples R China
关键词
Line detection; Hough transform; Surround suppression; LINES; EFFICIENT; ALGORITHM; ACCURATE; CONTOUR; IMAGES;
D O I
10.1016/j.patrec.2009.05.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Hough transform has been a frequently used method for detecting lines in images. However, when applying Hough transform and derived algorithms using the standard Hough voting scheme on real-world images, the methods often suffer considerable degeneration in performance, especially in detection rate, because of the large amount of edges given by complex background or texture. It is very likely that these edges form false peaks in Hough space and thus produce false positives in the final results, or even suppress true peaks and cause missing lines. To reduce the impact of these texture region edges, a novel method utilizing surround suppression is proposed in this paper. By introducing a measure of isotropic surround suppression, the new algorithm treats edge pixels differently, giving small weights to edges in texture regions and large weights to edges on strong and clear boundaries, and uses these weights to accumulate votes in Hough space. In this way, false peaks formed by texture region edges are suppressed, and the quality of detection results is improved. An efficient computation method for calculating the isotropic surround suppression was also given, accelerating the proposed algorithm. Experimental results on a real-world image base show that the new method improves line detection rate significantly, compared with the standard Hough transform and the Hough transform using gradient direction information to guide the voting process. Though slower than the other two methods, the new algorithm can be preferable in applications where detection rate is of the most concern and where there is no very strict requirement for high speed performance. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:1241 / 1252
页数:12
相关论文
共 30 条
[1]  
BALLARD D, 1981, IEEE T PATTERN ANAL, V13, P111
[2]   Mean shift based clustering of Hough domain for fast line segment detection [J].
Bandera, A ;
Pérez-Lorenzo, JM ;
Bandera, JP ;
Sandoval, F .
PATTERN RECOGNITION LETTERS, 2006, 27 (06) :578-586
[3]   Hough transform network: a class of networks for identifying parametric structures [J].
Basak, J ;
Das, A .
NEUROCOMPUTING, 2003, 51 :125-145
[5]   Extended Hough transform for linear feature detection [J].
Cha, J ;
Cofer, RH ;
Kozaitis, SP .
PATTERN RECOGNITION, 2006, 39 (06) :1034-1043
[6]   New memory- and computation-efficient hough transform for detecting lines [J].
Chung, KL ;
Chen, TC ;
Yan, WM .
PATTERN RECOGNITION, 2004, 37 (05) :953-963
[7]   Statistical properties of the Hough transform estimator in the presence of measurement errors [J].
Dattner, I. .
JOURNAL OF MULTIVARIATE ANALYSIS, 2009, 100 (01) :112-125
[8]   Automatic detection and analysis of discontinuity geometry of rock mass from digital images [J].
Deb, D. ;
Hariharan, S. ;
Rao, U. M. ;
Ryu, Chang-Ha .
COMPUTERS & GEOSCIENCES, 2008, 34 (02) :115-126
[9]   USE OF HOUGH TRANSFORMATION TO DETECT LINES AND CURVES IN PICTURES [J].
DUDA, RO ;
HART, PE .
COMMUNICATIONS OF THE ACM, 1972, 15 (01) :11-&
[10]   Real-time line detection through an improved Hough transform voting scheme [J].
Fernandes, Leandro A. F. ;
Oliveira, Manuel M. .
PATTERN RECOGNITION, 2008, 41 (01) :299-314