共 50 条
- [41] Optimal algorithms for finding connected components of an unknown graph COMPUTING AND COMBINATORICS, 1995, 959 : 131 - 140
- [42] Strongly Connected Components Based Efficient PPR Algorithms 1600, Science Press (40): : 584 - 600
- [43] A Comparative Review of Two-Pass Connected Component Labeling Algorithms ADVANCES IN SOFT COMPUTING, PT II, 2011, 7095 : 452 - 462
- [44] Optimizing two-pass connected-component labeling algorithms Pattern Analysis and Applications, 2009, 12 : 117 - 135
- [48] A Flexible ASIP Architecture for Connected Components Labeling in Embedded Vision Applications 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 IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1995, 25 (03): : 415 - 423
- [50] How Does Connected Components Labeling with Decision Trees Perform on GPUs? COMPUTER ANALYSIS OF IMAGES AND PATTERNS, CAIP 2019, PT I, 2019, 11678 : 39 - 51