From Signal Space To STP-CS
Under the assumption that a finite signal with different sampling lengths or different sampling frequencies is considered as equivalent, the signal space is considered as the quotient space of $\mathbb{R}^{\infty}$ over equivalence. The topological structure and the properties of signal space are investigated. Using them some characteristics of semi-tensor product based compressed sensing (STP-CS) are revealed. Finally, a systematic analysis of the construction of sensing matrix based on balanced incomplete block design (BIBD) is presented.
Code (0)
등록된 구현이 없습니다.
Tasks
compressed sensingSimilar Papers 제목 키워드 기반
On BT-limited Signals
In this paper, we introduce and characterize a subspace of bandlimited signals. The subspace consists of all $\Omega$ bandlimited signals such that the non-zero parts of their Fourier transforms are pieces of some $T$ ba…
On distributional graph signals
Graph signal processing (GSP) studies graph-structured data, where the central concept is the vector space of graph signals. To study a vector space, we have many useful tools up our sleeves. However, uncertainty is omni…
Tensor Matched Kronecker-Structured Subspace Detection for Missing Information
We consider the problem of detecting whether a tensor signal having many missing entities lies within a given low dimensional Kronecker-Structured (KS) subspace. This is a matched subspace detection problem. Tensor match…
A graphon-signal analysis of graph neural networks
We present an approach for analyzing message passing graph neural networks (MPNNs) based on an extension of graphon analysis to a so called graphon-signal analysis. A MPNN is a function that takes a graph and a signal on…
Phaseless Subspace Tracking
This work takes the first steps towards solving the "phaseless subspace tracking" (PST) problem. PST involves recovering a time sequence of signals (or images) from phaseless linear projections of each signal under the f…
Retrieval