Results 1  10
of
3,200
A Signal Processing Approach To Fair Surface Design
, 1995
"... In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing, or fai ..."
Abstract

Cited by 654 (15 self)
 Add to MetaCart
In this paper we describe a new tool for interactive freeform fair surface design. By generalizing classical discrete Fourier analysis to twodimensional discrete surface signals  functions defined on polyhedral surfaces of arbitrary topology , we reduce the problem of surface smoothing
Approximate Frequency Counts over Data Streams
 VLDB
, 2002
"... We present algorithms for computing frequency counts exceeding a userspecified threshold over data streams. Our algorithms are simple and have provably small memory footprints. Although the output is approximate, the error is guaranteed not to exceed a userspecified parameter. Our algorithms can e ..."
Abstract

Cited by 418 (1 self)
 Add to MetaCart
We present algorithms for computing frequency counts exceeding a userspecified threshold over data streams. Our algorithms are simple and have provably small memory footprints. Although the output is approximate, the error is guaranteed not to exceed a userspecified parameter. Our algorithms can
On sparse reconstruction from Fourier and Gaussian measurements
 Communications on Pure and Applied Mathematics
, 2006
"... Abstract. This paper improves upon best known guarantees for exact reconstruction of a sparse signal f from a small universal sample of Fourier measurements. The method for reconstruction that has recently gained momentum in the Sparse Approximation Theory is to relax this highly nonconvex problem ..."
Abstract

Cited by 262 (8 self)
 Add to MetaCart
Abstract. This paper improves upon best known guarantees for exact reconstruction of a sparse signal f from a small universal sample of Fourier measurements. The method for reconstruction that has recently gained momentum in the Sparse Approximation Theory is to relax this highly nonconvex problem
Fourier shape descriptors of pixel footprints for road extraction from satellite images
 Proceedings of ICIP 2007
"... ABSTRACT In this paper, an automatic road tracking method is presented for detecting roads from satellite images. This method is based on shape classification of a local homogeneous region around a pixel. The local homogeneous region is enclosed by a polygon, called the pixel footprint. We introduc ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
introduce a spoke wheel operator to obtain the pixel footprint and propose a Fourierbased approach to classify footprints for automatic seeding and growing of the road tracker. We experimentally demonstrate that our proposed road tracker can extract the centerlines of roads with sharp turns
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
, 2004
"... In this paper, we develop a robust uncertainty principle for finite signals in C N which states that for nearly all choices T, Ω ⊂ {0,..., N − 1} such that T  + Ω  ≍ (log N) −1/2 · N, there is no signal f supported on T whose discrete Fourier transform ˆ f is supported on Ω. In fact, we can mak ..."
Abstract

Cited by 181 (17 self)
 Add to MetaCart
In this paper, we develop a robust uncertainty principle for finite signals in C N which states that for nearly all choices T, Ω ⊂ {0,..., N − 1} such that T  + Ω  ≍ (log N) −1/2 · N, there is no signal f supported on T whose discrete Fourier transform ˆ f is supported on Ω. In fact, we can
Wavelet transforms versus Fourier transforms
 Department of Mathematics, MIT, Cambridge MA
, 213
"... Abstract. This note is a very basic introduction to wavelets. It starts with an orthogonal basis of piecewise constant functions, constructed by dilation and translation. The "wavelet transform " maps each f(x) to its coefficients with respect to this basis. The mathematics is simple and t ..."
Abstract

Cited by 82 (2 self)
 Add to MetaCart
and the transform is fast (faster than the Fast Fourier Transform, which we briefly explain), but approximation by piecewise constants is poor. To improve this first wavelet, we are led to dilation equations and their unusual solutions. Higherorder wavelets are constructed, and it is surprisingly quick to compute
Small Footprint Agent Shell Code
"... mobile services personalised for tourism Project Number: Project Title: ..."
XJoin: A ReactivelyScheduled Pipelined Join Operator
 IEEE DATA ENGINEERING BULLETIN
, 2000
"... Widearea distribution raises significant performance problems for traditional query processing techniques as data access becomes less predictable due to link congestion, load imbalances, and temporary outages. Pipelined query execution is a promising approach to coping with unpredictability in such ..."
Abstract

Cited by 138 (8 self)
 Add to MetaCart
in such environments as it allows scheduling to adjust to the arrival properties of the data. We have developed a nonblocking join operator, called XJoin, which has a small memory footprint, allowing many such operators to be active in parallel. XJoin is optimized to produce initial results quickly and can hide
Nonuniform fast Fourier transform
 Geophysics
, 1999
"... The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to as the nonuniform fast Fourier transform (NFFT). In L dimensions, the NFFT requires O(N(ln #) L + ( Q L #=1 M # ) P L #=1 log M # ) operations, where M # is the number of Fourier components ..."
Abstract

Cited by 52 (2 self)
 Add to MetaCart
The nonuniform discrete Fourier transform (NDFT) can be computed with a fast algorithm, referred to as the nonuniform fast Fourier transform (NFFT). In L dimensions, the NFFT requires O(N(ln #) L + ( Q L #=1 M # ) P L #=1 log M # ) operations, where M # is the number of Fourier components
FOURIER SERIES WITH SMALL GAPS
"... Abstract. Let f be a 2piperiodic function in L1[−pi, pi] and k=−∞ f̂(nk)einkx be its lacunary Fourier series with small gaps. We have estimated Fourier coefficients of f if it is of ϕ BV locally. We have also obtained a precise interconnection between the lacunarity in such series and the localness ..."
Abstract
 Add to MetaCart
Abstract. Let f be a 2piperiodic function in L1[−pi, pi] and k=−∞ f̂(nk)einkx be its lacunary Fourier series with small gaps. We have estimated Fourier coefficients of f if it is of ϕ BV locally. We have also obtained a precise interconnection between the lacunarity in such series
Results 1  10
of
3,200