Procrustes problems and Parseval quasi-dual frames
Functional Analysis
2013-10-01 v1
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 and with synthesis operators and , the operator norm of measures the (normalized) worst-case error in the reconstruction of vectors when analyzed with and synthesized with . Hence, for any given frame , we compute explicitly the infimum of the operator norms of , where is any Parseval frame. The 's that minimize this quantity are called Parseval quasi-dual frames of . Our treatment considers both finite and infinite Parseval quasi-dual frames.
Keywords
Cite
@article{arxiv.1309.7914,
title = {Procrustes problems and Parseval quasi-dual frames},
author = {G. Corach and P. Massey and M. Ruiz},
journal= {arXiv preprint arXiv:1309.7914},
year = {2013}
}