When can \(l_p\)-norm objective functions be minimized via graph cuts?

DOI10.1007/978-3-030-05288-1_9zbMath1519.68309arXiv1802.00624OpenAlexW2964077965MaRDI QIDQ6165904

Filip Malmberg, Robin Strand

Publication date: 2 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.00624

zbMATH Keywords

submodularity\(l_p\) normminimal graph cuts

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Machine vision and scene understanding (68T45)

Related Items (1)

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

This page was built for publication: When can \(l_p\)-norm objective functions be minimized via graph cuts?