𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Parallel Algorithms for Computer Vision Problems

✍ Scribed by Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
315 KB
Volume
62
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

✦ Synopsis

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 N 2 integers each of size OΓ°log N Þ-bit on the AROB using N 1ΓΎΓ°1=cÞ and N Γ‚ N 1ΓΎΓ°1=cÞ processors, respectively, where c is a constant and c51. 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.

πŸ“œ SIMILAR VOLUMES

Optimal Parallel Algorithms for Quadtree
Optimal Parallel Algorithms for Quadtree Problems
✍ S. Kasif πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science βš– 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc

Parallel Algorithms for Orthotropic Prob
Parallel Algorithms for Orthotropic Problems
✍ Ivar Gustafsson; Gunhild Lindskog πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 784 KB

Finite element meshes and node-numberings suitable for parallel solution with equally loaded processors are presented for linear orthotropic elliptic partial differential equations. These problems are of great importance, for instance in the oil and airfoil industries. The linear systems of equation

Algorithms for solving a spatial optimis
Algorithms for solving a spatial optimisation problem on a parallel computer
✍ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 337 KB πŸ‘ 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software

Call for Papers: Special Issue of Comput
Call for Papers: Special Issue of Computer Vision and Image Understanding on Empirical Evaluation of Computer Vision Algorithms
πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 19 KB

## Call for Papers Special Issue of Computer Vision and Image Understanding on Empirical Evaluation of Computer Vision Algorithms Computer vision has advanced to the point where a stronger experimental tradition is needed. As the importance of this need becomes better recognized, more researchers

Fast and Scalable Parallel Algorithms fo
Fast and Scalable Parallel Algorithms for Knapsack-like Problems
✍ Afonso Ferreira; John Michael Robson πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 403 KB

We present two new algorithms for searching in sorted X Ψ‰ Y Ψ‰ R Ψ‰ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n ‫؍‬ O(2 s/4 ), we obtain a