Procrustes problems and Parseval quasi-dual frames

preprint2013arXivOpen access

Abstract

Parseval frames have particularly useful properties, and in some cases, they can be used to reconstruct signals which were analyzed by a non-Parseval frame. In this paper, we completely describe the degree to which such reconstruction is feasible. Indeed, notice that for fixed frames $\cF$ and $\cX$ with synthesis operators FF and XX, the operator norm of FX∗−IFX^*-I measures the (normalized) worst-case error in the reconstruction of vectors when analyzed with $\cX$ and synthesized with $\cF$. Hence, for any given frame $\cF$, we compute explicitly the infimum of the operator norms of FX∗−IFX^*-I, where $\cX$ is any Parseval frame. The $\cX$'s that minimize this quantity are called Parseval quasi-dual frames of $\cF$. Our treatment considers both finite and infinite Parseval quasi-dual frames.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.