Sciweavers

DCC
2004
IEEE
14 years 11 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
DCC
2004
IEEE
14 years 11 months ago
Rate-Distortion Optimized Slicing, Packetization and Coding for Error Resilient Video Transmission
This paper presents an algorithm to optimize the tradeoff between rate and expected end-to-end distortion of a video sequence transmitted over a packet network. The approach optim...
Enrico Masala, Hua Yang, Kenneth Rose, Juan Carlos...
DCC
2004
IEEE
14 years 11 months ago
Source Coding With Distortion Side Information At The Encoder
Abstract: We consider lossy source coding when side information affecting the distortion measure may be available at the encoder, decoder, both, or neither. For example, such disto...
Emin Martinian, Gregory W. Wornell, Ram Zamir
DCC
2004
IEEE
14 years 11 months ago
Reduced Complexity Wavelet-Based Predictive Coding of Hyperspectral Images for FPGA Implementation
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
Agnieszka C. Miguel, Amanda R. Askew, Alexander Ch...
DCC
2004
IEEE
14 years 11 months ago
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes
The recently proposed turbo-binning scheme is shown to be both efficient and optimal for uniform source Slepian-Wolf coding problem [1]. This paper studies the case when sources a...
Jing (Tiffany) Li, Zhenyu Tu, Rick S. Blum
DCC
2004
IEEE
14 years 11 months ago
Semi-Lossless Text Compression
A new notion, that of semi-lossless text compression, is introduced, and its applicability in various settings is investigated. First results suggest that it might be hard to explo...
Yair Kaufman, Shmuel T. Klein
DCC
2004
IEEE
14 years 11 months ago
On the Entropy of a Hidden Markov Process
We study the entropy rate of a hidden Markov process (HMP) defined by observing the output of a binary symmetric channel whose input is a first-order binary Markov process. Despit...
Philippe Jacquet, Gadiel Seroussi, Wojciech Szpank...