Sciweavers

23 search results - page 1 / 5
» Point set compression through BSP quantization
Sort
View
SIBGRAPI
2006
IEEE
13 years 9 months ago
Point set compression through BSP quantization
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
Alex Laier Bordignon, Thomas Lewiner, Hélio...
MST
2000
101views more  MST 2000»
13 years 3 months ago
Robust Parallel Computations through Randomization
In this paper we present an efficient general simulation strategy for computations designed for fully operational BSP machines of n ideal processors, on n-processor dynamic-fault-p...
Spyros C. Kontogiannis, Grammati E. Pantziou, Paul...
DCC
2008
IEEE
14 years 3 months ago
Dimension Reduction and Expansion: Distributed Source Coding in a Noisy Environment
We studied the problem of distributed coding and transmission of intercorrelated sources with memory. Different from the conventional distributed source coding structure which rel...
Anna N. Kim, Fredrik Hekland
GLOBECOM
2009
IEEE
13 years 10 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
3DOR
2008
13 years 6 months ago
3D Object Retrieval using an Efficient and Compact Hybrid Shape Descriptor
We present a novel 3D object retrieval method that relies upon a hybrid descriptor which is composed of 2D features based on depth buffers and 3D features based on spherical harmo...
Panagiotis Papadakis, Ioannis Pratikakis, Theohari...