Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Hoshen–Kopelman algorithm

Known as: Hoshen-Kopelman Algorithm 
The Hoshen–Kopelman algorithm is a simple and efficient algorithm for labeling clusters on a grid. Where the grid is a regular network of cells, with… 
Wikipedia

Related topics

Related topics

13 relations
AlgorithmBinary imageCluster analysisConnectivity (graph theory)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Efficient space virtualisation for Hoshen-Kopelman algorithm
In this paper, the efficient space virtualisation for the Hoshen–Kopelman algorithm is presented. We observe minimal parallel… 
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2016
2016
Vision Day Schedule Time Speaker and Collaborators Affiliation Title a General Preprocessing Method for Improved Performance of Epipolar Geometry Estimation Algorithms on the Expressive Power of Deep…
Visual Learning of Arithmetic Operations Yedid Hoshen and Shmuel Peleg ­ HUJI A simple Neural Network model is presented for end… 
2015
2015
Parallelised Hoshen-Kopelman algorithm for lattice-Boltzmann simulations
a b s t r a c t We discuss two topics that we have encountered in our lattice-Boltzmann simulations of complex fluids: the sizes… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2008
2008
A Finite State Machine Approach to Cluster Identification Using the Hoshen-Kopelman Algorithm
The purpose of this study was to develop an efficient finite state machine implementation of the eponymous Hoshen-Kopelman… 
  • figure 2-2
  • figure 2-3
  • figure 2-5
  • figure 2-6
  • table 2-1
2007
2007
A parallel finite state machine implementation of a nearest-eight Hoshen-Kopelman adaptation for landscape analysis
This paper describes preliminary work on a parallel finite state machine implementation of the Hoshen-Kopelman cluster… 
  • figure 1
  • table 2
Highly Cited
2003
Highly Cited
2003
Extension of Hoshen–Kopelman algorithm to non-lattice environments
Abstract We extend the Hoshen–Kopelman (HK) algorithm for cluster labeling to non-lattice environments, where sites are placed at… 
  • figure 1
  • figure 2
  • table 1
  • figure 3
Highly Cited
1999
Highly Cited
1999
Invasion percolation: new algorithms and universality classes
Employing highly efficient algorithms for simulating invasion percolation (IP), whose execution time scales as O[Mlog(M)] or… 
  • table 1
  • table 2
  • figure 1
  • figure 2
  • table 3
1998
1998
Cluster Counting: The Hoshen–Kopelman Algorithm Versus Spanning Tree Approaches
Two basic approaches to the cluster counting task in the percolation and related models are discussed. The Hoshen–Kopelman… 
  • figure 1
  • figure 2
  • figure 3
1998
1998
On the application of the enhanced Hoshen-Kopelman algorithm for image analysis
  • J. Hoshen
  • Pattern Recognit. Lett.
  • 1998
  • Corpus ID: 29895994
The enhanced Hoshen-Kopelman (EHK) algorithm is introduced for a single pass analysis of spatial clusters in large images. The… 
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 4
1997
1997
Parallelization of the Hoshen-Kopelman Algorithm Using a Finite State Machine
In applications such as landscape ecology, computer mod eling is used to assess habitat fragmentation and its ecological… 
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE