Fast Hough Transform on Multiprocessors: A Branch and Bound Approach

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.


The algorithm of the Fast Hough Transform presents a strong irregularity which makes its parallelization difficult, especially if we introduce certain improvements into the sequential algorithm, such as the elimination of straight lines. In this work we approach this algorithm as a branch and bound problem, developing three different parallel algorithms. The first of these algorithms is based on an initial distribution of the problem that guarantees a good balance of computations. The other two algorithms perform a dynamic distribution of the load using different policies. In one of them, the mechanism is distributed and rebalancing is carried out at the demand of the processors left without load. In the other, one processor acts as a central processor and decides when to carry out the rebalance and what the correspondence between overloaded and underloaded processors will be.

Document Type: Short Communication

Affiliations: Department of Computer Architecture, University of Malaga, Campus de Tectinos, Malaga, 29080, Spain

Publication date: August 1, 1997

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more