Sciweavers

534 search results - page 21 / 107
» Data Separation by Sparse Representations
Sort
View
ESANN
2001
13 years 11 months ago
Constructive density estimation network based on several different separable transfer functions
Networks estimating probability density are usually based on radial basis function of the same type. Feature Space Mapping constructive network based on separable functions, optimi...
Wlodzislaw Duch, Rafal Adamczak, Geerd H. F. Dierc...
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
14 years 4 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
ICCV
2007
IEEE
15 years 6 hour ago
Fast Pixel/Part Selection with Sparse Eigenvectors
We extend the "Sparse LDA" algorithm of [7] with new sparsity bounds on 2-class separability and efficient partitioned matrix inverse techniques leading to 1000-fold spe...
Bernard Moghaddam, Yair Weiss, Shai Avidan
ISBI
2011
IEEE
13 years 1 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...
TKDE
2010
251views more  TKDE 2010»
13 years 4 months ago
Exploring Correlated Subspaces for Efficient Query Processing in Sparse Databases
The sparse data is becoming increasingly common and available in many real-life applications. However, relative little attention has been paid to effectively model the sparse data ...
Bin Cui, Jiakui Zhao, Dongqing Yang