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

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
Liste complète des métadonnées

Cited literature [71 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01306779
Contributor : Loic Landrieu <>
Submitted on : Monday, August 21, 2017 - 3:24:44 PM
Last modification on : Friday, April 19, 2019 - 1:28:12 PM

File

cutpursuit.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

  • HAL Id : hal-01306779, version 4

Citation

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. ⟨http://epubs.siam.org/doi/ref/10.1137/17M1113436⟩. ⟨hal-01306779v4⟩

Share

Metrics

Record views

544

Files downloads

860