Search

We present a new inner–outer iterative algorithm for edge enhancement in imaging problems. At each outer iteration, we formulate a Tikhonov-regularized problem where the penalization is expressed in the two-norm and involves a regularization operator designed to improve edge resolution as the outer iterations progress, through an adaptive process. An efficient hybrid regularization method is used to project the Tikhonov-regularized problem onto approximation subspaces of increasing dimensions (inner iterations), while conveniently choosing the regularization parameter (by applying well-known techniques, such as the discrepancy principle or the -curve criterion, to the projected problem). This procedure results in an automated algorithm for edge recovery that does not involve regularization parameter tuning by the user, nor repeated calls to sophisticated optimization algorithms, and is therefore particularly attractive from a computational point of view. A key to the success of the new algorithm is the design of the regularization operator through the use of an adaptive diagonal weighting matrix that effectively enforces smoothness only where needed. We demonstrate the value of our approach on applications in x-ray CT image reconstruction and in image deblurring, and show that it can be computationally much more attractive than other well-known strategies for edge preservation, while providing solutions of greater or equal quality. [ABSTRACT FROM AUTHOR]

The image reconstruction of chromophore concentrations using diffuse optical tomography (DOT) data can be described mathematically as an ill-posed inverse problem. Recent work has shown that the use of hyperspectral DOT data, as opposed to data sets comprising a single or, at most, a dozen wavelengths, has the potential for improving the quality of the reconstructions. The use of hyperspectral diffuse optical data in the formulation and solution of the inverse problem poses a significant computational burden. The forward operator is, in actuality, nonlinear. However, under certain assumptions, a linear approximation, called the Born approximation, provides a suitable surrogate for the forward operator, and we assume this to be true in the present work. Computation of the Born matrix requires the solution of thousands of large scale discrete PDEs and the reconstruction problem requires matrix-vector products with the (dense) Born matrix. In this paper, we address both of these difficulties, thus making the Born approach a computational viable approach for hyperspectral DOT reconstruction. In this paper, we assume that the images we wish to reconstruct are anomalies of unknown shape and constant value, described using a parametric level set approach [A. Aghasi, M. Kilmer, and E. L. Miller, SIAM J. Imaging Sci., 4 (2011), pp. 618-650] on a constant background. Specifically, to address the issue of the PDE solves, we develop a novel recycling-based Krylov subspace approach that leverages certain system similarities across wavelengths. To address the expense of using the Born operator in the inversion, we present a fast algorithm for compressing the Born operator that locally compresses across wavelengths for a given source-detector set and then recursively combines the low-rank factors to provide a global low-rank approximation. This low-rank approximation can be used implicitly to speed up the recovery of the shape parameters and the chromophore concentrations. We provide a detailed analysis of the accuracy and computational costs of the resulting algorithms and demonstrate the validity of our approach by detailed numerical experiments on a realistic geometry for breast imaging. [ABSTRACT FROM AUTHOR]

Dual-energy computerized tomography has gained great interest because of its ability to characterize the chemical composition of a material rather than simply providing relative attenuation images as in conventional tomography. The purpose of this paper is to introduce a novel polychromatic dual-energy processing algorithm, with an emphasis on detection and characterization of piecewise constant objects embedded in an unknown cluttered background. Physical properties of the objects, particularly the Compton scattering and photoelectric absorption coefficients, are assumed to be known with some level of uncertainty. Our approach is based on a level-set representation of the characteristic function of the object and encompasses a number of regularization techniques for addressing both the prior information we have concerning the physical properties of the object and the fundamental physics-based limitations associated with our ability to jointly recover the Compton scattering and photoelectric absorption properties of the scene. In the absence of an object with appropriate physical properties, our approach returns a null characteristic function and, thus, can be viewed as simultaneously solving the detection and characterization problems. Unlike the vast majority of methods that define the level-set function nonparametrically, i.e., as a dense set of pixel values, we define our level set parametrically via radial basis functions and employ a Gauss–Newton-type algorithm for cost minimization. Numerical results show that the algorithm successfully detects objects of interest, finds their shape and location, and gives an adequate reconstruction of the background. [ABSTRACT FROM PUBLISHER]

Adjoint field methods are both elegant and efficient for calculating sensitivity information required across a wide range of physics-based inverse problems. In this letter, we provide a unified approach to the derivation of such methods for problems whose physics are provided by Poisson's equation. Unlike existing approaches in the literature, we consider in detail and explicitly the role of general boundary conditions in the derivation of the associated adjoint-field-based sensitivities. We highlight the relationship between the adjoint field computations required for both gradient decent and Gauss–Newton approaches to image formation. Our derivation is based on standard results from vector calculus coupled with transparent manipulation of the underlying partial different equations, thereby making the concepts employed in this letter easily adaptable to other systems of interest. [ABSTRACT FROM PUBLISHER]

Voxel-based reconstructions in diffuse optical tomography (DOT) using a quadratic regularization functional tend to produce very smooth images due to the attenuation of high spatial frequencies. This then causes difficulty in estimating the spatial extent and contrast of anomalous regions such as tumors. Given an assumption that the target image is piecewise constant, we can employ a parametric model to estimate the boundaries and contrast of an inhomogeneity directly. In this paper, we describe a method to directly reconstruct such a shape boundary from diffuse optical measurements. We parameterized the object boundary using a spherical harmonic basis, and derived a method to compute sensitivities of measurements with respect to shape parameters. We introduced a centroid constraint to ensure uniqueness of the combined shape/center parameter estimate, and a projected Newton method was utilized to optimize the object center position and shape parameters simultaneously. Using the shape Jacobian, we also computed the Cramér-Rao lower bound on the theoretical estimator accuracy given a particular measurement configuration, object shape, and level of measurement noise. Knowledge of the shape sensitivity matrix and of the measurement noise variance allows us to visualize the shape uncertainty region in three dimensions, giving a confidence region for our shape estimate. We have implemented our shape reconstruction method, using a finite-difference-based forward model to compute the forward and adjoint fields. Reconstruction results are shown for a number of simulated target shapes, and we investigate the problem of model order selection using realistic levels of measurement noise. Assuming a signal-to-noise ratio in the amplitude measurements of 40 dB and a standard deviation in the phase measurements of 0.1°, we are able to estimate an object represented with an eighth-order spherical harmonic model having an absorption contrast of 0.15 cm-1 and a volume of 4.82 cm³ with errors of less than 10% in object volume find absorption contrast. We also investigate the robustness of our shape-based reconstruction approach to a violation of the assumption that the medium is purely piecewise constant. [ABSTRACT FROM AUTHOR]

A new parameter-free graph-morphology-based segmentation algorithm is proposed to address the problem of partitioning a 3D triangular mesh into disjoint submeshes that correspond to the physical parts of the underlying object. Curvedness, which is a rotation and translation invariant shape descriptor, is computed at every vertex in the input triangulation. Iterative graph dilation and morphological filtering of the outlier curvedness values result in multiple disjoint maximally connected submeshes such that each submesh contains a set of vertices with similarcurvedness values, and vertices in disjoint submeshes have significantly different curvedness values. Experimental evaluations using the triangulations of a number of complex objects demonstrate the robustness and the efficiency of the proposed algorithm and the results prove that it compares well with a number of state-of-the-art mesh segmentation algorithms. [ABSTRACT FROM AUTHOR]

In this paper, we present an adaptive two-pass rank order filter to remove impulse noise in highly corrupted images. When the noise ratio is high, rank order filters, such as the median filter for example, can produce unsatisfactory results. Better results can be obtained by applying the filter twice, which we call two-pass filtering. To further improve the performance, we develop an adaptive two-pass rank order filter. Between the passes of filtering, an adaptive process is used to detect irregularities in the spatial distribution of the estimated impulse noise. The adaptive process then selectively replaces some pixels changed by the first pass of filtering with their original observed pixel values. These pixels are then kept unchanged during the second filtering. In combination, the adaptive process and the second filter eliminate more impulse noise and restore some pixels that are mistakenly altered by the first filtering. As a final result, the reconstructed image maintains a higher degree of fidelity and has a smaller amount of noise. The idea of adaptive two-pass processing can be applied to many rank order filters, such as a center-weighted median filter (CWMF), adaptive CWMF, lower-upper-middle filter, and soft-decision rank-order-mean filter. Results from computer simulations are used to demonstrate the performance of this type of adaptation using a number of basic rank order filters. [ABSTRACT FROM AUTHOR]

In this paper, we examine the problem of locating an object in an image when size and rotation are unknown. Previous work has shown that with known geometric parameters, an image restoration method can be useful by estimating a delta function at the object location. When the geometric parameters are unknown, this method becomes impractical because the likelihood surface to be minimized across size and rotation has numerous local minima and areas of zero gradient. In this paper, we propose a new approach where a smooth approximation of the template is used to minimize a well-behaved likelihood surface. A coarse-to-fine approximation of the original template using a diffusion-like equation is used to create a library of templates. Using this library, we can successively perform minimizations which are locally well-behaved. As detail is added to the template, the likelihood surface gains local minima, but previous estimates place us within a wellbehaved "bowl" around the global minimum, leading to an accurate estimate. Numerical experiments are shown which verify the value of this approach for a wide range of values of the geometric parameters. [ABSTRACT FROM AUTHOR]

Dynamic magnetic resonance imaging (MRI) refers to the acquisition of a sequence of MRI images to monitor temporal changes in tissue structure. In this paper we present a method for the estimation of dynamic MRI sequences based on two complimentary strategies: an adaptive framework for the estimation of the MRI images themselves, and an adaptive method to tailor the MRI system excitations for each data acquisition. We refer to this method as the doubly adaptive temporal update method (DATUM) for dynamic MRI. Analysis of the adaptive image estimate framework shows that calculating the optimal system excitations for each new image requires complete knowledge of the next image in the sequence. Since this is not realizable, we introduce a linear predictor to aid in determining appropriate excitations. Simulated examples using real MRI data are included to illustrate that the doubly adaptive strategy can provide estimates with lower steady state error than previously proposed methods and also the ability to recover from dramatic changes in the image sequence. [ABSTRACT FROM AUTHOR]