Solving MRF Minimization by Mirror Descent

Duy V. N. Luong, Panos Parpas, Daniel Rueckert, Berç Rustem. Solving MRF Minimization by Mirror Descent. In George Bebis, Richard Boyle, Bahram Parvin, Darko Koracin, Charless Fowlkes, Sen Wang, Min-Hyung Choi, Stephan Mantler, Jürgen P. Schulze, Daniel Acevedo, Klaus Mueller, Michael E. Papka, editors, Advances in Visual Computing - 8th International Symposium, ISVC 2012, Rethymnon, Crete, Greece, July 16-18, 2012, Revised Selected Papers, Part I. Volume 7431 of Lecture Notes in Computer Science, pages 587-598, Springer, 2012. [doi]

@inproceedings{LuongPRR12,
  title = {Solving MRF Minimization by Mirror Descent},
  author = {Duy V. N. Luong and Panos Parpas and Daniel Rueckert and Berç Rustem},
  year = {2012},
  doi = {10.1007/978-3-642-33179-4_56},
  url = {http://dx.doi.org/10.1007/978-3-642-33179-4_56},
  researchr = {https://researchr.org/publication/LuongPRR12},
  cites = {0},
  citedby = {0},
  pages = {587-598},
  booktitle = {Advances in Visual Computing - 8th International Symposium, ISVC 2012, Rethymnon, Crete, Greece, July 16-18, 2012, Revised Selected Papers, Part I},
  editor = {George Bebis and Richard Boyle and Bahram Parvin and Darko Koracin and Charless Fowlkes and Sen Wang and Min-Hyung Choi and Stephan Mantler and Jürgen P. Schulze and Daniel Acevedo and Klaus Mueller and Michael E. Papka},
  volume = {7431},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-33178-7},
}