اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProcrustes problems and Parseval quasi-dual frames
140
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
A very useful identity for Parseval frames for Hilbert spaces was obtained by Balan, Casazza, Edidin, and Kutyniok. In this paper, we obtain a similar identity for Parseval p-approximate Schauder frames for Banach spaces which admits a homogeneous semi-inner product in the sense of Lumer-Giles.
Wavelet set wavelets were the first examples of wavelets that may not have associated multiresolution analyses. Furthermore, they provided examples of complete orthonormal wavelet systems in $L^2(mathbb{R}^d)$ which only require a single generating w
avelet. Although work had been done to smooth these wavelets, which are by definition discontinuous on the frequency domain, nothing had been explicitly done over $mathbb{R}^d$, $d >1$. This paper, along with another one cowritten by the author, finally addresses this issue. Smoothing does not work as expected in higher dimensions. For example, Bin Hans proof of existence of Schwartz class functions which are Parseval frame wavelets and approximate Parseval frame wavelet set wavelets does not easily generalize to higher dimensions. However, a construction of wavelet sets in $hat{mathbb{R}}^d$ which may be smoothed is presented. Finally, it is shown that a commonly used class of functions cannot be the result of convolutional smoothing of a wavelet set wavelet.
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 prescribed norms,
where optimality is measured with respect to majorization. In particular, these optimal completions are the minimizers of a family of convex functionals that include the mean square error and the Bendetto-Fickus frame potential. On the other hand, given a fixed frame $mathcal F$ we describe explicitly the spectral and geometrical structure of optimal frames $mathcal G$ that are in duality with $mathcal F$ and such that the Frobenius norms of their analysis operators is bounded from below by a fixed constant. In this case, optimality is measured with respect to submajorization of the frames operators. Our approach relies on the description of the spectral and geometrical structure of matrices that minimize submajorization on sets that are naturally associated with the problems above.
Binary Parseval frames share many structural properties with real and complex ones. On the other hand, there are subtle differences, for example that the Gramian of a binary Parseval frame is characterized as a symmetric idempotent whose range contai
ns at least one odd vector. Here, we study binary Parseval frames obtained from the orbit of a vector under a group representation, in short, binary Parseval group frames. In this case, the Gramian of the frame is in the algebra generated by the right regular representation. We identify equivalence classes of such Parseval frames with binary functions on the group that satisfy a convolution identity. This allows us to find structural constraints for such frames. We use these constraints to catalogue equivalence classes of binary Parseval frames obtained from group representations. As an application, we study the performance of binary Parseval frames generated with abelian groups for purposes of error correction. We show that $Z_p^q$ is always preferable to $Z_{p^q}$ when searching for best performing codes associated with binary Parseval group frames.
The main purpose of the paper is to give a characterization of all compactly supported dual windows of a Gabor frame. As an application, we consider an iterative procedure for approximation of the canonical dual window via compactly supported dual wi
ndows on every step. In particular, the procedure allows to have approximation of the canonical dual window via dual windows from certain modulation spaces or from the Schwartz space.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
