Results 1  10
of
4,997
Fast Approximate KarhunenLoève Expansions
, 1990
"... 39.37> 2 : We may assume without loss that X = 0. Write Var(X) for the sum of the coefficients of oe(X), which is the total variance of the ensemble X. Research supported in part by ONR Grant N0001488K0020 . Typeset by A M ST E X 2 MLADEN VICTOR WICKERHAUSER Let U : R d ! R d be ort ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
39.37> 2 : We may assume without loss that X = 0. Write Var(X) for the sum of the coefficients of oe(X), which is the total variance of the ensemble X. Research supported in part by ONR Grant N0001488K0020 . Typeset by A M ST E X 2 MLADEN VICTOR WICKERHAUSER Let U : R d ! R d
Reconstruction Equations and the KarhunenLoève Expansion for Systems with Symmetry
, 2000
"... We present a method for applying the KarhunenLoève decomposition to system with continuous symmetry. The techniques in this paper contribute to the general procedure of removing variables associated with the symmetry of a problem, and related ideas have been used in previous works both to identify ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
We present a method for applying the KarhunenLoève decomposition to system with continuous symmetry. The techniques in this paper contribute to the general procedure of removing variables associated with the symmetry of a problem, and related ideas have been used in previous works both to identify
Greenside, KarhunenLoéve decomposition of extensive chaos
, 1997
"... We show that the number of KLD (KarhunenLoève decomposition) modes DKLD(f) needed to capture a fraction f of the total variance of an extensively chaotic state scales extensively with subsystem volume V. This allows a correlation length ξKLD(f) to be defined that is easily calculated from spatially ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We show that the number of KLD (KarhunenLoève decomposition) modes DKLD(f) needed to capture a fraction f of the total variance of an extensively chaotic state scales extensively with subsystem volume V. This allows a correlation length ξKLD(f) to be defined that is easily calculated from
The KarhunenLoeve Transform of Discrete MVL Functions
"... The KarhunenLoeve (KL) transform of a discrete multiplevalued logic function is studied with respect to algebraic graph theory. The spectrum of a Cayley graph defined over the symmetry group is observed to be equivalent to the KL spectrum of a discrete function when the Cayley graph is generated u ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The KarhunenLoeve (KL) transform of a discrete multiplevalued logic function is studied with respect to algebraic graph theory. The spectrum of a Cayley graph defined over the symmetry group is observed to be equivalent to the KL spectrum of a discrete function when the Cayley graph is generated
1 KarhunenLoeve Representation of Stochastic Ocean Waves
, 2011
"... A new stochastic representation of a seastate is developed based on the KarhunenLoeve spectral decomposition of stochastic signals and the use of Slepian Prolate Spheroidal Wave Functions with a tunable bandwidth parameter. The new representation allows the description of stochastic ocean waves in ..."
Abstract
 Add to MetaCart
A new stochastic representation of a seastate is developed based on the KarhunenLoeve spectral decomposition of stochastic signals and the use of Slepian Prolate Spheroidal Wave Functions with a tunable bandwidth parameter. The new representation allows the description of stochastic ocean waves
Fractal Compression Using the Discrete KarhunenLoeve Transform
, 1998
"... Fractal coding of images is a quite recent and efficient method whose major drawback is the very slow compression phase, due to a timeconsuming similarity search between image blocks. A general acceleration method based on feature vectors is described, of which we can find many instances in the li ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
in the litterature. This general method is then optimized using the wellknown KarhunenLoeve expansion, allowing optimal dimensionality reduction of the search space. Finally a simple search algorithm is designed, based on orthogonal range searching and avoiding the "curse of dimensionality" problem
KarhunenLoeve Based Iterated Function System Encodings
, 1996
"... : Iterated Function Systems (IFS) raster compression techniques achieve their results by identifying selfsimilarities in the source image. However, not all source images contain exploitable selfsimilarity. We describe a compression technique that combines a KarhunenLoeve basis set (for non selfs ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
: Iterated Function Systems (IFS) raster compression techniques achieve their results by identifying selfsimilarities in the source image. However, not all source images contain exploitable selfsimilarity. We describe a compression technique that combines a KarhunenLoeve basis set (for non self
Multichannel Noise Reduction in the KarhunenLoève Expansion Domain
"... Abstract—The noise reduction problem is traditionally approached in the time, frequency, or transform domain. Having a signal dependent transform has shown some advantages over the traditional signal independent transform. Recently, the singlechannel noise reduction problem in the KarhunenLoève e ..."
Abstract
 Add to MetaCart
Abstract—The noise reduction problem is traditionally approached in the time, frequency, or transform domain. Having a signal dependent transform has shown some advantages over the traditional signal independent transform. Recently, the singlechannel noise reduction problem in the KarhunenLoève
Results 1  10
of
4,997