An improved parallel thinning algorithm
Communications of the ACM
Fast parallel thinning algorithms: parallel speed and connectivity preservation
Communications of the ACM
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Thinning Methodologies-A Comprehensive Survey
IEEE Transactions on Pattern Analysis and Machine Intelligence
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
A fast parallel algorithm for thinning digital patterns
Communications of the ACM
Optimal conversion of extended-entry decision tables with general cost criteria
Communications of the ACM
The synthetic approach to decision table conversion
Communications of the ACM
A Simple and Efficient Connected Components Labeling Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Fast connected-component labeling
Pattern Recognition
Optimized block-based connected components labeling with decision trees
IEEE Transactions on Image Processing
Optimal decision trees generation from OR-decision tables
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
| Hi-index | 0.10 |
In this paper we present a novel algorithm to synthesize an optimal decision tree from OR-decision tables, an extension of standard decision tables, complete with the formal proof of optimality and computational cost analysis. As many problems which require to recognize particular patterns can be modeled with this formalism, we select two common binary image processing algorithms, namely connected components labeling and thinning, to show how these can be represented with decision tables, and the benefits of their implementation as optimal decision trees in terms of reduced memory accesses. Experiments are reported, to show the computational time improvements over state of the art implementations.