A family of globally optimal branch-and-bound algorithms for 2D-3D correspondence-free registration

Mark Brown, David Windridge, Jean-Yves Guillemaut. A family of globally optimal branch-and-bound algorithms for 2D-3D correspondence-free registration. Pattern Recognition, 93:36-54, 2019. [doi]

@article{BrownWG19,
  title = {A family of globally optimal branch-and-bound algorithms for 2D-3D correspondence-free registration},
  author = {Mark Brown and David Windridge and Jean-Yves Guillemaut},
  year = {2019},
  doi = {10.1016/j.patcog.2019.04.002},
  url = {https://doi.org/10.1016/j.patcog.2019.04.002},
  researchr = {https://researchr.org/publication/BrownWG19},
  cites = {0},
  citedby = {0},
  journal = {Pattern Recognition},
  volume = {93},
  pages = {36-54},
}