Inter and intra-modal deformable registration: continuous deformations meet efficient optimal linear programming.
In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path extraction in a weighted graph. The space of solutions is represented using a set of a labels which are assigned to predefined displacements. The graph topology corresponds to a superimposed regular grid onto the volume. Links between neighborhood control points introduce smoothness, while links between the graph nodes and the labels (end-nodes) measure the cost induced to the objective function through the selection of a particular deformation for a given control point once projected to the entire volume domain, Higher order polynomials are used to express the volume deformation from the ones of the control points. Efficient linear programming that can guarantee the optimal solution up to (a user-defined) bound is considered to recover the optimal registration parameters. Therefore, the method is gradient free, can encode various similarity metrics (simple changes on the graph construction), can guarantee a globally sub-optimal solution and is computational tractable. Experimental validation using simulated data with known deformation, as well as manually segmented data demonstrate the extreme potentials of our approach.
Glocker
Ben
B
GALEN Group, Laboratoire de Mathématiques Appliquées aux Systèmes, Ecole Centrale de Paris. nikos@ecp.fr
Paragios
Nikos
N
Komodakis
Nikos
N
Tziritas
Georgios
G
Navab
Nassir
N
D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D004548:Elasticity; D006801:Humans; D007089:Image Enhancement / Q000379:methods*; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000379:methods*; D008279:Magnetic Resonance Imaging / Q000379:methods*; D008954:Models, Biological; D010363:Pattern Recognition, Automated / Q000379:methods*; D011382:Programming, Linear; D013382:Subtraction Technique