Sciweavers

132 search results - page 20 / 27
» Sparse Boolean Matrix Factorizations
Sort
View
CVPR
2010
IEEE
14 years 10 months ago
Sparse representation using nonnegative curds and whey
It has been of great interest to find sparse and/or nonnegative representations in computer vision literature. In this paper we propose a novel method to such a purpose and refer...
Yanan Liu, Fei Wu, Zhihua Zhang, Yueting Zhuang, S...
SIGIR
2008
ACM
14 years 9 months ago
Posterior probabilistic clustering using NMF
We introduce the posterior probabilistic clustering (PPC), which provides a rigorous posterior probability interpretation for Nonnegative Matrix Factorization (NMF) and removes th...
Chris H. Q. Ding, Tao Li, Dijun Luo, Wei Peng
ICASSP
2011
IEEE
14 years 1 months ago
Sparse non-negative decomposition of speech power spectra for formant tracking
Many works on speech processing have dealt with auto-regressive (AR) models for spectral envelope and formant frequency estimation, mostly focusing on the estimation of the AR par...
Jean-Louis Durrieu, Jean-Philippe Thiran
FOCS
2008
IEEE
15 years 4 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
IJCAI
2007
14 years 11 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert