T-Space at The University of Toronto Libraries >
School of Graduate Studies - Theses >
Please use this identifier to cite or link to this item:
|Title: ||Message Passing Algorithms for Facility Location Problems|
|Authors: ||Lazic, Nevena|
|Advisor: ||Aarabi, Parham|
Frey, Brendan J.
|Department: ||Electrical and Computer Engineering|
|Keywords: ||probabilistic graphical models|
|Issue Date: ||9-Jun-2011|
|Abstract: ||Discrete location analysis is one of the most widely studied branches of operations research, whose applications arise in a wide variety of settings. This thesis describes a powerful new approach to facility location problems - that of message passing inference in probabilistic graphical models. Using this framework, we develop new heuristic algorithms, as well as a new approximation algorithm for a particular problem type.
In machine learning applications, facility location can be seen a discrete formulation of clustering and mixture modeling problems. We apply the developed algorithms to such problems in computer vision. We tackle the problem of motion segmentation in video sequences by formulating it as a facility location instance and demonstrate the advantages of message passing algorithms over current segmentation methods.|
|Appears in Collections:||Doctoral|
Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.