Morphological erosions and openings: fast algorithms based on anchors

DOI10.1007/s10851-005-4886-2zbMath1478.94032MaRDI QIDQ2573026

M. Droogenbroeck, M. J. Buckley

Publication date: 7 November 2005

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://orbi.uliege.be/handle/2268/1302

zbMATH Keywords

mathematical morphology; granulometry; efficient algorithm; opening; erosion

Mathematics Subject Classification ID

68U10: Computing methodologies for image processing

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

Related Items

A novel approach for computation of morphological operations using the number theoretic transform, Fast morphological dilation and erosion for grey scale images using the Fourier transform, Fast and incremental computation for the erosion score

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lattice-theoretical framework for annular filters in morphological image processing
• Root images of median filters
• The algebraic basis of mathematical morphology
• Speeding-up successive Minkowski operations with bit-plane computers
• Pattern spectrum and multiscale shape representation
• Complete classification of roots to one-dimensional median and rank-order filters
• The algebraic basis of mathematical morphology I. Dilations and erosions
• An efficient algorithm for running window pel gray level ranking in 2-D images
• On fast running max-min filtering