Abstract
Functional lifting methods are a promising approach to determine optimal or near-optimal solutions to difficult nonconvex variational problems. Yet, they come with increased memory demands, limiting their practicability. To overcome this drawback, this paper presents a combination of two approaches designed to make liftings more scalable, namely product-space relaxations and sublabel-accurate discretizations. Our main contribution is a simple way to solve the resulting semi-infinite optimization problem with a sampling strategy. We show that despite its simplicity, our approach significantly outperforms baseline methods, in the sense that it finds solutions with lower energies given the same amount of memory. We demonstrate our empirical findings on the nonconvex optical flow and manifold-valued denoising problems.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 43rd DAGM German Conference on Pattern Recognition |
| Editors | Christian Bauckhage, Juergen Gall, Alexander Schwing |
| Place of Publication | Cham, Switzerland |
| Publisher | Springer Cham |
| Pages | 3-17 |
| Number of pages | 15 |
| ISBN (Electronic) | 9783030926595 |
| ISBN (Print) | 9783030926588 |
| DOIs | |
| Publication status | Published - 13 Jan 2022 |
| Event | 43rd DAGM German Conference on Pattern Recognition - Virtual Duration: 28 Sept 2021 → 1 Oct 2021 Conference number: 43 http://www.wikicfp.com/cfp/servlet/event.showcfp?eventid=125183©ownerid=6365 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer Cham |
| Volume | 13024 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Symposium
| Symposium | 43rd DAGM German Conference on Pattern Recognition |
|---|---|
| Abbreviated title | DAGM GCPR 2021 |
| Period | 28/09/21 → 1/10/21 |
| Internet address |
Keywords / Materials (for Non-textual outputs)
- variational methods
- manifold-valued problems
- convex relaxation
- global optimization