Direkt zum Inhalt springen
Computer Vision Group
TUM Department of Informatics
Technical University of Munich

Technical University of Munich

Menu
Home Teaching Summer Semester 2019 Probabilistic Graphical Models in Computer Vision (IN2329) (2h + 2h, 5 ECTS)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
teaching:ss2019:pgm2019 [2019/07/10 03:31]
Tao Wu
teaching:ss2019:pgm2019 [2019/07/13 01:43]
Tao Wu
Line 12: Line 12:
 </b> </b>
 </​html>​ \\ </​html>​ \\
-Several problems in computer vision can be cast as a labeling problem. Typically, such problems arise from Markov Random Field (MRFmodels, 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 ​others ​are NP hard. We will see bothefficient algorithms for solving the nice“ problems and relaxation strategies for the hard“ ones.\\+Under certain assumptions some "nice" ​MRF models can be solved in polynomial time, whereas ​other approaches ​are NP hard. We will see both efficient algorithms for solving the "nice" ​problems and relaxation strategies for the "hard" ​ones.\\
  
 {{ :​teaching:​ss2019:​pgm2019:​graph_model_1.png?​500 |}}\\ {{ :​teaching:​ss2019:​pgm2019:​graph_model_1.png?​500 |}}\\

Rechte Seite

Informatik IX
Chair of Computer Vision & Artificial Intelligence

Boltzmannstrasse 3
85748 Garching

info@vision.in.tum.de