Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Understanding the "Demon's Algorithm": 3D Non-rigid Registration by Gradient Descent
MICCAI '99 Proceedings of the Second International Conference on Medical Image Computing and Computer-Assisted Intervention
Multilabel Random Walker Image Segmentation Using Prior Models
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Random Walks for Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Insight into efficient image registration techniques and the demons algorithm
IPMI'07 Proceedings of the 20th international conference on Information processing in medical imaging
Non-rigid image registration using graph-cuts
MICCAI'07 Proceedings of the 10th international conference on Medical image computing and computer-assisted intervention - Volume Part I
WBIR'10 Proceedings of the 4th international conference on Biomedical image registration
Reliability-driven, spatially-adaptive regularization for deformable registration
WBIR'10 Proceedings of the 4th international conference on Biomedical image registration
Generalization of deformable registration in riemannian sobolev spaces
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part II
IPMI'13 Proceedings of the 23rd international conference on Information Processing in Medical Imaging
Hi-index | 0.00 |
We introduce a novel discrete optimization method for nonrigid image registration based on the random walker algorithm. We discretize the space of deformations and formulate registration using a Gaussian MRF where continuous labels correspond to the probability of a point having a certain discrete deformation. The interaction (regularization) term of the corresponding MRF energy is convex and image dependent, thus being able to accommodate different types of tissue elasticity. This formulation results in a fast algorithm that can easily accommodate a large number of displacement labels, has provable robustness to noise and a close to global solution. We experimentally demonstrate the validity of our formulation on synthetic and real medical data.