Minimum Spanning Tree Algorithm On An Image Understanding Architecture

David B. Shu; J.Greg Nash

doi:10.1117/12.947064

18 July 1988 Minimum Spanning Tree Algorithm On An Image Understanding Architecture

David B. Shu, J.Greg Nash

Proceedings Volume 0939, Hybrid Image and Signal Processing; (1988) https://doi.org/10.1117/12.947064
Event: 1988 Technical Symposium on Optics, Electro-Optics, and Sensors, 1988, Orlando, FL, United States

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.

Citation Download Citation

David B. Shu and J.Greg Nash "Minimum Spanning Tree Algorithm On An Image Understanding Architecture", Proc. SPIE 0939, Hybrid Image and Signal Processing, (18 July 1988); https://doi.org/10.1117/12.947064

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available