The paper presents a novel approach for dynamic magnetic resonance imaging (MRI) cardiac perfusion imagereconstructionfrom sparse k-space data. It formulates the reconstruction problem in an inverse-methods setting....
详细信息
ISBN:
(纸本)9781424400324
The paper presents a novel approach for dynamic magnetic resonance imaging (MRI) cardiac perfusion imagereconstructionfrom sparse k-space data. It formulates the reconstruction problem in an inverse-methods setting. Relevant prior information is incorporated via a parametric model for the perfusion process. This wealth of prior information empowers the proposed method to give high-quality reconstructions fromvery sparse k-space data. The paper presents reconstruction results using both Cartesian and radial sampling strategies using data simulated from a real acquisition. The proposed method produces high-quality reconstructions using 14% of the k-space data. The model-based approach can potentially greatly benefit cardiac myocardial perfusion studies as well as other dynamic contrast-enhanced MRI applications including tumor imaging.
For weakly scattering permittivities, each measurement of the scattered far field can be interpreted as a sampling point of the Fourier transformation of the object. Furthermore, each sampling point can be accessed by...
详细信息
ISBN:
(纸本)0819445592
For weakly scattering permittivities, each measurement of the scattered far field can be interpreted as a sampling point of the Fourier transformation of the object. Furthermore, each sampling point can be accessed by more than one combination of wavelength, propagation direction, and polarization of the incident field. This means, a set of measurements which access the same sampling point can be regarded as being redundant. For strongly scattering objects the Fourier diffraction slice theorem does not apply. We show that measurements which are redundant in the weakly scattering case can be exploited to resolve difficulties associated with imaging of the strongly scattering objects. One dimensional geometries are investigated to estimate the potential redundant data sets offer for addressing the inverse scattering problem of strongly and multiply scattering objects. In addition, we discuss preliminary results for solving 2D imaging problems.
This work proposes a novel sparse coding based approach for augmenting attributes in both object recognition and facial expression recognition applications. Attributes are a set of manually specified binary descriptio...
详细信息
ISBN:
(纸本)9781479952083
This work proposes a novel sparse coding based approach for augmenting attributes in both object recognition and facial expression recognition applications. Attributes are a set of manually specified binary descriptions of visual objects. Though playing an important role in different applications like zero-shot learning, image description and recognition, the manually specified attributes suffer from the incomplete capturing of the original imagedata. In this work, we propose to augment the original manually specified semantic attributes with the augmented attributes which are also sparse, based on the minimization of the reconstruction error between the original image and the concatenated semantic and augmented attributes. We propose to iteratively learn the dictionaries as well as recover the augmented attributes in the optimization. For our applications of object recognition and facial expression recognition, the augmented attributes combined with the predicted semantic attributes can improve the overall recognition rate. Also, our learned dictionaries show certain meanings captured by the attributes.
The problem of nonlinear distortions of images reconstructed fromincomplete and noisy spectrum data using nonlinear optimization methods such as maximum entropy method is considered. To decrease the level of nonlinea...
详细信息
The problem of nonlinear distortions of images reconstructed fromincomplete and noisy spectrum data using nonlinear optimization methods such as maximum entropy method is considered. To decrease the level of nonlinear distortions it is proposed to seek solution in the space of complex functions using generalized maximum entropy method instead of classical one.
Computed tomography (CT) streak artifacts caused by metal implants have long been recognized as a problem that limits various applications of CT imaging. An effective and robust algorithm is highly desirable to minimi...
详细信息
ISBN:
(纸本)9780819480231
Computed tomography (CT) streak artifacts caused by metal implants have long been recognized as a problem that limits various applications of CT imaging. An effective and robust algorithm is highly desirable to minimize metal artifacts and achieve clinically acceptable CT images. In this work, the raw projection data is viewed as "incomplete" in the presence of metal shadows. Shape and location of metal objects are automatically identified and used as prior knowledge for accurate segmentation of metal shadows in projection domain. An iterative algorithm based on constrained optimization is then used for the imagereconstruction. This algorithm minimizes a quadratic penalized smoothness measure function of the image, subject to the constraint that the estimated projection data is within a specified tolerance of the available metal-shadow-excluded projection data, with image non-negativity enforced. The constrained minimization problem is optimized through the combination of projection onto convex sets (POCS) and steepest gradient descent of the smoothness measure objective. Digital phantom study shows that the proposed constrained optimization algorithm has superior performance in reducing metal artifacts, suppressing noise and improving soft-tissue visibility. Some comparisons are performed with the filtered-back-projection (FBP), FDK, POCS and constrained optimization with total-variation (Tv) objective. Although the algorithm is presented in the context of metal artifacts, it can be generated to imagereconstructionfromincomplete projections caused by limited angular range or low angular sampling rate in both 2D and 3D cases.
The restoration or reconstruction of an object distribution or image when only limited discrete Fourier data are available is a common problem in many disciplines. Such problems are known to be ill-posed but regularis...
详细信息
The restoration or reconstruction of an object distribution or image when only limited discrete Fourier data are available is a common problem in many disciplines. Such problems are known to be ill-posed but regularisation theory defines a set of admissible or approximate estimates for the image by imposing constraints on these estimates. Even in the absence of noise, incomplete sampled data means that there are infinitely many image estimates consistent with, for example, the available Fourier data and the image support. To resolve these ambiguities prior knowledge is used to reduce the class of allowed solutions and to design a model and an optimality criterion.
This paper proposes an accelerating process through the use of a fast and exact line search for the over-relaxed monotone fast iterative shrinkage-threshold algorithms (OMFISTA). This algorithm is applied to high reso...
详细信息
ISBN:
(纸本)9781479983391
This paper proposes an accelerating process through the use of a fast and exact line search for the over-relaxed monotone fast iterative shrinkage-threshold algorithms (OMFISTA). This algorithm is applied to high resolution tomographic imagereconstruction using datafrom the Brazilian Synchrotron Light Source (LNLS). The LNLS can capture lots of datafrom the scanned objects in each angle, but in order to reduce acquisition time, only few angles are captured. Due to the reduced angles, the l(1) penalty is used as a prior to provide a proper reconstruction. Algorithms, such as the fast iterative shrinkage-threshold algorithms (FISTA) and the OMFISTA can be used with some success. However, due to the large computational time at each iteration, even with fast projection/backprojection operators, any reduction in the number of iterations is welcome. In this paper, the fast and exact unidimensional optimization for l(2)-l(1) is used as line search to accelerate the OMFISTA. The results in this paper illustrate that this line search accelerated OMFISTA is faster than FISTA, MFISTA and the OMFISTA.
imagereconstructionfrom noisy and incomplete observations is usually an ill-posed problem. A Bayesian framework may be adopted do deal with this such inverse task by well posing the reconstruction problem. In this a...
详细信息
ISBN:
(纸本)9781424418145
imagereconstructionfrom noisy and incomplete observations is usually an ill-posed problem. A Bayesian framework may be adopted do deal with this such inverse task by well posing the reconstruction problem. In this approach, the ill poseness nature of the reconstruction is removed by minimizing a two-term energy function. The first term pushes the solution toward the data and the second regularizes the solution. A Bayesian algorithm for ultrasound imagereconstruction and de-noising is proposed where an edge preserving prior is used to reduce the smoothing effect at the transitions. The prior distribution is based on log-Euclidean potential functions that are particular suitable in reconstruction problems under the constraint of positivity, that is, when the unknowns to be estimated should be positive, which is the case, where the noisy observations are modeled by a Rayleigh distribution. In this paper, the reconstruction procedure is formulated as the optimization of a convex function and a Newton method is adopted to obtain the minimizer. This strategy guarantees a convergence to the global minimum in a small number of iterations. Experimental results, using synthetic and real medical images are shown. The proposed method produces images where speckle noise is effectively suppressed and important clinical details (organ and tissue transitions) are preserved.
In this paper, a sparse representation of the data for an inverse synthetic aperture radar (ISAR) system is provided in two dimensions. The proposed sparse representation motivates the use a of a Convex Optimization t...
详细信息
ISBN:
(纸本)9781510600980
In this paper, a sparse representation of the data for an inverse synthetic aperture radar (ISAR) system is provided in two dimensions. The proposed sparse representation motivates the use a of a Convex Optimization that recovers the image with far less samples, which is required by Nyquist-Shannon sampling theorem to increases the efficiency and decrease the cost of calculation in radar imaging.
The problem of imagereconstruction of multiple bioelectric dipolar current sources is considered. The authors report a novel imagereconstruction method which is capable of finding not only the magnitude but also the...
详细信息
The problem of imagereconstruction of multiple bioelectric dipolar current sources is considered. The authors report a novel imagereconstruction method which is capable of finding not only the magnitude but also the orientation of dipoles for simple dipole combinations. The input simulated data is provided by a magnetoacoustic technique of noninvasive current measurement. The reconstruction method, called the vectorized iterative least-squares technique (v-ILST), is based on the classical ILST approach used in computerized tomography.
暂无评论