Skip navigation
Skip navigation

Iteratively reweighted graph cut for multi-label MRFs with non-convex priors

Ajanthan, Thalaiyasingam; Hartley, Richard; Salzmann, Mathieu; Li, Hongdong


While widely acknowledged as highly effective in computer vision, multi-label MRFs with non-convex priors are difficult to optimize. To tackle this, we introduce an algorithm that iteratively approximates the original energy with an appropriately weighted surrogate energy that is easier to minimize. Our algorithm guarantees that the original energy decreases at each iteration. In particular, we consider the scenario where the global minimizer of the weighted surrogate energy can be obtained by...[Show more]

CollectionsANU Research Publications
Date published: 2015
Type: Conference paper
Source: Exemplar Hidden Markov Models for Classification of Facial Expressions in Videos
DOI: 10.1109/CVPR.2015.7299150


File Description SizeFormat Image
01_Ajanthan_Iteratively_reweighted_graph_2015.pdf463.26 kBAdobe PDF    Request a copy
02_Ajanthan_Iteratively_reweighted_graph_2015.pdf303.05 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator