Toward a sparsity theory on weighted lattices

DOI10.1007/s10851-022-01075-1OpenAlexW4224115695MaRDI QIDQ2678919

Anastasios Tsiamis, Nikolaos Tsilivis, Petros Maragos

Publication date: 25 January 2023

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

Full work available at URL: https://doi.org/10.1007/s10851-022-01075-1

zbMATH Keywords

submodularitylatticesmathematical morphologysparsity

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Morphological perceptrons with competitive learning: lattice-theoretical framework and constructive learning algorithm
• Dynamical systems on weighted lattices: general theory
• Minimax algebra
• An analysis of the greedy algorithm for the submodular set covering problem
• Some open questions on morphological operators and representations in the deep learning era. A personal vision
• Eigenfunctions of ultrametric morphological openings and closings
• Sparse approximate solutions to max-plus equations
• Max-plus operators applied to filter selection and model pruning in neural networks
• Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
• Max-plus linear inverse problems: 2-norm regression and system identification of max-plus linear dynamical systems with Gaussian noise
• Sparsity in max-plus algebra and systems
• TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES
• The algebraic basis of mathematical morphology
• Max-linear Systems: Theory and Algorithms
• Sparse and Redundant Representations
• The algebraic basis of mathematical morphology I. Dilations and erosions
• Morphological Perceptrons: Geometry and Training Algorithms
• Learning with Submodular Functions: A Convex Optimization Perspective

This page was built for publication: Toward a sparsity theory on weighted lattices