Sciweavers

1313 search results - page 120 / 263
» Data Discretization Unification
Sort
View
TIP
1998
103views more  TIP 1998»
13 years 10 months ago
Orientation diffusions
Abstract—Diffusions are useful for image processing and computer vision because they provide a convenient way of smoothing noisy data, analyzing images at multiple scales, and en...
Pietro Perona
FS
2010
140views more  FS 2010»
13 years 8 months ago
Nonparametric estimation for a stochastic volatility model
Abstract Consider discrete time observations (X δ)1≤ ≤n+1 of the process X satisfying dXt = √ VtdBt, with Vt a one-dimensional positive diffusion process independent of the...
F. Comte, V. Genon-Catalot, Yves Rozenholc
ICIP
2010
IEEE
13 years 7 months ago
Spiral FFT: An efficient method for 3-D FFTS on spiral MRI contours
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...
Christopher K. Turnes, Justin K. Romberg
ICCV
2011
IEEE
12 years 10 months ago
Decision Tree Fields
This paper introduces a new formulation for discrete image labeling tasks, the Decision Tree Field (DTF), that combines and generalizes random forests and conditional random fiel...
Sebastian Nowozin, Carsten Rother, Shai Bagon, Ban...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
14 years 3 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler