Sciweavers

524 search results - page 81 / 105
» Context Trees
Sort
View
NIPS
1990
13 years 8 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
MLDM
2005
Springer
14 years 27 days ago
Supervised Evaluation of Dataset Partitions: Advantages and Practice
In the context of large databases, data preparation takes a greater importance : instances and explanatory attributes have to be carefully selected. In supervised learning, instanc...
Sylvain Ferrandiz, Marc Boullé
CVPR
2009
IEEE
2452views Computer Vision» more  CVPR 2009»
15 years 2 months ago
CHoG: Compressed Histogram of Gradients: A Low Bit-Rate Feature Descriptor
Establishing visual correspondences is an essential component of many computer vision problems, and is often done with robust, local feature-descriptors. Transmission and storag...
Vijay Chandrasekhar (Stanford University), Gabriel...
ICCV
1999
IEEE
14 years 9 months ago
Unsupervised Image Classification with a Hierarchical EM Algorithm
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes...
Annabelle Chardin, Patrick Pérez
ICIP
2007
IEEE
14 years 9 months ago
Rate-Distortion Optimal Depth Maps in the Wavelet Domain for Free-Viewpoint Rendering
We consider the problem of estimating and encoding depth maps from multiple views in the context of 3D-TV with free-viewpoint rendering. We propose a novel codec based on the Rate...
Matthieu Maitre, Yoshihisa Shinagawa, Minh N. Do