Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
Two linear time Union-Find strategies for image processing
Theoretical Computer Science
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Connected Component Labeling Using Quadtrees
Journal of the ACM (JACM)
The synthetic approach to decision table conversion
Communications of the ACM
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
A Simple and Efficient Connected Components Labeling Algorithm
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
A Component-Labeling Algorithm Using Contour Tracing Technique
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
The MIR flickr retrieval evaluation
MIR '08 Proceedings of the 1st ACM international conference on Multimedia information retrieval
Fast connected-component labeling
Pattern Recognition
An improved segmentation and coding algorithm for binary and nonbinary images
IBM Journal of Research and Development
Fast block based connected components labeling
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A Run-Based Two-Scan Labeling Algorithm
IEEE Transactions on Image Processing
Surfing on artistic documents with visually assisted tagging
Proceedings of the international conference on Multimedia
Probabilistic people tracking with appearance models and occlusion classification: The AD-HOC system
Pattern Recognition Letters
Optimal decision trees generation from OR-decision tables
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing: Part I
Optimal decision trees for local image processing algorithms
Pattern Recognition Letters
Automatic comic page segmentation based on polygon detection
Multimedia Tools and Applications
Hi-index | 0.02 |
In this paper, we define a new paradigm for eight-connection labeling, which employes a general approach to improve neighborhood exploration and minimizes the number of memory accesses. First, we exploit and extend the decision table formalism introducing OR-decision tables, in which multiple alternative actions are managed. An automatic procedure to synthesize the optimal decision tree from the decision table is used, providing the most effective conditions evaluation order. Second, we propose a new scanning technique that moves on a 2×2 pixel grid over the image, which is optimized by the automatically generated decision tree. An extensive comparison with the state of art approaches is proposed, both on synthetic and real datasets. The synthetic dataset is composed of different sizes and densities random images, while the real datasets are an artistic image analysis dataset, a document analysis dataset for text detection and recognition, and finally a standard resolution dataset for picture segmentation tasks. The algorithm provides an impressive speedup over the state of the art algorithms.