Abstract
For a mixed integer programming formulation of the problem of registering two medical images we propose a geometric Branch & Bound algorithm, which applies a geometric branching strategy on the transformation variables. The results show that medium sized problem instances can be solved to global optimality in a reasonable amount of time. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Stiglmayr, M., Pfeuffer, F., & Klamroth, K. (2008). A branch & bound algorithm for medical image registration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4958 LNCS, pp. 217–228). Springer Verlag. https://doi.org/10.1007/978-3-540-78275-9_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
