21 July 2009 in IEEE Transactions on Signal Processing
MMMohammadreza Malek-Mohammadi
Mohammadreza Malek-Mohammadi
In this correspondence, we focus on the performance analysis of the widely-used minimum description length (MDL) source enumeration technique in array processing. Unfortunately, available theoretical analysis exhibit deviation from the simulation results. We present an accurate and insightful performance analysis for the probability of missed detection. We also show that the statistical performance of the MDL is approximately the same under both deterministic and stochastic signal models. Simulation results show the superiority of the proposed analysis over available results.
27 September 2016 in IEEE Signal Processing Letters
This letter presents the sparse vector signal detection from one bit compressed sensing measurements, in contrast to the previous works that deal with scalar signal detection. Available results are extended to the vector case and the generalized likelihood ratio test (GLRT) detector and the optimal quantizer design are obtained. A double-detector scheme is introduced, in which a sensor level threshold detector is integrated into network level GLRT to improve the performance. The detection criteria of oracle and clairvoyant detectors are also derived. Simulation results show that with careful design of the threshold detector, the overall detection performance of double-detector scheme would be better than the sign-GLRT proposed in [J. Fang et al., “One-bit quantizer design for multisensor GLRT fusion,” IEEE Signal Process. Lett., vol. 20, no. 3, pp. 257-260, Mar. 2013] and close to oracle and clairvoyant detectors. The proposed detector is applied to spectrum sensing and the results are near the well-known energy detector, which uses the real valued data, while the proposed detector only uses the sign of the data.
25 July 2019 in IEEE Transactions on Signal Processing
We study the problem of recovering a block-sparse signal from under-sampled observations. The non-zero values of such signals appear in few blocks, and their recovery is often accomplished using an $\ell_{1,2}$ optimization problem. In applications such as DNA micro-arrays, some extra information about the distribution of non-zero blocks is available; i.e., the number of non-zero blocks in certain subsets of the blocks is known. A typical way to consider the extra information in recovery procedures is to solve a weighted $\ell_{1,2}$ problem. In this paper, we consider a block-sparse model which is accompanied with a partitioning of the blocks; besides the overall block-sparsity level of the signal, we assume to know the block-sparsity of each subset in the partition. Our goal in this work is to minimize the number of required linear measurements for perfect recovery of the signal by tuning the weights of a weighted $\ell_{1,2}$ problem. For this goal, we apply tools from conic integral geometry and derive closed-form expressions for the optimal weights. We show through precise analysis and simulations that the weighted $\ell_{1,2}$ problem with optimal weights significantly outperforms the regular $\ell_{1,2}$ problem. We further show that the optimal weights are robust against the inaccuracies of prior information.
14 May 2019 in IEEE Transactions on Signal Processing
In this paper, we address the problem of recovering point sources from two-dimensional low-pass measurements, which is known as the super-resolution problem. This is the fundamental concern of many applications such as electronic imaging, optics, microscopy, and line spectral estimations. We assume that the point sources are located in the square [0,1] 2 with unknown locations and complex amplitudes. The only available information is low-pass Fourier measurements band limited to the integer square [-f c , f c ] 2 . The sources are estimated by minimizing the total variation norm, which leads to a convex optimization problem. We observe in numerical results that if the sources are closer than 1.4/f c , they might not be recovered by the proposed optimization. We theoretically show that there exists a dual certificate which guarantees exact recovery when the sources are separated by at least 1.68/f c , reducing the gap between the available theoretical guarantee for the source separations and the observed results in the simulations.
11 September 2019 in IEEE Transactions on Information Theory
This work is about the total variation (TV) minimization which is used for recovering gradient-sparse signals from compressed measurements. Recent studies indicate that TV minimization exhibits a phase transition behavior from failure to success as the number of measurements increases. In fact, in large dimensions, TV minimization succeeds in recovering the gradient-sparse signal with high probability when the number of measurements exceeds a certain threshold; otherwise, it fails almost certainly. Obtaining a closed-form expression that approximates this threshold is a major challenge in this field and has not been appropriately addressed yet. In this work, we derive a tight lower-bound on this threshold in case of any random measurement matrix whose null space is distributed uniformly with respect to the Haar measure. In contrast to the conventional TV phase transition results that depend on the simple gradient-sparsity level, our bound is highly affected by generalized notions of gradient-sparsity. Our proposed bound is very close to the true phase transition of TV minimization confirmed by simulation results.
4 June 2019 in IEEE Transactions on Information Theory
Evaluating the statistical dimension is a common tool to determine the asymptotic phase transition in compressed sensing problems with Gaussian ensemble. Unfortunately, the exact evaluation of the statistical dimension is very difficult and it has become standard to replace it with an upper-bound. To ensure that this technique is suitable, [1] has introduced an upper-bound on the gap between the statistical dimension and its approximation. In this work, we first show that the error bound in [1] in some low-dimensional models such as total variation and ℓ1 analysis minimization becomes poorly large. Next, we develop a new error bound which significantly improves the estimation gap compared to [1]. In particular, unlike the bound in [1] that fails in some settings with overcomplete dictionaries, our bound exhibits a decaying behavior in such cases.