Computing global minimizers to a constrained B‐spline image registration problem from optimal l1 perturbations to block match data
- 10 March 2014
- journal article
- Published by Wiley in Medical Physics
- Vol. 41 (4) , 041904
Abstract
Purpose:: Block matching is a well‐known strategy for estimating corresponding voxel locations between a pair of images according to an image similarity metric. Though robust to issues such as image noise and large magnitude voxel displacements, the estimated point matches are not guaranteed to be spatially accurate. However, the underlying optimization problem solved by the block matching procedure is similar in structure to the class of optimization problem associated with B‐spline based registration methods. By exploiting this relationship, the authors derive a numerical method for computing a global minimizer to a constrained B‐spline registration problem that incorporates the robustness of block matching with the global smoothness properties inherent to B‐spline parameterization.Methods:: The method reformulates the traditional B‐spline registration problem as a basis pursuit problem describing the minimall1‐perturbation to block match pairs required to produce a B‐spline fitting error within a given tolerance. The sparsity pattern of the optimal perturbation then defines a voxel point cloud subset on which the B‐spline fit is a global minimizer to a constrained variant of the B‐spline registration problem. As opposed to traditional B‐spline algorithms, the optimization step involving the actual image data is addressed by block matching.Results:: The performance of the method is measured in terms of spatial accuracy using ten inhale/exhale thoracic CT image pairs (available for download atwww.dir‐lab.com) obtained from the COPDgene dataset and corresponding sets of expert‐determined landmark point pairs. The results of the validation procedure demonstrate that the method can achieve a high spatial accuracy on a significantly complex image set.Conclusions:: The proposed methodology is demonstrated to achieve a high spatial accuracy and is generalizable in that in can employ any displacement field parameterization described as a least squares fit to block match generated estimates. Thus, the framework allows for a wide range of image similarity block match metric and physical modeling combinations.Keywords
This publication has 48 references indexed in Scilit:
- Registration of sliding objects using direction dependent B-splines decompositionPhysics in Medicine & Biology, 2013
- Computed tomography–based biomarker provides unique signature for diagnosis of COPD phenotypes and disease progressionNature Medicine, 2012
- Compute-unified device architecture implementation of a block-matching algorithm for multiple graphical processing unit cardsJournal of Electronic Imaging, 2011
- A reproducible evaluation of ANTs similarity metric performance in brain image registrationNeuroImage, 2011
- Ventilation from four-dimensional computed tomography: density versus Jacobian methodsPhysics in Medicine & Biology, 2010
- Genetic Epidemiology of COPD (COPDGene) Study DesignCOPD: Journal of Chronic Obstructive Pulmonary Disease, 2010
- A framework for evaluation of deformable image registration spatial accuracy using large landmark point setsPhysics in Medicine & Biology, 2009
- Image registration using hierarchical b-splinesIEEE Transactions on Visualization and Computer Graphics, 2004
- Local polynomial reproduction and moving least squares approximationIMA Journal of Numerical Analysis, 2001
- Least Median of Squares RegressionJournal of the American Statistical Association, 1984