An efficient motion estimator with application to medical image registration.

Department of Computer & Information Sciences & Engineering, University of Florida, Gainesville 32611, USA.
Medical Image Analysis (Impact Factor: 4.09). 04/1998; 2(1):79-98. DOI: 10.1016/S1361-8415(01)80029-3
Source: DBLP

ABSTRACT Image registration is a very important problem in computer vision and medical image processing. Numerous algorithms for registering single and multi-modal image data have been reported in these areas. Robustness as well as computational efficiency are prime factors of importance in image data registration. In this paper, a robust/reliable and efficient algorithm for estimating the transformation between two image data sets of a patient taken from the same modality over time is presented. Estimating the registration between two image data sets is formulated as a motion-estimation problem. We use a hierarchical optical flow motion model which allows for both global as well as local motion between the data sets. In this hierarchical motion model, we represent the flow field with a B-spline basis which implicitly incorporates smoothness constraints on the field. In computing the motion, we minimize the expectation of the squared differences energy function numerically via a modified Newton iteration scheme. The main idea in the modified Newton method is that we precompute the Hessian of the energy function at the optimum without explicitly knowing the optimum. This idea is used for both global and local motion estimation in the hierarchical motion model. We present examples of motion estimation on synthetic and real data (from a patient acquired during pre- and post-operative stages) and compare the performance of our algorithm with that of competing ones.

  • European journal of cardio-thoracic surgery: official journal of the European Association for Cardio-thoracic Surgery 03/2011; 39(3):424; author reply 425. · 2.40 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Face alignment aims to fit a deformable landmark- based mesh to a facial image so that all facial features can be located accurately. In discriminative face alignment, an align- ment score function, which is treated as the appearance model, is learned such that moving along its gradient direction can improve the alignment. This paper proposes a new face model named "Optimal Gradient Pursuit Model", where the objective is to minimize the angle between the gradient direction and the vector pointing toward the ground-truth shape parameter. We formulate an iterative approach to solve this minimization problem. With extensive experiments in generic face alignment, we show that our model improves the alignment accuracy and speed compared to the state-of-the-art discriminative face alignment approach. I. INTRODUCTION Model-based image registration/alignment is a fundamen- tal topic in computer vision, where a model is deformed such that its distance to an image is minimized. In particular, face alignment is receiving considerable attention, because it not only enables various practical capabilities such as facial feature detection, pose rectification, face animation, etc, but also poses many scientific challenges due to facial appearance variations in pose, illumination, expression, and occlusions.
    Ninth IEEE International Conference on Automatic Face and Gesture Recognition (FG 2011), Santa Barbara, CA, USA, 21-25 March 2011; 01/2011
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Efficient and accurate fitting of active appearance models (AAM) is a key requirement for many applications. The most efficient fitting algorithm today is inverse compositional image alignment (ICIA). While ICIA is extremely fast, it is also known to have a small convergence radius. Convergence is especially bad when training and testing images differ strongly, as in multi-person AAMs. We describe ldquoforwardrdquo compositional image alignment in a consistent framework which also incorporates methods previously termed ldquoinverserdquo compositional, and use it to develop two novel fitting methods. The first method, compositional gradient descent (CoDe), is approximately four times slower than ICIA, while having a convergence radius which is even larger than that achievable by direct quasi-Newton descent. An intermediate convergence range with the same speed as ICIA is achieved by LinCoDe, the second new method. The success rate of the novel methods is 10 to 20 times higher than that of the original ICIA method.
    Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on; 07/2009


Available from