ISSN 19308337(print)
ISSN 19308345(online) 
Current volume

Journal archive


IPI is covered in Science Citation Index, Current Contents/Physical, Chemical & Earth Sciences (CC/PC&ES) ISI Alerting Services, Journal Citation Reports/Science Edition, Math Reviews, MathSciNet, Zentralblatt.
Inverse Problems and Imaging includes research articles of the highest quality that employ innovative mathematical and modeling techniques to study inverse and imaging problems arising in engineering and other sciences. Every published paper has a strong mathematical orientation employing methods from such areas as control theory, discrete mathematics, differential geometry, harmonic analysis, functional analysis, integral geometry, mathematical physics, numerical analysis, optimization, partial differential equations, stochastic and statistical methods. The field of applications include medical and other imaging, nondestructive testing, geophysical prospection and remote sensing as well as image analysis and image processing.
This journal is committed to recording important new results in its field and will maintain the highest standards of innovation and quality. To be published in this journal, a paper must be correct, novel, nontrivial and of interest to a substantial number of researchers and readers.
IPI will have four issues published in 2016 in February, May, August and November.
Archived in Portico 
TOP 10 Most Read Articles in IPI, September 2016
1 
Coordinate descent optimization for l^{1} minimization with application to compressed sensing; a greedy algorithm
Volume 3, Number 3, Pages: 487  503, 2009
Yingying Li
and Stanley Osher
Abstract
Full Text
Related Articles
We propose a fast algorithm for solving the Basis Pursuit problem, min_{u}
$\{u_1\: \Au=f\}$, which has application to compressed sensing.
We design an efficient method for solving the related unconstrained problem min_{u} $E(u) = u_1 + \lambda \Auf\^2_2$ based on a greedy coordinate descent
method. We claim that in combination with a Bregman iterative method, our
algorithm will achieve a solution with speed and accuracy competitive with some
of the leading methods for the basis pursuit problem.

2 
Template matching via $l_1$ minimization and its application to hyperspectral data
Volume 5, Number 1, Pages: 19  35, 2011
Zhaohui Guo
and Stanley Osher
Abstract
References
Full Text
Related Articles
Detecting and identifying targets or objects that are present in
hyperspectral ground images are of great interest. Applications
include land and environmental monitoring, mining, military, civil
searchandrescue operations, and so on. We propose and analyze an
extremely simple and efficient idea for template matching based on
$l_1$ minimization. The designed algorithm can be applied in
hyperspectral classification and target detection. Synthetic image
data and real hyperspectral image (HSI) data are used to assess the
performance, with comparisons to other approaches, e.g. spectral
angle map (SAM), adaptive coherence estimator (ACE),
generalizedlikelihood ratio test (GLRT) and matched filter. We
demonstrate that this algorithm achieves excellent results with both
high speed and accuracy by using Bregman iteration.

3 
Video stabilization of atmospheric turbulence distortion
Volume 7, Number 3, Pages: 839  861, 2013
Yifei Lou,
Sung Ha Kang,
Stefano Soatto
and Andrea L. Bertozzi
Abstract
References
Full Text
Related Articles
We present a method to enhance the quality of a video sequence
captured through a turbulent atmospheric medium, and give an
estimate of the radiance of the distant scene, represented as a
``latent image,'' which is assumed to be static throughout the
video. Due to atmospheric turbulence, temporal averaging produces
a blurred version of the scene's radiance. We propose a method
combining Sobolev gradient and Laplacian to stabilize the video
sequence, and a latent image is further found utilizing the ``lucky
region" method. The video sequence is stabilized while keeping
sharp details, and the latent image shows more consistent straight
edges. We analyze the wellposedness for the stabilizing PDE and the
linear stability of the numerical scheme.

4 
The "exterior approach" to solve the inverse obstacle problem for the Stokes system
Volume 8, Number 1, Pages: 23  51, 2014
Laurent Bourgeois
and Jérémi Dardé
Abstract
References
Full Text
Related Articles
We apply an ``exterior approach" based on the coupling of a method of quasireversibility and of a level set method in order to recover a fixed obstacle immersed in a Stokes flow from boundary measurements.
Concerning the method of quasireversibility, two new mixed formulations are introduced in order to solve the illposed Cauchy problems for the Stokes system by using some classical conforming finite elements. We provide some proofs for the convergence of the quasireversibility methods on the one hand and of the level set method on the other hand.
Some numerical experiments in $2D$ show the efficiency of the two mixed formulations and of the exterior approach based on one of them.

5 
Detecting small low emission radiating sources
Volume 7, Number 1, Pages: 47  79, 2013
Moritz Allmaras,
David Darrow,
Yulia Hristova,
Guido Kanschat
and Peter Kuchment
Abstract
References
Full Text
Related Articles
In order to prevent influx of highly enriched nuclear material
through border checkpoints, new advanced detection schemes need to be
developed. Typical issues faced in this context are sources with very
low emission against a dominating natural background radiation. Sources
are expected to be small and shielded and hence cannot be detected from
measurements of radiation levels alone.
We consider collimated and Comptontype measurements and propose a detection
method that relies on the geometric singularity of small sources to
distinguish them from the more uniform background.
The method is characterized by high sensitivity and specificity and
allows for assigning confidence probabilities of detection.
The validity of our approach can be justified using properties of
related techniques from medical imaging. Results of numerical
simulations are presented for collimated and Comptontype measurements.
The 2D case is considered in detail.

6 
Adaptive meshing approach to identification of cracks with
electrical impedance tomography
Volume 8, Number 1, Pages: 127  148, 2014
Kimmo Karhunen,
Aku Seppänen
and Jari P. Kaipio
Abstract
References
Full Text
Related Articles
Electrical impedance tomography (EIT) is a noninvasive imaging
modality in which the internal conductivity distribution
is reconstructed
based on boundary voltage measurements.
In this work, we consider the
application of EIT to nondestructive testing (NDT) of materials and,
especially, crack detection.
The main goal is to estimate the location, depth
and orientation of a crack in three dimensions.
We formulate the crack detection task as a shape estimation problem for
boundaries imposed with Neumann zero boundary conditions.
We propose an adaptive meshing algorithm that iteratively
seeks the maximum a posteriori estimate for the shape of the crack.
The approach is tested both numerically and experimentally.
In all test cases, the EIT measurements
are collected using a set of electrodes attached on only
a single planar surface of the target 
this is often the only realizable configuration in NDT of
large building structures,
such as concrete walls.
The results show that with the proposed computational method,
it is possible to recover the position and size of the crack,
even in cases where the background conductivity is inhomogeneous.

7 
Heat source identification based on $l_1$ constrained minimization
Volume 8, Number 1, Pages: 199  221, 2014
Yingying Li,
Stanley Osher
and Richard Tsai
Abstract
References
Full Text
Related Articles
We consider the inverse problem of finding sparse initial data from the
sparsely sampled solutions of the heat equation. The initial data are assumed
to be a sum of an unknown but finite number of Dirac delta functions at unknown locations.
Pointwise values of the heat solution at only a few locations are used in an
$l_1$ constrained optimization to find the initial data. A concept of
domain of effective sensing is introduced to speed up the already fast Bregman
iterative algorithm for $l_1$ optimization. Furthermore, an algorithm which
successively adds new measurements at specially chosen locations is introduced. By
comparing the solutions of the inverse problem obtained from different number of
measurements, the algorithm decides where to add new measurements in order to
improve the reconstruction of the sparse initial data.

8 
Convergence rates for Kaczmarztype regularization methods
Volume 8, Number 1, Pages: 149  172, 2014
Stefan Kindermann
and Antonio Leitão
Abstract
References
Full Text
Related Articles
This article is devoted to the convergence analysis of a special family of iterative
regularization methods for solving systems of illposed operator equations in Hilbert
spaces, namely Kaczmarztype methods.
The analysis is focused on the LandweberKaczmarz (LK) explicit iteration and the
iterated TikhonovKaczmarz (iTK) implicit iteration. The corresponding symmetric
versions of these iterative methods are also investigated (sLK and siTK).
We prove convergence rates for the four methods above, extending and complementing the
convergence analysis established originally in [22,13,12,8].

9 
The Moreau envelope approach for the L1/TV image denoising model
Volume 8, Number 1, Pages: 53  77, 2014
Feishe Chen,
Lixin Shen,
Yuesheng Xu
and Xueying Zeng
Abstract
References
Full Text
Related Articles
This paper presents the Moreau envelope viewpoint for the L1/TV
image denoising model. The main algorithmic difficulty for the
numerical treatment of the L1/TV model lies in the
nondifferentiability of both the fidelity and regularization terms
of the model. To overcome this difficulty, we propose five modified
L1/TV models by replacing one or two nondifferentiable
functions in the L1/TV model with their corresponding Moreau
envelopes. We prove that several existing approaches for the L1/TV
model essentially solve some of the modified models, but not the
original L1/TV model. Algorithms for the L1/TV model and its five
variants are proposed under a unified framework based on fixedpoint equations (via the
proximity operator) which characterize the solutions of the models. Depending upon whether we smooth the
regularization term or not, two different types of proximity
algorithms are presented. The convergence rates of both types of the
algorithms are improved significantly by exploring either the
strategy of the GaussSeidel iteration, or the FISTA, or both. We
compare the performance of various modified L1/TV models for the
problem of impulse noise removal, and make recommendations based on
our numerical experiments for using these models in applications.

10 
A MumfordShah levelset approach for the inversion and
segmentation of SPECT/CT data
Volume 5, Number 1, Pages: 137  166, 2011
Esther Klann,
Ronny Ramlau
and Wolfgang Ring
Abstract
References
Full Text
Related Articles
This paper presents a levelset based approach for the simultaneous reconstruction and segmentation of the activity as well as the density distribution from tomography data gathered by an integrated SPECT/CT scanner.
Activity and density distributions are modeled as piecewise constant functions. The segmenting contours and the corresponding function values of both the activity and the density distribution are found as minimizers of a MumfordShah like functional over the set of admissible contours and  for fixed contours  over the spaces of piecewise constant density and activity distributions which may be discontinuous across their corresponding contours. For the latter step a Newton method is used to solve the nonlinear optimality system. Shape sensitivity calculus is used to find a descent direction for the cost functional with respect to the geometrical variables which leads to an update formula for the contours in the levelset framework. A heuristic approach for the insertion of new components for the activity as well as the density function is used. The method is tested for synthetic data with different noise levels.

Go to top

