Fast computation of greyscale path openings

DOI10.1007/978-3-319-18720-4_52MaRDI QIDQ2946849zbMATH OpenOpenAlexFDO

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

Publication date 18 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-18720-4_52

zbMATH Keywords

algebraic morphological operatorsattributespath openingsstack openingtime complexity

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Analysis of algorithms (68W40)

Recommendations

• Efficient computation of greyscale path openings
• Path openings and closings
• Flexible linear openings and closings.
• scientific article; zbMATH DE number 1262713
• scientific article; zbMATH DE number 1262694

Cites work

• Constrained and Dimensionality-Independent Path Openings
• Geodesic Attributes Thinnings and Thickenings
• Parsimonious Path Openings and Closings
• Path openings and closings
• Topological sorting of large networks

Cited in

(2)

• Efficient computation of greyscale path openings
• Efficient and robust path openings using the scale-invariant rank operator

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

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