Sciweavers

83 search results - page 4 / 17
» Lossless Data Compression Using Optimal Tree Machines
Sort
View
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
13 years 8 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
SAC
2002
ACM
13 years 7 months ago
The P-tree algebra
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
Qin Ding, Maleq Khan, Amalendu Roy, William Perriz...
ENC
2003
IEEE
14 years 23 days ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
TMI
2010
251views more  TMI 2010»
13 years 2 months ago
3-D Scalable Medical Image Compression With Optimized Volume of Interest Coding
We present a novel 3-D scalable compression method for medical images with optimized volume of interest (VOI) coding. The method is presented within the framework of interactive te...
Victor Sanchez, Rafeef Abugharbieh, Panos Nasiopou...
ICIP
2003
IEEE
14 years 9 months ago
Highly scalable video compression with scalable motion coding
A scalable video coder cannot be equally efficient over a wide range of bit-rates unless both the video data and the motion information are scalable. We propose a wavelet-based, h...
Andrew Secker, David Taubman