NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Efficient implementation of hough transform on multiprocessors
| dc.creator | Datta, Abhijit | |
| dc.date.accessioned | 2012-06-07T22:36:01Z | |
| dc.date.available | 2012-06-07T22:36:01Z | |
| dc.date.created | 1994 | |
| dc.date.issued | 1994 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-1994-THESIS-D234 | |
| dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references. | en |
| dc.description.abstract | The Hough Transform (HT) is known to be a powerful technique in shape recognition and motion analysis. On shared-memory multi-processors, Image Partitioning and Parameter Partitioning are data partitioning techniques which give rise to two different classes of MIMD algorithms for HT. These techniques differ in terms of data locality and task granularity. In this paper, we compare these algorithms by the trade-offs involved in their mapping on bus-based shared memory machines. Based on our analysis, we suggest an efficient implementation of Parameter Partitioning which improves on known results. The improved performance is reflected in the execution times obtained on a Sequent Balance machine. Our analysis is also verified by running the algorithms on Proteus, a multi-processor simulator. The techniques of Image Partitioning and Parameter Partitioning are then extended to hypercube multiprocessors. It is shown that Parameter Partitioning performs better on hypercubes also. The measurements on hypercube are obtained by running the algorithms on a 64-node nCube machine. | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.subject | computer science. | en |
| dc.subject | Major computer science. | en |
| dc.title | Efficient implementation of hough transform on multiprocessors | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | computer science | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.