A greedy algorithm for decomposing convex structuring elements

DOI10.1023/A:1022847527229MaRDI QIDQ1870332zbMATH OpenOpenAlexFDO

Authors Ronaldo Hashimoto, Junior Barrera

Publication date 11 May 2003

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

Full work available at URL https://doi.org/10.1023/a:1022847527229

zbMATH Keywords

decompositiongreedy algorithmMinkowski additionconvex structuring element

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Convex structuring element decomposition for single scan binary mathematical morphology.
• scientific article; zbMATH DE number 123446
• Separable decompositions and approximations of greyscale morphological templates
• Decomposition of separable concave structuring functions
• Decomposition of separable concave structuring functions

Cited in

(6)

• A combinatorial optimization technique for the sequential decomposition of erosions and dilations
• Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
• scientific article; zbMATH DE number 123446 (Why is no real title available?)
• Analytical solutions for the Minkowski addition equation
• Convex structuring element decomposition for single scan binary mathematical morphology.
• From mathematical morphology to machine learning of image operators

This page was built for publication: A greedy algorithm for decomposing convex structuring elements

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