Sciweavers

423 search results - page 21 / 85
» Beta Random Projection
Sort
View
MEDIAFORENSICS
2010
15 years 3 months ago
Fast identification of highly distorted images
In this paper, we consider a low complexity identification system for highly distorted images. The performance of the proposed identification system is analyzed based on the avera...
Taras Holotyak, Sviatoslav Voloshynovskiy, Fokko B...
CORR
2008
Springer
78views Education» more  CORR 2008»
15 years 2 months ago
Spread Codes and Spread Decoding in Network Coding
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The ...
Felice Manganiello, Elisa Gorla, Joachim Rosenthal
TOG
2008
103views more  TOG 2008»
15 years 1 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
ICASSP
2008
IEEE
15 years 8 months ago
A compressive beamforming method
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...
Ali Cafer Gurbuz, James H. McClellan, Volkan Cevhe...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 2 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