Bias error analysis of the generalised Hough transform

被引:17
作者
Aguado, AS
Montiel, E
Nixon, MS
机构
[1] INRIA Rhone Alpes, Grenoble, France
[2] IMAGIS GRAVIR IMAG, F-38041 Grenoble 9, France
[3] Univ Southampton, Southampton SO9 5NH, Hants, England
关键词
algorithm analysis; error analysis; object detection; shape extraction; Hough transform; generalised Hough transform;
D O I
10.1023/A:1008388322921
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The generalised Hough transform (GHT) extends the Hough transform (HT) to the extraction of arbitrary shapes. In practice, the performance of both techniques differs considerably. The literature suggests that, whilst the HT can provide accurate results with significant levels of noise and occlusion, the performance of the GHT is in fact much more sensitive to noise. In this paper we extend previous error analyses by considering the possible causes of bias errors of the GHT. Our analysis considers both formulation and implementation issues. First, we compare the formulation of the GHT against the general formulation of the standard HT. This shows that, in fact, the GHT definition increases the robustness of the standard HT formulation. Then, in order to explain this paradoxical situation we consider four possible sources of errors that are introduced due to the implementation of the GHT: (i) errors in the computation of gradient direction; (ii) errors due to false evidence attributed to the range of values defined by the point spread function; (iii) errors due to the contribution of false evidence by background points; and (iv) errors due to the non-analytic (i.e., tabular) representation used to store the properties of the model. After considering the effects of each source of error we conclude that: (i) in theory, the GHT is actually more robust than the standard HT; (ii) that clutter and occlusion have a reduced effect in the GHT with respect to the HT; and (iii) that a significant source of error can be due to the use of a non-analytic representation. A non-analytic representation defines a discrete point spread function that is mapped into a discrete accumulator array. The discrete point spread function is scaled and rotated in the gathering process, increasing the amount of inaccurate evidence. Experimental results demonstrate that the analysis of errors is congruent with practical implementation issues. Our results demonstrate that the GHT is more robust than the HT when the non-analytic representation is replaced by an analytic representation and when evidence is gathered using a suitable range of values in gradient direction. As such, we show that errors in the GHT are due to implementation issues and that the technique actually provides a more powerful model-based shape extraction approach than has previously been acknowledged.
引用
收藏
页码:25 / 42
页数:18
相关论文
共 27 条
[1]  
Aguado A. S., 1996, Proceedings of the 13th International Conference on Pattern Recognition, P547, DOI 10.1109/ICPR.1996.546884
[2]  
Aguado AS, 1996, INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, PROCEEDINGS - VOL III, P627, DOI 10.1109/ICIP.1996.560573
[3]  
[Anonymous], P 2 INT C COMP VIS
[4]   GENERALIZING THE HOUGH TRANSFORM TO DETECT ARBITRARY SHAPES [J].
BALLARD, DH .
PATTERN RECOGNITION, 1981, 13 (02) :111-122
[6]   DETECTION OF STRUCTURES IN NOISY PICTURES [J].
COHEN, M ;
TOUSSAINT, GT .
PATTERN RECOGNITION, 1977, 9 (02) :95-98
[7]  
CYGANSKI D, 1990, SPIE, V1260, P148
[9]   CHORD-TANGENT TRANSFORMATION FOR OBJECT RECOGNITION [J].
DUFRESNE, TE ;
DHAWAN, AP .
PATTERN RECOGNITION, 1995, 28 (09) :1321-1332
[10]   ON THE SENSITIVITY OF THE HOUGH TRANSFORM FOR OBJECT RECOGNITION [J].
GRIMSON, WEL ;
HUTTENLOCHER, DP .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1990, 12 (03) :255-274