Optimal Parallel Algorithms for Computer Vision Problems

The full text article is not available for purchase.

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

Abstract:

The computational model on which the algorithms are developed is the arrays with reconfigurable optical buses (abbreviated to AROB). It integrates the advantages of both optical transmission and electronic computation. In this paper, instead of using the radix-2 system, a radix-x system can be used to represent the numbers of the intermediate results of algorithms. We first design two O(1) time basic operations for computing the prefix sums of N and N2 integers each of size O(log N)-bit on the AROB using N1+(1/c) and N×N1+(1/c) processors, respectively, where c is a constant and c1. Currently, these are the best-known results. Then, based on these two basic operations, several O(1) time parallel algorithms for computer vision problems are developed. These problems include shape moment computation, histogramming, histogram modification, Hough transform and median row. Based on the product of time and the number of processors used, all proposed algorithms are time and/or cost optimal. © 2002 Elsevier Science (USA).

Keywords: Hough transform; computer vision; histogram; histogram modification; median row.; prefix sums; reconfigurable optical buses

Document Type: Research Article

Affiliations: 1: Department of Information Management, Chinese Naval Academy, Kaohsiung, Taiwan, Republic of China 2: Department of Electrical Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, Republic of China 3: Department of Information Management, Ling Tung College, Taichung, Taiwan, Republic of China

Publication date: June 1, 2002

Related content

Tools

Favourites

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
X
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