Hierarchical Hough: advantages and automatic construction of the models

The authors describe the advantages of the hierarchical implementation of the Hough transform with respect to the labelled one. They demonstrate that the hierarchical Hough is faster than the labelled Hough if simple conditions are satisfied. They then discuss the automatic construction of the hierarchical models for the objects belonging to a completely known set. These models can be seen as oriented graphs whose nodes represent local features or patterns which are subparts of the object silhouette. Some experimental results are presented.<<ETX>>