## Journals

- Advances in Mathematics of Communications
- Big Data & Information Analytics
- Communications on Pure & Applied Analysis
- Discrete & Continuous Dynamical Systems - A
- Discrete & Continuous Dynamical Systems - B
- Discrete & Continuous Dynamical Systems - S
- Evolution Equations & Control Theory
- Inverse Problems & Imaging
- Journal of Computational Dynamics
- Journal of Dynamics & Games
- Journal of Geometric Mechanics
- Journal of Industrial & Management Optimization
- Journal of Modern Dynamics
- Kinetic & Related Models
- Mathematical Biosciences & Engineering
- Mathematical Control & Related Fields
- Mathematical Foundations of Computing
- Networks & Heterogeneous Media
- Numerical Algebra, Control & Optimization
- AIMS Mathematics
- Conference Publications
- Electronic Research Announcements
- Mathematics in Engineering

### Open Access Journals

IPI

Obtaining high quality images is very important in many areas of applied sciences, such as medical imaging, optical microscopy, and astronomy. Image reconstruction can be considered as solving the ill-posed and inverse problem $y=Ax+n$, where $x$ is the image to be reconstructed and $n$ is the unknown noise. In this paper, we propose general robust expectation maximization (EM)-type algorithms for image reconstruction. Both Poisson noise and Gaussian noise types are considered. The EM-type algorithms are performed using iteratively EM (or SART for weighted Gaussian noise) and regularization in the image domain. The convergence of these algorithms is proved in several ways: EM with

*a priori*information and alternating minimization methods. To show the efficiency of EM-type algorithms, the application in computerized tomography reconstruction is chosen.
IPI

Image recovery using functions of bounded variation and Sobolev spaces of negative differentiability

In this work we wish to recover an unknown image from a blurry, or noisy-blurry version. We solve this inverse problem by energy
minimization and regularization. We seek a solution of the form $u + v$,
where $u$ is a function of bounded variation (cartoon component), while $v$ is
an oscillatory component (texture), modeled by a Sobolev function with
negative degree of differentiability. We give several results of existence and characterization of minimizers of the proposed optimization problem.
Experimental results show that this
cartoon + texture model better recovers textured details in natural images, by comparison with the more standard models where the unknown is restricted only to the space of functions of bounded variation.

keywords:
Sobolev spaces
,
oscillatory functions.
,
Image restoration
,
bounded variation
,
variational models

IPI

Cartoon-texture regularization is a technique for reconstructing fine-scale
details from ill-posed imaging problems, which are often ill-posed because of
some non-invertible convolution kernel. Here we propose
a cartoon-texture regularization for deblurring problems with semi-known kernel.
The cartoon component is modeled by a function of bounded variation, while
the texture component is measured by an approximate duality with Lipschitz functions ($W^{1,\infty}$). To approximate the dual Lipschitz norm, which is difficult to calculate, we
propose an approach using concentration of measure. This provides
an accurate and differentiable expression. We also present numerical results
for our cartoon-texture decomposition, both in the case of a semi-known deblurring
kernel and the case of a known kernel. The texture norm enables one to
numerically reconstruct fine scale details that are typically difficult to recover from
blurred images, and for semi-known deblurring the method quickly leads to
the correct kernel, even when that kernel contains noise.

IPI

In this work, we wish to denoise HARDI (High Angular Resolution Diffusion Imaging) data arising in medical brain imaging. Diffusion imaging is a relatively new and powerful method to measure the three-dimensional profile of water diffusion at each point in the brain. These images can be used to reconstruct fiber directions and pathways in the living brain, providing detailed maps of fiber integrity and connectivity. HARDI data is a powerful new extension of diffusion imaging, which goes beyond the diffusion tensor imaging (DTI) model: mathematically, intensity data is given at every voxel and at any direction on the sphere. Unfortunately, HARDI data is usually highly contaminated with noise, depending on the

*b-value*which is a tuning parameter pre-selected to collect the data. Larger*b-values*help to collect more accurate information in terms of measuring diffusivity, but more noise is generated by many factors as well. So large*b-values*are preferred, if we can satisfactorily reduce the noise without losing the data structure. Here we propose two variational methods to denoise HARDI data. The first one directly denoises the collected data $S$, while the second one denoises the so-called sADC (spherical Apparent Diffusion Coefficient), a field of radial functions derived from the data. These two quantities are related by an equation of the form $S = S_0\exp(-b\cdot sADC)$ (in the noise-free case). By applying these two different models, we will be able to determine which quantity will most accurately preserve data structure after denoising. The theoretical analysis of the proposed models is presented, together with experimental results and comparisons for denoising synthetic and real HARDI data.## Year of publication

## Related Authors

## Related Keywords

[Back to Top]