Lingyun Qiu

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.

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.

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.

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.

D. T. Zhou, J. Chen, H. Wu et al.

In our previous work [Chen el al., J. Comput. Phys., 373(2018)], the quadratic Wasserstein metric is successfully applied to the earthquake location problem. The actual earthquake hypocenter can be accurately recovered starting from initial values very far from the true ones. However, the seismic wave signals need to be normalized since the quadratic Wasserstein metric requires mass conservation. This brings a critical difficulty. Since the amplitude of a seismogram at a receiver is a good representation of the distance between the source and the receiver, simply normalizing the signals will cause the objective function in optimization process to be insensitive to the distance between the source and the receiver. When the data is contaminated with strong noise, the minimum point of the objective function will deviate and lead to a low accurate location result. To overcome the difficulty mentioned above, we apply the Wasserstein-Fisher-Rao (WFR) metric [Chizat et al., Found. Comput. Math., 18(2018)] to the earthquake location problem. The WFR metric is one of the newly developed metric in the unbalanced Optimal Transport theory. It does not require the normalization of the seismic signals. Thus, the amplitude of seismograms can be considered as a new constraint, which can substantially improve the sensitivity of the objective function to the distance between the source and the receiver. As a result, we can expect more accurate location results from the WFR metric based method compare to those based on quadratic Wasserstein metric under high-intensity noise. The numerical examples also demonstrate this.

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.

Yi Wang, Ziyu Zhan, Yuran Wang et al.

Imaging objects hidden outside the direct line of sight expands the effective field of view and is critical for applications such as autonomous driving and robotic perception. Despite impressive progress in time-of-flight (ToF)-based non-line-of-sight (NLOS) imaging, real-world deployment remains challenging because practical measurements are often collected over spatially limited, arbitrarily shaped relay regions-conditions that violate the planar-wall and dense-sampling assumptions made by most existing methods. To address these limitations, we propose a LOS-guided NLOS imaging pipeline that imposes no geometric assumptions on the relay surface and naturally supports both confocal and non-confocal configurations. Our method represents the hidden scene using 3D Gaussian primitives and couples them with an efficient, differentiable transient rendering model, enabling end-to-end optimization directly from measured transients. We validate our approach on real-world measurements from both a public dataset and a custom-built capture system. Across settings, our method achieves state-of-the-art reconstruction fidelity under spatially limited, sparsely sampled conditions, and significantly outperforms existing methods on complex, arbitrary relay surface geometries.

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.