Pyramid mappings onto hypercubes for computer vision: Connection machine comparative study

Document Type

Article

Publication Date

1-1-1993

Abstract

The paper presents a comparative analysis for algorithms that map pyramids onto hypercubes. The analysis is based on some important performance measures from graph theory and actual results from a Connection Machine system CM‐2 containing 16K processors. Connection Machine results are presented for pyramid algorithms that compute the perimeter of objects, apply 2‐dimensional convolution, and segment images. Copyright © 1993 John Wiley & Sons, Ltd

Identifier

0027659609 (Scopus)

Publication Title

Concurrency Practice and Experience

External Full Text Location

https://doi.org/10.1002/cpe.4330050603

e-ISSN

10969128

ISSN

10403108

First Page

471

Last Page

489

Issue

6

Volume

5

This document is currently not available here.

Share

COinS