Kesheng Wu, Ekow Otoo, Arie Shoshani  Home/Search
Context
Related
| lbl.gov/%7Ekewu/ps/LBNL56864.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lbl.gov/fastbit/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among the neighbors to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The... (Update)
Active bibliography (related documents): More All
4.8: Optimizing Connected Component Labeling Algorithms - Wu, Otoo, Shoshani (Correct)
0.3: DEX: Increasing the Capability of Scientific Data.. - Stockinger, Shalf.. (2005) (Correct)
0.3: Cell Probe Complexity - a Survey - Miltersen (1999) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ wu-optimizing,
author = "Kesheng Wu and Ekow Otoo and Arie Shoshani",
title = "Optimizing Connected Component Labeling Algorithms",
url = "citeseer.ist.psu.edu/743593.html" }
Citations (may not include all citations):539 Computer Vision (context) - Ballard - 1982
148 Deformable models in medical image analysis: A survey - McInerney, Terzopoulos - 1996
129 A survey of medical image registration - Maintz, Viergever - 1998
127 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1983
78 Efficiency of a good but not linear set union algorithm (context) - Tarjan - 1975
17 A general approach to connected-component labeling for arbit.. (context) - Dillencourt, Samet et al. - 1992
14 Two linear time union-find strategies for image processing - Fiorio, Gustedt - 1996
12 Connected component labeling using quadtrees (context) - Samet - 1981
12 Using bitmap index for interactive exploration of large data.. - Wu, Koegler et al. - 2003
5 A linear-time component-labeling algorithm using contour tra.. (context) - Chang, Chen et al. - 2004
5 Model-guided labeling of coronary structure (context) - Ezquerra, Capell et al. - 1998
4 Computer-aided diagnosis in chest radiography: A survey (context) - van Ginneken, Haar et al. - 2001
3 Worst-case and amortised optimality in union-find - Alstrup, Ben-Amram et al. - 1999
2 Memory management for union-find algorithms - Fiorio, Gustedt - 1997
2 Linear-time connected-component labeling based on sequential.. (context) - Suzuki, Horiba et al. - 2003
2 A high-speed algorithm for propagation-type labeling based o.. (context) - Shima, Murakami et al. - 1990
2 the expected behavior of disjoint set union algorithms (context) - Bollobas, Simon - 1985
2 Linear expected time of a simple union-find algorithm (context) - Doyle, Rivest - 1976
2 Automatic segmentation of digital micrographs: a survey (context) - Nattkemper - 2004
2 Yet another survey on image segmentation: Region and boundar.. (context) - Freixenet, Munoz et al. - 2002
Documents on the same site (http://sdm.lbl.gov/fastbit/publications.html): More
An Efficient Compression Scheme for Bitmap Indices - Wu, Otoo, Shoshani (2004) (Correct)
Strategies for Processing ad hoc Queries on Large Data.. - Stockinger, Wu, Shoshani (2002) (Correct)
Optimizing Connected Component Labeling Algorithms - Wu, Otoo, Shoshani (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC