Valued Constraint Satisfaction Problems
42 mins 4 secs,
612.52 MB,
MPEG-4 Video
640x360,
29.97 fps,
44100 Hz,
1.94 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Kolmogorov, V
Wednesday 6th September 2017 - 11:10 to 12:00 |
|---|
| Created: | 2017-09-07 13:27 |
|---|---|
| Collection: | Variational methods and effective algorithms for imaging and vision |
| Publisher: | Isaac Newton Institute |
| Copyright: | Kolmogorov, V |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | I will consider the Valued Constraint Satisfaction Problem (VCSP), whose goal is to minimize a sum of local terms where each term comes from a fixed set of functions (called a "language") over a fixed discrete domain. I will present recent results characterizing languages that can be solved using the basic LP relaxation. This includes languages consisting of submodular functions, as well as their generalizations.
One of such generalizations is k-submodular functions. In the second part of the talk I will present an application of such functions in computer vision. Based on joint papers with Igor Gridchyn, Andrei Krokhin, Michal Rolinek, Johan Thapper and Stanislav Zivny. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 640x360 | 1.94 Mbits/sec | 612.52 MB | View | Download | |
| WebM | 640x360 | 459.12 kbits/sec | 141.52 MB | View | Download | |
| iPod Video | 480x270 | 522.14 kbits/sec | 160.88 MB | View | Download | |
| MP3 | 44100 Hz | 249.73 kbits/sec | 77.04 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||