Lingyun Qiu

NA
h-index8
8papers
164citations
Novelty56%
AI Score37

8 Papers

FAJan 18, 2012
Local Analysis of Inverse Problems: Hölder Stability and Iterative Reconstruction

Maarten V. de Hoop, Lingyun Qiu, Otmar Scherzer

We consider a class of inverse problems defined by a nonlinear map from parameter or model functions to the data. We assume that solutions exist. The space of model functions is a Banach space which is smooth and uniformly convex; however, the data space can be an arbitrary Banach space. We study sequences of parameter functions generated by a nonlinear Landweber iteration and conditions under which these strongly converge, locally, to the solutions within an appropriate distance. We express the conditions for convergence in terms of Hölder stability of the inverse maps, which ties naturally to the analysis of inverse problems.

NAFeb 16, 2017
Determining anisotropic conductivity using diffusion tensor imaging data in magneto-acoustic tomography with magnetic induction

Habib Ammari, Lingyun Qiu, Fadil Santosa et al.

In this paper we present a mathematical and numerical framework for a procedure of imaging anisotropic electrical conductivity tensor by integrating magneto-acoutic tomography with data acquired from diffusion tensor imaging. Magneto-acoustic Tomography with Magnetic Induction (MAT-MI) is a hybrid, non-invasive medical imaging technique to produce conductivity images with improved spatial resolution and accuracy. Diffusion Tensor Imaging (DTI) is also a non- invasive technique for characterizing the diffusion properties of water molecules in tissues. We propose a model for anisotropic conductivity in which the conductivity is proportional to the diffusion tensor. Under this assumption, we propose an optimal control approach for reconstructing the anisotropic electrical conductivity tensor. We prove convergence and Lipschitz type stability of the algorithm and present numerical examples to illustrate its accuracy and feasibility.

FASep 26, 2014
Generalized Convergence Rates Results for Linear Inverse Problems in Hilbert Spaces

Roman Andreev, Peter Elbau, Maarten V. de Hoop et al.

In recent years, a series of convergence rates conditions for regularization methods has been developed. Mainly, the motivations for developing novel conditions came from the desire to carry over convergence rates results from the Hilbert space setting to generalized Tikhonov regularization in Banach spaces. For instance, variational source conditions have been developed and they were expected to be equivalent to standard source conditions for linear inverse problems in a Hilbert space setting. We show that this expectation does not hold. However, in the standard Hilbert space setting these novel conditions are optimal, which we prove by using some deep results from Neubauer, and generalize existing convergence rates results. The key tool in our analysis is a novel source condition, which we put into relation to the existing source conditions from the literature. As a positive by-product, convergence rates results can be proven without spectral theory, which is the standard technique for proving convergence rates for linear inverse problems in Hilbert spaces.

NAJun 16, 2012
A convergence analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraints

Maarten V. de Hoop, Lingyun Qiu, Otmar Scherzer

We consider nonlinear inverse problems described by operator equations in Banach spaces. Assuming conditional stability of the inverse problem, that is, assuming that stability holds on a closed, convex subset of the domain of the operator, we introduce a novel nonlinear projected steepest descent iteration and analyze its convergence to an approximate solution given limited accuracy data. We proceed with developing a multi-level algorithm based on a nested family of closed, convex subsets on which stability holds and the stability constants are ordered. Growth of the stability constants is coupled to the increase in accuracy of approximation between neighboring levels to ensure that the algorithm can continue from level to level until the iterate satisfies a desired discrepancy criterion, after a finite number of steps.

NAMar 12, 2015
Analysis of the Magneto-acoustic Tomography with Magnetic Induction (MAT-MI)

Lingyun Qiu, Fadil Santosa

Magnetoacoustic tomography with magnetic induction (MAT-MI) is a coupled-physics medical imaging modality for determining conductivity distribution in biological tissue. The capability of MAT-MI to provide high resolution images has been demonstrated experimentally. MAT-MI involves two steps. The first step is a well-posed inverse source problem for acoustic wave equation, which has been well studied in the literature. This paper concerns mathematical analysis of the second step, a quantitative reconstruction of the conductivity from knowledge of the internal data recovered in the first step, using techniques such as time reversal. The problem is modeled by a system derived from Maxwell's equations. We show that a single internal data determines the conductivity. A global Lipschitz type stability estimate is obtained. A numerical approach for recovering the conductivity is proposed and results from computational experiments are presented.

CVNov 21, 2022
Few-shot Non-line-of-sight Imaging with Signal-surface Collaborative Regularization

Xintong Liu, Jianyu Wang, Leping Xiao et al.

The non-line-of-sight imaging technique aims to reconstruct targets from multiply reflected light. For most existing methods, dense points on the relay surface are raster scanned to obtain high-quality reconstructions, which requires a long acquisition time. In this work, we propose a signal-surface collaborative regularization (SSCR) framework that provides noise-robust reconstructions with a minimal number of measurements. Using Bayesian inference, we design joint regularizations of the estimated signal, the 3D voxel-based representation of the objects, and the 2D surface-based description of the targets. To our best knowledge, this is the first work that combines regularizations in mixed dimensions for hidden targets. Experiments on synthetic and experimental datasets illustrated the efficiency and robustness of the proposed method under both confocal and non-confocal settings. We report the reconstruction of the hidden targets with complex geometric structures with only $5 \times 5$ confocal measurements from public datasets, indicating an acceleration of the conventional measurement process by a factor of 10000. Besides, the proposed method enjoys low time and memory complexities with sparse measurements. Our approach has great potential in real-time non-line-of-sight imaging applications such as rescue operations and autonomous driving.

MATH-PHSep 14, 2024
Neumann Series-based Neural Operator for Solving Inverse Medium Problem

Ziyang Liu, Fukai Chen, Junqing Chen et al.

The inverse medium problem, inherently ill-posed and nonlinear, presents significant computational challenges. This study introduces a novel approach by integrating a Neumann series structure within a neural network framework to effectively handle multiparameter inputs. Experiments demonstrate that our methodology not only accelerates computations but also significantly enhances generalization performance, even with varying scattering properties and noisy data. The robustness and adaptability of our framework provide crucial insights and methodologies, extending its applicability to a broad spectrum of scattering problems. These advancements mark a significant step forward in the field, offering a scalable solution to traditionally complex inverse problems.

CVAug 4, 2025
Fast and Memory-efficient Non-line-of-sight Imaging with Quasi-Fresnel Transform

Yijun Wei, Jianyu Wang, Leping Xiao et al.

Non-line-of-sight (NLOS) imaging seeks to reconstruct hidden objects by analyzing reflections from intermediary surfaces. Existing methods typically model both the measurement data and the hidden scene in three dimensions, overlooking the inherently two-dimensional nature of most hidden objects. This oversight leads to high computational costs and substantial memory consumption, limiting practical applications and making real-time, high-resolution NLOS imaging on lightweight devices challenging. In this paper, we introduce a novel approach that represents the hidden scene using two-dimensional functions and employs a Quasi-Fresnel transform to establish a direct inversion formula between the measurement data and the hidden scene. This transformation leverages the two-dimensional characteristics of the problem to significantly reduce computational complexity and memory requirements. Our algorithm efficiently performs fast transformations between these two-dimensional aggregated data, enabling rapid reconstruction of hidden objects with minimal memory usage. Compared to existing methods, our approach reduces runtime and memory demands by several orders of magnitude while maintaining imaging quality. The substantial reduction in memory usage not only enhances computational efficiency but also enables NLOS imaging on lightweight devices such as mobile and embedded systems. We anticipate that this method will facilitate real-time, high-resolution NLOS imaging and broaden its applicability across a wider range of platforms.