Sciweavers

598 search results - page 31 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
AC
2003
Springer
14 years 1 months ago
Timed Automata: Semantics, Algorithms and Tools
This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We prese...
Johan Bengtsson, Wang Yi
CORR
2011
Springer
203views Education» more  CORR 2011»
13 years 3 months ago
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
Laurent Jacques, Jason N. Laska, Petros Boufounos,...
ICIP
2009
IEEE
13 years 6 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 8 months ago
Solving Inverse Problems with Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...
CGF
2004
114views more  CGF 2004»
13 years 8 months ago
Smooth Surface Reconstruction Using Tensor Fields as Structuring Elements
We propose a new strategy to estimate surface normal information from highly noisy sparse data. Our approach is based on a tensor field morphologically adapted to infer normals. I...
Marcelo Bernardes Vieira, Paulo P. Martins Jr., Ar...