-
1
-
-
0021518209
-
Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
-
D. Geman and S. Geman, "Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images," PAMI, vol. 6, pp. 721-741, 1984.
-
(1984)
PAMI
, vol.6
, pp. 721-741
-
-
Geman, D.1
Geman, S.2
-
2
-
-
43249091850
-
A comparative study of energy minimization methods for markov random fields with smoothness-based priors
-
R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother, "A comparative study of energy minimization methods for markov random fields with smoothness-based priors," PAMI., vol. 30, no. 6, pp. 1068-1080, 2008.
-
(2008)
PAMI
, vol.30
, Issue.6
, pp. 1068-1080
-
-
Szeliski, R.1
Zabih, R.2
Scharstein, D.3
Veksler, O.4
Kolmogorov, V.5
Agarwala, A.6
Tappen, M.7
Rother, C.8
-
3
-
-
70249100926
-
Global optimization for first order Markov random fields with submodular priors
-
J. Darbon, "Global optimization for first order Markov random fields with submodular priors," in IWCIA, 2008, pp. 229-237.
-
(2008)
IWCIA
, pp. 229-237
-
-
Darbon, J.1
-
4
-
-
0142039762
-
Exact optimization for Markov random fields with convex priors
-
October
-
H. Ishikawa, "Exact optimization for Markov random fields with convex priors," PAMI, vol. 25, no. 10, pp. 1333-1336, October 2003.
-
(2003)
PAMI
, vol.25
, Issue.10
, pp. 1333-1336
-
-
Ishikawa, H.1
-
5
-
-
0742286180
-
What energy functions can be minimized via graph cuts?
-
V. Kolmogorov and R. Zabih, "What energy functions can be minimized via graph cuts?," PAMI, vol. 26, no. 2, pp. 147-159, 2004.
-
(2004)
PAMI
, vol.26
, Issue.2
, pp. 147-159
-
-
Kolmogorov, V.1
Zabih, R.2
-
6
-
-
0035509961
-
Fast approximate energy minimization via graph cuts
-
Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energy minimization via graph cuts," PAMI, vol. 23, no. 11, pp. 1222-1239, 2001.
-
(2001)
PAMI
, vol.23
, Issue.11
, pp. 1222-1239
-
-
Boykov, Y.1
Veksler, O.2
Zabih, R.3
-
7
-
-
0016565825
-
Minimum cuts and related problem
-
J.P. Picard and H.D. Ratlif, "Minimum cuts and related problem," Networks, vol. 5, pp. 357-370, 1975.
-
(1975)
Networks
, vol.5
, pp. 357-370
-
-
Picard, J.P.1
Ratlif, H.D.2
-
8
-
-
33845478943
-
Image restoration with discrete constrained Total Variation part II: Levelable functions, convex priors and non-convex cases
-
December
-
J. Darbon and M. Sigelle, "Image restoration with discrete constrained Total Variation part II: Levelable functions, convex priors and non-convex cases," JMIV, vol. 26, no. 3, pp. 277-291, December 2006.
-
(2006)
JMIV
, vol.26
, Issue.3
, pp. 277-291
-
-
Darbon, J.1
Sigelle, M.2
-
10
-
-
38149047343
-
Graph cut based optimization for mrfs with truncated convex priors
-
O. Veksler, "Graph cut based optimization for mrfs with truncated convex priors," in IEEE CVPR, 2007.
-
(2007)
IEEE CVPR
-
-
Veksler, O.1
-
11
-
-
2442549031
-
Maximum a posteriori estimation of height profiles in InSAR imaging
-
april
-
G. Ferraiuolo, V. Pascazio, and G. Schirinzi, "Maximum a posteriori estimation of height profiles in InSAR imaging," IEEE Geoscience and Remote Sensing Letters, vol. 1, pp. 66-70, april 2004.
-
(2004)
IEEE Geoscience and Remote Sensing Letters
, vol.1
, pp. 66-70
-
-
Ferraiuolo, G.1
Pascazio, V.2
Schirinzi, G.3
|