Paper
21 March 1989 Parallel Implementation Of The Split And Merge Algorithm On Hypercube Processors For Object Detection And Recognition
Mehmet Celenk, Prabhashankar Lakshman
Author Affiliations +
Abstract
Split and merge is a computationaly efficient region segmentation technique suitable to detect objects or surfaces in a given image. Despite its superior performance, it suffers from large memory usage and excessive computation time. This paper describes parallel implementation of the split and merge algorithm in a 16 node hypercube processor in order to reduce processing time to an acceptable level in the real time applications. Three methods are proposed to parallelize the operation of the method using the nearest neghbor (mesh) topology that can be mapped onto the hypercube architecture. Comparison of the described techniques is given and processing results of the real world images are presented.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mehmet Celenk and Prabhashankar Lakshman "Parallel Implementation Of The Split And Merge Algorithm On Hypercube Processors For Object Detection And Recognition", Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); https://doi.org/10.1117/12.969276
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image processing

Parallel computing

Image processing algorithms and systems

Artificial intelligence

Evolutionary algorithms

Image storage

Back to Top