Fetching the paper…
Reading the bibliography…
Markov Random Fields (MRFs) are a popular model for several pattern recognition and reconstruction problems in robotics and computer vision.
S. Jegelka and J. Bilmes, “Submodularity beyond submodular energies: Coupling edges in graph cuts,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) . IEEE, 2011, pp. 1897–1904
1904
Earlier work this paper cites.
R. B. Potts and C. Domb, “Some generalized order-disorder transformations,” Mathematical Proceedings of the Cambridge Philosophical Society , vol. 48, no. 01, p. 106, 1952
1952
Earlier work this paper cites.
P. L. Ivănescu, “Some Network Flow Problems Solved with Pseudo-Boolean Programming,” Operations Research , vol. 13, no. 3, pp. 388–399, 1965
1965
Earlier work this paper cites.
Geman, S and Geman, D, “Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 6, no. 6, pp. 721–741, 1984
1984
Earlier work this paper cites.
A. Schrijver, Theory of Linear and Integer Programming . New York, NY, USA: John Wiley & Sons, Inc., 1986
1986
Earlier work this paper cites.
J. Besag, “On the statistical analysis of dirty pictures,” J. Royal Statistical Soc. , vol. 48, no. 3, pp. 48–259, 1986
1986
Earlier work this paper cites.
M. Guignard and S. Kim, “Lagrangean decomposition: A model yielding stronger lagrangean bounds,” Mathematical Programming , vol. 39, no. 2, pp. 215–228, 1987
1987
Earlier work this paper cites.
M. Kass, A. Witkin, and D. Terzopoulos, “Snakes: Active Contour Models,” Intl. J. of Computer Vision , vol. 1, no. 4, pp. 321–331, 1987
1987
Earlier work this paper cites.
J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference . Morgan Kaufmann, 1988
1988
Earlier work this paper cites.
D. Greig, B. Porteous, and A. Seheult, “Exact Maximum A Posteriori Estimation for Binary Images,” J. Royal Statistical Soc. , vol. 51, no. 2, pp. 271–279, 1989
1989
Earlier work this paper cites.
P. Tseng, “Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach,” SIAM J. Control Optim. , vol. 28, no. 1, pp. 214–242, 1990
1990
Earlier work this paper cites.
A. Amini, T. Weymouth, and R. Jain, “Using dynamic programming for solving variational problems in vision,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 12, no. 9, pp. 855–867, 1990
1990
Earlier work this paper cites.
M. Goemans and D. Williamson, “Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming,” J. ACM , vol. 42, no. 6, pp. 1115–1145, 1995
1995
Earlier work this paper cites.
F. Alizadeh, “Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization,” SIAM Journal on Optimization , vol. 5, no. 1, pp. 13–51, 1995
1995
Earlier work this paper cites.
S. Poljak, F. Rendl, and H. Wolkowicz, “A recipe for semidefinite relaxation for (0,1)-quadratic programming,” Journal of Global Optimization , vol. 7, no. 1, pp. 51–73, 1995
1995
Earlier work this paper cites.
E. Mortensen and W. Barrett, “Intelligent scissors for image composition,” in SIGGRAPH , 1995, pp. 191–198
1995
Earlier work this paper cites.
L. Vandenberghe and S. Boyd, “Semidefinite programming,” SIAM Rev. , vol. 38, no. 1, pp. 49–95, 1996
1996
Earlier work this paper cites.
Y. Amit and A. Kong, “Graphical templates for model registration,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 18, no. 3, pp. 225–236, 1996
1996
Earlier work this paper cites.
H. Ishikawa and D. Geiger, “Occlusions, discontinuities, and epipolar lines in stereo,” in European Conf. on Computer Vision (ECCV) , H. Burkhardt and B. Neumann, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998, pp. 232–248
1998
Earlier work this paper cites.
Y. Boykov, O. Veksler, and R. Zabih, “Markov Random Fields with Efficient Approximations,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 1998
1998
Earlier work this paper cites.
S. Birchfield and C. Tomasi, “A pixel dissimilarity measure that is insensitive to image sampling,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 20, no. 4, pp. 401–406, 1998
1998
Earlier work this paper cites.
Q. Zhao, S. Karisch, F. Rendl, and H. H. Wolkowicz, “Semidefinite programming relaxations for the quadratic assignment problem,” Journal of Combinatorial Optimization , vol. 2, no. 1, pp. 71–109, 1998
1998
Earlier work this paper cites.
H. Ishikawa and D. Geiger, “Segmentation by grouping junctions,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 1998, pp. 125–131
1998
Earlier work this paper cites.
S. Roy and I. J. Cox, “A Maximum-Flow Formulation of the N-camera Stereo Correspondence Problem,” in Intl. Conf. on Computer Vision (ICCV) , 1998, pp. 492–499
1998
Earlier work this paper cites.
W. Freeman and E. Pasztor, “Learning low-level vision,” Intl. J. of Computer Vision , vol. 40, pp. 25–47, 1999
1999
Earlier work this paper cites.
J. Kleinberg and E. Tardos, “Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov Random Fields,” in Proc. of the 40th Annual Symposium on Foundations of Computer Science , 1999
1999
Earlier work this paper cites.
S. Birchfield and C. Tomasi, “Multiway cut for stereo and motion with slanted surfaces,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , vol. 1, 1999, pp. 489–495
1999
Earlier work this paper cites.
S. Roy, “Stereo without epipolar lines: A maximum-flow formulation,” Intl. J. of Computer Vision , vol. 34, no. 2, pp. 147–161, Aug 1999. [Online]. Available: https://doi.org/10.1023/A:1008192004934
1999
Earlier work this paper cites.
A. Gupta and É. Tardos, “A constant factor approximation algorithm for a class of classification problems,” in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing , 2000
2000
Earlier work this paper cites.
J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 24, no. 5, 2000
2000
Earlier work this paper cites.
D. Snow, P. Viola, and R. Zabih, “Exact voxel occupancy with graph cuts,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , vol. 1, 2000, pp. 345–352 vol.1
2000
Earlier work this paper cites.
Y. Boykov and M.-P. Jolly, “Interactive Organ Segmentation Using Graph Cuts,” 2000
2000
Earlier work this paper cites.
J. Kim, J. F. III, A. Tsai, C. Wible, A. Willsky, and W. W. III, “Incorporating spatial priors into an information theoretic approach for fmri data analysis,” in Proc. of the Third International Conference on Medical Image Computing and Computer-Assisted Intervention , ser. MICCAI ’00. London, UK, UK: Springer-Verlag, 2000, pp. 62–71. [Online]. Available: http://dl.acm.org/citation.cfm?id=646923.710388
2000
Earlier work this paper cites.
Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 23, no. 11, pp. 1222–1239, 2001
2001
Earlier work this paper cites.
Y. Weiss and W. T. Freeman, “On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs,” IEEE Trans. on Information Theory , vol. 47, no. 2, pp. 736–744, 2001
2001
Earlier work this paper cites.
D. S. Hochbaum, “An efficient algorithm for image segmentation, Markov random fields and related problems,” Journal of the ACM , vol. 48, no. 4, pp. 686–701, 2001
2001
Earlier work this paper cites.
C. Chekuri, S. Khanna, J. Naor, and L. Zosin, “Approximation algorithms for the metric labeling problem via a new linear programming formulation,” in Proc. of the Annual ACM-SIAM Symposium on Discrete Algorithms , 2001, pp. 109–118
2001
Earlier work this paper cites.
K. Anstreicher and N. Brixius, “A new bound for the quadratic assignment problem based on convex quadratic programming,” Mathematical Programming , vol. 89, no. 3, pp. 341–357, 2001
2001
Earlier work this paper cites.
V. Kolmogorov and R. Zabih, “Computing visual correspondence with occlusions using graph cuts,” in Intl. Conf. on Computer Vision (ICCV) , vol. 2, 2001, pp. 508–515 vol.2
2001
Earlier work this paper cites.
S. Hu, E. Hoffman, and J. Reinhardt, “Automatic lung segmentation for accurate quantization of volumetric X-ray CT images,” IEEE Transactions on Medical Imaging , vol. 20, no. 6, pp. 490–498, 2001
2001
Earlier work this paper cites.
E. Boros and P. L. Hammer, “Pseudo-boolean optimization,” Discrete Applied Mathematics , vol. 123, no. 1, pp. 155–225, 2002. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0166218X01003419
2002
Earlier work this paper cites.
D. Scharstein and R. Szeliski, “A taxonomy and evaluation of dense two-frame stereo correspondence algorithms,” Intl. J. of Computer Vision , vol. 47, no. 1, pp. 7–42, 2002
2002
Earlier work this paper cites.
V. Kolmogorov and R. Zabih, “Multi-camera scene reconstruction via graph cuts,” in European Conf. on Computer Vision (ECCV) , 2002
2002
Earlier work this paper cites.
J. Keuchel, C. Schnörr, C. Schellewald, and D. Cremers, “Binary partitioning, perceptual grouping, and restoration with semidefinite programming,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 25, pp. 1364–1379, 2003
2003
Earlier work this paper cites.
S. Burer and R. Monteiro, “A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization,” Mathematical Programming , vol. 95, no. 2, pp. 329–357, 2003
2003
Cited alongside, same era.
H. Ishikawa, “Exact optimization for markov random fields with convex priors,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 25, no. 10, pp. 1333–1336, 2003
2003
Cited alongside, same era.
P. H. S. Torr, “Solving markov random fields using semi definite programming,” in International Workshop on Artificial Intelligence and Statistics (AISTATS) , 2003
2003
Cited alongside, same era.
M. J. Wainwright and M. I. Jordan, “Semidefinite relaxations for approximate inference on graphs with cycles,” in Advances in Neural Information Processing Systems (NIPS) , 2003, pp. 369–376
2003
Cited alongside, same era.
F. Schroff, A. Criminisi, and A. Zisserman, “Object class segmentation using random forests,” in British Machine Vision Conf. (BMVC) , 2008
2008
Later among the works it cites.
P. Kohli, L. Ladicky, and P. Torr, “Robust higher order potentials for enforcing label consistency,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2008, pp. 1–8
2008
Later among the works it cites.
M. Kumar and D. Koller, “MAP Estimation of Semi-metric MRFs via Hierarchical Graph Cuts,” in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI) , 2009, pp. 313–320
2009
Later among the works it cites.
P. Torr and M. Kumar, “Improved moves for truncated convex models,” in Advances in Neural Information Processing Systems (NIPS) , 2009, pp. 889–896
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
M. Tappen and W. Freeman, “Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters,” in Intl. Conf. on Computer Vision (ICCV) , 2003, pp. 900–907
2003
Cited alongside, same era.
J. Keuchel, M. Heiler, and C. Schnörr, “Hierarchical Image Segmentation Based on Semidefinite Programming.” DAGM-Symposium , vol. 3175, no. Chapter 15, pp. 120–128, 2004
2004
Cited alongside, same era.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge University Press, 2004
2004
Cited alongside, same era.
V. Kolmogorov and R. Zabih, “What energy functions can be minimized via graph cuts?” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 26, no. 2, pp. 147–159, 2004
2004
Cited alongside, same era.
M. Wainwright, T. Jaakkola, and A. Willsky, “Tree consistency and bounds on the performance of the max-product algorithm and its generalizations,” Statistics and Computing , vol. 14, no. 2, pp. 143–166, 2004
2004
Cited alongside, same era.
A. Agarwala, M. Dontcheva, M. Agrawala, S. Drucker, A. Colburn, B. Curless, D. Salesin, and M. Cohen, “Interactive digital photomontage,” ACM Trans. Graph. , vol. 23, no. 3, pp. 294–302, 2004
2004
Cited alongside, same era.
C. Rother, V. Kolmogorov, and A. Blake, “GrabCut -interactive foreground extraction using iterated graph cuts,” in SIGGRAPH , 2004
2004
Cited alongside, same era.
2009
Later among the works it cites.
P. Kohli, L. Ladický, and P. Torr, “Robust higher order potentials for enforcing label consistency,” Intl. J. of Computer Vision , vol. 82, no. 3, pp. 302–324, 2009
2009
Later among the works it cites.
J. Lellmann, F. Becker, and C. Schnörr, “Convex optimization for multi-class image labeling with a novel family of total variation based regularizers,” in Intl. Conf. on Computer Vision (ICCV) , 2009, pp. 646–653
2009
Later among the works it cites.
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends, Machine Learning , vol. 3, no. 1, pp. 1–122, 2010
2010
Later among the works it cites.
P. Felzenszwalb, R. Girshick, D. McAllester, and D. Ramanan, “Object detection with discriminatively trained part-based models,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 32, no. 9, pp. 1627–1645, 2010
2010
Later among the works it cites.
A. Blake, P. Kohli, and C. Rother, Markov Random Fields for Vision and Image Processing . The MIT Press, 2011
2011
Later among the works it cites.
A. Gallagher, D. Batra, and D. Parikh, “Inference for order reduction in Markov Random Fields,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2011, pp. 1857–1864
2011
Later among the works it cites.
P. Felzenszwalb and R. Zabih, “Dynamic programming and graph algorithms in computer vision,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 33, no. 4, pp. 721–740, 2011
2011
Later among the works it cites.
P. Krähenbühl and V. Koltun, “Efficient inference in fully connected crfs with gaussian edge potentials,” in Advances in Neural Information Processing Systems (NIPS) , 2011, pp. 109–117
2011
Later among the works it cites.
N. Komodakis, N. Paragios, and G. Tziritas, “MRF Energy Minimization and Beyond via Dual Decomposition,” pami , vol. 33, no. 3, pp. 531–552, 2011
2011
Later among the works it cites.
A. Martins, M. Figueiredo, P. Aguiar, N. Smith, and E. Xing, “An augmented Lagrangian approach to constrained MAP inference,” in Intl. Conf. on Machine Learning (ICML) , 2011, pp. 169–176
2011
Later among the works it cites.
G. Kim, E. Xing, L. Fei-Fei, and T. Kanade, “Distributed cosegmentation via submodular optimization on anisotropic diffusion,” in Intl. Conf. on Computer Vision (ICCV) , 2011, pp. 169–176
2011
Later among the works it cites.
A. Chen and J. Corso, “Temporally consistent multi-class video-object segmentation with the video graph-shifts algorithm,” in 2011 IEEE Workshop on Applications of Computer Vision (WACV) , 2011, pp. 614–621
2011
Later among the works it cites.
D. Cremers, T. Pock, K. Kolev, and A. Chambolle, “Convex relaxation techniques for segmentation, stereo and multiview reconstruction,” in Markov Random Fields for Vision and Image Processing . MIT Press, 2011
2011
Later among the works it cites.
B. Savchynskyy, S. Schmidt, J. Kappes, and C. Schnörr, “Efficient mrf energy minimization via adaptive diminishing smoothing,” in Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence (UAI) , 2012, pp. 746–755
2012
Later among the works it cites.
D. Sontag, D. Choe, and Y. Li, “Efficiently searching for frustrated cycles in map inference,” in Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence (UAI) , 2012
2012
Later among the works it cites.
Y. Yang, S. Hallman, D. Ramanan, and C. Fowlkes, “Layered Object Models for Image Segmentation,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 34, no. 9, pp. 1731–1743, 2012
2012
Later among the works it cites.
J. Kappes, M. Speth, G. Reinelt, and C. Schn̈rr, “Towards efficient and exact map-inference for large scale discrete computer vision problems via combinatorial optimization,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2013
2013
Later among the works it cites.
W. Peng, S. Chunhua, and A. van den Hengel, “A fast semidefinite approach to solving binary quadratic problems,” IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , pp. 1312–1319, 2013
2013
Later among the works it cites.
Q. Huang, Y. Chen, and L. Guibas, “Scalable semidefinite relaxation for maximum a posterior estimation,” in Intl. Conf. on Machine Learning (ICML) , 2014, pp. II–64–II–72
2014
Later among the works it cites.
R. Frostig, S. Wang, P. Liang, and C. Manning, “Simple MAP inference via low-rank relaxations,” in NIPS , 2014
2014
Later among the works it cites.
A. Kundu, Y. Li, F. Dellaert, F. Li, and J. Rehg, “Joint semantic segmentation and 3D reconstruction from monocular video,” in European Conf. on Computer Vision (ECCV) , ser. Lecture Notes in Computer Science, vol. 8694, 2014, pp. 703–718
2014
Later among the works it cites.
J. H. Kappes, B. Andres, F. A. Hamprecht, C. Schnörr, S. Nowozin, D. Batra, S. Kim, B. X. Kausler, T. Kröger, J. Lellmann, N. Komodakis, B. Savchynskyy, and C. Rother, “A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems,” Intl. J. of Computer Vision , vol. 115, no. 2, pp. 155–184, 2015
2015
Later among the works it cites.
P. Wang, C. Shen, A. van den Hengel, and P. H. S. Torr, “Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference,” Intl. J. of Computer Vision , vol. 117, no. 3, pp. 269–289, 2015
2015
Later among the works it cites.
P. Wang, C. Shen, and A. V. D. Hengel, “Efficient SDP inference for fully-connected CRFs based on low-rank decomposition,” IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , pp. 3222–3231, 2015
2015
Later among the works it cites.
D. Zhuo, T. Sinisa, and L. Longin, “Semantic segmentation of RGB-D images with mutex constraints,” Intl. Conf. on Computer Vision (ICCV) , pp. 1733–1741, 2015
2015
Later among the works it cites.
S. Gupta, P. Arbeláez, R. Girshick, and J. Malik, “Indoor scene understanding with RGB-D images: Bottom-up segmentation, object detection and semantic segmentation,” Intl. J. of Computer Vision , vol. 112, no. 2, pp. 133–149, 2015
2015
Later among the works it cites.
N. Boumal, V. Voroninski, and A. Bandeira, “The non-convex Burer–Monteiro approach works on smooth semidefinite programs,” in Advances in Neural Information Processing Systems (NIPS) , 2016, pp. 2757–2765
2016
Later among the works it cites.
H. Zhu, F. Meng, J. Cai, and S. Lu, “Beyond pixels: A comprehensive survey from bottom-up to semantic image segmentation and cosegmentation,” Journal of Visual Communication and Image Representation , vol. 12–27, p. 34, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
M. Cordts, M. Omran, S. Ramos, T. Rehfeld, M. Enzweiler, R. Benenson, U. Franke, S. Roth, and B. Schiele, “The Cityscapes dataset for semantic urban scene understanding,” in IEEE Conf. on Computer Vision and Pattern Recognition (CVPR) , 2016
2016
Later among the works it cites.
B. Andres, T. Beier, and J. Kappes, “OpenGM2,” 2016. [Online]. Available: http://hci.iwr.uni-heidelberg.de/opengm2/
2016
Later among the works it cites.
P. Wang, C. Shen, A. V. D. Hengel, and P. Torr, “Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 39, no. 3, pp. 1–18, 2016
2016
Later among the works it cites.
D. Rosen and L. Carlone, “Computational enhancements for certifiably correct SLAM,” in IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS) , 2017, workshop on “Introspective Methods for Reliable Autonomy”, (pdf)
2017
Later among the works it cites.
M. Thoma, “A survey of semantic segmentation,” ArXiv Preprint: 1602.06541 , 2017
2017
Later among the works it cites.
2017
Later among the works it cites.
L. Chen, G. Papandreou, I. Kokkinos, K. Murphy, and A. Yuille, “DeepLab: Semantic image segmentation with deep convolutional nets, atrous convolution, and fully connected CRFs,” IEEE Trans. Pattern Anal. Machine Intell. , vol. 40, pp. 834–848, 2018
2018
Closest in time.
S. Hu and L. Carlone, “Accelerated inference in Markov Random Fields via smooth Riemannian optimization,” Tech. Rep., 2018, supplemental material: (pdf)
2018
Closest in time.
A. Milioto and C. Stachniss, “Bonnet: An Open-Source Training and Deployment Framework for Semantic Segmentation in Robotics using CNNs,” ArXiv , 2018
2018
Closest in time.
Y. Aksoy, T. Oh, S. Paris, M. Pollefeys, and W. Matusik, “Semantic soft segmentation,” SIGGRAPH , vol. 37, no. 4, pp. 72:1–72:13, 2018
2018
Closest in time.