Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Connected Component Labeling Using Quadtrees
Journal of the ACM (JACM)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
Digital Picture Processing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Hashing by proximity to process duplicates in spatial databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Finding connected components on a scan line array processor
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Connected component labeling based on the EVM model
SCCG '02 Proceedings of the 18th spring conference on Computer graphics
A Comparison of Algorithms for Connected Set Openings and Closings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Fast Multifunctional Approach for Document Image Analysis
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
A linear-time component-labeling algorithm using contour tracing technique
Computer Vision and Image Understanding
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
A fast orientation and skew detection algorithm for monochromatic document images
Proceedings of the 2005 ACM symposium on Document engineering
Hybrid object labelling in digital images
Machine Vision and Applications
An Embedded Real-Time Surveillance System: Implementation and Evaluation
Journal of Signal Processing Systems
Fast connected-component labeling
Pattern Recognition
Connected Component Labeling Techniques on Modern Architectures
ICIAP '09 Proceedings of the 15th International Conference on Image Analysis and Processing
Automatic Initiation of the Periorbital Signal Extraction in Thermal Imagery
AVSS '09 Proceedings of the 2009 Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance
Real-Time Object-Based Video Segmentation Using Colour Segmentation and Connected Component Labeling
IVIC '09 Proceedings of the 1st International Visual Informatics Conference on Visual Informatics: Bridging Research and Practice
Optimized block-based connected components labeling with decision trees
IEEE Transactions on Image Processing
A fast connected components labeling algorithm and its application to real-time pupil detection
Machine Vision and Applications - Integrated Imaging and Vision Techniques for Industrial Inspection
Fast and memory efficient 2-D connected components using linked lists of line segments
IEEE Transactions on Image Processing
An embedded system for real-time facial expression recognition based on the extension theory
Computers & Mathematics with Applications
A connected-component-labeling-based approach to virtual porosimetry
Graphical Models
Detecting atmospheric rivers in large climate datasets
Proceedings of the 2nd international workshop on Petascal data analytics: challenges and opportunities
A comparative review of two-pass connected component labeling algorithms
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
Expert Systems with Applications: An International Journal
| Hi-index | 0.01 |
An improved and general approach to connected-component labeling of images is presented. The algorithm presented in this paper processes images in predetermined order, which means that the processing order depends only on the image representation scheme and not on specific properties of the image. The algorithm handles a wide variety of image representation schemes (rasters, run lengths, quadrees, bintrees, etc.). How to adapt the standard UNION-FIND algorithm to permit reuse of temporary labels is shown. This is done using a technique called age balancing, in which, when two labels are merged, the older label becomes the father of the younger label. This technique can be made to coexist with the more conventional rule of weight balancing, in which the label with more descendants becomes the father of the label with fewer descendants. Various image scanning orders are examined and classified. It is also shown that when the algorithm is specialized to a pixel array scanned in raster order, the total processing time is linear in the number of pixels. The linear-time processing time follows from a special property of the UNION-FIND algorithm, which may be of independent interest. This property states that under certain restrictions on the input, UNION-FIND runs in time linear in the number of FIND and UNION operations. Under these restrictions, linear-time performance can be achieved without resorting to the more complicated Gabow-Tarjan algorithm for disjoint set union.