On the application of the enhanced Hoshen-Kopelman algorithm for image analysis

被引:15
|
作者
Hoshen, J
机构
[1] Naperville, IL 60540-7112
关键词
cluster analysis; connected components; percolation; spatial clusters;
D O I
10.1016/S0167-8655(98)00018-X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The enhanced Hoshen-Kopelman (EHK) algorithm is introduced for a single pass analysis of spatial clusters in large images. The EHK algorithm is a generalisation of the algorithm known in the statistical physics literature as the Hoshen-Kopelman (HK) algorithm. While the HK algorithm was designed to compute cluster sizes in a binary image, the EHK algorithm enables the computation of cluster shape parameters such as spatial clusters moments, perimeters and bounding boxes in a multiple class image. An example of spatial cluster analysis for a simulated image containing 2 x 10(9) pixels is given. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
下载
收藏
页码:575 / 584
页数:10
相关论文
共 50 条
  • [2] Percolation and cluster structure parameters: The enhanced Hoshen-Kopelman algorithm
    Hoshen, J
    Berry, MW
    Minser, KS
    PHYSICAL REVIEW E, 1997, 56 (02): : 1455 - 1460
  • [3] Percolation and cluster structure parameters: the enhanced Hoshen-Kopelman algorithm
    Hoshen, J.
    Berry, M.W.
    Minser, K.S.
    Physical Review E. Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics, 1997, 56 (02):
  • [4] Efficient space virtualization for the Hoshen-Kopelman algorithm
    Kotwica, M.
    Gronek, P.
    Malarz, K.
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2019, 30 (08):
  • [5] Extension of Hoshen-Kopelman algorithm to non-lattice environments
    Al-Futaisi, A
    Patzek, TW
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2003, 321 (3-4) : 665 - 678
  • [6] Parallelised Hoshen-Kopelman algorithm for lattice-Boltzmann simulations
    Frijters, S.
    Krueger, T.
    Harting, J.
    COMPUTER PHYSICS COMMUNICATIONS, 2015, 189 : 92 - 98
  • [7] Parallelization of the Hoshen-Kopelman algorithm using a finite state machine
    Univ of Tennessee, Knoxville, United States
    Int J Supercomput Appl High Perform Comput, 1 (34-48):
  • [8] Cluster counting: The Hoshen-Kopelman algorithm versus spanning tree approaches
    Babalievski, F
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 1998, 9 (01): : 43 - 60
  • [9] Parallelization of the Hoshen-Kopelman algorithm using a finite state machine
    Constantin, JM
    Berry, MW
    VanderZanden, BT
    INTERNATIONAL JOURNAL OF SUPERCOMPUTER APPLICATIONS AND HIGH PERFORMANCE COMPUTING, 1997, 11 (01): : 34 - 48
  • [10] 基于Hoshen-Kopelman算法的三维多孔介质模型中黏土矿物的构建
    何延龙
    蒲春生
    景成
    谷潇雨
    刘洪志
    崔淑霞
    李晓
    宋俊强
    石油学报, 2016, 37 (08) : 1037 - 1046