When Convex Analysis Meets Mathematical Morphology on Graphs
From MaRDI portal
Publication:2946834
DOI10.1007/978-3-319-18720-4_40zbMath1445.68263OpenAlexW2287006870MaRDI QIDQ2946834
Hugues Talbot, Laurent Najman, Jean-Christophe Pesquet
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_40
Convex programming (90C25) Applications of optimal control and differential games (49N90) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Axioms and fundamental equations of image processing
- Lattice calculus of the morphological slope transform
- Discrete Poincaré lemma
- Mutational equations of the morphological dilation tubes
- Dual Constrained TV-based Regularization on Graphs
- Discrete Calculus
- Handbook of Mathematical Models in Computer Vision
- Nonlocal PDEs-Based Morphology on Weighted Graphs for Image and Data Processing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: When Convex Analysis Meets Mathematical Morphology on Graphs