Sciweavers

100 search results - page 19 / 20
» Best Basis Compressed Sensing
Sort
View
CVPR
2005
IEEE
14 years 8 months ago
Rank-R Approximation of Tensors: Using Image-as-Matrix Representation
We present a novel multilinear algebra based approach for reduced dimensionality representation of image ensembles. We treat an image as a matrix, instead of a vector as in tradit...
Hongcheng Wang, Narendra Ahuja
ICASSP
2008
IEEE
14 years 13 days ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
CN
2004
256views more  CN 2004»
13 years 5 months ago
A line in the sand: a wireless sensor network for target detection, classification, and tracking
Intrusion detection is a surveillance problem of practical import that is well suited to wireless sensor networks. In this paper, we study the application of sensor networks to the...
Anish Arora, Prabal Dutta, Sandip Bapat, Vinod Kul...
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
13 years 11 months ago
Inherent Fault Tolerance in Evolved Sorting Networks
This poster paper summarizes our research on fault tolerance arising as a by-product of the evolutionary computation process. Past research has shown evidence of robustness emergin...
Rob Shepherd, James A. Foster
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 6 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...