Sciweavers

441 search results - page 48 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
13 years 5 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
KDD
2001
ACM
187views Data Mining» more  KDD 2001»
15 years 10 months ago
Random projection in dimensionality reduction: applications to image and text data
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
Ella Bingham, Heikki Mannila
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
15 years 10 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
ECCV
2010
Springer
14 years 11 months ago
Semantic Segmentation of Urban Scenes Using Dense Depth Maps
In this paper we present a framework for semantic scene parsing and object recognition based on dense depth maps. Five viewindependent 3D features that vary with object class are e...
Chenxi Zhang, Liang Wang, Ruigang Yang
PSIVT
2009
Springer
176views Multimedia» more  PSIVT 2009»
15 years 2 months ago
Monocular 3D Reconstruction of Objects Based on Cylindrical Panoramas
This paper discusses ways of using a single panoramic image (captured by a rotating sensor-line camera having very-high spatial resolution) for the geometric shape recovery of a sh...
Ralf Haeusler, Reinhard Klette, Fay Huang