Sciweavers

35 search results - page 2 / 7
» Fast normal vector compression with bounded error
Sort
View
CAGD
2005
88views more  CAGD 2005»
13 years 4 months ago
An efficient bit allocation for compressing normal meshes with an error-driven quantization
We propose a new wavelet compression algorithm based on the rate-distortion optimization for densely sampled triangular meshes. Exploiting the normal remesher of Guskov et al., th...
Frédéric Payan, Marc Antonini
VISUALIZATION
2000
IEEE
13 years 9 months ago
Topology preserving compression of 2D vector fields
We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different...
Suresh K. Lodha, Jose C. Renteria, Krishna M. Rosk...
CORR
2011
Springer
203views Education» more  CORR 2011»
12 years 11 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,...
TSP
2010
12 years 11 months ago
Compressed sensing performance bounds under Poisson noise
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
Maxim Raginsky, Rebecca Willett, Zachary T. Harman...
DCC
2007
IEEE
14 years 4 months ago
Bayesian Detection in Bounded Height Tree Networks
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards th...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win