In this paper, we study the finite Gabor system for oversampling schemes. A characterization of dual tight frame using discrete time Zak transform is given. Also, a method to calculate coefficients expansion in case and necessary sufficient condition existence biorthogonal pair Riesz basis l2(ZL) Further, introduce notion block sliding Fourier (BSDFT) which reduces computational complexity give...

In this paper, we study the construction of irregular shearlet systems, i.e., systems of the form SH(ψ,Λ) = {a− 4 ψ(A−1 a S−1 s (x− t)) : (a, s, t) ∈ Λ}, where ψ ∈ L(R), Λ is an arbitrary sequence in R ×R×R2, Aa is a parabolic scaling matrix and Ss a shear matrix. These systems are obtained by appropriately sampling the Continuous Shearlet Transform. We derive sufficient conditions for such a d...

using the notion of “belongingness ($epsilon$)” and “quasi-coincidence (q)” of fuzzy points with fuzzy sets, we introduce the concept of an ($ alpha, beta$)- fuzzyhv-ideal of an hv-ring, where , are any two of {$epsilon$, q,$epsilon$ $vee$ q, $epsilon$ $wedge$ q} with $ alpha$ $neq$ $epsilon$ $wedge$ q. since the concept of ($epsilon$, $epsilon$ $vee$ q)-fuzzy hv-ideals is an important and ...

A common method to compute sparse solutions in compressed sensing is based on `minimization. In this paper we consider `-minimization for arbitrary 0 < p ≤ 1. More precisely, we prove stability estimates for solutions of the analysis formulation of the `minimization problem for 0 < p ≤ 1 from noisy measurements. Furthermore, our focus lies in arbitrary frames that are not necessarily tight or P...

Phase retrieval has become a very active area of research. We will classify when phase retrieval by Parseval frames passes to the Naimark complement and when phase retrieval by projections passes to the orthogonal complements. We introduce a new concept we call norm retrieval and show that this is what is necessary for passing phase retrieval to complements. This leads to a detailed study of no...

If B < ∞ we call F = {fi}i∈I a Bessel sequence with Bessel bound B. If 0 < A ≤ B < ∞, then {fi}i∈I is a frame for K. If K 6= H we call {fi}i∈I a frame sequence in H. The largest A and the smallest B satisfying the above inequalities are called the optimal lower and upper frame bound and will be denoted A(F) and B(F) respectively. If A = B = λ we call this a λ-tight frame and if λ = 1 it is call...

and Applied Analysis 3 Proposition 1.3 see 4, 10 . A closed subspace X of L2 n is a reducing subspace if and only if X { f ∈ L2 n : supp ( f̂ ) ⊆ S } 1.5 for some measurable set S ⊆ n with ãS S. So, to be specific, one denotes a reducing subspace by L2 S ∨ instead of X. In particular, L2 n is a reducing subspace of L2 n . Definition 1.4 see 5–7 . Let B n be a subgroup of the integral affine grou...

We examine relations between popular variational methods in image processing and classical operator splitting methods in convex analysis. We focus on a gradient descent reprojection algorithm for image denoising and the recently proposed Split Bregman and alternating Split Bregman methods. By identifying the latter with the so-called DouglasRachford splitting algorithm we can guarantee its conv...

in this paper, we introduce the notion of ($epsilon $, $epsilon $ $vee$ q_{k})− fuzzy subnear-ring which is a generalization of ($epsilon $, $epsilon $ $vee$ q)−fuzzy subnear-ring. we have given examples which are ($epsilon $, $epsilon $ $vee$ q_{k})−fuzzy ideals but they are not ($epsilon $, $epsilon $ $vee$ q)−fuzzy ideals. we have also introduced the notions of ($epsilon $, $epsilon $ $vee$ ...