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… (More)
Wikipedia

Related topics

Related topics

13 relations
AlgorithmBinary imageCluster analysisConnectivity (graph theory)
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Efficient space virtualisation for Hoshen-Kopelman algorithm
In this paper the efficient space virtualisation for Hoshen–Kopelman algorithm is presented. We observe minimal parallel overhead… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
Parallelised Hoshen-Kopelman algorithm for lattice-Boltzmann simulations
We discuss two topics that we have encountered in our lattice-Boltzmann simulations of complex fluids: the sizes of droplets in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
Is this relevant?
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… (More)
  • figure 1
  • table 2
Is this relevant?
2003
2003
Extension of Hoshen–Kopelman algorithm to non-lattice environments
We extend the Hoshen–Kopelman (HK) algorithm for cluster labeling to non-lattice environments, where sites are placed at random… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2000
2000
A direct parallel implementation of the Hoshen–Kopelman algorithm for distributed memory architectures
 
Is this relevant?
1999
1999
The application of the enhanced Hoshen-Kopelman algorithm for processing unbounded images
The enhanced Hoshen-Kopelman (EHK) algorithm for the analysis of connected components in images that are unbounded in one of… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • table II
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1998
1998
On the application of the enhanced Hoshen-Kopelman algorithm for image analysis
Ž . The enhanced Hoshen–Kopelman EHK algorithm is introduced for a single pass analysis of spatial clusters in large images. The… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 4
Is this relevant?
1997
1997
Parallelization of the Hoshen-Kopelman Algorithm Using a Finite State Machine
In applications such as landscape ecology, computermodeling is used to assess habitat fragmentation and its ecological… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?