252 research outputs found
Self-Calibration and Biconvex Compressive Sensing
The design of high-precision sensing devises becomes ever more difficult and
expensive. At the same time, the need for precise calibration of these devices
(ranging from tiny sensors to space telescopes) manifests itself as a major
roadblock in many scientific and technological endeavors. To achieve optimal
performance of advanced high-performance sensors one must carefully calibrate
them, which is often difficult or even impossible to do in practice. In this
work we bring together three seemingly unrelated concepts, namely
Self-Calibration, Compressive Sensing, and Biconvex Optimization. The idea
behind self-calibration is to equip a hardware device with a smart algorithm
that can compensate automatically for the lack of calibration. We show how
several self-calibration problems can be treated efficiently within the
framework of biconvex compressive sensing via a new method called SparseLift.
More specifically, we consider a linear system of equations y = DAx, where both
x and the diagonal matrix D (which models the calibration error) are unknown.
By "lifting" this biconvex inverse problem we arrive at a convex optimization
problem. By exploiting sparsity in the signal model, we derive explicit
theoretical guarantees under which both x and D can be recovered exactly,
robustly, and numerically efficiently via linear programming. Applications in
array calibration and wireless communications are discussed and numerical
simulations are presented, confirming and complementing our theoretical
analysis
Super-resolved localisation in multipath environments
In the last few decades, the localisation problems have been studied extensively. There are still some open issues that remain unresolved. One of the key issues is the efficiency and preciseness of the localisation in presence of non-line-of-sight (NLoS) path. Nevertheless, the NLoS path has a high occurrence in multipath environments, but NLoS bias is viewed as a main factor to severely degrade the localisation performance. The NLoS bias would often result in extra propagation delay and angular bias. Numerous localisation methods have been proposed to deal with NLoS bias in various propagation environments, but they are tailored to some specif ic scenarios due to different prior knowledge requirements, accuracies, computational complexities, and assumptions.
To super-resolve the location of mobile device (MD) without prior knowledge, we address the localisation problem by super-resolution technique due to its favourable features, such as working on continuous parameter space, reducing computational cost and good extensibility. Besides the NLoS bias, we consider an extra array directional error which implies the deviation in the orientation of the array placement. The proposed method is able to estimate the locations of MDs and self-calibrate the array directional errors simultaneously. To achieve joint localisation, we directly map MD locations and array directional error to received signals. Then the group sparsity based optimisation is proposed to exploit the geometric consistency that received paths are originating from common MDs. Note that the super-resolution framework cannot be directly applied to our localisation problems. Because the proposed objective function cannot be efficiently solved by semi-definite programming.
Typical strategies focus on reducing adverse effect due to the NLoS bias by separating line-of-sight (LoS)/NLoS path or mitigating NLoS effect. The LoS path is well studied for localisation and multiple methods have been proposed in the literature. However, the number of LoS paths are typically limited and the effect of NLoS bias may not always be reduced completely. As a long-standing issue, the suitable solution of using NLoS path is still an open topic for research. Instead of dealing with NLoS bias, we present a novel localisation method that exploits both LoS and NLoS paths in the same manner. The unique feature is avoiding hard decisions on separating LoS and NLoS paths and hence relevant possible error. A grid-free sparse inverse problem is formulated for localisation which avoids error propagation between multiple stages, handles multipath in a unified way, and guarantees a global convergence. Extensive localisation experiments on different propagation environments and localisation systems are presented to illustrate the high performance of the proposed algorithm compared with theoretical analysis. In one of the case studies, single antenna access points (APs) can locate a single antenna MD even when all paths between them are NLoS, which according to the authors’ knowledge is the first time in the literature.Open Acces
Sparsity Promoting Off-grid Methods with Applications in Direction Finding
University of Minnesota Ph.D. dissertation. May 2017. Major: Electrical/Computer Engineering. Advisor: Mostafa Kaveh. 1 computer file (PDF); x, 99 pages.In this dissertation, the problem of directions-of-arrival (DoA) estimation is studied by the compressed sensing application of sparsity-promoting regularization techniques. Compressed sensing can recover high-dimensional signals with a sparse representation from very few linear measurements by nonlinear optimization. By exploiting the sparse representation for the multiple measurement vectors or the spatial covariance matrix of correlated or uncorrelated sources, the DoA estimation problem can be formulated in the framework of sparse signal recovery with high resolution. There are three main topics covered in this dissertation. These topics are recovery methods for the sparse model with structured perturbations, continuous sparse recovery methods in the super-resolution framework, and the off-grid DoA estimation with array self-calibration. These topics are summarized below. For the first topic, structured perturbation in the sparse model is considered. A major limitation of most methods exploiting sparse spectral models for the purpose of estimating directions-of-arrival stems from the fixed model dictionary that is formed by array response vectors over a discrete search grid of possible directions. In general, the array responses to actual DoAs will most likely not be members of such a dictionary. Thus, the sparse spectral signal model with uncertainty of linearized dictionary parameter mismatch is considered, and the dictionary matrix is reformulated into a multiplication of a fixed base dictionary and a sparse matrix. Based on this sparse model, we propose several convex optimization algorithms. However, we are also concerned with the development of a computationally efficient optimization algorithm for off-grid direction finding using a sparse observation model. With an emphasis on designing efficient algorithms, various sparse problem formulations are considered, such as unconstrained formulation, primal-dual formulation, or conic formulation. But, because of the nature of nondifferentiable objective functions, those problems are still challenging to solve in an efficient way. Thus, the Nesterov smoothing methodology is utilized to reformulate nonsmooth functions into smooth ones, and the accelerated proximal gradient algorithm is adopted to solve the smoothed optimization problem. Convergence analysis is conducted as well. The accuracy and efficiency of smoothed sparse recovery methods are demonstrated for the DoA estimation example. In the second topic, estimation of directions-of-arrival in the spatial covariance model is studied. Unlike the compressed sensing methods which discretize the search domain into possible directions on a grid, the theory of super resolution is applied to estimate DoAs in the continuous domain. We reformulate the spatial spectral covariance model into a multiple measurement vectors (MMV)-like model, and propose a block total variation norm minimization approach, which is the analog of Group Lasso in the super-resolution framework and that promotes the group-sparsity. The DoAs can be estimated by solving its dual problem via semidefinite programming. This gridless recovery approach is verified by simulation results for both uncorrelated and correlated source signals. In the last topic, we consider the array calibration issue for DoA estimation, and extend the previously considered single measurement vector model to multiple measurement vectors. By exploiting multiple measurement snapshots, a modified nuclear norm minimization problem is proposed to recover a low-rank matrix with high probability. The definition of linear operator for the MMV model is given, and its corresponding matrix representation is derived so that a reformulated convex optimization problem can be solved numerically. In order to alleviate computational complexity of the method, we use singular value decomposition (SVD) to reduce the problem size. Furthermore, the structured perturbation in the sparse array self-calibration estimation problem is considered as well. The performance and efficiency of the proposed methods are demonstrated by numerical results
Recommended from our members
Structured Sub-Nyquist Sampling with Applications in Compressive Toeplitz Covariance Estimation, Super-Resolution and Phase Retrieval
Sub-Nyquist sampling has received a huge amount of interest in the past decade. In classical compressed sensing theory, if the measurement procedure satisfies a particular condition known as Restricted Isometry Property (RIP), we can achieve stable recovery of signals of low-dimensional intrinsic structures with an order-wise optimal sample size. Such low-dimensional structures include sparse and low rank for both vector and matrix cases. The main drawback of conventional compressed sensing theory is that random measurements are required to ensure the RIP property. However, in many applications such as imaging and array signal processing, applying independent random measurements may not be practical as the systems are deterministic. Moreover, random measurements based compressed sensing always exploits convex programs for signal recovery even in the noiseless case, and solving those programs is computationally intensive if the ambient dimension is large, especially in the matrix case. The main contribution of this dissertation is that we propose a deterministic sub-Nyquist sampling framework for compressing the structured signal and come up with computationally efficient algorithms. Besides widely studied sparse and low-rank structures, we particularly focus on the cases that the signals of interest are stationary or the measurements are of Fourier type. The key difference between our work from classical compressed sensing theory is that we explicitly exploit the second-order statistics of the signals, and study the equivalent quadratic measurement model in the correlation domain. The essential observation made in this dissertation is that a difference/sum coarray structure will arise from the quadratic model if the measurements are of Fourier type. With these observations, we are able to achieve a better compression rate for covariance estimation, identify more sources in array signal processing or recover the signals of larger sparsity. In this dissertation, we will first study the problem of Toeplitz covariance estimation. In particular, we will show how to achieve an order-wise optimal compression rate using the idea of sparse arrays in both general and low-rank cases. Then, an analysis framework of super-resolution with positivity constraint is established. We will present fundamental robustness guarantees, efficient algorithms and applications in practices. Next, we will study the problem of phase-retrieval for which we successfully apply the sparse array ideas by fully exploiting the quadratic measurement model. We achieve near-optimal sample complexity for both sparse and general cases with practical Fourier measurements and provide efficient and deterministic recovery algorithms. In the end, we will further elaborate on the essential role of non-negative constraint in underdetermined inverse problems. In particular, we will analyze the nonlinear co-array interpolation problem and develop a universal upper bound of the interpolation error. Bilinear problem with non-negative constraint will be considered next and the exact characterization of the ambiguous solutions will be established for the first time in literature. At last, we will show how to apply the nested array idea to solve real problems such as Kriging. Using spatial correlation information, we are able to have a stable estimate of the field of interest with fewer sensors than classic methodologies. Extensive numerical experiments are implemented to demonstrate our theoretical claims
Statistical Nested Sensor Array Signal Processing
Source number detection and direction-of-arrival (DOA) estimation are two major applications of sensor arrays. Both applications are often confined to the use of uniform linear arrays (ULAs), which is expensive and difficult to yield wide aperture. Besides, a ULA with N scalar sensors can resolve at most N − 1 sources. On the other hand, a systematic approach was recently proposed to achieve O(N 2 ) degrees of freedom (DOFs) using O(N) sensors based on a nested array, which is obtained by combining two or more ULAs with successively increased spacing.
This dissertation will focus on a fundamental study of statistical signal processing of nested arrays. Five important topics are discussed, extending the existing nested-array strategies to more practical scenarios. Novel signal models and algorithms are proposed.
First, based on the linear nested array, we consider the problem for wideband Gaussian sources. To employ the nested array to the wideband case, we propose effective strategies to apply nested-array processing to each frequency component, and combine all the spectral information of various frequencies to conduct the detection and estimation. We then consider the practical scenario with distributed sources, which considers the spreading phenomenon of sources.
Next, we investigate the self-calibration problem for perturbed nested arrays, for which existing works require certain modeling assumptions, for example, an exactly known array geometry, including the sensor gain and phase. We propose corresponding robust algorithms to estimate both the model errors and the DOAs. The partial Toeplitz structure of the covariance matrix is employed to estimate the gain errors, and the sparse total least squares is used to deal with the phase error issue.
We further propose a new class of nested vector-sensor arrays which is capable of significantly increasing the DOFs. This is not a simple extension of the nested scalar-sensor array. Both the signal model and the signal processing strategies are developed in the multidimensional sense. Based on the analytical results, we consider two main applications: electromagnetic (EM) vector sensors and acoustic vector sensors.
Last but not least, in order to make full use of the available limited valuable data, we propose a novel strategy, which is inspired by the jackknifing resampling method. Exploiting numerous iterations of subsets of the whole data set, this strategy greatly improves the results of the existing source number detection and DOA estimation methods
- …