Sciweavers

2512 search results - page 5 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
99
Voted
ECCV
2010
Springer
15 years 1 days ago
Optimum Subspace Learning and Error Correction for Tensors
Confronted with the high-dimensional tensor-like visual data, we derive a method for the decomposition of an observed tensor into a low-dimensional structure plus unbounded but spa...
95
Voted
CVPR
2010
IEEE
15 years 1 days ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...
FGR
2004
IEEE
133views Biometrics» more  FGR 2004»
15 years 1 months ago
Finding Temporal Patterns by Data Decomposition
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...
David C. Minnen, Christopher Richard Wren
CVPR
2011
IEEE
14 years 5 months ago
Sparse Image Representation with Epitomes
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictiona...
Louise Benoit, Julien Mairal, Francis Bach, Jean P...
PRICAI
2000
Springer
15 years 1 months ago
Generating Hierarchical Structure in Reinforcement Learning from State Variables
This paper presents the CQ algorithm which decomposes and solves a Markov Decision Process (MDP) by automatically generating a hierarchy of smaller MDPs using state variables. The ...
Bernhard Hengst