Search arXivSearch

arXiv · 1301.6256

Tight is better: Performance Improvement of the Compressive Classifier Using Equi-Norm Tight Frames

Abstract

Detecting or classifying already known sparse signals contaminated by Gaussian noise from compressive measurements is different from reconstructing sparse signals, as its objective is to minimize the error probability which describes performance of the detectors or classifiers. This paper is concerned about the performance improvement of a commonly used Compressive Classifier. We prove that when the arbitrary sensing matrices used to get the Compressive Measurements are transformed into Equi-Norm Tight Frames, i.e. the matrices that are row-orthogonal, The Compressive Classifier achieves better performance. Although there are other proofs that among all Equi-Norm Tight Frames the Equiangular tight Frames (ETFs) bring best worst-case performance, the existence and construction of ETFs on some dimensions is still an open problem. As the construction of Equi-Norm Tight Frames from any arbitrary matrices is very easy and practical compared with ETF matrices, the result of this paper can also provide a practical method to design an improved sensing matrix for Compressive Classification. We can conclude that: Tight is Better!

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hailong Shi, Hao Zhang. 2013-07-01. Tight is better: Performance Improvement of the Compressive Classifier Using Equi-Norm Tight Frames. https://doi.org/10.1109/dsp-spe.2013.6642557

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