Frame (linear algebra) explained
In linear algebra, a frame of an inner product space is a generalization of a basis of a vector space to sets that may be linearly dependent. In the terminology of signal processing, a frame provides a redundant, stable way of representing a signal. Frames are used in error detection and correction and the design and analysis of filter banks and more generally in applied mathematics, computer science, and engineering.
History
Because of the various mathematical components surrounding frames, frame theory has roots in harmonic and functional analysis, operator theory, linear algebra, and matrix theory.
The Fourier transform has been used for over a century as a way of decomposing and expanding signals. However, the Fourier transform masks key information regarding the moment of emission and the duration of a signal. In 1946, Dennis Gabor was able to solve this using a technique that simultaneously reduced noise, provided resiliency, and created quantization while encapsulating important signal characteristics. This discovery marked the first concerted effort towards frame theory.
The frame condition was first described by Richard Duffin and Albert Charles Schaeffer in a 1952 article on nonharmonic Fourier series as a way of computing the coefficients in a linear combination of the vectors of a linearly dependent spanning set (in their terminology, a "Hilbert space frame"). In the 1980s, Stéphane Mallat, Ingrid Daubechies, and Yves Meyer used frames to analyze wavelets. Today frames are associated with wavelets, signal and image processing, and data compression.
Definition and motivation
Motivating example: computing a basis from a linearly dependent set
over a
field
and we want to express an arbitrary element
as a
linear combination of the vectors
, that is, finding coefficients
such that
If the set
does not span
, then such coefficients do not exist for every such
. If
spans
and also is
linearly independent, this set forms a
basis of
, and the coefficients
are uniquely determined by
. If, however,
spans
but is not linearly independent, the question of how to determine the coefficients becomes less apparent, in particular if
is of infinite dimension.
Given that
spans
and is linearly dependent, one strategy is to remove vectors from the set until it becomes linearly independent and forms a basis. There are some problems with this plan:
- Removing arbitrary vectors from the set may cause it to be unable to span
before it becomes linearly independent.
- Even if it is possible to devise a specific way to remove vectors from the set until it becomes a basis, this approach may become unfeasible in practice if the set is large or infinite.
- In some applications, it may be an advantage to use more vectors than necessary to represent
. This means that we want to find the coefficients
without removing elements in
. The coefficients
will no longer be uniquely determined by
. Therefore, the vector
can be represented as a linear combination of
in more than one way.
Definition
Let
be an
inner product space and
be a set of vectors in
. The set
is a
frame of
if it satisfies the so called
frame condition. That is, if there exist two constants
such that
A\left\|v\right\|2\leq\sumk\left|\langlev,ek\rangle\right|2\leqB\left\|v\right\|2, \forallv\inV.
A frame is called
overcomplete (or
redundant) if it is not a Riesz basis for the vector space. The redundancy of the frame is measured by the lower and upper frame bounds (or
redundancy factors)
and
, respectively. That is, a frame of
normalized vectors
in an
-dimensional space
has frame bounds which satisfiy
0<A\leq
|\langleek,e
\leqB<infty.
If the frame is a Riesz basis and is therefore
linearly independent, then
.
The frame bounds are not unique because numbers less than
and greater than
are also valid frame bounds. The
optimal lower bound is the
supremum of all lower bounds and the
optimal upper bound is the
infimum of all upper bounds.
Analysis operator
If the frame condition is satisfied, then the linear operator defined as
T:V\to\ell2, v\mapstoTv=\{\langle
,
mapping
to the sequence of
frame coefficients
, is called the
analysis operator. Using this definition, the frame condition can be rewritten as
A\left\|v\right\|2\leq\left\|Tv\right\|2=\sumk\left|\langlev,ek\rangle\right|2\leqB\left\|v\right\|2.
Synthesis operator
The adjoint of the analysis operator is called the synthesis operator of the frame and defined as
T*:\ell2\toV, \{ck\}k\mapsto\sumkckek.
Frame operator
The composition of the analysis operator and the synthesis operator leads to the frame operator defined as
S:V → V, v\mapstoSv=T*Tv=\sumk\langlev,ek\rangleek.
From this definition and linearity in the first argument of the inner product, the frame condition now yields
A\left\|v\right\|2\leq\left\|Tv\right\|2=\langleSv,v\rangle\leqB\left\|v\right\|2.
If the analysis operator exists, then so does the frame operator
as well as the inverse
. Both
and
are positive definite, bounded self-adjoint operators, resulting in
and
being the infimum and supremum values of the spectrum of
. In finite dimensions, the frame operator is automatically
trace-class, with
and
corresponding to the smallest and largest
eigenvalues of
or, equivalently, the smallest and largest
singular values of
.
Relation to bases
The frame condition is a generalization of Parseval's identity that maintains norm equivalence between a signal in
and its sequence of coefficients in
.
If the set
is a frame of
, it spans
. Otherwise there would exist at least one non-zero
which would be orthogonal to all
such that
A\left\|v\right\|2\leq0\leqB\left\|v\right\|2;
either violating the frame condition or the assumption that
.
However, a spanning set of
is not necessarily a frame. For example, consider
with the
dot product, and the infinite set
given by
\left\{(1,0),(0,1),\left(0,\tfrac{1}{\sqrt{2}}\right),\left(0,\tfrac{1}{\sqrt{3}}\right),...c\right\}.
This set spans
but since
\sumk\left|\langleek,(0,1)\rangle\right|2=0+1+\tfrac{1}{2}+\tfrac{1}{3}+...b=infty,
we cannot choose a finite upper frame bound
B. Consequently, the set
is not a frame.
Dual frames
Let
be a frame; satisfying the frame condition. Then the dual operator is defined as
}\mathbf = \sum_ \langle \mathbf,\tilde_k\rangle,with
}_ = (\mathbf^*\mathbf)^ \mathbf_ = \mathbf^ \mathbf_,called the
dual frame (or
conjugate frame). It is the
canonical dual of
(similar to a
dual basis of a basis), with the property that
v=
\sumk\langlev,ek\rangle\tilde{e
}_k = \sum_k \langle \mathbf, \mathbf_k \rangle \mathbf_k,and subsequent frame condition
\|v\|2\leq\sumk|\langlev,\tilde{e
}_k\rangle|^2 = \langle \mathbf\mathbf^\mathbf,\mathbf\mathbf^\mathbf \rangle = \langle \mathbf^\mathbf,\mathbf\rangle \leq \frac\|\mathbf\|^2, \quad \forall \mathbf \in V.Canonical duality is a reciprocity relation, i.e. if the frame
}_ \} is the canonical dual of
then the frame
is the canonical dual of
}_ \}. To see that this makes sense, let
be an element of
and let
u=
\sumk\langlev,ek\rangle\tilde{e
}_.
Thus
u=
\sumk\langlev,ek\rangle(S-1ek)=S-1\left(\sumk\langlev,ek\rangleek\right)=
S-1Sv=v,
proving that
v=\sumk\langlev,ek\rangle\tilde{e
}_.Alternatively, let
}_ \rangle \mathbf_.
Applying the properties of
and its inverse then shows that
u=
\sumk\langlev,S-1ek\rangleek=
\sumk\langleS-1v,ek\rangleek=
S(S-1v)=v,
and therefore
}_ \rangle \mathbf_.An overcomplete frame
allows us some freedom for the choice of coefficients
}_ \rangle such that
. That is, there exist dual frames
}_\} of
for which
v=\sumk\langlev,gk\rangleek, \forallv\inV.
Dual frame synthesis and analysis
Suppose
is a subspace of a
Hilbert space
and let
and
}_k\}_ be a frame and dual frame of
, respectively. If
does not depend on
, the dual frame is computed as
}_ = (\mathbf^*\mathbf_V)^ \mathbf_,where
denotes the restriction of
to
such that
is invertible on
. The best linear approximation of
in
is then given by the orthogonal projection of
onto
, defined as
PVf=
\sumk\langlef,ek\rangle\tilde{e
}_k = \sum_k \langle f, \mathbf_k \rangle \mathbf_k. The dual frame synthesis operator is defined as
}^*\mathbf f = (\mathbf^*\mathbf_V)^\mathbf^*\mathbf f =\sum_k \langle f, \mathbf_k \rangle \mathbf_k,and the orthogonal projection is computed from the frame coefficients
. In dual analysis, the orthogonal projection is computed from
as
}f = \sum_k \langle f, \mathbf_k \rangle \mathbf_kwith dual frame analysis operator
}f\}_k = \langle f,\tilde_k\rangle.
Applications and examples
In signal processing, it is common to represent signals as vectors in a Hilbert space. In this interpretation, a vector expressed as a linear combination of the frame vectors is a redundant signal. Representing a signal strictly with a set of linearly independent vectors may not always be the most compact form. Using a frame, it is possible to create a simpler, more sparse representation of a signal as compared with a family of elementary signals. Frames, therefore, provide "robustness". Because they provide a way of producing the same vector within a space, signals can be encoded in various ways. This facilitates fault tolerance and resilience to a loss of signal. Finally, redundancy can be used to mitigate noise, which is relevant to the restoration, enhancement, and reconstruction of signals.
Non-harmonic Fourier series
See main article: Fourier series. From Harmonic analysis it is known that the complex trigonometric system form an orthonormal basis for . As such, is a (tight) frame for with bounds
.
The system remains stable under "sufficiently small" perturbations
and the frame
will form a Riesz basis for
. Accordingly, every function
in
will have a unique
non-harmonic Fourier series representation
with
and
is called the
Fourier frame (or
frame of exponentials). What constitutes "sufficiently small" is described by the following theorem, named after
Mikhail Kadets.
The theorem can be easily extended to frames, replacing the integers by another sequence of real numbers such that
|λk-\muk|\leqL<
, \forallk\inZ, and 1-\cos(\piL)+\sin(\piL)<\sqrt{
},then
is a frame for
with bounds
}(1-\cos(\pi L) + \sin(\pi L)))^2, \quad B(2-\cos(\pi L) + \sin(\pi L))^2.
Frame projector
Frame (linear algebra) should not be confused with Projective frame.
Redundancy of a frame is useful in mitigating added noise from the frame coefficients. Let
denote a vector computed with noisy frame coefficients. The noise is then mitigated by projecting
onto the image of
.
The
sequence space and
(as
\operatorname{im}(T)\subseteq\ell2
) are
reproducing kernel Hilbert spaces with a kernel given by the matrix
Mk,p=\langleS-1ep,ek\rangle
. As such, the above equation is also referred to as the reproducing kernel equation and expresses the redundancy of frame coefficients.
Special cases
Tight frames
A frame is a tight frame if
. A tight frame
with frame bound
has the property that
v=
\sumk\langlev,ek\rangleek, \forallv\inV.
For example, the union of
disjoint
orthonormal bases of a vector space is an overcomplete tight frame with
. A tight frame is a
Parseval frame if
. Each orthonormal basis is a (complete) Parseval frame, but the converse is not necessarily true.
Equal norm frame
A frame is an equal norm frame if there is a constant
such that
for each
. An equal norm frame is a
normalized frame (sometimes called a
unit-norm frame) if
. A unit-norm Parseval frame is an orthonormal basis; such a frame satisfies
Parseval's identity.
Equiangular frames
A frame is an equiangular frame if there is a constant
such that
for all
. In particular, every orthonormal basis is equiangular.
Exact frames
A frame is an exact frame if no proper subset of the frame spans the inner product space. Each basis for an inner product space is an exact frame for the space (so a basis is a special case of a frame).
Generalizations
Semi-frame
Sometimes it may not be possible to satisfy both frame bounds simultaneously. An upper (respectively lower) semi-frame is a set that only satisfies the upper (respectively lower) frame inequality. The Bessel Sequence is an example of a set of vectors that satisfies only the upper frame inequality.
For any vector
to be reconstructed from the coefficients
it suffices if there exists a constant
such that
A\|x-y\|2\le\|Tx-Ty\|2, \forallx,y\inV.
By setting
and applying the linearity of the analysis operator, this condition is equivalent to:
A\|v\|2\le\|Tv\|2, \forallv\inV,
which is exactly the lower frame bound condition.
Fusion frame
See main article: article and Fusion frame. A fusion frame is best understood as an extension of the dual frame synthesis and analysis operators where, instead of a single subspace
, a set of closed subspaces
with positive scalar weights
is considered. A fusion frame is a family
that satisfies the frame condition
A\|f\|2\leq\sumi
f\|2\leqB\|f\|2, \forallf\inH,
where
denotes the orthogonal projection onto the subspace
.
Continuous frame
Suppose
is a Hilbert space,
a
locally compact space, and
is a locally finite
Borel measure on
. Then a set of vectors in
,
with a measure
is said to be a continuous frame if there exists constants,
such that
A||f||2\leq\intX|\langle
B||f||2, \forallf\inH.
To see that continuous frames are indeed the natural generalization of the frames mentioned above, consider a discrete set
and a measure
where
is the
Dirac measure. Then the continuous frame condition reduces to
A||f||2\leq\sumλ\in|\langlef,fλ\rangle|2\leqB||f||2, \forallf\inH.
Just like in the discrete case we can define the analysis, synthesis, and frame operators when dealing with continuous frames.
Continuous analysis operator
Given a continuous frame
the continuous analysis operator is the operator mapping
to a function on
defined as follows:
by
f\mapsto\langlef,fx\ranglex\in
.
Continuous synthesis operator
The adjoint operator of the continuous analysis operator is the continuous synthesis operator, which is the map
by
ax\mapsto\intXaxfxd\mu(x)
.
Continuous frame operator
The composition of the continuous analysis operator and the continuous synthesis operator is known as the continuous frame operator. For a continuous frame
, it is defined as follows:
by
Sf:=\intX\langlef,fx\ranglefxd\mu(x).
In this case, the continuous frame projector
P:L2(x,\mu)\to\operatorname{im}(T)
is the orthogonal projection defined by
The projector
is an integral operator with reproducting kernel
K(x,y)=\langleS-1fx,fy\rangle
, thus
is a
reproducing kernel Hilbert space.
Continuous dual frame
Given a continuous frame
, and another continuous frame
, then
is said to be a continuous dual frame of
if it satisfies the following condition for all
:
\langlef,h\rangle=\intX\langlef,fx\rangle\langlegx,h\rangled\mu(x).
Framed positive operator-valued measure
See main article: article and Positive operator-valued measure. Just as a frame is a natural generalization of a basis to sets that may be linear dependent, a positive operator-valued measure (POVM) is a natural generalization of a projection-valued measure (PVM) in that elements of a POVM are not necessarily orthogonal projections.
Suppose
is a
measurable space with
a Borel σ-algebra on
and let
be a POVM from
to the space of
positive operators on
with the additional property that
0<AI\leqF(M)\leqBI<infty,
where
is the
identity operator. Then
is called a
framed POVM. In case of the fusion frame condition, this allows for the substitution
For the continuous frame operator, the framed POVM would be
\langleF(M)fx,fy\rangle=\intM\langleSfx,fy\rangled\mu(x).
See also
References
- Antoine . J.-P. . Balazs . P. . Frames, Semi-Frames, and Hilbert Scales . Numerical Functional Analysis and Optimization . 33 . 7–9 . 2012 . 736–769 . 0163-0563 . 10.1080/01630563.2012.682128. 1203.0506 .
- Book: Casazza . Peter . Peter G. Casazza . Kutyniok . Gitta . Gitta Kutyniok . Philipp . Friedrich . Introduction to Finite Frame Theory . Finite Frames: Theory and Applications . 2013 . Birkhäuser . Berlin . 978-0-8176-8372-6 . 1–53.
- Book: Christensen, Ole . Applied and Numerical Harmonic Analysis . An Introduction to Frames and Riesz Bases . Springer International Publishing . Cham . 2016 . 978-3-319-25611-5 . 2296-5009 . 10.1007/978-3-319-25613-9.
- Duffin . Richard James . Richard Duffin . Schaeffer . Albert Charles . Albert Charles Schaeffer . A class of nonharmonic Fourier series . 1952 . Transactions of the American Mathematical Society . 72 . 341–366 . 10.2307/1990760 . 1990760 . 2 . 0047179 . free.
- Kovačević . Jelena . Chebira . Amina . An Introduction to Frames . Foundations and Trends in Signal Processing . 2008 . 2 . 1 . 1–94 . 10.1561/2000000006.
- Kovacevic . Jelena . Dragotti . Pier Luigi . Goyal . Vivek . Filter Bank Frame Expansions with Erasures . 2002 . IEEE Transactions on Information Theory . 48 . 6 . 1439–1450 . 10.1109/TIT.2002.1003832 . 10.1.1.661.2699.
- Book: Mallat, Stéphane . A wavelet tour of signal processing: the sparse way . Elsevier/Academic Press . Amsterdam Boston . 2009 . 978-0-12-374370-1.
- Book: Moran . Bill . Howard . Stephen . Cochran . Doug . Excursions in Harmonic Analysis, Volume 2 . Positive-Operator-Valued Measures: A General Setting for Frames . Birkhäuser Boston . Boston . 2013 . 978-0-8176-8378-8 . 10.1007/978-0-8176-8379-5_4.
- Robinson . Benjamin . Moran . Bill . Cochran . Doug . Positive operator-valued measures and densely defined operator-valued frames . Rocky Mountain Journal of Mathematics . 51 . 1 . 2021 . 0035-7596 . 10.1216/rmj.2021.51.265. 2004.11729 .
- Book: Young, Robert M. . An Introduction to Non-Harmonic Fourier Series, Revised Edition, 93 . Academic Press . 2001 . 978-0-12-772955-8.