Parallelized Bayesian inversion for three-dimensional dental X-ray imaging

Diagnostic and operational tasks based on dental radiology often require three-dimensional (3-D) information that is not available in a single X-ray projection image. Comprehensive 3-D information about tissues can be obtained by computerized tomography (CT) imaging. However, in dental imaging a conventional CT scan may not be available or practical because of high radiation dose, low-resolution or the cost of the CT scanner equipment. In this paper, we consider a novel type of 3-D imaging modality for dental radiology. We consider situations in which projection images of the teeth are taken from a few sparsely distributed projection directions using the dentist's regular (digital) X-ray equipment and the 3-D X-ray attenuation function is reconstructed. A complication in these experiments is that the reconstruction of the 3-D structure based on a few projection images becomes an ill-posed inverse problem. Bayesian inversion is a well suited framework for reconstruction from such incomplete data. In Bayesian inversion, the ill-posed reconstruction problem is formulated in a well-posed probabilistic form in which a priori information is used to compensate for the incomplete information of the projection data. In this paper we propose a Bayesian method for 3-D reconstruction in dental radiology. The method is partially based on Kolehmainen et al. 2003. The prior model for dental structures consist of a weighted /spl lscr//sup 1/ and total variation (TV)-prior together with the positivity prior. The inverse problem is stated as finding the maximum a posteriori (MAP) estimate. To make the 3-D reconstruction computationally feasible, a parallelized version of an optimization algorithm is implemented for a Beowulf cluster computer. The method is tested with projection data from dental specimens and patient data. Tomosynthetic reconstructions are given as reference for the proposed method.     

Markov random field modeling for three-dimensional reconstruction of the left ventricle in cardiac angiography

This paper reports on a method for left ventricle three-dimensional (3-D) reconstruction from two orthogonal ventriculograms. The proposed algorithm is voxel-based and takes into account the conical projection geometry associated with the biplane image acquisition equipment. The reconstruction process starts with an initial ellipsoidal approximation derived from the input ventriculograms. This model is subsequently deformed in such a way as to match the input projections. To this end, the object is modeled as a 3-D Markov-Gibbs random field, and an energy function is defined so that it includes one term that models the projections compatibility and another one that includes the space-time regularity constraints. The performance of this reconstruction method is evaluated by considering the reconstruction of mathematically synthesized phantoms and two 3-D binary databases from two orthogonal synthesized projections. The method is also tested using real biplane ventriculograms. In this case, the performance of the reconstruction is expressed in terms of the projection error, which attains values between 9.50% and 11.78 % for two biplane sequences including a total of 55 images.     

Object classification in 3-D images using alpha-trimmed mean radialbasis function network

We propose a pattern classification based approach for simultaneous three-dimensional (3-D) object modeling and segmentation in image volumes. The 3-D objects are described as a set of overlapping ellipsoids. The segmentation relies on the geometrical model and graylevel statistics. The characteristic parameters of the ellipsoids and of the graylevel statistics are embedded in a radial basis function (RBF) network and they are found by means of unsupervised training. A new robust training algorithm for RBF networks based on alpha-trimmed mean statistics is employed in this study. The extension of the Hough transform algorithm in the 3-D space by employing a spherical coordinate system is used for ellipsoidal center estimation. We study the performance of the proposed algorithm and we present results when segmenting a stack of microscopy images.     

Model-based estimation for dynamic cardiac studies using ECT

The authors develop a strategy for joint estimation of physiological parameters and myocardial boundaries using ECT (emission computed tomography). They construct an observation model to relate parameters of interest to the projection data and to account for limited ECT system resolution and measurement noise. The authors then use a maximum likelihood (ML) estimator to jointly estimate all the parameters directly from the projection data without reconstruction of intermediate images. They also simulate myocardial perfusion studies based on a simplified heart model to evaluate the performance of the model-based joint ML estimator and compare this performance to the Cramer-Rao lower bound. Finally, the authors discuss model assumptions and potential uses of the joint estimation strategy.     

Tomographic reconstruction of dynamic cardiac image sequences.

In this paper, we propose an approach for the reconstruction of dynamic images from a gated cardiac data acquisition. The goal is to obtain an image sequence that can show simultaneously both cardiac motion and time-varying image activities. To account for the cardiac motion, the cardiac cycle is divided into a number of gate intervals, and a time-varying image function is reconstructed for each gate. In addition, to cope with the under-determined nature of the problem, the time evolution at each pixel is modeled by a B-spline function. The dynamic images for the different gates are then jointly determined using maximum a posteriori estimation, in which a motion-compensated smoothing prior is introduced to exploit the similarity among the different gates. The proposed algorithm is evaluated using a dynamic version of the 4-D gated mathematical cardiac torso phantom simulating a gated single photon emission computed tomography perfusion acquisition with Technitium-99m labeled Teboroxime. We thoroughly evaluated the performance of the proposed algorithm using several quantitative measures, including signal-to-noise ratio analysis, bias-variance plot, and time activity curves. Our results demonstrate that the proposed joint reconstruction approach can improve significantly the accuracy of the reconstruction.     

A moment-based variational approach to tomographic reconstruction

We describe a variational framework for the tomographic reconstruction of an image from the maximum likelihood (ML) estimates of its orthogonal moments. We show how these estimated moments and their (correlated) error statistics can be computed directly, and in a linear fashion from given noisy and possibly sparse projection data. Moreover, thanks to the consistency properties of the Radon transform, this two-step approach (moment estimation followed by image reconstruction) can be viewed as a statistically optimal procedure. Furthermore, by focusing on the important role played by the moments of projection data, we immediately see the close connection between tomographic reconstruction of nonnegative valued images and the problem of nonparametric estimation of probability densities given estimates of their moments. Taking advantage of this connection, our proposed variational algorithm is based on the minimization of a cost functional composed of a term measuring the divergence between a given prior estimate of the image and the current estimate of the image and a second quadratic term based on the error incurred in the estimation of the moments of the underlying image from the noisy projection data. We show that an iterative refinement of this algorithm leads to a practical algorithm for the solution of the highly complex equality constrained divergence minimization problem. We show that this iterative refinement results in superior reconstructions of images from very noisy data as compared with the classical filtered back-projection (FBP) algorithm.     

A novel temporal calibration method for 3-D ultrasound

This paper examines a novel approach for temporal calibration of a three-dimensional (3-D) freehand ultrasound system. A localization system fixed on the probe gives the position and orientation of the probe. For quantitative use, calibration is needed to correctly localize a B-scan in four-dimensional (4-D) (3-D+t) space. Temporal latency estimation is defined in a general robust formulation using no specific probe motion constraints. Experiments were performed on synthetic and real data using a 3-D freehand ultrasound system. The achieved precision is lower than the image acquisition rate (40 ms). A validation study using a calibration phantom has been performed to evaluate the influence of incorrect latency estimation on the 3-D reconstruction procedure. We showed that for latency estimation errors less than 40 ms, the 3-D reconstruction errors are negligible for volume estimation.     

Three-Dimension Localization of Wideband Sources Using Sensor Network

Usually source localization using sensor networks requires many sensors to localize a few number of sources, and it is still very troublesome to deal with coherent sources. When the three-dimensional (3-D) space are considered, the localization will become more difficult. A new approach is proposed to localize 3-D wideband coherent sources based on distributed sensor network, which consists of two nodes and each node contains only two sensors. Direction-of-arrival (DOA) estimation is performed at each node by employing a new noise subspace proposed. Combining the pattern matching idea and the prior geometrical information of sources, a cost function is constructed to estimate the rough positions. A rotational projection algorithm is proposed to estimate the heights of sources and correct the rough positions, and consequently the localization of 3-D sources could be achieved. Numerical examples are provided to demonstrate the effectiveness of this approach.     

Fourier-based reconstruction for fully 3-D PET: optimization of interpolation parameters

Fourier-based approaches for three-dimensional (3-D) reconstruction are based on the relationship between the 3-D Fourier transform (FT) of the volume and the two-dimensional (2-D) FT of a parallel-ray projection of the volume. The critical step in the Fourier-based methods is the estimation of the samples of the 3-D transform of the image from the samples of the 2-D transforms of the projections on the planes through the origin of Fourier space, and vice versa for forward-projection (reprojection). The Fourier-based approaches have the potential for very fast reconstruction, but their straightforward implementation might lead to unsatisfactory results if careful attention is not paid to interpolation and weighting functions. In our previous work, we have investigated optimal interpolation parameters for the Fourier-based forward and back-projectors for iterative image reconstruction. The optimized interpolation kernels were shown to provide excellent quality comparable to the ideal sinc interpolator. This work presents an optimization of interpolation parameters of the 3-D direct Fourier method with Fourier reprojection (3D-FRP) for fully 3-D positron emission tomography (PET) data with incomplete oblique projections. The reprojection step is needed for the estimation (from an initial image) of the missing portions of the oblique data. In the 3D-FRP implementation, we use the gridding interpolation strategy, combined with proper weighting approaches in the transform and image domains. We have found that while the 3-D reprojection step requires similar optimal interpolation parameters as found in our previous studies on Fourier-based iterative approaches, the optimal interpolation parameters for the main 3D-FRP reconstruction stage are quite different. Our experimental results confirm that for the optimal interpolation parameters a very good image accuracy can be achieved even without any extra spectral oversampling, which is a common practice to decrease errors caused by interpolation in Fourier reconstruction.     

基于子空间和投影分离的三维正弦信号频率估计算法

本文提出了一种基于子空间和投影分离的三维正弦信号的频率参数估计算法.算法核心思想在于将三维采样数据阵理解为散布在某一维上的二维切片矩阵列,以此来实现对三维采样数据阵列的降维处理,并通过构造投影矩阵来实现信号中各分量的分离,算法可实现信号各分量三维参数自动配对.在整个估计过程中,算法所用矩阵都维持原采样数据阵规模,因而算法整体运算量较小.计算机仿真结果表明所提算法在性能及运算复杂度上均要优于三维情况下的IMDF算法及HOSVD算法.     

Wavefront-based models for inverse electrocardiography

We introduce two wavefront-based methods for the inverse problem of electrocardiography, which we term wavefront-based curve reconstruction (WBCR) and wavefront-based potential reconstruction (WBPR). In the WBCR approach, the epicardial activation wavefront is modeled as a curve evolving on the heart surface, with the evolution governed by factors derived phenomenologically from prior measured data. The body surface potential/wavefront relationship is modeled via an intermediate mapping of wavefront to epicardial potentials, again derived phenomenologically. In the WBPR approach, we iteratively construct an estimate of epicardial potentials from an estimated wavefront curve according to a simplified model and use it as an initial solution in a Tikhonov regularization scheme. Initial simulation results using measured canine epicardial data show considerable improvement in reconstructing activation wavefronts and epicardial potentials with respect to standard Tikhonov solutions. In particular the WBCR method accurately finds the anisotropic propagation early after epicardial pacing, and the WBPR method finds the wavefront (regions of sharp gradient of the potential) both accurately and with minimal smoothing.     

Convolution backprojection formulas for 3-D vector tomography withapplication to MRI

Vector tomography is the reconstruction of vector fields from measurements of their projections. In previous work, it has been shown that the reconstruction of a general three-dimensional (3-D) vector field is possible from the so-called inner product measurements. It has also been shown how the reconstruction of either the irrotational or solenoidal component of a vector field can be accomplished with fewer measurements than that required for the full field. The present paper makes three contributions. First, in analogy to the two-dimensional (2-D) approach of Norton (1988), several 3-D projection theorems are developed. These lead directly to new vector field reconstruction formulas that are convolution backprojection formulas. It is shown how the local reconstruction property of these 3-D reconstruction formulas permits reconstruction of point flow or of regional flow from a limited data set. Second, simulations demonstrating 3-D reconstructions, both local and nonlocal, are presented. Using the formulas derived herein and those derived in previous work, these results demonstrate the reconstruction of the irrotational and solenoidal components, their potential functions, and the field itself from simulated inner product measurement data. Finally, it is shown how 3-D inner product measurements can be acquired using a magnetic resonance scanner     

Three-dimensional tumor perfusion reconstruction using fractal interpolation functions

It has been shown that the perfusion of blood in tumor tissue can be approximated using the relative perfusion index determined from dynamic contrast-enhanced magnetic resonance imaging (DE-MRI) of the tumor blood pool. Also, it was concluded in a previous report that the blood perfusion in a two-dimensional (2-D) tumor vessel network has a fractal structure and that the evolution of the perfusion front can be characterized using invasion percolation. In this paper, the three-dimensional (3-D) tumor perfusion is reconstructed from the 2-D slices using the method of fractal interpolation functions (FIF), i.e., the piecewise self-affine fractal interpolation model (PSAFIM) and the piecewise hidden variable fractal interpolation model (PHVFIM). The fractal models are compared to classical interpolation techniques (linear, spline, polynomial) by means of determining the 2-D fractal dimension of the reconstructed slices. Using FIFs instead of classical interpolation techniques better conserves the fractal-like structure of the perfusion data. Among the two FIF methods, PHVFIM conserves the 3-D fractality better due to the cross correlation that exists between the data in the 2-D slices and the data along the reconstructed direction. The 3-D structures resulting from PHVFIM have a fractal dimension within 3%-5% of the one reported in literature for 3-D percolation. It is, thus, concluded that the reconstructed 3-D perfusion has a percolation-like scaling. As the perfusion term from bio-heat equation is possibly better described by reconstruction via fractal interpolation, a more suitable computation of the temperature field induced during hyperthermia treatments is expected.     

2.5-D simultaneous multislice reconstruction by series expansion methods from Fourier-rebinned PET data

True three-dimensional (3-D) volume reconstruction from fully 3-D data in positron emission tomography (PET) has only a limited clinical use because of its large computational burden. Fourier rebinning (FORE) of the fully 3-D data into a set of 2-D sinogram data decomposes the 3-D reconstruction process into multiple 2-D reconstructions of decoupled 2-D image slices, thus substantially decreasing the computational burden even in the case when the 2-D reconstructions are performed by an iterative reconstruction algorithm. On the other hand, the approximations involved in the rebinning combined with the decoupling of the image slices cause a certain reduction of image quality, especially when the signal-to-noise ratio of the data is low. We propose a 2.5-D Simultaneous Multislice Reconstruction approach, based on the series expansion principle, where the volume is represented by the superposition of 3-D spherically symmetric bell-shaped basis functions. It takes advantage of the time reduction due to the use of the FORE (2-D) data, instead of the original fully 3-D data, but at the same time uses a 3-D iterative reconstruction approach with 3-D basis functions. The same general approach can be applied to any reconstruction algorithm belonging to the class of series expansion methods (iterative or noniterative) using 3-D basis functions that span multiple slices, and can be used for any multislice sinogram or list mode data whether obtained by a special rebinning scheme or acquired directly by a PET scanner in the 2-D mode using septa. Our studies confirm that the proposed 2.5-D approach provides a considerable improvement in reconstruction quality, as compared to the standard 2-D reconstruction approach, while the reconstruction time is of the same order as that of the 2-D approach and is clinically practical even on a general-purpose computer.     

Asymptotic global confidence regions for 3-D parametric shape estimation in inverse problems.

This paper derives fundamental performance bounds for statistical estimation of parametric surfaces embedded in R3. Unlike conventional pixel-based image reconstruction approaches, our problem is reconstruction of the shape of binary or homogeneous objects. The fundamental uncertainty of such estimation problems can be represented by global confidenceregions, which facilitate geometric inference and optimization ofthe imaging system. Compared to our previous work on global confidence region analysis for curves [two-dimensional (2-D) shapes], computation of the probability that the entire surface estimate lies within the confidence region is more challenging because a surface estimate is an inhomogeneous random field continuously indexed by a 2-D variable. We derive an asymptotic lower bound to this probability by relating it to the exceedence probability of a higher dimensional Gaussian random field, which can, in turn, be evaluated using the tube formula due to Sun. Simulation results demonstrate the tightness of the resulting bound and the usefulness of the three-dimensional global confidence region approach.     

Mean and covariance properties of dynamic PET reconstructions from list-mode data

We derive computationally efficient methods for the estimation of the mean and variance properties of penalized likelihood dynamic positron emission tomography (PET) images. This allows us to predict the accuracy of reconstructed activity estimates and to compare reconstruction algorithms theoretically. We combine a bin-mode approach in which data is modeled as a collection of independent Poisson random variables at each spatiotemporal bin with the space-time separabilities in the imaging equation and penalties to derive rapidly computable analytic mean and variance approximations. We use these approximations to compare bias/variance properties of our dynamic PET image reconstruction algorithm with those of multiframe static PET reconstructions.     

Three-Dimensional Motion Estimation of Atmospheric Layers From Image Sequences

In this paper, we address the problem of estimating 3-D motions of a stratified atmosphere from satellite image sequences. The analysis of 3-D atmospheric fluid flows associated with incomplete observation of atmospheric layers due to the sparsity of cloud systems is very difficult. This makes the estimation of dense atmospheric motion field from satellite image sequences very difficult. The recovery of the vertical component of fluid motion from a monocular sequence of image observations is a very challenging problem for which no solution exists in the literature. Based on a physically sound vertical decomposition of the atmosphere into cloud layers of different altitudes, we propose here a dense motion estimator dedicated to the extraction of 3-D wind fields characterizing the dynamics of a layered atmosphere. Wind estimation is performed over the complete 3-D space, using a multilayer model describing a stack of dynamic horizontal layers of evolving thickness, interacting at their boundaries via vertical winds. The efficiency of our approach is demonstrated on synthetic and real sequences.      

On the possibility of direct Fourier reconstruction from divergent-beam projections

A great number of tomographic systems, especially those equipped with fast data acquisition techniques, scan the objects investigated by divergent (fan) X-ray beams. Fan-beam projection data require special reconstruction techniques to be implemented. Among reconstruction techniques from parallel projection data, the direct Fourier method (DFM) proved to be one of the most promising ones, especially for high-speed image reconstruction in the high-end 3-D and dynamic tomographic systems. The goal of this work is to answer the topical question: how would direct use of the DFM influence the quality of image reconstruction from the fan-beam data? The formula describing the error caused by such an approximation is derived. The conclusions deduced from the formula are confirmed by computer simulations. The boundary values of data acquisition geometry parameters have been estimated for the case of using the DFM without recalculating the fan-beam data.