Pith. sign in

REVIEW

Procrustes problems and Parseval quasi-dual frames

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1309.7914 v1 pith:4OJIXHEK submitted 2013-09-30 math.FA

classification math.FA
keywords framesparsevalframequasi-dualanalyzedoperatorreconstructioncalled
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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 $F$ and $X$, the operator norm of $FX^*-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^*-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.

Discussion (0). Sign in to comment.

Pith tools