Optimized Block-Based Connected Components Labeling With Decision Trees

DOI10.1109/TIP.2010.2044963zbMATH Open1371.68281WikidataQ51714043 ScholiaQ51714043MaRDI QIDQ5366390FDOQ5366390

Daniele Borghesani, Costantino Grana, Rita Cucchiara

Publication date: 9 October 2017

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Cited In (1)

• Comparative study and proof of single-pass connected components algorithms

   Recommendations

• Fast connected-component labeling 👍 👎
• A New Framework for Connected Components Labeling of Binary Images 👍 👎
• A general approach to connected-component labeling for arbitrary image representations 👍 👎
• Configuration-Transition-Based Connected-Component Labeling 👍 👎
• Component-Hypertrees for Image Segmentation 👍 👎

This page was built for publication: Optimized Block-Based Connected Components Labeling With Decision Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366390)