Correlated Sparse Bayesian Learning for Recovery of Block Sparse Signals with Unknown Borders

We consider the problem of recovering complex-valued block sparse signals with unknown borders. Such signals arise naturally in numerous applications. Several algorithms have been developed to solve the problem of unknown block partitions. In pattern-coupled sparse Bayesian learning (PCSBL), each coefficient involves its own hyperparameter...

Towards a general framework for fast and feasible k-space trajectories for MRI based on projection methods

The design of feasible trajectories to traverse the k-space for sampling in magnetic resonance imaging (MRI) is important while considering ways to reduce the scan time. Over the recent years, non-Cartesian trajectories have been observed to result in benign artifacts and being less sensitive to motion. In this paper, we propose a generalized...

Coding Mask Design for Single Sensor Ultrasound Imaging

We study the design of a coding mask for pulse-echo ultrasound imaging. We are interested in the scenario of a single receiving transducer with an aberrating layer, or ‘mask,’ in front of the transducer's receive surface, with a separate co-located transmit transducer. The mask encodes spatial measurements into a single output signal, containing...

Antenna Placement in a Compressive Sensing-Based Colocated MIMO Radar

Compressive sensing (CS) has been widely used in multiple-input-multiple-output (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 article, for a CS-based colocated MIMO radar with linear arrays, we attempt to improve the target...

K-Space Trajectory Design for Reduced MRI Scan Time

The development of compressed sensing (CS) techniques for magnetic resonance imaging (MRI) is enabling a speedup of MRI scanning. To increase the incoherence in the sampling, a random selection of points on the k-space is deployed and a continuous trajectory is obtained by solving a traveling salesman problem (TSP) through these points. A...

Active Semi-Supervised Learning for Diffusions on Graphs

Diffusion-based semi-supervised learning on graphs consists of diffusing labeled information of a few nodes to infer the labels on the remaining ones. The performance of these methods heavily relies on the initial labeled set, which is either generated randomly or using heuristics. The first sometimes leads to unsatisfactory results because...

Super-Resolution Channel Estimation for Arbitrary Arrays in Hybrid Millimeter-Wave Massive MIMO Systems

This paper develops efficient channel estimation techniques for millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems under practical hardware limitations, including an arbitrary array geometry and a hybrid hardware structure. Taking on an angle-based approach, this work adopts a generalized array manifold separation...

Information distances for radar resolution analysis

A stochastic approach to resolution based on information distances computed from the geometry of data models which is characterized by the Fisher information is explored. Stochastic resolution includes probability of resolution and signal-to-noise ratio (SNR). The probability of resolution is assessed from a hypothesis test by exploiting...

Signal-to-Noise-Ratio Analysis of Compressive Data Acquisition

Data acquisition in compressive sensing (CS) is commonly believed to be less complicated, and even less costly, while performing agreeably. There is a major lack of measureable foundations supporting this optimism as the performance and complexity of a CS sensor have hardly been quantified. We aim to fill the gap by computing the performance...

Bound on the estimation grid size for sparse reconstruction in direction of arrival estimation

A bound for sparse reconstruction involving both the signal-to-noise ratio (SNR) and the estimation grid size is presented. The bound is illustrated for the case of a uniform linear array (ULA). By reducing the number of possible sparse vectors present in the feasible set of a constrained ℓ1-norm minimization problem, ambiguities in the...

Stochastic resolution analysis of co-prime arrays in radar

Resolution from co-prime arrays and from a full ULA of the size equal to the virtual size of co-prime arrays is investigated. We take into account not only the resulting beam width but also the fact that fewer measurements are acquired by co-prime arrays. This fact is relevant in compressive acquisition typical for compressive sensing. Our...