Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision

DOI10.1007/978-3-030-14085-4_17OpenAlexW2917917577MaRDI QIDQ5237061

Filip Malmberg, Robin Strand, Krzysztof Chris Ciesielski

Publication date: 16 October 2019

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-14085-4_17

zbMATH Keywords

energy minimizationsubmodularityminimum cutpixel labeling

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions

Cites Work

• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
• When can \(l_p\)-norm objective functions be minimized via graph cuts?
• Unnamed Item

This page was built for publication: Optimization of Max-Norm Objective Functions in Image Processing and Computer Vision