Loading…

Parallelization of symmetry detection algorithms on a network of workstations

Detection of spatial symmetry is useful in several computer vision applications. Due to the real-time nature of the applications, it is important that symmetry detection algorithms be computationally efficient. Sequential algorithms for finding various types of planar symmetries in images are CPU-in...

Full description

Saved in:
Bibliographic Details
Published in:Microprocessors and microsystems 1997-02, Vol.20 (6), p.341-349
Main Authors: Parthiban, R., Ravikumar, C.P., Kakarala, R., Sivaswamy, J.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Detection of spatial symmetry is useful in several computer vision applications. Due to the real-time nature of the applications, it is important that symmetry detection algorithms be computationally efficient. Sequential algorithms for finding various types of planar symmetries in images are CPU-intensive, prompting us to look for fast parallel implementations. In this paper, we propose parallel algorithms for symmetry detection, and report an implementation on a distributed computing environment consisting of a network of Sun workstations. Experiments revealed close-to-linear speedup on a number of test images which we considered.
ISSN:0141-9331
1872-9436
DOI:10.1016/S0141-9331(96)01103-9