DocumentCode
2579039
Title
Massive parallelism for sparse images
Author
Ranka, Sanjay ; Shankar, Ravi V.
Author_Institution
Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
fYear
1991
fDate
13-16 Oct 1991
Firstpage
683
Abstract
The authors present parallel algorithms using sparse representation for arrays. It is shown that adopting such a representation not only reduces the processor/space requirement, but also provides efficient load balancing. New parallel primitives needed to work with such a representation are defined. Sample algorithms from the areas of image processing and computer vision are presented. Alternate schemes for dealing with arrays containing large contiguous blocks of elements with identical array values are considered
Keywords
computerised picture processing; parallel algorithms; parallel processing; computer vision; computerised picture processing; image processing; load balancing; massive parallelism; parallel algorithms; parallel primitives; sparse images; Clustering algorithms; Communication system control; Computer vision; Hypercubes; Image processing; Information science; Object recognition; Parallel processing; Surface fitting; Voting;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems, Man, and Cybernetics, 1991. 'Decision Aiding for Complex Systems, Conference Proceedings., 1991 IEEE International Conference on
Conference_Location
Charlottesville, VA
Print_ISBN
0-7803-0233-8
Type
conf
DOI
10.1109/ICSMC.1991.169765
Filename
169765
Link To Document