Sidharth Gupta

Sidharth Gupta

Auto-generated profile, based on publicly available information

Sidharth Gupta

University of Illinois at Urbana-Champaign, Champaign, IL, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 October 2019 in Seismological Research Letters
Verified
Journal Article
Closed access
PDF file
HFHongjian Fang
Hongjian Fang
RHRobert D. van der Hilst
Robert D. van der Hilst
MHMaarten V. de Hoop
Maarten V. de Hoop
KKKonik Kothari
Konik Kothari
SGSidharth Gupta
Sidharth Gupta
IDIvan Dokmanić
Ivan Dokmanić
Ill‐posed seismic inverse problems are often solved using Tikhonov‐type regularization, that is, incorporation of damping and smoothing to obtain stable results. This typically results in overly smooth models, poor amplitude resolution, and a difficult choice between plausible models. Recognizing that the average of parameters can be better constrained than individual parameters, we propose a seismic tomography method that stabilizes the inverse problem by projecting the original high‐dimension model space onto random low‐dimension subspaces and then infers the high‐dimensional solution from combinations of such subspaces. The subspaces are formed by functions constant in Poisson Voronoi cells, which can be viewed as the mean of parameters near a certain location. The low‐dimensional problems are better constrained, and image reconstruction of the subspaces does not require explicit regularization. Moreover, the low‐dimension subspaces can be recovered by subsets of the whole dataset, which increases efficiency and offers opportunities to mitigate uneven sampling of the model space. The final (high‐dimension) model is then obtained from the low‐dimension images in different subspaces either by solving another normal equation or simply by averaging the low‐dimension images. Importantly, model uncertainty can be obtained directly from images in different subspaces. Synthetic tests show that our method outperforms conventional methods both in terms of geometry and amplitude recovery. The application to southern California plate boundary region also validates the robustness of our method by imaging geologically consistent features as well as strong along‐strike variations of San Jacinto fault that are not clearly seen using conventional methods.

22 July 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
SHShuai Huang
Shuai Huang
SGSidharth Gupta
Sidharth Gupta
IDIvan Dokmanic
Ivan Dokmanic
We tackle the problem of recovering a complex signal ${\boldsymbol{x}}\in \mathbb{C}^n$ from quadratic measurements of the form $y_i={\boldsymbol{x}}^*{\boldsymbol{A}}_i{\boldsymbol{x}}$ , where ${\boldsymbol{A}}_i$ is a full-rank, complex random measurement matrix whose entries are generated from a rotation-invariant sub-Gaussian distribution. We formulate it as the minimization of a nonconvex loss. This problem is related to the well understood phase retrieval problem where the measurement matrix is a rank-1 positive semidefinite matrix. Here we study the general full-rank case which models a number of key applications such as molecular geometry recovery from distance distributions and compound measurements in phaseless diffractive imaging. Most prior works either address the rank-1 case or focus on real measurements. The several papers that address the full-rank complex case adopt the computationally-demanding semidefinite relaxation approach. In this paper we prove that the general class of problems with rotation-invariant sub-Gaussian measurement models can be efficiently solved with high probability via the standard framework comprising a spectral initialization followed by iterative Wirtinger flow updates on a nonconvex loss. Numerical experiments on simulated data corroborate our theoretical analysis.

17 November 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
SGSidharth Gupta
Sidharth Gupta
IDIvan Dokmanic
Ivan Dokmanic
We address the phase retrieval problem with errors in the sensing vectors. A number of recent methods for phase retrieval are based on least squares (LS) formulations which assume errors in the quadratic measurements. We extend this approach to handle errors in the sensing vectors by adopting the total least squares (TLS) framework that is used in linear inverse problems with operator errors. We show how gradient descent and the specific geometry of the phase retrieval problem can be used to obtain a simple and efficient TLS solution. Additionally, we derive the gradients of the TLS and LS solutions with respect to the sensing vectors and measurements which enables us to calculate the solution errors. By analyzing these error expressions we determine conditions under which each method should outperform the other. We run simulations to demonstrate that our method can lead to more accurate solutions. We further demonstrate the effectiveness of our approach by performing phase retrieval experiments on real optical hardware which naturally contains both sensing vector and measurement errors.

22 December 2023 in IEEE Transactions on Computational Imaging
Verified
Journal Article
Open access
SGSidharth Gupta
Sidharth Gupta
KKKonik Kothari
Konik Kothari
VDValentin Debarnot
Valentin Debarnot
IDIvan Dokmanić
Ivan Dokmanić
We propose a differentiable imaging framework to address uncertainty in measurement coordinates such as sensor locations and projection angles. We formulate the problem as measurement interpolation at unknown nodes supervised through the forward operator. To solve it we apply implicit neural networks, also known as neural fields, which are naturally differentiable with respect to the input coordinates. We also develop differentiable spline interpolators which perform as well as neural networks, require less time to optimize and have well-understood properties. Differentiability is key as it allows us to jointly fit a measurement representation, optimize over the uncertain measurement coordinates, and perform image reconstruction which in turn ensures consistent calibration. We apply our approach to 2D and 3D computed tomography, and show that it produces improved reconstructions compared to baselines that do not account for the lack of calibration. The flexibility of the proposed framework makes it easy to extend to almost arbitrary imaging problems.

1 January 2016
Verified
Book Chapter
Closed access
SSS. Sethi
S. Sethi
SGS. Gupta
S. Gupta

1 May 2019
Verified
Conference Paper
Closed access
SHShuai Huang
Shuai Huang
SGSidharth Gupta
Sidharth Gupta
IDIvan Dokmanić
Ivan Dokmanić
We tackle the problem of recovering a complex signal x ∈ ℂ n from quadratic measurements of the form y = x*A i x, where {A i } i = 1 m is a set of complex iid standard Gaussian matrices. This non-convex problem is related to the well understood phase retrieval problem where A i is a rank-1 positive semidefinite matrix. Here we study a general full-rank case which models a number of key applications such as molecular geometry recovery from distance distributions and compound measurements in phaseless diffractive imaging. Most prior work either addresses the rank-1 case or focuses on real measurements. The several papers that address the full-rank complex case adopt the semidefinite relaxation approach and are thus computationally demanding. In this paper we propose a method based on the standard framework comprising a spectral initialization followed by iterative gradient descent updates. We prove that when the number of measurements exceeds the signal's length by some constant factor, a globally optimal solution can be recovered from complex quadratic measurements with high probability. Numerical experiments on simulated data corroborate our theoretical analysis.