Sciweavers

143 search results - page 16 / 29
» Fast Reconstruction Method for Diffraction Imaging
Sort
View
ICMCS
2006
IEEE
103views Multimedia» more  ICMCS 2006»
15 years 4 months ago
Multiplierless Approximation of Fast DCT Algorithms
This paper proposes an effective method for converting any fast DCT algorithm into an approximate multiplierless version. Basically it approximates any constant in the original tr...
Raymond Chan, Moon-chuen Lee
CORR
2010
Springer
253views Education» more  CORR 2010»
14 years 10 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
ICPR
2010
IEEE
14 years 10 months ago
Fast Odometry Integration in Local Bundle Adjustment-Based Visual SLAM
The Simultaneous Localisation And Mapping (SLAM) for a camera moving in a scene is a long term research problem. Here we improve a recent visual SLAM which applies Local Bundle Ad...
Alexandre Eudes, Maxime Lhuillier, Sylvie Naudet-C...
ICIAR
2004
Springer
15 years 3 months ago
A Fast Probabilistic Bidirectional Texture Function Model
The bidirectional texture function (BTF) describes rough texture appearance variations due to varying illumination and viewing conditions. Such a function consists of thousands of ...
Michal Haindl, Jirí Filip
ISBI
2004
IEEE
15 years 10 months ago
Reconstruction of 2D Pet Data with Monte Carlo Generated Natural Pixels
Abstract-In discrete detector PET, natural pixels are image basis functions calculated from responses of detector pairs. By using reconstruction with natural pixels the discretizat...
Charles L. Byrne, Stefaan Vandenberghe, Edward J. ...