Related papers: Designing optimal dual frames for $\ell^p-$average…
The study involves characterizations of dual pairs of frames which are optimal to handle erasures among all dual pairs for a finite dimensional Hilbert space. A new optimality measure using the Frobenius norm of the error operator has been…
The prime focus of this paper is the study of optimal duals of a given finite frame as well as optimal dual pairs, in the context of probability modelled erasures of frame coefficients. We characterize optimal dual frames (and dual pairs)…
Error occurs in data transmission process when some data are missing at the time of reconstruction. Finding the best dual frame or a dual pair that minimizes the reconstruction error when erasure occurs,is a deep-rooted problem in frame…
This paper investigates the optimization of dual frame pairs in the context of erasure problems in data transmission, using a graph theoretical approach. Frames are essential for mitigating errors and signal loss due to their redundancy…
This paper explores the structure of optimal K-dual frames for a given K-frame and optimal K-dual pairs, within the context of erasures which occur during the transmission of frame coefficients. We address two distinct erasure scenarios and…
Finding the optimal dual frame and optimal dual pair for signal reconstruction, which can minimize the reconstruction error when erasure occurs during data transmission, is a deep rooted problem from the perspective of frame theory. In this…
In this paper we study the problem of recovering a signal from frame coefficients with erasures. Suppose that erased coefficients are indexed by a finite set $E$. Starting from a frame $(x_n)_{n=1}^\infty$ and its arbitrary dual frame, we…
The purpose of this work is to examine the structure of optimal dual fusion frames and get more exibility in the use of dual fusion frames for erasures of subspaces. We deal with optimal dual fusion frames with respect to different…
Let $I\subseteq \Bbb N$ be a finite or infinite set and let ${(x_n)_{n\in I}}$ be a frame for a separable Hilbert space $\mathcal{H}$. Consider transmission of a signal $h\in\mathcal{H}$ where a finite subset $(\langle h,x_n\rangle)_{n\in…
Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be optimal for handling up to two erasures, in the sense that they minimize the largest possible error when up to two…
We propose a new approach to the problem of recovering signal from frame coefficients with erasures. Such problems arise naturally from applications where some of the coefficients could be corrupted or erased during the data transmission.…
Compressed sensing with sparse frame representations is seen to have much greater range of practical applications than that with orthonormal bases. In such settings, one approach to recover the signal is known as $\ell_1$-analysis. We…
The most important purpose of this article is to investigate perfect reconstruction underlying range space of operators in finite dimensional Hilbert spaces by matrix methods. To this end, first we obtain more structures of the canonical…
In [9], authors studied spectrally optimal dual frames for 1-erasure and 2-erasures of frames generated by graph. In this paper, we study spectrally optimal dual frames for r-erasures. We show that the spectral radius of the error operator…
We give some new methods for perfect reconstruction from frame and sampling erasures in finitely many steps. By bridging an erasure set we mean replacing the erased Fourier coefficients of a function with respect to a frame by appropriate…
Given a channel with additive noise and adversarial erasures, the task is to design a frame that allows for stable signal reconstruction from transmitted frame coefficients. To meet these specifications, we introduce numerically…
In this paper we consider two problems in frame theory. On the one hand, given a set of vectors $\mathcal F$ we describe the spectral and geometrical structure of optimal completions of $\mathcal F$ by a finite family of vectors with…
This paper aims to develop a new and robust approach to feature representation. Motivated by the success of Auto-Encoders, we first theoretical summarize the general properties of all algorithms that are based on traditional Auto-Encoders:…
We study the problem of residual error estimation for matrix and vector norms using a linear sketch. Such estimates can be used, for example, to quickly assess how useful a more expensive low-rank approximation computation will be. The…
Frame is the corner stone for designing decomposition and reconstruction operations in signal processing. Famous frames include wavelets, curvelets,and Gabor. A celebrated result indicates that if a synthesis frame is chosen for…