Optimal Decision Trees Generation from OR-Decision Tables
In this paper we present a novel dynamic programming algorithm to synthesize an optimal decision tree from OR-decision tables, an extension of standard decision tables, which allow to choose between several alternative actions in the same rule. Experiments are reported, showing the computational time improvements over state of the art implementations of connected components labeling, using this modelling technique.
KeywordsDecision tables Decision trees Connected components labeling Image processing
- 1.Di Stefano, L., Bulgarelli, A.: A simple and efficient connected components labeling algorithm. In: International Conference on Image Analysis and Processing, pp. 322–327 (1999)Google Scholar
- 2.Grana, C., Borghesani, D., Cucchiara, R.: Optimized Block-based Connected Components Labeling with Decision Trees. IEEE Transactions on Image Processing 19(6) (June 2010)Google Scholar
- 3.He, L., Chao, Y., Suzuki, K.: A linear-time two-scan labeling algorithm. In: International Conference on Image Processing, vol. 5, pp. 241–244 (2007)Google Scholar