Cite
HARVARD Citation
Brown, M. et al. (n.d.). A family of globally optimal branch-and-bound algorithms for 2D–3D correspondence-free registration. Pattern recognition. pp. 36-54. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Brown, M. et al. (n.d.). A family of globally optimal branch-and-bound algorithms for 2D–3D correspondence-free registration. Pattern recognition. pp. 36-54. [Online].