16-18 March 2009

Filter Results

Displaying Results 1 - 25 of 93
  • [Front cover]

    Publication Year: 2009, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (129 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2009, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2009, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (148 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (108 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2009, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • The Capocelli Prize

    Publication Year: 2009, Page(s): vi
    Request permission for commercial reuse | PDF file iconPDF (85 KB)
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2009, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2009, Page(s):ix - xvi
    Request permission for commercial reuse | PDF file iconPDF (128 KB)
    Freely Available from IEEE
  • On Minimum-Redundancy Fix-Free Codes

    Publication Year: 2009, Page(s):3 - 12
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (303 KB) | HTML iconHTML

    Fix-free codes are variable length codes in which no codeword is the prefix or suffix of another codeword. They are used in video compression standards because their property of efficient decoding in both the forward and backward directions assists with error resilience. This property also potentially halves the average search time for a string in a compressed file relative to unidirectional varia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-Memory Adaptive Prefix Coding

    Publication Year: 2009, Page(s):13 - 22
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    In this paper we study the adaptive prefix coding problem in cases where the size of the input alphabet is large. We present an online prefix coding algorithm that uses O(sigma1/lambda+epsiv) bits of space for any constants epsiv > 0, > 1, and encodes the string of symbols in O(loglog sigma) time per symbol in the worst case, where sigma is the size of the alphabet. The upper boun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High Performance Word-Codeword Mapping Algorithm on PPM

    Publication Year: 2009, Page(s):23 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    The word-codeword mapping technique allows words to be managed in PPM modelling when a natural language text file is being compressed. The main idea for managing words is to assign them codes in order to improve the compression. The previous work was focused on proposing several mapping adaptive algorithms and evaluating them. In this paper, we propose a semi-static word-codeword mapping method th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guaranteed Synchronization of Huffman Codes with Known Position of Decoder

    Publication Year: 2009, Page(s):33 - 42
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    In Huffman-encoded data a bit error may propagate arbitrarily long. This paper introduces a method for limiting such error propagation to at most L bits, L being a parameter. It is required that the decoder knows the bit number currently being decoded. The method utilizes the inherent tendency of Huffman codes to resynchronize spontaneously and does not introduce any redundancy if such a resynchro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • pFPC: A Parallel Compressor for Floating-Point Data

    Publication Year: 2009, Page(s):43 - 52
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    This paper describes and evaluates pFPC, a parallel implementation of the lossless FPC compression algorithm for 64-bit floating-point data. pFPC can trade off compression ratio for throughput. For example, on a 4-core 3 GHz Xeon system, it compresses our nine datasets by 18% at a throughput of 1.36 gigabytes per second and by 41% at a throughput of 570 megabytes per second. Decompression is even ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of K-Channel Multiple Description Quantization

    Publication Year: 2009, Page(s):53 - 62
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    This paper studies the tight rate-distortion bound for K-channel symmetric multiple-description coding for a memory less Gaussian source. We find that the product of a function of the individual side distortions (for single received descriptions) and the central distortion (for K received descriptions) is asymptotically independent of the redundancy among the descriptions. Using this property, we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi Level Multiple Descriptions

    Publication Year: 2009, Page(s):63 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (194 KB) | HTML iconHTML

    Multiple description (MD) source coding is a method to overcome unexpected information loss in a diversity system such as the Internet, or a wireless network. While classic MD coding handles the situation where the rate in some channels drops to zero temporarily, thus causing unexpected packet-loss, it fails to accommodate more subtle changes in link rate such as rate reduction. In such a case, a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of Correlated Source Coding for Event-Based Monitoring in Sensor Networks

    Publication Year: 2009, Page(s):73 - 82
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (253 KB) | HTML iconHTML

    Motivated by the paradigm of event-based monitoring, which can potentially alleviate the inherent bandwidth and energy constraints associated with wireless sensor networks, we consider the problem of joint coding of correlated sources under a cost criterion that is appropriately conditioned on event occurrences. The underlying premise is that individual sensors only have access to partial informat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Posterior Matching Feedback Scheme for Joint Source-Channel Coding with Bandwidth Expansion

    Publication Year: 2009, Page(s):83 - 92
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (207 KB) | HTML iconHTML

    When transmitting a Gaussian source over an AWGN channel with an input power constraint and a quadratic distortion measure, it is well known that optimal performance can be obtained using an analog joint source-channel scalar scheme which merely scales the input and output signals. In the case of bandwidth expansion, such a joint source-channel analog scheme attaining optimal performance is no lon... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Source-Channel Coding at the Application Layer

    Publication Year: 2009, Page(s):93 - 102
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1365 KB) | HTML iconHTML

    The multicasting of an independent and identically distributed Gaussian source over a binary erasure broadcast channel is considered. This model applies to a one-to-many transmission scenario in which some mechanism at the physical layer delivers information packets with losses represented by erasures, and users are subject to different erasure probabilities. The reconstruction signal-to-noise rat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analog Joint Source Channel Coding Using Space-Filling Curves and MMSE Decoding

    Publication Year: 2009, Page(s):103 - 112
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB) | HTML iconHTML

    We investigate the performance of a discrete-time all-analog-processing joint source channel coding system for the transmission of i.i.d. Gaussian and Laplacian sources over AWGN channels. In the encoder, two samples of an i.i.d. source are mapped into a channel symbol using a space-filling curve. Different from previous work in the literature, MMSE decoding instead of ML decoding is considered, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis on Rate-Distortion Performance of Compressive Sensing for Binary Sparse Source

    Publication Year: 2009, Page(s):113 - 122
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    This paper proposes to use a bipartite graph to represent compressive sensing (CS). The evolution of nodes and edges in the bipartite graph, which is equivalent to the decoding process of compressive sensing, is characterized by a set of differential equations. One of main contributions in this paper is that we derive the close-form formulation of the evolution in statistics, which enable us to mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-Guided Adaptive Recovery of Compressive Sensing

    Publication Year: 2009, Page(s):123 - 132
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (957 KB) | HTML iconHTML

    For the new signal acquisition methodology of compressive sensing (CS) a challenge is to find a space in which the signal is sparse and hence recoverable faithfully. Given the nonstationarity of many natural signals such as images, the sparse space is varying in time or spatial domain. As such, CS recovery should be conducted in locally adaptive, signal-dependent spaces to counter the fact that th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • l1 Compression of Image Sequences Using the Structural Similarity Index Measure

    Publication Year: 2009, Page(s):133 - 142
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB) | HTML iconHTML

    We consider lossy compression of image sequences using lscr1 compression with over complete dictionaries. As a fidelity measure for the reconstruction quality, we incorporate the proposed structural similarity index measure, and we show that this leads to problem formulations that are very similar to conventional lscr1 compression algorithms. In addition, we develop efficient... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree Histogram Coding for Mobile Image Matching

    Publication Year: 2009, Page(s):143 - 152
    Cited by:  Papers (50)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (346 KB) | HTML iconHTML

    For mobile image matching applications, a mobile device captures a query image, extracts descriptive features, and transmits these features wirelessly to a server. The server recognizes the query image by comparing the extracted features to its database and returns information associated with the recognition result. For slow links, query feature compression is crucial for low-latency retrieval. Pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressed Kernel Perceptrons

    Publication Year: 2009, Page(s):153 - 162
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (259 KB) | HTML iconHTML

    Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among the most popular online kernel machines that are known to achieve high-quality classification despite their simplicity. They are represented by a set of B prototype examples, called support vectors, and their associated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overlapped Tiling for Fast Random Oblique Plane Access of 3D Object Datasets

    Publication Year: 2009, Page(s):163 - 172
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    Volume visualization with random data access poses significant challenges. While tiling techniques lead to simple implementations, they are not well suited for cases where the goal is to access arbitrarily located subdimensional datasets (e.g., being able to display an arbitrary 2D planar ldquocutrdquo from a 3D volume). Significant effort has been devoted to volumetric data compression, with most... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.