Sciweavers

2295 search results - page 209 / 459
» Learning Overcomplete Representations
Sort
View
IJON
2008
116views more  IJON 2008»
15 years 6 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
ALGORITHMICA
2005
76views more  ALGORITHMICA 2005»
15 years 6 months ago
Characterizing History Independent Data Structures
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
Jason D. Hartline, Edwin S. Hong, Alexander E. Moh...
COGSCI
2004
97views more  COGSCI 2004»
15 years 6 months ago
A rhythm recognition computer program to advocate interactivist perception
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
Jean-Christophe Buisson
ISBI
2011
IEEE
14 years 10 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
CVPR
2012
IEEE
13 years 9 months ago
Pose pooling kernels for sub-category recognition
The ability to normalize pose based on super-category landmarks can significantly improve models of individual categories when training data are limited. Previous methods have co...
Ning Zhang, Ryan Farrell, Trevor Darrell