FAST HOUGH TRANSFORM BASED ON BINTREE DATA STRUCTURE.

Abstract

The fast Hough transform algorithm based on bintree (FHTB) is a generalization of the fast Hough transform (FHT), which is based on the K-tree data structure and provides several orders of magnitude reduction of storage and execution time. Because of its bintree data structure, the FHTB algorithm further reduces the computation and is more flexible in allowing a solution with different precision in each dimension of the parameter space. The incremental intersection property achieved by FHT is preserved in FHTB.