Efficient implementation of hough transform on multiprocessors /
also. The measurements on hypercube are obtained by running
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1994.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | also. The measurements on hypercube are obtained by running are then extended to hypercube multiprocessors. It is shown Balance machine. Our analysis is also verified by running efficient implementation of Parameter Partitioning which granularity. In this paper, we compare these algorithms by improves on known results. The improved performance is in shape recognition and motion analysis. On shared-memory memory machines. Based on our analysis, we suggest an multi-processors, Image Partitioning and Parameter Partitioning are data partitioning techniques which give rise reflected in the execution times obtained on a Sequent techniques differ in terms of data locality and task techniques of Image Partitioning and Parameter Partitioning that Parameter Partitioning performs better on hypercubes the algorithms on a 64-node nCube machine. the algorithms on Proteus, a multi-processor simulator. The The Hough Transform (HT) is known to be a powerful technique the trade-offs involved in their mapping on bus-based shared to two different classes of MIMD algorithms for HT. These |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | xi, 53 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references. |