TY - GEN
T1 - Sparse update for loopy belief propagation
T2 - International Conference on Digital Image Computing: Techniques and Applications, DICTA 2010
AU - Xiao, Pengdong
AU - Barnes, Nick
AU - Lieby, Paulette
AU - Caetano, Tiberio
PY - 2010
Y1 - 2010
N2 - A dense point-based registration is an ideal starting point for detailed comparison between two neuroanatomical objects. This paper presents a new algorithm for global dense point-based registration between anatomical objects without assumptions about their shape. We represent mesh models of the surfaces of two similar 3D anatomical objects using a Markov Random Field and seek correspondence pairs between points in each shape. However, for densely sampled objects the set of possible point by point correspondences is very large. We solve the global non-rigid matching problem between the two objects in an efficient manner by applying loopy belief propagation. Typically loopy belief propagation is of order m3 for each iteration, where m is the number of nodes in a mesh. By avoiding computation of probabilities of configurations that cannot occur in practice, we reduce this to order m2. We demonstrate the method and its performance by registering hippocampi from a population of individuals aged 60-69. We find a corresponding rigid registration, and compare the results to a state-of-the-art technique and show comparable accuracy. Our method provides a global registration without prior information about alignment, and handles arbitrary shapes of spherical topology.
AB - A dense point-based registration is an ideal starting point for detailed comparison between two neuroanatomical objects. This paper presents a new algorithm for global dense point-based registration between anatomical objects without assumptions about their shape. We represent mesh models of the surfaces of two similar 3D anatomical objects using a Markov Random Field and seek correspondence pairs between points in each shape. However, for densely sampled objects the set of possible point by point correspondences is very large. We solve the global non-rigid matching problem between the two objects in an efficient manner by applying loopy belief propagation. Typically loopy belief propagation is of order m3 for each iteration, where m is the number of nodes in a mesh. By avoiding computation of probabilities of configurations that cannot occur in practice, we reduce this to order m2. We demonstrate the method and its performance by registering hippocampi from a population of individuals aged 60-69. We find a corresponding rigid registration, and compare the results to a state-of-the-art technique and show comparable accuracy. Our method provides a global registration without prior information about alignment, and handles arbitrary shapes of spherical topology.
UR - http://www.scopus.com/inward/record.url?scp=79951607976&partnerID=8YFLogxK
U2 - 10.1109/DICTA.2010.97
DO - 10.1109/DICTA.2010.97
M3 - Conference contribution
SN - 9780769542713
T3 - Proceedings - 2010 Digital Image Computing: Techniques and Applications, DICTA 2010
SP - 546
EP - 551
BT - Proceedings - 2010 Digital Image Computing
Y2 - 1 December 2010 through 3 December 2010
ER -