We consider the problem of estimating the output of an unknown discrete-time linear time-invariant system and identifying a model of the system, where only measurements via a nonlinear dynamic sensor with known dynamics are available. The main result of this paper is a rank-constrained semidefinite program, which provides an equivalent characterization of this identification and estimation problem. This extends existing results from Wiener system identification to the more general case that the nonlinear block exhibits dynamic behavior, which is a commonly found scenario in practical applications. Notably, the result can be applied in the presence of nonlinear sensors with general non-invertible system dynamics. Two examples are used to illustrate the applicability of our approach.
more »
« less
A Non-Convex Approach To Joint Sensor Calibration And Spectrum Estimation
Blind sensor calibration for spectrum estimation is the problem of estimating the unknown sensor calibration parameters as well as the parameters-of-interest of the impinging signals simultaneously from snapshots of measurements obtained from an array of sensors. In this paper, we consider blind phase and gain calibration (BPGC) problem for direction-of-arrival estimation with multiple snapshots of measurements obtained from an uniform array of sensors, where each sensor is perturbed by an unknown gain and phase parameter. Due to the unknown sensor and signal parameters, BPGC problem is a highly nonlinear problem. Assuming that the sources are uncorrelated, the covariance matrix of the measurements in a perfectly calibrated array is a Toeplitz matrix. Leveraging this fact, we first change the nonlinear problem to a linear problem considering certain rank-one positive semidefinite matrix, and then suggest a non-convex optimization approach to find the factor of the rank-one matrix under a unit norm constraint to avoid trivial solutions. Numerical experiments demonstrate that our proposed non-convex optimization approach provides better or competitive recovery performance than existing methods in the literature, without requiring any tuning parameters.
more »
« less
- Award ID(s):
- 1818571
- NSF-PAR ID:
- 10078982
- Date Published:
- Journal Name:
- 2018 IEEE Statistical Signal Processing Workshop (SSP)
- Page Range / eLocation ID:
- 398 to 402
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Low-rank matrix recovery is a fundamental problem in machine learning with numerous applications. In practice, the problem can be solved by convex optimization namely nuclear norm minimization, or by non-convex optimization as it is well-known that for low-rank matrix problems like matrix sensing and matrix completion, all local optima of the natural non-convex objectives are also globally optimal under certain ideal assumptions. In this paper, we study new approaches for matrix sensing in a semi-random model where an adversary can add any number of arbitrary sensing matrices. More precisely, the problem is to recover a low-rank matrix $X^\star$ from linear measurements $b_i = \langle A_i, X^\star \rangle$, where an unknown subset of the sensing matrices satisfies the Restricted Isometry Property (RIP) and the rest of the $A_i$'s are chosen adversarially. It is known that in the semi-random model, existing non-convex objectives can have bad local optima. To fix this, we present a descent-style algorithm that provably recovers the ground-truth matrix $X^\star$. For the closely-related problem of semi-random matrix completion, prior work [CG18] showed that all bad local optima can be eliminated by reweighting the input data. However, the analogous approach for matrix sensing requires reweighting a set of matrices to satisfy RIP, which is a condition that is NP-hard to check. Instead, we build on the framework proposed in [KLL$^+$23] for semi-random sparse linear regression, where the algorithm in each iteration reweights the input based on the current solution, and then takes a weighted gradient step that is guaranteed to work well locally. Our analysis crucially exploits the connection between sparsity in vector problems and low-rankness in matrix problems, which may have other applications in obtaining robust algorithms for sparse and low-rank problems.more » « less
-
Abstract We study the low-rank phase retrieval problem, where our goal is to recover a $d_1\times d_2$ low-rank matrix from a series of phaseless linear measurements. This is a fourth-order inverse problem, as we are trying to recover factors of a matrix that have been observed, indirectly, through some quadratic measurements. We propose a solution to this problem using the recently introduced technique of anchored regression. This approach uses two different types of convex relaxations: we replace the quadratic equality constraints for the phaseless measurements by a search over a polytope and enforce the rank constraint through nuclear norm regularization. The result is a convex program in the space of $d_1 \times d_2$ matrices. We analyze two specific scenarios. In the first, the target matrix is rank-$1$, and the observations are structured to correspond to a phaseless blind deconvolution. In the second, the target matrix has general rank, and we observe the magnitudes of the inner products against a series of independent Gaussian random matrices. In each of these problems, we show that anchored regression returns an accurate estimate from a near-optimal number of measurements given that we have access to an anchor matrix of sufficient quality. We also show how to create such an anchor in the phaseless blind deconvolution problem from an optimal number of measurements and present a partial result in this direction for the general rank problem.more » « less
-
Grulkowski, Ireneusz (Ed.)Quantitative phase imaging (QPI) via Digital Holographic microscopy (DHM) has been widely applied in material and biological applications. The performance of DHM technologies relies heavily on computational reconstruction methods to provide accurate phase measurements. Among the optical configuration of the imaging system in DHM, imaging systems operating in a non-telecentric regime are the most common ones. Nonetheless, the spherical wavefront introduced by the non-telecentric DHM system must be compensated to provide undistorted phase measurements. The proposed reconstruction approach is based on previous work from Kemper’s group. Here, we have reformulated the problem, reducing the number of required parameters needed for reconstructing phase images to the sensor pixel size and source wavelength. The developed computational algorithm can be divided into six main steps. In the first step, the selection of the +1-diffraction order in the hologram spectrum. The interference angle is obtained from the selected +1 order. Secondly, the curvature of the spherical wavefront distorting the sample’s phase map is estimated by analyzing the size of the selected +1 order in the hologram’s spectrum. The third and fourth steps are the spatial filtering of the +1 order and the compensation of the interference angle. The next step involves the estimation of the center of the spherical wavefront. An optional final optimization step has been included to fine-tune the estimated parameters and provide fully compensated phase images. Because the proper implementation of a framework is critical to achieve successful results, we have explicitly described the steps, including functions and toolboxes, required for reconstructing phase images without distortions. As a result, we have provided open-access codes and a user interface tool with minimum user input to reconstruct holograms recorded in a non-telecentric DHM system.more » « less
-
We introduce a novel approach to waveform inversion based on a data-driven reduced order model (ROM) of the wave operator. The presentation is for the acoustic wave equation, but the approach can be extended to elastic or electromagnetic waves. The data are time resolved measurements of the pressure wave gathered by an acquisition system that probes the unknown medium with pulses and measures the generated waves. We propose to solve the inverse problem of velocity estimation by minimizing the square misfit between the ROM computed from the recorded data and the ROM computed from the modeled data, at the current guess of the velocity. We give a step by step computation of the ROM, which depends nonlinearly on the data and yet can be obtained from them in a noniterative fashion, using efficient methods from linear algebra. We also explain how to make the ROM robust to data inaccuracy. The ROM computation requires the full array response matrix gathered with colocated sources and receivers. However, we find that the computation can deal with an approximation of this matrix, obtained from towed-streamer data using interpolation and reciprocity on-the-fly. Although the full-waveform inversion approach of nonlinear least-squares data fitting is challenging without low-frequency information, due to multiple minima of the data fit objective function, we find that the ROM misfit objective function has better behavior, even for a poor initial guess. We also find by explicit computation of the objective functions in a simple setting that the ROM misfit objective function has convexity properties, whereas the least-squares data fit objective function displays multiple local minima.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/SSP.2018.8450691
