Sciweavers

62 search results - page 4 / 13
» Complexity measures of sign matrices
Sort
View
CDC
2010
IEEE
164views Control Systems» more  CDC 2010»
14 years 4 months ago
A recursive system identification method based on binary measurements
Abstract-- An online approach to parameter estimation problems based on binary observations is presented in this paper. This recursive identification method relies on a least-mean ...
Kian Jafari, Jérôme Juillard, É...
CVIU
2004
134views more  CVIU 2004»
14 years 9 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera
SDM
2012
SIAM
245views Data Mining» more  SDM 2012»
12 years 11 months ago
Deterministic CUR for Improved Large-Scale Data Analysis: An Empirical Study
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
Christian Thurau, Kristian Kersting, Christian Bau...
ICASSP
2011
IEEE
14 years 1 months ago
Improved thresholds for rank minimization
—Nuclear norm minimization (NNM) has recently gained attention for its use in rank minimization problems. In this paper, we define weak, sectional and strong recovery for NNM to...
Samet Oymak, M. Amin Khajehnejad, Babak Hassibi
CORR
2011
Springer
203views Education» more  CORR 2011»
14 years 4 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,...