By Topic

Date 29-31 March 2011

Filter Results

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

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

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

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

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

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

    Publication Year: 2011, Page(s): vi
    Request permission for commercial reuse | PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • Reviewers

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

    Publication Year: 2011, Page(s):ix - xvi
    Request permission for commercial reuse | PDF file iconPDF (145 KB)
    Freely Available from IEEE
  • On Asymptotically Optimal Stationary Source Codes for IID Sources

    Publication Year: 2011, Page(s):3 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB) | HTML iconHTML

    A vector extension of a necessary condition for asymptotically optimal stationary (sliding-block) source codes is presented. The condition implies the intuitive result that the reproduction process for an IID input must be approximately uncorrelated if the code is approximately optimal, a property previously demonstrated empirically for common examples. One-bit coding of a Gaussian IID process is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Advances in Optimal Structured Source Code Design

    Publication Year: 2011, Page(s):13 - 22
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (195 KB) | HTML iconHTML

    A memoryless equiprobable source with four-letter alphabet is to be trellis encoded at an encoding rate of one code bit per source sample with respect to the Hamming fidelity criterion. Each possible trellis code for this encoding task is characterized by a binary generating matrix of fixed dimensions via which reproduction labels from the source alphabet are linearly assigned to the trellis edges... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Matching Dyadic Distributions to Channels

    Publication Year: 2011, Page(s):23 - 32
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (382 KB) | HTML iconHTML

    Many communication channels with discrete input have non-uniform capacity achieving probability mass functions (PMF). By parsing a stream of independent and equiprobable bits according to a full prefix-free code, a modulator can generate dyadic PMFs at the channel input. In this work, we show that for discrete memoryless channels and for memoryless discrete noiseless channels, searching for good d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quasi-cyclic Minimum Storage Regenerating Codes for Distributed Data Compression

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

    Nowadays, it is possible to optimize the storage size of large files in distributed environments, maintaining the same availability level in the system. Although replication (backups) is the most used option, it is possible to make use of erasure coding in order to significantly compress the storage size [1]. However, using erasure coding, more information needs to be transmitted than when using r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding of Sets of Words

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

    We study the problem of coding of unordered sets of words, appearing in natural language processing, retrieval, machine learning, computer vision, and other fields. We note that this problem is different from the problem of coding of a particular sequence of same words, and show that up to log(m!) bits (where m is the number of words in the set) can be saved by specialized codes for sets. We propo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Dispersion of Lossy Source Coding

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

    In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding rate above the rate-distortion function is inversely proportional (to the first order) to the square root of the block length. We give an explicit expression f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust Learning of 2-D Separable Transforms for Next-Generation Video Coding

    Publication Year: 2011, Page(s):63 - 72
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB) | HTML iconHTML

    With the simplicity of its application together with compression efficiency, the Discrete Cosine Transform(DCT) plays a vital role in the development of video compression standards. For next-generation video coding, a new set of 2-D separable transforms has emerged as a candidate to replace the DCT. These separable transforms are learned from residuals of each intra prediction mode, hence termed a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lifting Transforms on Graphs for Video Coding

    Publication Year: 2011, Page(s):73 - 82
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    We present a new graph-based transform for video signals using wavelet lifting. Graphs are created to capture spatial and temporal correlations in video sequences. Our new transforms allow spatial and temporal correlation to be jointly exploited, in contrast to existing techniques, such as motion compensated temporal filtering, which can be seen as "separable" transforms, since spatial and tempora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lie Group Transformation Models for Predictive Video Coding

    Publication Year: 2011, Page(s):83 - 92
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB) | HTML iconHTML

    We propose a new method for modeling the temporal correlation in videos, based on local transforms realized by Lie group operators. A large class of transforms can be theoretically described by these operators, however, we propose to learn from natural movies a subset of transforms that are statistically relevant for video representation. The proposed transformation modeling is further exploited t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative Thresholding-Based Sparse Directional Representation for Efficient Low Bit-Rate Embedded Video Coding

    Publication Year: 2011, Page(s):93 - 102
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1134 KB) | HTML iconHTML

    The contourlet transform provides a flexible directional image decomposition by employing Laplacian pyramid and uniform directional filter banks. Although it is able to efficiently capture the 2-D piecewise smooth functions with line or curve discontinuities, its major drawbacks of 4/3 redundancy and non-ideal filter banks in Laplacian pyramid are the main obstacles for high performance image/vide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Scalar/Vector Quantization of Mel-Frequency Cepstral Coefficients for Low Bit-Rate Coding of Speech

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

    In this paper, we propose a low bit-rate speech codec based on a hybrid scalar/vector quantization of the mel-frequency cepstral coefficients (MFCCs). We begin by showing that if a high-resolution mel-frequency cepstrum (MFC) is computed, good-quality speech reconstruction is possible from the MFCCs despite the lack of explicit phase information. By evaluating the contribution toward speech qualit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressed Dictionary Matching with One Error

    Publication Year: 2011, Page(s):113 - 122
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (231 KB) | HTML iconHTML

    Given a set D of d patterns of total length n, the dictionary matching problem is to index D such that for any query text T, we can locate the occurrences of any pattern within T efficiently. This problem can be solved in optimal O(|T|+occ) time by the classical AC automaton (Aho and Corasick, 1975) where occ denotes the number of occurrences. The space requirement is O(n) words. In the {approxima... View full abstract»

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

    Publication Year: 2011, Page(s):123 - 132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (223 KB) | HTML iconHTML

    Property matching is a biologically motivated problem where the task is to find those occurrences of an online pattern P in a string text T (of size n), such that the matched part in T satisfies some conceptual property. The property of a string is a set π of (possibly overlapping) intervals {(s1, f1), (s2, f2),⋯} corresponding to the part ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressed Index for Property Matching

    Publication Year: 2011, Page(s):133 - 142
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (155 KB) | HTML iconHTML

    In this paper, we revisit the Property Matching problem and present a better indexing scheme for the problem. Let T be a text of length n with property p, and P be a pattern of length m, both strings are over a fixed finite alphabet. In particular, the existing data structures all require O(n log n)-bit space, where n is the length of the text. By using compressed suffix array and other supporting... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The String-to-Dictionary Matching Problem

    Publication Year: 2011, Page(s):143 - 152
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB) | HTML iconHTML

    The String-to-Dictionary Matching Problem is defined, in which a string is searched for in all the possible concatenations of the elements of a given dictionary, with applications to compressed matching in variable to fixed length encodings, such as Tunstall's. An algorithm based on suffix trees is suggested and experiments on natural language text are presented suggesting that compressed search m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Compression by 2D Motif Basis

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

    Approaches to image compression and indexing based on extensions to 2D of some of the Lempel-Ziv incremental parsing techniques have been proposed in the recent past. In these approaches, an image is decomposed into a number of patches, consisting each of a square or rectangular solid block. This paper proposes image compression techniques based on patches that are not necessarily solid blocks, bu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-Distortion Optimized Adaptive Scanning Order for Bitplane Image Coding Engines

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

    This paper introduces an adaptive scanning order for bitplane image coding engines, which is devised from a rate-distortion optimization perspective that uses recent advances in coefficient modeling and distortion estimation. The main idea is to always select the next coefficient to be coded so that image distortion and code stream length are minimized. The sequence of visited coefficients is adap... View full abstract»

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