Toward reliable experiments on the performance of Connected Components Labeling algorithms

被引:0
|
作者
Federico Bolelli
Michele Cancilla
Lorenzo Baraldi
Costantino Grana
机构
[1] Università degli Studi di Modena e Reggio Emilia,Dipartimento di Ingegneria “Enzo Ferrari”
来源
关键词
Connected Components Labeling; Benchmarking; Performance Evaluation;
D O I
暂无
中图分类号
学科分类号
摘要
The problem of labeling the connected components of a binary image is well defined, and several proposals have been presented in the past. Since an exact solution to the problem exists, algorithms mainly differ on their execution speed. In this paper, we propose and describe YACCLAB, Yet Another Connected Components Labeling Benchmark. Together with a rich and varied dataset, YACCLAB contains an open source platform to test new proposals and to compare them with publicly available competitors. Textual and graphical outputs are automatically generated for many kinds of tests, which analyze the methods from different perspectives. An extensive set of experiments among state-of-the-art techniques is reported and discussed.
引用
收藏
页码:229 / 244
页数:15
相关论文
共 50 条
  • [41] Optimal algorithms for finding connected components of an unknown graph
    Shi, WP
    West, DB
    COMPUTING AND COMBINATORICS, 1995, 959 : 131 - 140
  • [42] Strongly Connected Components Based Efficient PPR Algorithms
    Yang H.-G.
    Shen D.-R.
    Kou Y.
    Nie T.-Z.
    Yu G.
    1600, Science Press (40): : 584 - 600
  • [43] A Comparative Review of Two-Pass Connected Component Labeling Algorithms
    Hernandez-Belmonte, Uriel H.
    Ayala-Ramirez, Victor
    Sanchez-Yanez, Raul E.
    ADVANCES IN SOFT COMPUTING, PT II, 2011, 7095 : 452 - 462
  • [44] Optimizing two-pass connected-component labeling algorithms
    Kesheng Wu
    Ekow Otoo
    Kenji Suzuki
    Pattern Analysis and Applications, 2009, 12 : 117 - 135
  • [45] ALGORITHMS FOR IMAGE COMPONENT LABELING ON SIMD MESH-CONNECTED COMPUTERS
    CYPHER, RE
    SANZ, JLC
    SNYDER, L
    IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (02) : 276 - 281
  • [46] Optimizing two-pass connected-component labeling algorithms
    Wu, Kesheng
    Otoo, Ekow
    Suzuki, Kenji
    PATTERN ANALYSIS AND APPLICATIONS, 2009, 12 (02) : 117 - 135
  • [47] Application of a Fast Connected Components Labeling Algorithm in Processing Landmark Images
    闫士举
    王成焘
    陈统一
    袁文
    苏颖颖
    JournalofShanghaiJiaotongUniversity, 2007, (03) : 383 - 387
  • [48] A Flexible ASIP Architecture for Connected Components Labeling in Embedded Vision Applications
    Eusse, Juan Fernando
    Leupers, Rainer
    Ascheid, Gerd
    Sudowe, Patrick
    Leibe, Bastian
    Sadasue, Tamon
    2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), 2014,
  • [49] A HIGH-SPEED SYSTOLIC ARCHITECTURE FOR LABELING CONNECTED COMPONENTS IN AN IMAGE
    RANGANATHAN, N
    MEHROTRA, R
    SUBRAMANIAN, S
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1995, 25 (03): : 415 - 423
  • [50] How Does Connected Components Labeling with Decision Trees Perform on GPUs?
    Allegretti, Stefano
    Bolelli, Federico
    Cancilla, Michele
    Pollastri, Federico
    Canalini, Laura
    Grana, Costantino
    COMPUTER ANALYSIS OF IMAGES AND PATTERNS, CAIP 2019, PT I, 2019, 11678 : 39 - 51