On fast running max-min filtering

DOI10.1109/82.618040MaRDI QIDQ4371864zbMATH OpenOpenAlexFDO

Authors Dinu Coltuc, Ioannis Pitas

Publication date 23 March 1998

Published in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/82.618040

zbMATH Keywords

computational complexityfast algorithmsmax-min filtering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• scientific article; zbMATH DE number 5182608
• Optimal algorithms for running max and min filters on random inputs
• scientific article; zbMATH DE number 1067818
• Efficient dilation, erosion, opening and closing algorithms.
• scientific article; zbMATH DE number 4203795

Cited in

(3)

• Morphological erosions and openings: fast algorithms based on anchors
• Optimal algorithms for running max and min filters on random inputs
• scientific article; zbMATH DE number 5182608 (Why is no real title available?)

This page was built for publication: On fast running max-min filtering

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