A hyper-pyramid network topology for image processing

Abstract

The authors describe a novel network topology for image processing, called the hyper-pyramid network topology. This structure is hierarchical and implements local, inside-region communications at each level, and upward/downward communications in the whole structure. Intraregion communications are shown by an image processing algorithm study. The authors display the implementation of a component labeling algorithm onto a hyper-pyramid network with a computational complexity of O(log/sup 2/(n)). This complexity is the same as that of the hypercube network. It is also demonstrated that the wiring complexity is less than that of the hypercube network.<>