Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
teaching:ss2019:pgm2019 [2019/07/01 19:23] wuta |
teaching:ss2019:pgm2019 [2019/07/13 01:43] wuta |
||
---|---|---|---|
Line 2: | Line 2: | ||
< | < | ||
<b> Announcement: | <b> Announcement: | ||
- | The lecture on 22.07 will be on deep Boltzmann machines presented by [[: | + | There was an error in the exercise sheet 9, which is corrected now (2019.07.09 16:00). \\ |
- | There will be NO tutorial on Wednesday, 12.06.2019. Sheet5 should be submitted on 17.06. | + | The last lecture on 22.07 will be on deep Boltzmann machines presented by [[: |
+ | There will be NO tutorial on Wednesday, 12.06.2019. Sheet5 should be submitted on 17.06. | ||
There will be NO lecture on Wednesday, 24.04.2019.\\ | There will be NO lecture on Wednesday, 24.04.2019.\\ | ||
Line 11: | Line 12: | ||
</b> | </b> | ||
</ | </ | ||
- | Several problems in computer vision can be cast as a labeling problem. Typically, such problems arise from Markov Random Field (MRF) models, which provide an elegant framework of formulating various types of labeling problems in imaging. | + | Several problems in computer vision can be cast as a labeling problem. Typically, such problems arise from Markov Random Field (undirected graphical models), which provide an elegant framework of formulating various types of labeling problems in vision. |
- | By making use of certain assumptions some „nice“ MRF models can be solved in polynomial time, whereas | + | Under certain assumptions some "nice" |
{{ : | {{ : |