Share Email Print

Proceedings Paper

Minimum Spanning Tree Algorithm On An Image Understanding Architecture
Author(s): David B. Shu; J.Greg Nash
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A parallel algorithm for computing the minimum spanning tree of a weighted, undirected graph on an n x n mesh-connected array with a special "gated connection network" is presented. For a graph of n vertices, the algorithm requires O(log2n) time. At each step in the parallel algorithm, each node selects one of its links with the least cost as a spanning tree link. Linked nodes form connected components, so that each node eventually belongs to a group with its own identity. The connected components and their associated indices are then treated as super nodes at the next minimum link determination step. The gated connection network function is to allow all the nodes within a connected component to be electrically connected, regardless of where they are located in the adjacency matrix. The index or label used for that component is the local minimum of the node index. All the connected component operations, and those for finding minimum links between them, can be performed in parallel.

Paper Details

Date Published: 18 July 1988
PDF: 17 pages
Proc. SPIE 0939, Hybrid Image and Signal Processing, (18 July 1988); doi: 10.1117/12.947064
Show Author Affiliations
David B. Shu, Hughes Research Laboratories (United States)
J.Greg Nash, Hughes Research Laboratories (United States)

Published in SPIE Proceedings Vol. 0939:
Hybrid Image and Signal Processing
David P. Casasent; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top