On learning higher-order consistency potentials for multi-class pixel labeling
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part II
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
Joint tumor segmentation and dense deformable registration of brain MR images
MICCAI'12 Proceedings of the 15th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
Computer Vision and Image Understanding
| Hi-index | 0.00 |
We present a very general algorithmic framework for structured prediction learning that is able to efficiently handle both pairwise and higher-order discrete MRFs/CRFs^1. It relies on a dual decomposition approach that has been recently proposed for MRF optimization. By properly combining this approach with a max-margin method, our framework manages to reduce the training of a complex high-order MRF to the parallel training of a series of simple slave MRFs that are much easier to handle. This leads to an extremely efficient and general learning scheme. Furthermore, the proposed framework can yield learning algorithms of increasing accuracy since it naturally allows a hierarchy of convex relaxations to be used for MRF inference within a max-margin learning approach. It also offers extreme flexibility and can be easily adapted to take advantage of any special structure of a given class of MRFs. Experimental results demonstrate the great effectiveness of our method.