Skip to Main content Skip to Navigation
Journal articles

Cut Pursuit: fast algorithms to learn piecewise constant functions on general weighted graphs

Loic Landrieu 1, 2, * Guillaume Obozinski 2
* Corresponding author
1 MATIS - Méthodes d'Analyses pour le Traitement d'Images et la Stéréorestitution
LaSTIG - Laboratoire des Sciences et Technologies de l'Information Géographique
Abstract : We propose working-set/greedy algorithms to efficiently solve problems penalized respectively by the total variation on a general weighted graph and its L0 counterpart the Mumford Shah total level-set boundary size when the piecewise constant solutions have a small number of distinct level-sets; this is typically the case when the total level-set boundary size is small, which is encouraged by these two forms of penalization. Our algorithms exploit this structure by recursively splitting the level-sets of a piecewise-constant candidate solution using graph cuts. We obtain significant speed-ups over state-of-the-art algorithms for images that are well approximated with few level-sets
Document type :
Journal articles
Complete list of metadata

Cited literature [71 references]  Display  Hide  Download
Contributor : Loic Landrieu <>
Submitted on : Monday, August 21, 2017 - 3:24:44 PM
Last modification on : Tuesday, May 4, 2021 - 6:13:17 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License


  • HAL Id : hal-01306779, version 4


Loic Landrieu, Guillaume Obozinski. Cut Pursuit: fast algorithms to learn piecewise constant functions on general weighted graphs. SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, 2017, Vol. 10 ( No. 4 ), pp. 1724-1766. ⟨hal-01306779v4⟩



Record views


Files downloads