Fusion frame

Last updated

In mathematics, a fusion frame of a vector space is a natural extension of a frame. It is an additive construct of several, potentially "overlapping" frames. The motivation for this concept comes from the event that a signal can not be acquired by a single sensor alone (a constraint found by limitations of hardware or data throughput), rather the partial components of the signal must be collected via a network of sensors, and the partial signal representations are then fused into the complete signal.

Contents

By construction, fusion frames easily lend themselves to parallel or distributed processing [1] of sensor networks consisting of arbitrary overlapping sensor fields.

Definition

Given a Hilbert space , let be closed subspaces of , where is an index set. Let be a set of positive scalar weights. Then is a fusion frame of if there exist constants such that for all we have

,

where denotes the orthogonal projection onto the subspace . The constants and are called lower and upper bound, respectively. When the lower and upper bounds are equal to each other, becomes a -tight fusion frame. Furthermore, if , we can call Parseval fusion frame. [1]

Assume is a frame for . Then is called a fusion frame system for . [1]

Theorem for the relationship between fusion frames and global frames

Let be closed subspaces of with positive weights . Suppose is a frame for with frame bounds and . Let and , which satisfy that . Then is a fusion frame of if and only if is a frame of .

Additionally, if is called a fusion frame system for with lower and upper bounds and , then is a frame of with lower and upper bounds and . And if is a frame of with lower and upper bounds and , then is called a fusion frame system for with lower and upper bounds and . [2]

Local frame representation

Let be a closed subspace, and let be an orthonormal basis of . Then for all , the orthogonal projection of onto is given by . [3]

We can also express the orthogonal projection of onto in terms of given local frame of ,

,

where is a dual frame of the local frame . [1]

Definition of fusion frame operator

Let be a fusion frame for . Let be representation space for projection. The analysis operator is defined by

.

Then The adjoint operator , which we call the synthesis operator, is given by

,

where .

The fusion frame operator is defined by

. [2]

Properties of fusion frame operator

Given the lower and upper bounds of the fusion frame , and , the fusion frame operator can be bounded by

, where is the identity operator. Therefore, the fusion frame operator is positive and invertible. [2]

Representation of fusion frame operator

Given a fusion frame system for , where , and , which is a dual frame for , the fusion frame operator can be expressed as

,

where , are analysis operators for and respectively, and , are synthesis operators for and respectively. [1]

For finite frames (i.e., and ), the fusion frame operator can be constructed with a matrix. [1] Let be a fusion frame for , and let be a frame for the subspace and an index set for each . With

and

where is the canonical dual frame of , the fusion frame operator is given by

.

The fusion frame operator is then given by an matrix.

See also

Related Research Articles

Distributions, also known as Schwartz distributions or generalized functions, are objects that generalize the classical notion of functions in mathematical analysis. Distributions make it possible to differentiate functions whose derivatives do not exist in the classical sense. In particular, any locally integrable function has a distributional derivative.

In mathematics, a linear form is a linear map from a vector space to its field of scalars.

In mathematics, the GrassmannianGr(k, V) is a space that parameterizes all k-dimensional linear subspaces of the n-dimensional vector space V. For example, the Grassmannian Gr(1, V) is the space of lines through the origin in V, so it is the same as the projective space of one dimension lower than V.

In quantum mechanics, the Gorini–Kossakowski–Sudarshan–Lindblad equation, master equation in Lindblad form, quantum Liouvillian, or Lindbladian is one of the general forms of Markovian master equations describing open quantum systems. It generalizes the Schrödinger equation to open quantum systems; that is, systems in contacts with their surroundings. The resulting dynamics is no longer unitary, but still satisfies the property of being trace-preserving and completely positive for any initial condition.

In quantum mechanics, a quantum operation is a mathematical formalism used to describe a broad class of transformations that a quantum mechanical system can undergo. This was first discussed as a general stochastic transformation for a density matrix by George Sudarshan. The quantum operation formalism describes not only unitary time evolution or symmetry transformations of isolated systems, but also the effects of measurement and transient interactions with an environment. In the context of quantum computation, a quantum operation is called a quantum channel.

In linear algebra and functional analysis, the partial trace is a generalization of the trace. Whereas the trace is a scalar valued function on operators, the partial trace is an operator-valued function. The partial trace has applications in quantum information and decoherence which is relevant for quantum measurement and thereby to the decoherent approaches to interpretations of quantum mechanics, including consistent histories and the relative state interpretation.

In functional analysis, the Friedrichs extension is a canonical self-adjoint extension of a non-negative densely defined symmetric operator. It is named after the mathematician Kurt Friedrichs. This extension is particularly useful in situations where an operator may fail to be essentially self-adjoint or whose essential self-adjointness is difficult to show.

In matrix theory, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique eigenvalue of largest magnitude and that eigenvalue is real. The corresponding eigenvector can be chosen to have strictly positive components, and also asserts a similar statement for certain classes of nonnegative matrices. This theorem has important applications to probability theory ; to the theory of dynamical systems ; to economics ; to demography ; to social networks ; to Internet search engines (PageRank); and even to ranking of football teams. The first to discuss the ordering of players within tournaments using Perron–Frobenius eigenvectors is Edmund Landau.

The Peres–Horodecki criterion is a necessary condition, for the joint density matrix of two quantum mechanical systems and , to be separable. It is also called the PPT criterion, for positive partial transpose. In the 2×2 and 2×3 dimensional cases the condition is also sufficient. It is used to decide the separability of mixed states, where the Schmidt decomposition does not apply. The theorem was discovered in 1996 by Asher Peres and the Horodecki family

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.

In mathematics, a holomorphic vector bundle is a complex vector bundle over a complex manifold X such that the total space E is a complex manifold and the projection map π : EX is holomorphic. Fundamental examples are the holomorphic tangent bundle of a complex manifold, and its dual, the holomorphic cotangent bundle. A holomorphic line bundle is a rank one holomorphic vector bundle.

In mathematics, in the field of functional analysis, the Cotlar–Stein almost orthogonality lemma is named after mathematicians Mischa Cotlar and Elias Stein. It may be used to obtain information on the operator norm on an operator, acting from one Hilbert space into another when the operator can be decomposed into almost orthogonal pieces. The original version of this lemma (for self-adjoint and mutually commuting operators) was proved by Mischa Cotlar in 1955 and allowed him to conclude that the Hilbert transform is a continuous linear operator in without using the Fourier transform. A more general version was proved by Elias Stein.

Amplitude amplification is a technique in quantum computing which generalizes the idea behind Grover's search algorithm, and gives rise to a family of quantum algorithms. It was discovered by Gilles Brassard and Peter Høyer in 1997, and independently rediscovered by Lov Grover in 1998.

A decoherence-free subspace (DFS) is a subspace of a quantum system's Hilbert space that is invariant to non-unitary dynamics. Alternatively stated, they are a small section of the system Hilbert space where the system is decoupled from the environment and thus its evolution is completely unitary. DFSs can also be characterized as a special class of quantum error correcting codes. In this representation they are passive error-preventing codes since these subspaces are encoded with information that (possibly) won't require any active stabilization methods. These subspaces prevent destructive environmental interactions by isolating quantum information. As such, they are an important subject in quantum computing, where (coherent) control of quantum systems is the desired goal. Decoherence creates problems in this regard by causing loss of coherence between the quantum states of a system and therefore the decay of their interference terms, thus leading to loss of information from the (open) quantum system to the surrounding environment. Since quantum computers cannot be isolated from their environment and information can be lost, the study of DFSs is important for the implementation of quantum computers into the real world.

Overcompleteness is a concept from linear algebra that is widely used in mathematics, computer science, engineering, and statistics. It was introduced by R. J. Duffin and A. C. Schaeffer in 1952.

In mathematics, particularly linear algebra, the Schur–Horn theorem, named after Issai Schur and Alfred Horn, characterizes the diagonal of a Hermitian matrix with given eigenvalues. It has inspired investigations and substantial generalizations in the setting of symplectic geometry. A few important generalizations are Kostant's convexity theorem, Atiyah–Guillemin–Sternberg convexity theorem, Kirwan convexity theorem.

For computer science, in statistical learning theory, a representer theorem is any of several related results stating that a minimizer of a regularized empirical risk functional defined over a reproducing kernel Hilbert space can be represented as a finite linear combination of kernel products evaluated on the input points in the training set data.

In the ADM formulation of general relativity one splits spacetime into spatial slices and time, the basic variables are taken to be the induced metric, , on the spatial slice, and its conjugate momentum variable related to the extrinsic curvature, ,. These are the metric canonical coordinates.

In applied mathematical analysis, shearlets are a multiscale framework which allows efficient encoding of anisotropic features in multivariate problem classes. Originally, shearlets were introduced in 2006 for the analysis and sparse approximation of functions . They are a natural extension of wavelets, to accommodate the fact that multivariate functions are typically governed by anisotropic features such as edges in images, since wavelets, as isotropic objects, are not capable of capturing such phenomena.

Tau functions are an important ingredient in the modern mathematical theory of integrable systems, and have numerous applications in a variety of other domains. They were originally introduced by Ryogo Hirota in his direct method approach to soliton equations, based on expressing them in an equivalent bilinear form.

References

  1. 1 2 3 4 5 6 Casazza, Peter G.; Kutyniok, Gitta; Li, Shidong (2008). "Fusion frames and distributed processing". Applied and Computational Harmonic Analysis. 25 (1): 114–132. arXiv: math/0605374 . doi:10.1016/j.acha.2007.10.001. S2CID   329040.
  2. 1 2 3 Casazza, P.G.; Kutyniok, G. (2004). "Frames of subspaces". Wavelets, Frames and Operator Theory. Contemporary Mathematics. Vol. 345. pp. 87–113. doi:10.1090/conm/345/06242. ISBN   9780821833803. S2CID   16807867.
  3. Christensen, Ole (2003). An introduction to frames and Riesz bases. Boston [u.a.]: Birkhäuser. p. 8. ISBN   978-0817642952.