Efficient computation of greyscale path openings

DOI10.1515/MATHM-2016-0010MaRDI QIDQ1980874zbMATH OpenOpenAlexFDO

Authors Herman Schubert, Jasper J. van de Gronde, J. B. T. M. Roerdink

Publication date 9 September 2021

Published in Mathematical Morphology. Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/mathm-2016-0010

zbMATH Keywords

time complexityattributesalgebraic morphological operatorspath openingsstack opening

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Fast computation of greyscale path openings
• Path openings and closings
• Flexible linear openings and closings.
• Efficient and robust path openings using the scale-invariant rank operator
• Statistical threshold selection for path openings to detect cracks

Cites work

• Constrained and Dimensionality-Independent Path Openings
• Efficient and robust path openings using the scale-invariant rank operator
• Fast computation of greyscale path openings
• Geodesic Attributes Thinnings and Thickenings
• Parsimonious Path Openings and Closings
• Path openings and closings
• Path-based mathematical morphology on tensor fields
• Ranking orientation responses of path operators: motivations, choices and algorithmics
• Topological sorting of large networks

Cited in

(5)

• Path openings and closings
• Flexible linear openings and closings.
• Efficient and robust path openings using the scale-invariant rank operator
• Statistical threshold selection for path openings to detect cracks
• Fast computation of greyscale path openings

This page was built for publication: Efficient computation of greyscale path openings

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