Three-dimensional cardiac strain estimation using spatio-temporal elastic registration of ultrasound images: a feasibility study

Current ultrasound methods for measuring myocardial strain are often limited to measurements in one or two dimensions. Cardiac motion and deformation however are truly 3-D. With the introduction of matrix transducer technology, 3-D ultrasound imaging of the heart has become feasible but suffers from low temporal and spatial resolution, making 3-D strain estimation challenging. In this paper, it is shown that automatic intensity-based spatio–temporal elastic registration of currently available 3-D volumetric ultrasound data sets can be used to measure the full 3-D strain tensor. The method was validated using simulated 3-D ultrasound data sets of the left ventricle (LV). Three types of data sets were simulated: a normal and symmetric LV with different heart rates, a more realistic asymmetric normal LV and an infarcted LV. The absolute error in the estimated displacement was between $0.47 pm 0.23$ and $1.00 pm 0.59$ mm, depending on heart rate and amount of background noise. The absolute error on the estimated strain was 9%–21% for the radial strain and 1%–4% for the longitudinal and circumferential strains. No large differences were found between the different types of data sets. The shape of the strain curves was estimated properly and the position of the infarcts could be identified correctly. Preliminary results on clinical data taken in vivo from three healthy volunteers and one patient with an apical aneurism confirmed these findings in a qualitative manner as the strain curves obtained with the proposed method have an amplitude and shape similar to what could be expected.      

MRF-based intensity invariant elastic registration of cardiac perfusion images using saliency information

In this paper, we propose a Markov random field-based method that uses saliency and gradient information for elastic registration of dynamic contrast enhanced (DCE) magnetic resonance (MR) images of the heart. DCE-MR images are characterized by rapid intensity changes over time, thus posing challenges for conventional intensity-based registration methods. Saliency information contributes to a contrast invariant metric to identify similar regions in spite of contrast enhancement. Its robustness and accuracy are attributed to a close adherence to a neurobiological model of the human visual system (HVS). The HVS has a remarkable ability to match images in the face of intensity changes and noise. This ability motivated us to explore the efficacy of such a model for registering DCE-MR images. The data penalty is a combination of saliency and gradient information. The smoothness cost depends upon the relative displacement and saliency difference of neighboring pixels. Saliency is also used in a modified narrow band graph cut framework to identify relevant pixels for registration, thus reducing the number of graph nodes and computation time. Experimental results on real patient images demonstrate superior registration accuracy for a combination of saliency and gradient information over other similarity metrics.     

Joint MAP registration and high-resolution image estimation using asequence of undersampled images

In many imaging systems, the detector array is not sufficiently dense to adequately sample the scene with the desired field of view. This is particularly true for many infrared focal plane arrays. Thus, the resulting images may be severely aliased. This paper examines a technique for estimating a high-resolution image, with reduced aliasing, from a sequence of undersampled frames. Several approaches to this problem have been investigated previously. However, in this paper a maximum a posteriori (MAP) framework for jointly estimating image registration parameters and the high-resolution image is presented. Several previous approaches have relied on knowing the registration parameters a priori or have utilized registration techniques not specifically designed to treat severely aliased images. In the proposed method, the registration parameters are iteratively updated along with the high-resolution image in a cyclic coordinate-descent optimization procedure. Experimental results are provided to illustrate the performance of the proposed MAP algorithm using both visible and infrared images. Quantitative error analysis is provided and several images are shown for subjective evaluation.     

Bayesian estimation of ventricular contours in angiographic images

A method for left ventricular contour determination in digital angiographic images is presented. The problem is formulated in a Bayesian framework, adopting as the estimation criterion the maximum a posterior probability (MAP). The true contour is modeled as a one-dimensional noncausal Gauss-Markov random field and the observed image is described as the superposition of an ideal image (deterministic function of the real contour) with white Gaussian noise. The proposed algorithm estimates simultaneously the contour and the model parameters by implementing an adaptive version of the iterated conditional modes algorithm. The convergence of this scheme is proved and its performance evaluated on both synthetic and real angiographic images. The method exhibits robustness against image artifacts and the contours obtained are considered good by expert clinicians. Being completely data-driven and fast, the proposed algorithm is suitable for routine clinical use.     

Landmark-based elastic registration using approximating thin-platesplines

We consider elastic image registration based on a set of corresponding anatomical point landmarks and approximating thin-plate splines. This approach is an extension of the original interpolating thin-plate spline approach and allows to take into account landmark localization errors. The extension is important for clinical applications since landmark extraction is always prone to error. Our approach is based on a minimizing functional and can cope with isotropic as well as anisotropic landmark errors. In particular, in the latter case it is possible to include different types of landmarks, e.g., unique point landmarks as well as arbitrary edge points. Also, the scheme is general with respect to the image dimension and the order of smoothness of the underlying functional. Optimal affine transformations as well as interpolating thin-plate splines are special cases of this scheme. To localize landmarks we use a semi-automatic approach which is based on three-dimensional (3-D) differential operators. Experimental results are presented for two-dimensional as well as 3-D tomographic images of the human brain.     

Motion estimation in ultrasound images using time domain cross correlation with prior estimates

In this paper we introduce a new speckle tracking method that is based on the standard time-domain cross correlation strain estimation (TDE). We call this method time-domain cross-correlation with prior estimates (TDPE), because it uses prior displacement estimates of neighboring windows to speed up computation. TDPE has all the advantages of TDE, but is much faster. Simulations, as well as experiments with phantoms and tissue, indicate that TDPE is capable of reliably estimating tissue displacement and strain over a large range of displacements in real time. The computational efficiency of TDPE is compared with current time-efficient methods that have been used in real time strain imaging systems. The results show that TDPE is the most time efficient algorithm to date, and is roughly 10 times faster than the TDE. The implementation of TDPE on an Ultrasonix RP500 ultrasound machine runs at 30 fps for strain images of 16 000 pixels.     

Elastic registration of biological images using vector-spline regularization

We present an elastic registration algorithm for the alignment of biological images. Our method combines and extends some of the best techniques available in the context of medical imaging. We express the deformation field as a B-spline model, which allows us to deal with a rich variety of deformations. We solve the registration problem by minimizing a pixelwise mean-square distance measure between the target image and the warped source. The problem is further constrained by way of a vector-spline regularization which provides some control over two independent quantities that are intrinsic to the deformation: its divergence, and its curl. Our algorithm is also able to handle soft landmark constraints, which is particularly useful when parts of the images contain very little information or when its repartition is uneven. We provide an optimal analytical solution in the case when only landmarks and smoothness considerations are taken into account. We have applied our approach to perform the elastic registration of images such as electrophoretic gels and fly embryos. The validation of the results by experts has been favorable in all cases.     

Motion estimation using higher order statistics

The objective of this paper is to introduce a fourth-order cost function of the displaced frame difference (DFD) capable of estimating motion even for small regions or blocks. Using higher than second-order statistics is appropriate in case the image sequence is severely corrupted by additive Gaussian noise. Some results are presented and compared to those obtained from the mean kurtosis and the mean square error of the DFD.     

Multimodal registration of retinal images using self organizing maps

In this paper, an automatic method for registering multimodal retinal images is presented. The method consists of three steps: the vessel centerline detection and extraction of bifurcation points only in the reference image, the automatic correspondence of bifurcation points in the two images using a novel implementation of the self organizing maps and the extraction of the parameters of the affine transform using the previously obtained correspondences. The proposed registration algorithm was tested on 24 multimodal retinal pairs and the obtained results show an advantageous performance in terms of accuracy with respect to the manual registration.     

Motion estimation processor using mixed-signal approach

This paper describes the design, realization, and evaluation of a mixed-signal motion estimation processor using the full-search block-matching algorithm. The approach features digital I/O and a low-power, compact analog computational core. The proof-of-concept realization whose architecture incorporates pixel reuse, was fabricated in 0.8-/spl mu/m CMOS technology occupying 0.65 mm/sup 2/, and operates on 4 /spl times/ 4 pixel blocks and a search area of 8 /spl times/ 8 pixels. The processor achieves a low energy consumption per motion vector of 1.35 nJ and dissipates 0.8 mW from a 3-V power supply at QCIF 15 frames/s. The approach is intended for portable applications of digital video encoding.     

Motion estimation algorithm using interblock correlation

A new motion estimation algorithm that exploits the motion correlation of neighbor blocks in temporal and spatial directions is presented. Preliminary results indicate that this algorithm achieves significant savings on computation time and the amount of side information on motion vectors.<>     

Fluid registration of diffusion tensor images using information theory

We apply an information-theoretic cost metric, the symmetrized Kullback-Leibler (sKL) divergence, or J-divergence, to fluid registration of diffusion tensor images. The difference between diffusion tensors is quantified based on the sKL-divergence of their associated probability density functions (PDFs). Three-dimensional DTI data from 34 subjects were fluidly registered to an optimized target image. To allow large image deformations but preserve image topology, we regularized the flow with a large-deformation diffeomorphic mapping based on the kinematics of a Navier-Stokes fluid. A driving force was developed to minimize the J-divergence between the deforming source and target diffusion functions, while reorienting the flowing tensors to preserve fiber topography. In initial experiments, we showed that the sKL-divergence based on full diffusion PDFs is adaptable to higher-order diffusion models, such as high angular resolution diffusion imaging (HARDI). The sKL-divergence was sensitive to subtle differences between two diffusivity profiles, showing promise for nonlinear registration applications and multisubject statistical analysis of HARDI data.     

Recursive estimation of images using non-Gaussian autoregressivemodels

We consider recursive estimation of images modeled by non-Gaussian autoregressive (AR) models and corrupted by spatially white Gaussian noise. The goal is to find a recursive algorithm to compute a near minimum mean square error (MMSE) estimate of each pixel of the scene using a fixed lookahead of D rows and D columns of the observations. Our method is based on a simple approximation that makes possible the development of a useful suboptimal nonlinear estimator. The algorithm is first developed for a non-Gaussian AR time-series and then generalized to two dimensions. In the process, we draw on the well-known reduced update Kalman filter (KF) technique of Woods and Radewan (1977) to circumvent computational load problems. Several examples demonstrate the non-Gaussian nature of residuals for AR image models and that our algorithm compares favorably with the Kalman filtering techniques in such cases.     

Neighbourhood structure estimation of images using hierarchicaltesting

Methods for estimating model parameters using likelihood techniques are examined and a model selection procedure is proposed for classifying the neighbourhood structure of the image. The techniques are investigated using simulated data     

Motion parameter estimation by using time-frequency representations

The estimation of motion parameters of moving objects by using variable μ-propagation and time-frequency representations is proposed. The spectrogram and the Wigner distribution, two basic time-frequency distributions, are used. Both the velocity and the initial position can be accurately estimated by this approach     

Motion estimation using a complex-valued wavelet transform

This paper describes a new motion estimation algorithm that is potentially useful for both computer vision and video compression applications. It is hierarchical in structure, using a separable two-dimensional (2-D) discrete wavelet transform (DWT) on each frame to efficiently construct a multiresolution pyramid of subimages. The DWT is based on a complex-valued pair of four-tap FIR filters with Gabor-like characteristics. The resulting complex DWT (CDWT) effectively implements an analysis by an ensemble of Gabor-like filters with a variety of orientations and scales. The phase difference between the subband coefficients of each frame at a given subpel bears a predictable relation to a local translation in the region of the reference frame subtended by that subpel. That relation is used to estimate the displacement field at the coarsest scale of the multiresolution pyramid. Each estimate is accompanied by a directional confidence measure in the form of the parameters of a quadratic matching surface. The initial estimate field is progressively refined by a coarse-to fine strategy in which finer scale information is appropriately incorporated at each stage. The accuracy, efficiency, and robustness of the new algorithm are demonstrated in comparison testing against hierarchical implementations of intensity gradient-based and fractional-precision block matching motion estimators     

快速菱形搜索运动估计方法

提出一种快速菱形运动估计算法,利用运动矢量的中心偏移特性,在第一步搜索时设立一个门限值,减小获得运动矢量所需的搜索次数。实验结果表明,算法在降低计算复杂度的同时,保持了较好的图像质量。     

A comprehensive cardiac motion estimation framework using both untagged and 3-D tagged MR images based on nonrigid registration

In this paper, we present a novel technique based on nonrigid image registration for myocardial motion estimation using both untagged and 3-D tagged MR images. The novel aspect of our technique is its simultaneous usage of complementary information from both untagged and 3-D tagged MR images. To estimate the motion within the myocardium, we register a sequence of tagged and untagged MR images during the cardiac cycle to a set of reference tagged and untagged MR images at end-diastole. The similarity measure is spatially weighted to maximize the utility of information from both images. In addition, the proposed approach integrates a valve plane tracker and adaptive incompressibility into the framework. We have evaluated the proposed approach on 12 subjects. Our results show a clear improvement in terms of accuracy compared to approaches that use either 3-D tagged or untagged MR image information alone. The relative error compared to manually tracked landmarks is less than 15% throughout the cardiac cycle. Finally, we demonstrate the automatic analysis of cardiac function from the myocardial deformation fields.     

Nonrigid registration using free-form deformations: application tobreast MR images

In this paper we present a new approach for the nonrigid registration of contrast-enhanced breast MRI. A hierarchical transformation model of the motion of the breast has been developed. The global motion of the breast is modeled by an affine transformation while the local breast motion is described by a free-form deformation (FFD) based on B-splines. Normalized mutual information is used as a voxel-based similarity measure which is insensitive to intensity changes as a result of the contrast enhancement. Registration is achieved by minimizing a cost function, which represents a combination of the cost associated with the smoothness of the transformation and the cost associated with the image similarity. The algorithm has been applied to the fully automated registration of three-dimensional (3-D) breast MRI in volunteers and patients. In particular, we have compared the results of the proposed nonrigid registration algorithm to those obtained using rigid and affine registration techniques. The results clearly indicate that the nonrigid registration algorithm is much better able to recover the motion and deformation of the breast than rigid or affine registration algorithms.     

Motion correction of PET images using multiple acquisition frames

Positron emission tomography (PET) is a relatively lengthy brain imaging method. Because it is difficult for the subject to stay still during the data acquisition, head motion during scans is a source of image degradation. A simple data acquisition technique to reduce the effect of this problem is described. The technique associates the incoming data with the real-space position of the head. During the PET scan, the head position is constantly monitored with two video cameras and compared to its initial position. Every time the displacement for a region within the field of view (FOV) is larger than a specified threshold displacement, the PET data acquisition system starts to save the PET data in a new frame. The total number of frames required for a complete study depends on the magnitude of the head motion during the study and on the threshold displacement. At the end of the study, all the acquired frames are reconstructed independently and each image is rotated and translated to coincide with the initial position. When these images are summed, they produce a final image with fewer motion artefacts