30 March 2017 in IEEE Communications Letters
In this letter, we identify a class of absolutely continuous probability distributions, and show that the differential entropy is uniformly convergent over this space under the metric of total variation distance. One of the advantages of this class is that the requirements could be readily verified for a given distribution.
27 October 2020 in IEEE Internet of Things Journal
The LoRa technology is considered as one of the most potential solutions for IoT in the near future. The existing LoRa networks are based on the star topology. In this paper, a tree network adopted for the LoRa technology and a communication protocol are proposed to mitigate the energy consumption constraints. In the proposed network, the nodes are self-configured based on the LoRa physical link behavior and can act as relays to propagate data from other nodes. The analysis, design, and evaluation of the proposed architecture for large scale LoRa networks are presented in detail. With analytical studies, the energy consumption of the star and tree LoRa networks are compared. The presented analytical results can provide developers with effective guidelines for scalable design and optimization of LoRa networks. Further, the results are verified using simulation and experimental tests. Both simulation and experimental results confirm that the presented method improves the energy consumption of the entire IoT network significantly. As a result, the presented tree network can be deployed in various applications.
5 November 2019 in IEEE Transactions on Image Processing
With the dominance of digital imaging systems, we are often dealing with discrete-domain samples of an analog image. Due to physical limitations, all imaging devices apply a blurring kernel on the input image before taking samples to form the output pixels. In this paper, we focus on the reconstruction of binary shape images from few blurred samples. This problem has applications in medical imaging, shape processing, and image segmentation. Our method relies on representing the analog shape image in a discrete grid much finer than the sampling grid. We formulate the problem as the recovery of a rank r matrix that is formed by a Hankel structure on the pixels. We further propose efficient ADMM-based algorithms to recover the low-rank matrix in both noiseless and noisy settings. We also analytically investigate the number of required samples for successful recovery in the noiseless case. For this purpose, we study the problem in the random sampling framework, and show that with O(r log4(n1n2)) random samples (where the size of the image is assumed to be n1 x n2) we can guarantee the perfect reconstruction with high probability under mild conditions. We further prove the robustness of the proposed recovery in the noisy setting by showing that the reconstruction error in the noisy case is bounded when the input noise is bounded. Simulation results confirm that our proposed method outperform the conventional total variation minimization in the noiseless settings.
23 September 2014 in Journal of Fourier Analysis and Applications
28 May 2020 in IEEE Transactions on Aerospace and Electronic Systems
Compressive sensing (CS) has been widely used in MIMO radar in recent years. Unlike traditional MIMO radar, detection/estimation of targets in a CS-based MIMO radar is accomplished via sparse recovery. In this paper, for a CSbased colocated MIMO radar with linear arrays, we attempt to improve the target detection performance by reducing the coherence of the associated sensing matrix. Our tool in reducing the coherence is the placement of the antennas across the array aperture. In particular, we choose antenna positions within a given grid. Initially, we formalize the position selection problem as finding binary weights for each of the locations. This problem is highly non-convex and combinatorial in nature. Instead, we find continuous weight values for each location and interpret them as the probability of including an antenna at the given location. Next, we select antenna locations randomly according to the obtained probability distribution. We formulate the problem for the general case of a MIMO radar with independent transmit and receive arrays for which we propose an iterative algorithm. For the special case of a transceiver array, the solution is obtained through a convex optimization approach. Our experiments show that the proposed method achieves a superior detection performance compared to a uniformly at random placement of the antennas within the array aperture.
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.