Search arXivSearch

arXiv · 1606.03472

Super-Resolution From Binary Measurements With Unknown Threshold

Abstract

We address the problem of super-resolution of point sources from binary measurements, where random projections of the blurred measurement of the actual signal are encoded using only the sign information. The threshold used for binary quantization is not known to the decoder. We develop an algorithm that solves convex programs iteratively and achieves signal recovery. The proposed algorithm, which we refer to as the binary super-resolution (BSR) algorithm, recovers point sources with reasonable accuracy, albeit up to a scale factor. We show through simulations that the BSR algorithm is successful in recovering the locations and the amplitudes of the point sources, even in the presence of significant amount of blurring. We also propose a framework for handling noisy measurements and demonstrate that BSR gives a reliable reconstruction (correspondingly, reconstruction signal-to-noise ratio (SNR) of about 22 dB) for a measurement SNR of 15 dB.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Subhadip Mukherjee, Anjany Kumar Sekuboyina, Chandra Sekhar Seelamantula. 2016-05-13. Super-Resolution From Binary Measurements With Unknown Threshold. https://arxiv.org/abs/1606.03472

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT