-
1
-
-
0003515463
-
-
Prentice Hall
-
R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
-
(1993)
Network Flows: Theory, Algorithms, and Applications.
-
-
Ahuja, R.1
Magnanti, T.2
Orlin, J.3
-
2
-
-
0028518325
-
Improved algorithms for bipartite network flow
-
R. K. Ahuja, J. B. Orlin, and C. Stein. Improved algorithms for bipartite network flow. SIAM J. Computing, 23(5), 1994.
-
(1994)
SIAM J. Computing
, vol.23
, Issue.5
-
-
Ahuja, R.K.1
Orlin, J.B.2
Stein, C.3
-
4
-
-
70450159716
-
Learning statistical priors for efficient combinatorial optimization via graph cuts
-
D. Cremers and L. Grady. Learning statistical priors for efficient combinatorial optimization via graph cuts. In ECCV, 2006.
-
(2006)
ECCV
-
-
Cremers, D.1
Grady, L.2
-
5
-
-
77953221790
-
Exact MAP States and Expectations from Perfect Sampling: Greig, Porteous and Seheult revisited
-
C. Fox and G. Nicholls. Exact MAP States and Expectations from Perfect Sampling: Greig, Porteous and Seheult revisited. In AIP conf.
-
AIP Conf.
-
-
Fox, C.1
Nicholls, G.2
-
6
-
-
1942500856
-
Active contours for tracking distributions
-
D. Freedman and T. Zhang. Active contours for tracking distributions. PAMI, 13(4), 2004.
-
(2004)
PAMI
, vol.13
, Issue.4
-
-
Freedman, D.1
Zhang, T.2
-
8
-
-
57349155750
-
Efficient inference with cardinality-based clique potentials
-
R. Gupta, A. Diwan, and S. Sarawagi. Efficient inference with cardinality-based clique potentials. In ICML, '07.
-
ICML
, vol.7
-
-
Gupta, R.1
Diwan, A.2
Sarawagi, S.3
-
9
-
-
51949098412
-
Robust higher order potentials for enforcing label consistency
-
P. Kohli, L. Ladicky, and P. H. S. Torr. Robust higher order potentials for enforcing label consistency. In CVPR, 2008.
-
(2008)
CVPR
-
-
Kohli, P.1
Ladicky, L.2
Torr, P.H.S.3
-
10
-
-
33750129298
-
Convergent tree-reweighted message passing for energy minimization
-
V. Kolmogorov. Convergent tree-reweighted message passing for energy minimization. PAMI, 28(10), 2006.
-
(2006)
PAMI
, vol.28
, Issue.10
-
-
Kolmogorov, V.1
-
11
-
-
50649122028
-
Applications of parametric maxflow in computer vision
-
V. Kolmogorov, Y. Boykov, and C. Rother. Applications of parametric maxflow in computer vision. In ICCV, 2007.
-
(2007)
ICCV
-
-
Kolmogorov, V.1
Boykov, Y.2
Rother, C.3
-
12
-
-
34249656812
-
Minimizing non-submodular functions with graph cuts - A review
-
V. Kolmogorov and C. Rother. Minimizing non-submodular functions with graph cuts - a review. PAMI, 29(7):1274-1279, 2007.
-
(2007)
PAMI
, vol.29
, Issue.7
, pp. 1274-1279
-
-
Kolmogorov, V.1
Rother, C.2
-
13
-
-
50649087920
-
MRF optimization via dual decomposition: Message-passing revisited
-
N. Komodakis, N. Paragios, and G. Tziritas. MRF optimization via dual decomposition: Message-passing revisited. In ICCV, 2007.
-
(2007)
ICCV
-
-
Komodakis, N.1
Paragios, N.2
Tziritas, G.3
-
14
-
-
34547676164
-
Solid Texture Synthesis from 2D Exemplars
-
J. Kopf, C.-W. Fu, D. Cohen-Or, O. Deussen, D. Lischinski, and T.-T. Wong. Solid Texture Synthesis from 2D Exemplars. SIGGRAPH, 26(3):2:1-2:9, 2007.
-
(2007)
SIGGRAPH
, vol.26
, Issue.3
-
-
Kopf, J.1
Fu, C.-W.2
Cohen-Or, D.3
Deussen, O.4
Lischinski, D.5
Wong, T.-T.6
-
15
-
-
77954004426
-
Graphcut textures: Image and video synthesis using graph cuts
-
July
-
V. Kwatra, A. Schödl, I. Essa, G. Turk, and A. Bobick. Graphcut textures: Image and video synthesis using graph cuts. SIGGRAPH, July 2003.
-
(2003)
SIGGRAPH
-
-
Kwatra, V.1
Schödl, A.2
Essa, I.3
Turk, G.4
Bobick, A.5
-
16
-
-
84877632511
-
Grabcut - Interactive foreground extraction using iterated graph cuts
-
August
-
C. Rother, V. Kolmogorov, and A. Blake. Grabcut - interactive foreground extraction using iterated graph cuts. SIGGRAPH, August 2004.
-
(2004)
SIGGRAPH
-
-
Rother, C.1
Kolmogorov, V.2
Blake, A.3
-
17
-
-
77956003870
-
Cosegmentation of image pairs by histogram matching - Incorporating a global constraint into MRFs
-
C. Rother, V. Kolmogorov, T. Minka, and A. Blake. Cosegmentation of image pairs by histogram matching - incorporating a global constraint into MRFs. In CVPR, 06.
-
CVPR
, vol.6
-
-
Rother, C.1
Kolmogorov, V.2
Minka, T.3
Blake, A.4
-
18
-
-
77953203040
-
Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 1
-
M. I. Schlesinger and V. V. Giginyak. Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 1. Contr. Syst. and Comp., (1).
-
Contr. Syst. and Comp.
, Issue.1
-
-
Schlesinger, M.I.1
Giginyak, V.V.2
-
19
-
-
77953203040
-
Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 2
-
M. I. Schlesinger and V. V. Giginyak. Solution to structural recognition (MAX,+)-problems by their equivalent transformations. Part 2. Contr. Syst. and Comp., (2).
-
Contr. Syst. and Comp.
, Issue.2
-
-
Schlesinger, M.I.1
Giginyak, V.V.2
-
20
-
-
77953223152
-
Shared Segmentation of Natural Scenes Using Dependent Pitman-Yor Processes
-
E. Sudderth and M. Jordan. Shared Segmentation of Natural Scenes Using Dependent Pitman-Yor Processes. In NIPS, 08.
-
NIPS
, vol.8
-
-
Sudderth, E.1
Jordan, M.2
-
21
-
-
0036566199
-
Image Segmentation by Data-Driven Markov Chain Monte Carlo
-
Z. Tu and S.-C. Zhu. Image Segmentation by Data-Driven Markov Chain Monte Carlo. PAMI, 24(5), 2002.
-
(2002)
PAMI
, vol.24
, Issue.5
-
-
Tu, Z.1
Zhu, S.-C.2
-
22
-
-
77953225043
-
Joint optimization of segmentation and appearance models
-
S. Vicente, V. Kolmogorov, and C. Rother. Joint optimization of segmentation and appearance models. In ICCV, 2009.
-
(2009)
ICCV
-
-
Vicente, S.1
Kolmogorov, V.2
Rother, C.3
-
23
-
-
27744456278
-
MAP estimation via agreement on trees: Message-passing and linear-programming approaches
-
M. Wainwright, T. Jaakkola, and A. Willsky. MAP estimation via agreement on trees: Message-passing and linear-programming approaches. IEEE Trans. Information Theory, 51(11), 2005.
-
(2005)
IEEE Trans. Information Theory
, vol.51
, Issue.11
-
-
Wainwright, M.1
Jaakkola, T.2
Willsky, A.3
-
24
-
-
51949116660
-
High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)
-
T. Werner. High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF). In CVPR, 2008.
-
(2008)
CVPR
-
-
Werner, T.1
-
27
-
-
0002584347
-
FRAME: Filters, Random fields and Maximum Entropy - Towards a unified theory for texture modeling
-
S.-C. Zhu, Y. Wu, and D. Mumford. FRAME: Filters, Random fields And Maximum Entropy - towards a unified theory for texture modeling. IJCV, 27:1-20, 1998.
-
(1998)
IJCV
, vol.27
, pp. 1-20
-
-
Zhu, S.-C.1
Wu, Y.2
Mumford, D.3
|