Sciweavers

5115 search results - page 143 / 1023
» On Randomized Lanczos Algorithms
Sort
View
NIPS
2008
15 years 7 months ago
Sparse Signal Recovery Using Markov Random Fields
Compressive Sensing (CS) combines sampling and compression into a single subNyquist linear measurement process for sparse and compressible signals. In this paper, we extend the th...
Volkan Cevher, Marco F. Duarte, Chinmay Hegde, Ric...
PAMI
2006
440views more  PAMI 2006»
15 years 6 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
ICASSP
2010
IEEE
15 years 4 months ago
Sectored Random Projections for Cancelable Iris Biometrics
Privacy and security are essential requirements in practical biometric systems. In order to prevent the theft of biometric patterns, it is desired to modify them through revocable...
Jaishanker K. Pillai, Vishal M. Patel, Rama Chella...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 4 months ago
Efficient Nonnegative Matrix Factorization with Random Projections
The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical...
Fei Wang, Ping Li
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
15 years 1 months ago
Nonholonomic source seeking in switching random fields
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
Shun-ichi Azuma, Mahmut Selman Sakar, George J. Pa...