Complete Image Partitioning on Spiral Architecture

Publisher:
Springer-Verlag
Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science - Parallel and Distributed Processing and Applications International Symposium, ISPA 2003, 2003, 2745 pp. 304 - 315
Issue Date:
2003-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2003001617.pdf674.17 kB
Adobe PDF
Uniform image partitioning has been achieved on Spiral Architecture, which plays an important role in parallel image processing on many aspects such as uniform data partitioning, load balancing, zero data exchange between the processing nodes et al. However, when the number of partitions is not the power of seven like 49, each subimage except one is split into a few fragments which are mixed together. We could not tell which fragments belong to which sub-image. It is an unacceptable flaw to parallel image processing. This paper proposes a method to resolve the problem mentioned above. From the experimental results, it is shown that the proposed method correctly identifies the fragments belonging to the same sub-image and successfully collects them together to be a complete sub-image. Then, these sub-images can be distributed into the different processing nodes for further processing.
Please use this identifier to cite or link to this item: