Sciweavers

195 search results - page 22 / 39
» Fusion Moves for Markov Random Field Optimization
Sort
View
FS
2006
81views more  FS 2006»
13 years 7 months ago
Optimal portfolio choice in the bond market
We consider the Merton problem of optimal portfolio choice when the traded instruments are the set of zero-coupon bonds. Working within an infinite-factor Markovian Heath-Jarrow-Mo...
Nathanael Ringer, Michael Tehranchi
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
PAMI
2007
176views more  PAMI 2007»
13 years 7 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
ICPR
2006
IEEE
14 years 8 months ago
Image Renaissance Using Discrete Optimization
In this paper we propose a novel technique to image completion that addresses image renaissance through a graph-based matching process. To this end, a number of candidate seeds wi...
Cédric Allène, Nikos Paragios
CVPR
2009
IEEE
15 years 2 months ago
Continuous Maximal Flows and Wulff Shapes: Application to MRFs
Convex and continuous energy formulations for low level vision problems enable efficient search procedures for the corresponding globally optimal solutions. In this work we exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...