GPU Prefilter for Accurate Cubic B-spline Interpolation
Publications associées (105)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
This work presents an improved coefficient decoding method for Matching Pursuit streams. It builds on the adaptive a posteriori quantization of coefficients, and implements an interpolation scheme that enhances the inverse quantization performance at the d ...
ICIP'05 Best Student Paper Award We investigate the use of quasi-interpolating approximation schemes, to construct an estimate of an unknown function from its given discrete samples. We show theoretically and with practical experiments that such methods pe ...
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diffie-Hellman, and RSA. As an application, we propose a generic undeniable sign ...
Digital analysis and processing of signals inherently relies on the existence of methods for reconstructing a continuous-time signal from a sequence of corrupted discrete-time samples. In this paper, a general formulation of this problem is developed that ...
The E* algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation, it results in more appropriate paths during gradient descent. The underlying formulation is based on interpreting navigation functions a ...
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the “natural” spline basis function as generator for a shift-invariant function space; i.e., the tensor-product B-spli ...
The E-star algorithm is a path planning method capable of dynamic replanning and user-configurable path cost interpolation. It calculates a navigation function as a sampling of an underlying smooth goal distance that takes into account a continuous notion ...
We are proposing an interpolation technique for head related transfer functions (HRTFs). For deriving the algorithm we study the dual problem where sound is emitted from the listener’s ear and the generated sound field is recorded along a circular array of ...
We present a simple, original method to improve piecewise-linear interpolation with uniform knots: we shift the sampling knots by a fixed amount, while enforcing the interpolation property. We determine the theoretical optimal shift that maximizes the qual ...
In this paper, we present an algorithm for the detection of local illumination changes due to shadows in real world sequences. The algorithm is designed to be able to work when camera, illumination and scene’s characteristics are unknown. This feature is h ...