Fast Deformable Image Registration with Non-smooth Dual Optimization
IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
URL with Digital Object Identifier
© 2016 IEEE. Optimization techniques have been widely used in deformable registration, allowing for the incorporation of similarity metrics with regularization mechanisms. These regularization mechanisms are designed to mitigate the effects of trivial solutions to ill-posed registration problems and to otherwise ensure the resulting deformation fields are well-behaved. This paper introduces a novel deformable registration (DR) algorithm, RANCOR, which uses iterative convexification to address DR problems under nonsmooth total-variation regularization. Initial comparative results against four state-of-the-art registration algorithms and under smooth regularization, respectively, are presented using the Internet Brain Segmentation Repository (IBSR) database.