Abstract | ||
---|---|---|
We show how certain nonconvex optimization problems that arise in image processing and computer vision can be restated as convex minimization problems. This allows, in particular, the finding of global minimizers via standard convex minimization schemes. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1137/040615286 | SIAM JOURNAL ON APPLIED MATHEMATICS |
Keywords | DocType | Volume |
denoising,segmentation | Journal | 66 |
Issue | ISSN | Citations |
5 | 0036-1399 | 169 |
PageRank | References | Authors |
7.43 | 12 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mila Nikolova | 1 | 1792 | 105.71 |
Selim Esedoglu | 2 | 1000 | 49.59 |
Tony F. Chan | 3 | 8733 | 659.77 |