Fast morphological attribute operations using Tarjan's union-find algorithm.

zbMATH Open1073.68877MaRDI QIDQ2759986FDOQ2759986

Authors: J. B. T. M. Roerdink, Michael Wilkinson 

Publication date: 2000

Recommendations

• Two linear time Union--Find strategies for image processing
• Morphological erosions and openings: fast algorithms based on anchors
• scientific article; zbMATH DE number 1290181
• Development of morphological operators for real‐time applications
• Memory management for union-find algorithms

zbMATH Keywords

granulometriesattribute operators

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10)

Cited In (2)

• Memory management for union-find algorithms
• CASOP: A fast algorithm for computing the \(n\)-ary composition of a binary associative operator

This page was built for publication: Fast morphological attribute operations using Tarjan's union-find algorithm.

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