๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine

โœ Scribed by N. Copty; S. Ranka; G. Fox; R.V. Shankar

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
696 KB
Volume
21
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

โœฆ Synopsis

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare various parallel architectures and programming models. The implementations were done on the Connection Machine, models CM-2 and CM-5, in the data parallel and message passing programming models. Randomization was introduced in breaking ties during merging to increase the degree of parallelism, and only one- and two-dimensional arrays of data were used in the implementations. O 1994 Academic Press, Inc.

๐Ÿ“œ SIMILAR VOLUMES

A parallel algorithm for solving the 3D
A parallel algorithm for solving the 3D inverse scattering problem
โœ Ganquan Xie; Qisu Zou ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

A parallel algorithm for solving the 3D inverse scattering problem is presented. The inverse problem considered is to determine a potential function from received wave data measured on a surface. The above inverse problem is transformed to a 3D nonlinear integral geometry equation. The principal ter

A hybrid algorithm for the one machine s
A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
โœ V. Srinivasan ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

A Simple Parallel Algorithm for the Sing
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
โœ Jesper L. Trรคff; Christos D. Zaroliagis ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 216 KB

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2= +n 1&= ) log n) time, performing O(n 1+= log n) work for any 0<=<1ร‚2. The strength of

An Inexact Newton Algorithm for Solving
An Inexact Newton Algorithm for Solving the Tokamak Edge Plasma Fluid Equations on a Multiply-Connected Domain
โœ D.A. Knoll; P.R. McHugh ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 554 KB

Newton's method is combined with a preconditioned conjugate gradient-like algorithm and finite volume discretization to solve the steady-state two-dimensional tokamak edge plasma fluid equations. A numerical evaluation of the Jacobian is employed. Mesh sequencing, pseudo-transient continuation, and