Related papers: Nonlinear inverse problem by T-matrix completion. …
There are a large number of methods for solving under-determined linear inverse problem. Many of them have very high time complexity for large datasets. We propose a new method called Two-Stage Sparse Representation (TSSR) to tackle this…
Consider a symmetric matrix $A(v)\in\RR^{n\times n}$ depending on a vector $v\in\RR^n$ and satisfying the property $A(\alpha v)=A(v)$ for any $\alpha\in\RR\backslash{0}$. We will here study the problem of finding $(\lambda,v)\in\RR\times…
The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both…
The independent set problem, ISP for short, asks for the maximal number of vertices in a (large) graph which can be occupied such that none of them are neighbors. We address the question from a statistical mechanics perspective, in the case…
Remotely sensed images may contain some missing areas because of poor weather conditions and sensor failure. Information of those areas may play an important role in the interpretation of multitemporal remotely sensed data. The paper aims…
In this paper, the inverse scattering transform for the integrable discrete nonlocal PT symmetric nonlinear Schr\"odinger equation with nonzero boundary conditions is presented. According to the two different signs of symmetry reduction and…
We extend the T-matrix approach to light scattering by spherical particles to some simple cases in which the scatterers are optically anisotropic. Specifically we consider cases in which the spherical particles include radially and…
We propose a Bayesian inference framework to estimate uncertainties in inverse scattering problems. Given the observed data, the forward model and their uncertainties, we find the posterior distribution over a finite parameter field…
We study the structure of solutions to linear programming formulations for the traveling salesperson problem (TSP). We perform a detailed analysis of the support of the subtour elimination linear programming relaxation, which leads to…
The computation of light scattering by the superposition T-matrix scheme has been so far restricted to systems made of particles that are either sparsely distributed or of near-spherical shape. In this work, we extend the range of…
A generalization of the S-parameter retrieval method for finite three-dimensional inhomogeneous objects under arbitrary illumination and observation conditions is presented. The effective permittivity of such objects may be rigorously…
The transmission matrix (TM) is a representation to describe the light scattering process through a scattering medium. The degree of control elements in TM is correlated with the capacity of evaluating enormous equations with tremendous…
We develop a novel wave imaging scheme for reconstructing the shape of an inhomogeneous scatterer and we consider the inverse acoustic obstacle scattering problem as a prototype model for our study. There exists a wealth of reconstruction…
In this article we study the problem of recovering the unknown solution of a linear ill-posed problem, via iterative regularization methods. We review the problem of projection-regularization from a statistical point of view. A basic…
In this paper we examine iterative methods for solving the forward ($A{\bf x}={\bf b}$) and adjoint ($A^{T}{\bf y}={\bf g}$) systems of linear equations used to approximate the scattering amplitude, defined by ${\bf g}^{T}{\bf x}={\bf…
Network structures are reconstructed from dynamical data by respectively naive mean field (nMF) and Thouless-Anderson-Palmer (TAP) approximations. For TAP approximation, we use two methods to reconstruct the network: a) iteration method; b)…
Multi-spectral CT (MSCT) is increasingly used in industrial non-destructive testing and medical diagnosis because of its outstanding performance like material distinguishability. The process of obtaining MSCT data can be modeled as…
The Densest Subgraph Problem (DSP) is widely used to identify community structures and patterns in networks such as bioinformatics and social networks. While solvable in polynomial time, traditional exact algorithms face computational and…
The Half-Space Matching (HSM) method has recently been developed as a new method for the solution of 2D scattering problems with complex backgrounds, providing an alternative to Perfectly Matched Layers (PML) or other artificial boundary…
In Optical diffraction tomography, the multiply scattered field is a nonlinear function of the refractive index of the object. The Rytov method is a linear approximation of the forward model, and is commonly used to reconstruct images.…