Results 1  10
of
101,056
Biorthogonal Local Trigonometric Bases
, 2000
"... Local trigonometric bases consist of cosines and sines multiplied by smooth, well localized window functions in order to have basis functions with good timefrequency localization. On the one hand, bases in the twooverlapping setting are considered. In particular, the development of such bases from ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Local trigonometric bases consist of cosines and sines multiplied by smooth, well localized window functions in order to have basis functions with good timefrequency localization. On the one hand, bases in the twooverlapping setting are considered. In particular, the development of such bases
Biorthogonal Smooth Local Trigonometric Bases
 J. Fourier Anal. Appl
, 1994
"... In this paper we discuss smooth local trigonometric bases. We present two generalizations of the orthogonal basis of Malvar and CoifmanMeyer: biorthogonal and equal parity bases. These allow natural representations of constant and, sometimes, linear components. We study and compare their approximat ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
In this paper we discuss smooth local trigonometric bases. We present two generalizations of the orthogonal basis of Malvar and CoifmanMeyer: biorthogonal and equal parity bases. These allow natural representations of constant and, sometimes, linear components. We study and compare
On the Reproduction of Linear Functions by Local Trigonometric Bases
 Approximation Theory IX, volume II, Computational Aspects of Innovations in Applied Mathematics
, 1998
"... . Using an approach of Chui and Shi we construct smooth local trigonometric bases which reproduce linear functions locally by a finite set of basis functions. More precisely, we want to determine window functions w j such that each linear function can be written locally as a finite linear combinati ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
. Using an approach of Chui and Shi we construct smooth local trigonometric bases which reproduce linear functions locally by a finite set of basis functions. More precisely, we want to determine window functions w j such that each linear function can be written locally as a finite linear
Bivariate Local Trigonometric Bases On Triangular Partitions
 In Wavelets and Multiscale Methods, Proceedings of the International Wavelet Conference, Tanger
, 1998
"... We construct bivariate local trigonometric bases on a "twooverlapping" triangular grid. A main result is the description of various trigonometric bases on triangles, satisfying parity conditions at the edges. Moreover, we introduce folding operators for the triangular grid. From these res ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We construct bivariate local trigonometric bases on a "twooverlapping" triangular grid. A main result is the description of various trigonometric bases on triangles, satisfying parity conditions at the edges. Moreover, we introduce folding operators for the triangular grid. From
Fast compression of seismic data with local trigonometric bases
 in Wavelet Applications in Signal and Image Processing VII
, 1999
"... Our goal in this paper is to provide a fast numerical implementation of the local trigonometric bases algorithm1 in order to demonstrate that an advantage can be gained by constructing a biorthogonal basis adapted to a target image. Different choices for the bells are proposed, and an extensive eval ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Our goal in this paper is to provide a fast numerical implementation of the local trigonometric bases algorithm1 in order to demonstrate that an advantage can be gained by constructing a biorthogonal basis adapted to a target image. Different choices for the bells are proposed, and an extensive
Optimal Bell Functions for Biorthogonal Local Trigonometric Bases
, 1997
"... A general approach for biorthogononal local trigonometric bases in the twooverlapping setting was given by Chui and Shi. In this paper, we give error estimates for the approximation with such basis functions. In particular, it is shown that for a partition of the real axis into small intervals one o ..."
Abstract
 Add to MetaCart
A general approach for biorthogononal local trigonometric bases in the twooverlapping setting was given by Chui and Shi. In this paper, we give error estimates for the approximation with such basis functions. In particular, it is shown that for a partition of the real axis into small intervals one
Signal Compression with Smooth Local Trigonometric Bases
 Optical Eng
, 1994
"... We discuss smooth local trigonometric bases and their applications to signal compression. In image compression, these bases can reduce the blocking effect that occurs in JPEG. We present and compare two generalizations of the original construction of Malvar, Coifman and Meyer: biorthogonal and equal ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We discuss smooth local trigonometric bases and their applications to signal compression. In image compression, these bases can reduce the blocking effect that occurs in JPEG. We present and compare two generalizations of the original construction of Malvar, Coifman and Meyer: biorthogonal
Error Estimates and Reproduction of Polynomials for Biorthogonal Local Trigonometric Bases
 Appl. Comput. Harmon. Anal
, 1999
"... A general approach for biorthogononal local trigonometric bases in the twooverlapping setting was given by Chui and Shi. In this paper, we give error estimates for the approximation with such basis functions. In particular, it is shown that for a partition of the real axis into small intervals one o ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
A general approach for biorthogononal local trigonometric bases in the twooverlapping setting was given by Chui and Shi. In this paper, we give error estimates for the approximation with such basis functions. In particular, it is shown that for a partition of the real axis into small intervals one
LOF: Identifying densitybased local outliers
 MOD
, 2000
"... For many KDD applications, such as detecting criminal activities in Ecommerce, finding the rare instances or the outliers, can be more interesting than finding the common patterns. Existing work in outlier detection regards being an outlier as a binary property. In this paper, we contend that for ..."
Abstract

Cited by 516 (13 self)
 Add to MetaCart
that for many scenarios, it is more meaningful to assign to each object a degree of being an outlier. This degree is called the local outlier factor (LOF) of an object. It is local in that the degree depends on how isolated the object is with respect to the surrounding neighborhood. We give a detailed formal
Localitysensitive hashing scheme based on pstable distributions
 In SCG ’04: Proceedings of the twentieth annual symposium on Computational geometry
, 2004
"... inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate ..."
Abstract

Cited by 521 (8 self)
 Add to MetaCart
inÇÐÓ�Ò We present a novel LocalitySensitive Hashing scheme for the Approximate Nearest Neighbor Problem underÐÔnorm, based onÔstable distributions. Our scheme improves the running time of the earlier algorithm for the case of theÐnorm. It also yields the first known provably efficient approximate
Results 1  10
of
101,056