Skip to Main content Skip to Navigation
Journal articles

A labeling algorithm based on a forest of decision trees

Abstract : Connected component labeling (CCL) is one of the most fundamental operations in image processing. CCL is a procedure for assigning a unique label to each connected component. It is a mandatory step between low-level and high-level image processing. In this work, a general method is given to improve the neighbourhood exploration in a two-scan labeling. The neighbourhood values are considered as commands of a decision table. This decision table can be represented as a decision tree. A block-based approach is proposed so that values of several pixels are given by one decision tree. This block-based approach can be extended to multiple connectivities, 2D and 3D. In a raster scan, already seen pixels can be exploited to generate smaller decision trees. New decision trees are automatically generated from every possible command. This process creates a decision forest that minimises the number of memory accesses. Experimental results show that this method is faster than the state-of-the-art labelling algorithms and require fewer memory accesses. The whole process can be generalised to any given connectivity.
Complete list of metadata

Cited literature [36 references]  Display  Hide  Download

https://hal-mines-paristech.archives-ouvertes.fr/hal-02438281
Contributor : Petr Dokladal <>
Submitted on : Monday, January 20, 2020 - 2:02:04 PM
Last modification on : Thursday, September 24, 2020 - 4:38:04 PM

Identifiers

Citation

Theodore Chabardes, Petr Dokládal, Michel Bilodeau. A labeling algorithm based on a forest of decision trees. Journal of Real-Time Image Processing, Springer Verlag, 2019, ⟨10.1007/s11554-019-00912-8⟩. ⟨hal-02438281⟩

Share

Metrics

Record views

166