Sciweavers

3116 search results - page 257 / 624
» Recovering
Sort
View
JAT
2006
64views more  JAT 2006»
15 years 4 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger
ECCC
2007
96views more  ECCC 2007»
15 years 4 months ago
Linear programming bounds for codes via a covering argument
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
Michael Navon, Alex Samorodnitsky
JMIV
2006
133views more  JMIV 2006»
15 years 4 months ago
Combining Seminorms in Adaptive Lifting Schemes and Applications to Image Analysis and Compression
In this paper, we present some adaptive wavelet decompositions that can capture the directional nature of images. Our method exploits the properties of seminorms to build lifting s...
Gemma Piella, Béatrice Pesquet-Popescu, Hen...
JVCA
2006
110views more  JVCA 2006»
15 years 4 months ago
As-consistent-As-possible compositing of virtual objects and video sequences
We present an efficient approach that merges the virtual objects into video sequences taken by a freely moving camera in a realistic manner. The composition is visually and geomet...
Guofeng Zhang, Xueying Qin, Xiaobo An, Wei Chen, H...
PAMI
2008
243views more  PAMI 2008»
15 years 4 months ago
Shape from Defocus via Diffusion
Defocus can be modeled as a diffusion process and represented mathematically using the heat equation, where image blur corresponds to the diffusion of heat. This analogy can be ext...
Paolo Favaro, Stefano Soatto, Martin Burger, Stanl...