Optimizing two-pass connected-component labeling algorithms

被引:0
|
作者
Kesheng Wu
Ekow Otoo
Kenji Suzuki
机构
[1] University of California,Lawrence Berkeley National Laboratory
[2] The University of Chicago,Department of Radiology
来源
关键词
Connected-component labeling; Optimization; Union-find algorithm; Decision tree; Equivalence relation;
D O I
暂无
中图分类号
学科分类号
摘要
We present two optimization strategies to improve connected-component labeling algorithms. Taking together, they form an efficient two-pass labeling algorithm that is fast and theoretically optimal. The first optimization strategy reduces the number of neighboring pixels accessed through the use of a decision tree, and the second one streamlines the union-find algorithms used to track equivalent labels. We show that the first strategy reduces the average number of neighbors accessed by a factor of about 2. We prove our streamlined union-find algorithms have the same theoretical optimality as the more sophisticated ones in literature. This result generalizes an earlier one on using union-find in labeling algorithms by Fiorio and Gustedt (Theor Comput Sci 154(2):165–181, 1996). In tests, the new union-find algorithms improve a labeling algorithm by a factor of 4 or more. Through analyses and experiments, we demonstrate that our new two-pass labeling algorithm scales linearly with the number of pixels in the image, which is optimal in computational complexity theory. Furthermore, the new labeling algorithm outperforms the published labeling algorithms irrespective of test platforms. In comparing with the fastest known labeling algorithm for two-dimensional (2D) binary images called contour tracing algorithm, our new labeling algorithm is up to ten times faster than the contour tracing program distributed by the original authors.
引用
收藏
页码:117 / 135
页数:18
相关论文
共 50 条
  • [1] Optimizing two-pass connected-component labeling algorithms
    Wu, Kesheng
    Otoo, Ekow
    Suzuki, Kenji
    [J]. PATTERN ANALYSIS AND APPLICATIONS, 2009, 12 (02) : 117 - 135
  • [2] A Comparative Review of Two-Pass Connected Component Labeling Algorithms
    Hernandez-Belmonte, Uriel H.
    Ayala-Ramirez, Victor
    Sanchez-Yanez, Raul E.
    [J]. ADVANCES IN SOFT COMPUTING, PT II, 2011, 7095 : 452 - 462
  • [3] A fast and memory-efficient two-pass connected-component labeling algorithm for binary images
    Bataineh, Bilal
    [J]. TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2019, 27 (02) : 1243 - 1259
  • [4] A New Parallel Algorithm for Two-Pass Connected Component Labeling
    Gupta, Siddharth
    Palsetia, Diana
    Patwary, Md. Mostofa Ali
    Agrawal, Ankit
    Choudhary, Alok
    [J]. PROCEEDINGS OF 2014 IEEE INTERNATIONAL PARALLEL & DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2014, : 1356 - 1363
  • [5] Optimizing connected component labeling algorithms
    Wu, KS
    Otoo, E
    Shoshani, A
    [J]. MEDICAL IMAGING 2005: IMAGE PROCESSING, PT 1-3, 2005, 5747 : 1965 - 1976
  • [6] Fast connected-component labeling
    He, Lifeng
    Chao, Yuyan
    Suzuki, Kenji
    Wu, Kesheng
    [J]. PATTERN RECOGNITION, 2009, 42 (09) : 1977 - 1987
  • [7] A New Connected-Component Labeling Algorithm
    Zhao, Xiao
    He, Lifeng
    Yao, Bin
    Chao, Yuyan
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2015, E98D (11): : 2013 - 2016
  • [8] A comparison of connected-component algorithms
    Waltz, FM
    Miller, JWV
    [J]. MACHINE VISION SYSTEMS FOR INSPECTION AND METROLOGY VIII, 1999, 3836 : 10 - 17
  • [9] Evaluation of connected-component labeling algorithms for distributed-memory systems
    Iverson, J.
    Kamath, C.
    Karypis, G.
    [J]. PARALLEL COMPUTING, 2015, 44 : 53 - 68
  • [10] The connected-component labeling problem: A review of state-of-the-art algorithms
    He, Lifeng
    Ren, Xiwei
    Gao, Qihang
    Zhao, Xiao
    Yao, Bin
    Chao, Yuyan
    [J]. PATTERN RECOGNITION, 2017, 70 : 25 - 43