Connected Components Labeling on DRAGs
Abstract: In this paper we introduce a new Connected Components Labeling (CCL) algorithm which exploits a novel approach to model decision problems as Directed Acyclic Graphs with a root, which will be called Directed Rooted Acyclic Graphs (DRAGs). This structure supports the use of sets of equivalent actions, as required by CCL, and optimally leverages these equivalences to reduce the number of nodes (decision points). The advantage of this representation is that a DRAG, differently from decision trees usually exploited by the state-of-the-art algorithms, will contain only the minimum number of nodes required to reach the leaf corresponding to a set of condition values. This combines the benefits of using binary decision trees with a reduction of the machine code size. Experiments show a consistent improvement of the execution time when the model is applied to CCL.
Citation:
Bolelli, Federico; Baraldi, Lorenzo; Cancilla, Michele; Grana, Costantino "Connected Components Labeling on DRAGs" 2018 24th International Conference on Pattern Recognition (ICPR), vol. 2018-, Beijing, China, pp. 121 -126 , Aug 20-24, 2018 DOI: 10.1109/ICPR.2018.8545505
not available
Paper download:
- Author version:
- DOI: 10.1109/ICPR.2018.8545505