Contour ranking on coarse grained machines: a case study for low-level vision computations
✍ Scribed by Hameed, F.; Hambrusch, S. E.; Khokhar, A. A.; Patel, J. N.
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 289 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1040-3108
No coin nor oath required. For personal study only.
✦ Synopsis
In the paper we present parallel solutions for performing image contour ranking on coarsegrained machines. In contour ranking, a linear representation of the edge contours is generated from the edge contours of a raw image. We describe solutions that employ different divide-andconquer approaches and that use different communication patterns. The combining step of the divide-and-conquer solutions uses efficient sequential techniques for merging information about subimages. The proposed solutions are implemented on Intel Delta and Intel Paragon machines. We discuss performance results and present scalability analysis using different image and machine sizes.