arXiv subjects

Yonina C. Eldar

Publications and source records attributed to Yonina C. Eldar.

At least 325 records · Page 18Linked to original sources

arXiv2018

Deep Signal Recovery with One-Bit Quantization

Machine learning, and more specifically deep learning, have shown remarkable performance in sensing, communications, and inference. In this paper, we consider the application of the deep unfolding technique in the problem of signal reconstruction from its one-bit noisy measurements. Namely, we propose a model-based machine learning method and unfold the iterations of an inference optimization algorithm into the layers of a deep neural network for one-bit signal recovery. The resulting network, which we refer to as DeepRec, can efficiently handle the recovery of high-dimensional signals from acquired one-bit noisy measurements. The proposed method results in an improvement in accuracy and computational efficiency with respect to the original framework as shown through numerical analysis.

eess.SP↗

arXiv2018

On the Spectral Efficiency of Noncooperative Uplink Massive MIMO Systems

Massive multiple-input multiple-output (MIMO) systems have been drawing considerable interest due to the growing throughput demands on wireless networks. In the uplink, massive MIMO systems are commonly studied assuming that each base station (BS) decodes the signals of its user terminals separately and linearly while treating all interference as noise. Although this approach provides improved spectral efficiency which scales with the number of BS antennas in favorable channel conditions, it is generally sub-optimal from an information-theoretic perspective. In this work we characterize the spectral efficiency of massive MIMO when the BSs are allowed to jointly decode the received signals. In particular, we consider four schemes for treating the interference, and derive the achievable average ergodic rates for both finite and asymptotic number of antennas for each scheme. Simulation tests of the proposed methods illustrate their gains in spectral efficiency compared to the standard approach of separate linear decoding, and show that the standard approach fails to capture the actual achievable rates of massive MIMO systems, particularly when the interference is dominant.

cs.IT↗

arXiv2018

Deep Unfolded Robust PCA with Application to Clutter Suppression in Ultrasound

Contrast enhanced ultrasound is a radiation-free imaging modality which uses encapsulated gas microbubbles for improved visualization of the vascular bed deep within the tissue. It has recently been used to enable imaging with unprecedented subwavelength spatial resolution by relying on super-resolution techniques. A typical preprocessing step in super-resolution ultrasound is to separate the microbubble signal from the cluttering tissue signal. This step has a crucial impact on the final image quality. Here, we propose a new approach to clutter removal based on robust principle component analysis (PCA) and deep learning. We begin by modeling the acquired contrast enhanced ultrasound signal as a combination of a low rank and sparse components. This model is used in robust PCA and was previously suggested in the context of ultrasound Doppler processing and dynamic magnetic resonance imaging. We then illustrate that an iterative algorithm based on this model exhibits improved separation of microbubble signal from the tissue signal over commonly practiced methods. Next, we apply the concept of deep unfolding to suggest a deep network architecture tailored to our clutter filtering problem which exhibits improved convergence speed and accuracy with respect to its iterative counterpart. We compare the performance of the suggested deep network on both simulations and in-vivo rat brain scans, with a commonly practiced deep-network architecture and the fast iterative shrinkage algorithm, and show that our architecture exhibits better image quality and contrast.

cs.LG↗

arXiv2018

The Global Optimization Geometry of Shallow Linear Neural Networks

We examine the squared error loss landscape of shallow linear neural networks. We show---with significantly milder assumptions than previous works---that the corresponding optimization problems have benign geometric properties: there are no spurious local minima and the Hessian at every saddle point has at least one negative eigenvalue. This means that at every saddle point there is a directional negative curvature which algorithms can utilize to further decrease the objective value. These geometric properties imply that many local search algorithms (such as the gradient descent which is widely utilized for training neural networks) can provably solve the training problem with global convergence.

cs.LG↗

arXiv2018

Subspace Estimation from Incomplete Observations: A High-Dimensional Analysis

We present a high-dimensional analysis of three popular algorithms, namely, Oja's method, GROUSE and PETRELS, for subspace estimation from streaming and highly incomplete observations. We show that, with proper time scaling, the time-varying principal angles between the true subspace and its estimates given by the algorithms converge weakly to deterministic processes when the ambient dimension $n$ tends to infinity. Moreover, the limiting processes can be exactly characterized as the unique solutions of certain ordinary differential equations (ODEs). A finite sample bound is also given, showing that the rate of convergence towards such limits is $\mathcal{O}(1/\sqrt{n})$. In addition to providing asymptotically exact predictions of the dynamic performance of the algorithms, our high-dimensional analysis yields several insights, including an asymptotic equivalence between Oja's method and GROUSE, and a precise scaling relationship linking the amount of missing data to the signal-to-noise ratio. By analyzing the solutions of the limiting ODEs, we also establish phase transition phenomena associated with the steady-state performance of these techniques.

cs.LG↗

arXiv2018

On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization

The use of multichannel data in line spectral estimation (or frequency estimation) is common for improving the estimation accuracy in array processing, structural health monitoring, wireless communications, and more. Recently proposed atomic norm methods have attracted considerable attention due to their provable superiority in accuracy, flexibility and robustness compared with conventional approaches. In this paper, we analyze atomic norm minimization for multichannel frequency estimation from noiseless compressive data, showing that the sample size per channel that ensures exact estimation decreases with the increase of the number of channels under mild conditions. In particular, given $L$ channels, order $K\left(\log K\right) \left(1+\frac{1}{L}\log N\right)$ samples per channel, selected randomly from $N$ equispaced samples, suffice to ensure with high probability exact estimation of $K$ frequencies that are normalized and mutually separated by at least $\frac{4}{N}$. Numerical results are provided corroborating our analysis.

cs.IT↗

arXiv2018

Analysis of Frequency Agile Radar via Compressed Sensing

Frequency agile radar (FAR) is known to have excellent electronic counter-countermeasures (ECCM) performance and the potential to realize spectrum sharing in dense electromagnetic environments. Many compressed sensing (CS) based algorithms have been developed for joint range and Doppler estimation in FAR. This paper considers theoretical analysis of FAR via CS algorithms. In particular, we analyze the properties of the sensing matrix, which is a highly structured random matrix. We then derive bounds on the number of recoverable targets. Numerical simulations and field experiments validate the theoretical findings and demonstrate the effectiveness of CS approaches to FAR.

cs.IT↗

arXiv2018

SUSHI: Sparsity-based Ultrasound Super-resolution Hemodynamic Imaging

Identifying and visualizing vasculature within organs and tumors has major implications in managing cardiovascular diseases and cancer. Contrast-enhanced ultrasound scans detect slow-flowing blood, facilitating non-invasive perfusion measurements. However, their limited spatial resolution prevents the depiction of microvascular structures. Recently, super-localization ultrasonography techniques have surpassed this limit. However, they require long acquisition times of several minutes, preventing the detection of hemodynamic changes. We present a fast super-resolution method that exploits sparsity in the underlying vasculature and statistical independence within the measured signals. Similar to super-localization techniques, this approach improves the spatial resolution by up to an order of magnitude compared to standard scans. Unlike super-localization methods, it requires acquisition times of only tens of milliseconds. We demonstrate a temporal resolution of 25Hz, which may enable functional super-resolution imaging deep within the tissue, surpassing the temporal resolution limitations of current super-resolution methods, e.g. in neural imaging. The sub-second acquisitions make our approach robust to motion artifacts, simplifying in-vivo use of super-resolution ultrasound.

physics.med-ph↗

arXiv2018

TenDSuR: Tensor-Based 4D Sub-Nyquist Radar

We propose Tensor-based 4D Sub-Nyquist Radar (TenDSuR) that samples in spectral, spatial, Doppler, and temporal domains at sub-Nyquist rates while simultaneously recovering the target's direction, Doppler velocity, and range without loss of native resolutions. We formulate the radar signal model wherein the received echo samples are represented by a partial third-order tensor. We then apply compressed sensing in the tensor domain and use our tensor-OMP and tensor completion algorithms for signal recovery. Our numerical experiments demonstrate joint estimation of all three target parameters at the same native resolutions as a conventional radar but with reduced measurements. Furthermore, tensor completion methods show enhanced performance in off-grid target recovery with respect to tensor-OMP.

eess.SP↗

arXiv2018

Sparse Convolutional Beamforming for Ultrasound Imaging

The standard technique used by commercial medical ultrasound systems to form B-mode images is delay and sum (DAS) beamforming. However, DAS often results in limited image resolution and contrast, which are governed by the center frequency and the aperture size of the ultrasound transducer. A large number of elements leads to improved resolution but at the same time increases the data size and the system cost due to the receive electronics required for each element. Therefore, reducing the number of receiving channels while producing high quality images is of great importance. In this paper, we introduce a nonlinear beamformer called COnvolutional Beamforming Algorithm (COBA), which achieves significant improvement of lateral resolution and contrast. In addition, it can be implemented efficiently using the fast Fourier transform. Based on the COBA concept, we next present two sparse beamformers with closed form expressions for the sensor locations, which result in the same beam pattern as DAS and COBA while using far fewer array elements. Optimization of the number of elements shows that they require a minimal number of elements which is on the order of the square root of the number used by DAS. The performance of the proposed methods is tested and validated using simulated data, phantom scans and in vivo cardiac data. The results demonstrate that COBA outperforms DAS in terms of resolution and contrast and that the suggested beamformers offer a sizable element reduction while generating images with an equivalent or improved quality in comparison to DAS.

cs.IT↗

arXiv2018

Sparse Doppler Sensing Based on Nested Arrays

Spectral Doppler ultrasound imaging allows visualizing blood flow by estimating its velocity distribution over time. Duplex ultrasound is a modality in which an ultrasound system is used for displaying simultaneously both B-mode images and spectral Doppler data. In B-mode imaging short wide-band pulses are used to achieve sufficient spatial resolution in the images. In contrast, for Doppler imaging, narrow-band pulses are preferred in order to attain increased spectral resolution. Thus, the acquisition time must be shared between the two sequences. In this work, we propose a non-uniform slow-time transmission scheme for spectral Doppler, based on nested arrays, which reduces the number of pulses needed for accurate spectrum recovery. We derive the minimal number of Doppler emissions needed, using this approach, for perfect reconstruction of the blood spectrum in a noise-free environment. Next, we provide two spectrum recovery techniques which achieve this minimal number. The first method performs efficient recovery based on the fast Fourier transform. The second allows for continuous recovery of the Doppler frequencies, thus avoiding off-grid error leakage, at the expense of increased complexity. The performance of the techniques is evaluated using realistic Field II simulations as well as in vivo measurements, producing accurate spectrograms of the blood velocities using a significant reduced number of transmissions. The time gained, where no Doppler pulses are sent, can be used to enable the display of both blood velocities and high quality B-mode images at a high frame rate.

cs.IT↗

arXiv2018

Sub-Nyquist Radar Systems: Temporal, Spectral and Spatial Compression

Conventional radar transmits electromagnetic waves towards the targets of interest. In between the outgoing pulses, the radar measures the signal reflected from the targets to determine their presence, range, velocity and other characteristics. Radar systems face multiple challenges, generating many trade-offs such as bandwidth versus range resolution and dwell time versus Doppler resolution. In MIMO radar, high resolution requires a large aperture and high number of antennas, increasing hardware and processing requirements. Recently, novel approaches in sampling theory and radar signal processing have been proposed to allow target detection and parameter recovery from samples obtained below the Nyquist rate. These techniques exploit the sparsity of the target scene in order to reduce the required number of samples, pulses and antennas, breaking the link between bandwidth, dwell time and number of antennas on the one hand and range, Doppler and azimuth resolution, respectively, on the other. This review introduces this so-called sub-Nyquist radar paradigm and describes the corresponding sampling and recovery algorithms, that leverage compressed sensing techniques to perform time and spatial compression. We focus on non radar imaging applications and survey many recent compressed radar systems. Our goal is to review the main impacts of compressed radar on parameter resolution as well as digital and analog complexity. The survey includes fast and slow time compression schemes as well as spatial compression approaches. We show that beyond substantial rate reduction, compression may also enable communication and radar spectrum sharing. Throughout the paper, we consider both theoretical and practical aspects of compressed radar, and present hardware prototype implementations, demonstrating real-time target parameter recovery from low rate samples in pulse-Doppler and MIMO radars.

eess.SP↗

arXiv2018

The Distortion-Rate Function of Sampled Wiener Processes

We consider the recovery of a continuous-time Wiener process from a quantized or lossy compressed version of its uniform samples under limited bitrate and sampling rate. We derive a closed form expression for the optimal tradeoff among sampling rate, bitrate, and quadratic distortion in this setting. This expression is given in terms of a reverse waterfilling formula over the asymptotic spectral distribution of a sequence of finite-rank operators associated with the optimal estimator of the Wiener process from its samples. We show that the ratio between this expression and the standard distortion rate function of the Wiener process, describing the optimal tradeoff between bitrate and distortion without a sampling constraint, is only a function of the number of bits per sample. For example using one bit per sample on average, the expected distortion is approximately 1.2 times the standard distortion rate function, indicating a performance loss of about 20% due to sampling. We next consider the distortion when the continuous-time process is estimated from the output of an encoder that is optimal with respect to the discrete-time samples. We show that while the latter is strictly greater than the distortion under optimal encoding, the ratio between the two does not exceed 1.027. We therefore conclude that nearly optimal performance is attained even if the encoder is unaware of the sampling rate and encodes the samples without taking into account the continuous-time underlying process.

cs.IT↗

arXiv2018

Coupled Dictionary Learning for Multi-contrast MRI Reconstruction

Medical imaging tasks often involve multiple contrasts, such as T1- and T2-weighted magnetic resonance imaging (MRI) data. These contrasts capture information associated with the same underlying anatomy and thus exhibit similarities. In this paper, we propose a Coupled Dictionary Learning based multi-contrast MRI reconstruction (CDLMRI) approach to leverage an available guidance contrast to restore the target contrast. Our approach consists of three stages: coupled dictionary learning, coupled sparse denoising, and $k$-space consistency enforcing. The first stage learns a group of dictionaries that capture correlations among multiple contrasts. By capitalizing on the learned adaptive dictionaries, the second stage performs joint sparse coding to denoise the corrupted target image with the aid of a guidance contrast. The third stage enforces consistency between the denoised image and the measurements in the $k$-space domain. Numerical experiments on the retrospective under-sampling of clinical MR images demonstrate that incorporating additional guidance contrast via our design improves MRI reconstruction, compared to state-of-the-art approaches.

cs.CV↗

arXiv2018

iMAP Beamforming for High Quality High Frame Rate Imaging

We present a statistical interpretation of beamforming to overcome limitations of standard delay-and-sum (DAS) processing. Both the interference and the signal of interest are viewed as random variables and the distribution of the signal of interest is exploited to maximize the a-posteriori distribution of the aperture signals. In this formulation the beamformer output is a maximum-a-posteriori (MAP) estimator of the signal of interest. We provide a closed form expression for the MAP beamformer and estimate the unknown distribution parameters from the available aperture data using an empirical Bayes approach. We propose a simple scheme that iterates between estimation of distribution parameters and computation of the MAP estimator of the signal of interest, leading to an iterative MAP (iMAP) beamformer. This results in a significant improvement of the contrast compared to DAS without severe increase in computational complexity or need for fine-tuning of parameters. By implementing iMAP on both simulated and experimental data, we show that only 13 transmissions are required to obtain contrast comparable to DAS with 75 plane-waves. The proposed method is compared to other interference suppression techniques such as coherence factor and scaled Wiener processing and shows improved contrast and better preserved speckle pattern.

cs.IT↗

arXiv2018

On MIMO Channel Capacity with Output Quantization Constraints

The capacity of a Multiple-Input Multiple-Output (MIMO) channel in which the antenna outputs are processed by an analog linear combining network and quantized by a set of threshold quantizers is studied. The linear combining weights and quantization thresholds are selected from a set of possible configurations as a function of the channel matrix. The possible configurations of the combining network model specific analog receiver architectures, such as single antenna selection, sign quantization of the antenna outputs or linear processing of the outputs. An interesting connection between the capacity of this channel and a constrained sphere packing problem in which unit spheres are packed in a hyperplane arrangement is shown. From a high-level perspective, this follows from the fact that each threshold quantizer can be viewed as a hyperplane partitioning the transmitter signal space. Accordingly, the output of the set of quantizers corresponds to the possible regions induced by the hyperplane arrangement corresponding to the channel realization and receiver configuration. This connection provides a number of important insights into the design of quantization architectures for MIMO receivers; for instance, it shows that for a given number of quantizers, choosing configurations which induce a larger number of partitions can lead to higher rates.

cs.IT↗

arXiv2018

Sampling and Super-resolution of Sparse Signals Beyond the Fourier Domain

Recovering a sparse signal from its low-pass projections in the Fourier domain is a problem of broad interest in science and engineering and is commonly referred to as super-resolution. In many cases, however, Fourier domain may not be the natural choice. For example, in holography, low-pass projections of sparse signals are obtained in the Fresnel domain. Similarly, time-varying system identification relies on low-pass projections on the space of linear frequency modulated signals. In this paper, we study the recovery of sparse signals from low-pass projections in the Special Affine Fourier Transform domain (SAFT). The SAFT parametrically generalizes a number of well known unitary transformations that are used in signal processing and optics. In analogy to the Shannon's sampling framework, we specify sampling theorems for recovery of sparse signals considering three specific cases: (1) sampling with arbitrary, bandlimited kernels, (2) sampling with smooth, time-limited kernels and, (3) recovery from Gabor transform measurements linked with the SAFT domain. Our work offers a unifying perspective on the sparse sampling problem which is compatible with the Fourier, Fresnel and Fractional Fourier domain based results. In deriving our results, we introduce the SAFT series (analogous to the Fourier series) and the short time SAFT, and study convolution theorems that establish a convolution--multiplication property in the SAFT domain.

cs.IT↗

arXiv2018

Fundamental Distortion Limits of Analog-to-Digital Compression

Representing a continuous-time signal by a set of samples is a classical problem in signal processing. We study this problem under the additional constraint that the samples are quantized or compressed in a lossy manner under a limited bitrate budget. To this end, we consider a combined sampling and source coding problem in which an analog stationary Gaussian signal is reconstructed from its encoded samples. These samples are obtained by a set of bounded linear functionals of the continuous-time path, with a limitation on the average number of samples obtained per unit time available in this setting. We provide a full characterization of the minimal distortion in terms of the sampling frequency, the bitrate, and the signal's spectrum. Assuming that the signal's energy is not uniformly distributed over its spectral support, we show that for each compression bitrate there exists a critical sampling frequency smaller than the Nyquist rate, such that the distortion in signal reconstruction when sampling at this frequency is minimal. Our results can be seen as an extension of the classical sampling theorem for bandlimited random processes in the sense that it describes the minimal amount of excess distortion in the reconstruction due to lossy compression of the samples, and provides the minimal sampling frequency required in order to achieve this distortion. Finally, we compare the fundamental limits in the combined source coding and sampling problem to the performance of pulse code modulation (PCM), where each sample is quantized by a scalar quantizer using a fixed number of bits.

cs.IT↗