Combinatorial Algorithms for the Markov Random Fields problem and implications for ranking, clustering, group decision making and image segmentation

Combinatorial Algorithms for the Markov Random Fields problem and implications for ranking, clustering, group decision making and image segmentation

Other Related Seminars
Mar 17, 2014, 04:00 PM - 05:00 PM | 3108 Etcheverry Hall | Happening As Scheduled
Dorit Hochbaum, Univeristy of California, Berkeley
One of the classical optimization models for image segmentation is the well-known Markov Random Fields (MRF) model. The MRF problem involves minimizing pairwise-separation and singleton-deviation terms. This model is shown here to be powerful in representing classical problems of ranking, group decision making and clustering. The techniques presented are stronger than continuous techniques used...