Evaluation of connected-component labeling algorithms for distributed-memory systems

Iverson, J.; Kamath, C.; Karypis, G.

doi:10.1016/j.parco.2015.02.005

Title: Evaluation of connected-component labeling algorithms for distributed-memory systems

Authors:: Iverson, J.; Kamath, C.; Karypis, G.

Publication Date:: Fri May 01 00:00:00 EDT 2015

Sponsoring Org.:: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)

OSTI Identifier:: 1253427

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Parallel Computing

Additional Journal Information:: Journal Name: Parallel Computing Journal Volume: 44 Journal Issue: C; Journal ID: ISSN 0167-8191

Publisher:: Elsevier

Country of Publication:: Netherlands

Language:: English

Citation Formats


                    Iverson, J., Kamath, C., and Karypis, G. Evaluation of connected-component labeling algorithms for distributed-memory systems.  Netherlands: N. p., 2015. 
Web.  doi:10.1016/j.parco.2015.02.005.

Copy to clipboard


                    Iverson, J., Kamath, C., & Karypis, G. Evaluation of connected-component labeling algorithms for distributed-memory systems.  Netherlands.  https://doi.org/10.1016/j.parco.2015.02.005

Copy to clipboard


                    Iverson, J., Kamath, C., and Karypis, G. Fri .  
"Evaluation of connected-component labeling algorithms for distributed-memory systems".  Netherlands.  https://doi.org/10.1016/j.parco.2015.02.005.

Copy to clipboard


                    
@article{osti_1253427,

  title        = {Evaluation of connected-component labeling algorithms for distributed-memory systems},

  author       = {Iverson, J. and Kamath, C. and Karypis, G.},

  abstractNote = {},

  doi          = {10.1016/j.parco.2015.02.005},

  journal      = {Parallel Computing},

  number       = C,

  volume       = 44,

  place        = {Netherlands},

  year         = {Fri May 01 00:00:00 EDT 2015},

  month        = {Fri May 01 00:00:00 EDT 2015}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.parco.2015.02.005

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 17 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Works referenced in this record:

Cloud-based Connected Component Algorithm
conference, October 2010

Wu, Bin; Du, YaHong
2010 International Conference on Artificial Intelligence and Computational Intelligence (AICI)
DOI: 10.1109/AICI.2010.360

Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction
journal, November 2007

Sadlo, Filip; Peikert, Ronald
IEEE Transactions on Visualization and Computer Graphics, Vol. 13, Issue 6
DOI: 10.1109/TVCG.2007.70554

Computing connected components on parallel computers
journal, August 1979

Hirschberg, D. S.; Chandra, A. K.; Sarwate, D. V.
Communications of the ACM, Vol. 22, Issue 8
DOI: 10.1145/359138.359141

An O(logn) parallel connectivity algorithm
journal, March 1982

Shiloach, Yossi; Vishkin, Uzi
Journal of Algorithms, Vol. 3, Issue 1
DOI: 10.1016/0196-6774(82)90008-6

Near linear time algorithm to detect community structures in large-scale networks
journal, September 2007

Raghavan, Usha Nandini; Albert, Réka; Kumara, Soundar
Physical Review E, Vol. 76, Issue 3
DOI: 10.1103/PhysRevE.76.036106

A comparison of parallel algorithms for connected components
conference, January 1994

Greiner, John
Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94
DOI: 10.1145/181014.181021

Efficiency of a Good But Not Linear Set Union Algorithm
journal, April 1975

Tarjan, Robert Endre
Journal of the ACM, Vol. 22, Issue 2
DOI: 10.1145/321879.321884

A Parallel Algorithm for Connected Components on Distributed Memory Machines
book, January 2001

Buš, Libor; Tvrdík, Pavel
Recent Advances in Parallel Virtual Machine and Message Passing Interface
DOI: 10.1007/3-540-45417-9_39

In-situ Feature-Based Objects Tracking for Large-Scale Scientific Simulations
conference, November 2012

Zhang, Fan; Lasluisa, Solomon; Jin, Tong
2012 SC Companion: High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion: High Performance Computing, Networking Storage and Analysis
DOI: 10.1109/SC.Companion.2012.100

Practical parallel Union-Find algorithms for transitive closure and clustering
journal, October 1988

Cybenko, G.; Allen, T. G.; Polito, J. E.
International Journal of Parallel Programming, Vol. 17, Issue 5
DOI: 10.1007/BF01383882

Similar Records in DOE PAGES and OSTI.GOV collections:

Practical algorithms for image-component labeling on SIMD mesh connected computers

Technical Report Cypher, R E ; Snyder, L ; Sanz, J L

Two new parallel algorithms are presented for the problem of labeling the connected components of a binary image, which is also known as the connected ones problem. The machine model is an SIMD two-dimensional mesh-connected computer consisting of an N x N array of processing elements, each containing a single pixel of an N x N image. Both new algorithms use a shrinking operation defined by Levialdi and have time complexities of O(N log N) bit operations, which makes them the fastest local algorithms for the problem. Compared with other approaches having similar or better time complexities, this local approachmore »« less
Algorithms for image component labelling on SIMD mesh-connected computers

Journal Article Cypher, R E ; Snyder, L ; Sanz, J L.C. - IEEE Transactions on Computers (Institute of Electrical and Electronics Engineers); (USA)

Two new parallel algorithms are presented for the problem of labeling the connected components of a binary image. The machine model is an SIMD two-dimensional mesh-connected computer consisting of an N {times} N array of processing elements, each containing a single pixel of an N {times} N image. Both new algorithms use a local shrinking operation defined by Levialdi and have time complexities of O(N log N) bit operations, making them the fastest local algorithms for the problem. Compared to other approaches having similar or better asymptotic time complexities, this local approach dramatically simplifies the algorithms and reduces the constantsmore »« less
https://doi.org/10.1109/12.45215
Optimizing connected component labeling algorithms

Conference Wu, Kesheng ; Otoo, Ekow ; Shoshani, Arie

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 connected component labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among them 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 second strategy uses an array to store the equivalence information among the labels. This replaces the pointer basedmore »« less
Full Text Available
Modified cyclic algorithms for solving triangular systems on distributed-memory multiprocessors

Technical Report Eisenstat, S C ; Heath, M T ; Henkel, C S ; ...

New parallel algorithms and comparative test results are given for solving triangular systems of linear equations on distributed-memory multiprocessors. These results supplement those given in a previous paper. All of the new algorithms are variations on the cyclic algorithms discussed previously. The new algorithms are shown to provide substantial performance improvements.
Multitarget tracking algorithm parallelization for distributed-memory computing systems

Conference Popp, R L ; Pattipati, K R ; Bar-Shalom, Y

In this paper we present a robust scalable parallelization of a multitarget tracking algorithm developed for air traffic surveillance. We couple the state estimation and data association problems by embedding an Interacting Multiple Model (IMM) state estimator into an optimization-based assignment framework. A SPMD distributed-memory parallelization is described, wherein the interface to the optimization problem, namely, computing the rather numerous gating and IMM state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the assignment problem), is parallelized. We describe several heuristic algorithms developed for the inherent task allocation problem, wherein the problem is one of assigningmore »« less

Similar Records

Title: Evaluation of connected-component labeling algorithms for distributed-memory systems

Citation Formats

Cloud-based Connected Component Algorithm conference, October 2010

Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction journal, November 2007

Computing connected components on parallel computers journal, August 1979

An O(logn) parallel connectivity algorithm journal, March 1982

Near linear time algorithm to detect community structures in large-scale networks journal, September 2007

A comparison of parallel algorithms for connected components conference, January 1994

Efficiency of a Good But Not Linear Set Union Algorithm journal, April 1975

A Parallel Algorithm for Connected Components on Distributed Memory Machines book, January 2001

In-situ Feature-Based Objects Tracking for Large-Scale Scientific Simulations conference, November 2012

Practical parallel Union-Find algorithms for transitive closure and clustering journal, October 1988

Cloud-based Connected Component Algorithm
conference, October 2010

Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction
journal, November 2007

Computing connected components on parallel computers
journal, August 1979

An O(logn) parallel connectivity algorithm
journal, March 1982

Near linear time algorithm to detect community structures in large-scale networks
journal, September 2007

A comparison of parallel algorithms for connected components
conference, January 1994

Efficiency of a Good But Not Linear Set Union Algorithm
journal, April 1975

A Parallel Algorithm for Connected Components on Distributed Memory Machines
book, January 2001

In-situ Feature-Based Objects Tracking for Large-Scale Scientific Simulations
conference, November 2012

Practical parallel Union-Find algorithms for transitive closure and clustering
journal, October 1988