Name
Abstract | ||
|---|---|---|
This paper deals with the total variation minimization problem when the fidelity is either the L2-norm or the L1-norm. We propose an algorithm which computes the exact solution of these two problems after discretization. Our method relies on the decomposition of an image into its level sets. It maps the original problems into independent binary Markov Random Field optimization problems associated with each level set. Exact solutions of these binary problems are found thanks to minimum-cut techniques. We prove that these binary solutions are increasing and thus allow to reconstruct the solution of the original problems. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-30503-3_40 | IWCIA |
Keywords | Field | DocType |
exact optimization,total variation minimization problem,exact solution,paper deal,markov random field optimization,binary solution,original problem,level set,independent binary,binary problem,optimization problem,minimum cut | Discretization,Mathematical optimization,Markov process,Computer science,Markov random field,Level set,Optimization problem,Binary number,Constrained optimization,Covering problems | Conference |
Volume | ISSN | ISBN |
3322 | 0302-9743 | 3-540-23942-1 |
Citations | PageRank | References |
14 | 2.28 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jérôme Darbon | 1 | 512 | 41.96 |
| Marc Sigelle | 2 | 316 | 34.12 |