By Topic

Scalable parallel list ranking of image edges on fine-grained machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. N. Patel ; Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA ; A. A. Khokhar ; L. H. Jamieson

We present analytical and experimental results for fine-grained list ranking algorithms, with the objective of examining how the locality properties of image edge lists can be used to improve the performance of this highly data-dependent operation. Starting with Wyllie's (1979) algorithm and Anderson and Miller's (1990) randomized algorithm as bases, we use the spatial locality of edge links to derive scalable algorithms designed to exploit the characteristics of image edges. Tested on actual and synthetic edge data, this approach achieves significant speedup on the MasPar MP-1 and MP-2, compared to the standard list ranking algorithms. The modified algorithms exhibit good scalability and are robust across a wide variety of images

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995