 |
Conference papers
Cut Pursuit: fast algorithms to learn piecewise constant functions
Abstract : We propose working-set/greedy algorithms to efficiently find the solutions to convex optimization problems penalized respectively by the total variation and the Mumford Shah boundary size. Our algorithms exploit the piecewise constant structure of the level-sets of the solutions by recursively splitting them using graph cuts. We obtain significant speed up on images that can be approximated with few level-sets compared to state-of-the-art algorithms .
Cited literature [4 references]
https://hal.archives-ouvertes.fr/hal-01306786
Contributor : Loic Landrieu <>
Submitted on : Monday, April 25, 2016 - 3:17:40 PM
Last modification on : Monday, April 20, 2020 - 8:40:02 AM
Document(s) archivé(s) le : Tuesday, November 15, 2016 - 11:45:10 AM
Contributor : Loic Landrieu <>
Submitted on : Monday, April 25, 2016 - 3:17:40 PM
Last modification on : Monday, April 20, 2020 - 8:40:02 AM
Document(s) archivé(s) le : Tuesday, November 15, 2016 - 11:45:10 AM
Files
aistat2016_landrieu.pdf
Files produced by the author(s)
- aistat2016-landrieu-supp.pdf Files produced by the author(s)
