Topic
Codebook
About: Codebook is a research topic. Over the lifetime, 8492 publications have been published within this topic receiving 115995 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: Wang et al. as discussed by the authors proposed spatiotemporal completed local quantization patterns (STCLQP) for facial micro-expression analysis. But, their method only considers appearance and motion features from the sign-based difference between two pixels but not yet considers other useful information.
201 citations
01 Jul 1993
TL;DR: Two combined unequal error protection (UEP) coding and modulation schemes are proposed, based on partitioning a signal constellation into disjoint subsets in which the most important data sequence is encoded, using most of the available redundancy, to specify a sequence of subsets.
Abstract: Two combined unequal error protection (UEP) coding and modulation schemes are proposed. The first method multiplexes different coded signal constellations, with each coded constellation providing a different level of error protection. In this method, a codeword specifies the multiplexing rule and the choice of the codeword from a fixed codebook is used to convey additional important information. The decoder determines the multiplexing rule before decoding the rest of the data. The second method is based on partitioning a signal constellation into disjoint subsets in which the most important data sequence is encoded, using most of the available redundancy, to specify a sequence of subsets. The partitioning and code construction is done to maximize the minimum Euclidean distance between two different valid subset sequences. This leads to ways of partitioning the signal constellations into subsets. The less important data selects a sequence of signal points to be transmitted from the subsets. A side benefit of the proposed set partitioning procedure is a reduction in the number of nearest neighbors, sometimes even over the uncoded signal constellation. >
200 citations
01 Apr 1987
TL;DR: The paper describes a related scheme, which allows real time implementation on current DSP chips, and the very efficient search procedure in the codebook is achieved by means of a new technique called "backward filtering" and the use of algebraic codes.
Abstract: Code-Excited Linear Prediction (CELP) produces high quality synthetic speech at low bit rate. However the basic scheme leads to huge computational loads. The paper describes a related scheme, which allows real time implementation on current DSP chips. The very efficient search procedure in the codebook is achieved by means of a new technique called "backward filtering" and the use of algebraic codes. RSB performances are reported for a variety of conditions.
196 citations
TL;DR: A new method for compressing inverted indexes is introduced that yields excellent compression, fast decoding, and exploits clustering—the tendency for words to appear relatively frequently in some parts of the collection and infrequently in others.
Abstract: Information retrieval systems contain large volumes of text, and currently have typical sizes into the gigabyte range. Inverted indexes are one important method for providing search facilities into these collections, but unless compressed require a great deal of space. In this paper we introduce a new method for compressing inverted indexes that yields excellent compression, fast decoding, and exploits clustering—the tendency for words to appear relatively frequently in some parts of the collection and infrequently in others. We also describe two other quite separate applications for the same compression method: representing the MTF list positions generated by the Burrows-Wheeler Block Sorting transformations and transmitting the codebook for semi-static block-based minimum-redundancy coding.
193 citations
TL;DR: A new fast search algorithm for vector quantization using the mean of image vectors is proposed, showing that the number of calculations can be reduced to as low as a fourth the number achievable by an algorithm known as the partial distance method.
Abstract: A new fast search algorithm for vector quantization using the mean of image vectors is proposed. The codevectors are sorted according to their component means, and the search for the codevector having the minimum Euclidean-distance to a given input vector starts with the one having the minimum mean-distance to it, making use of our observation that the two codevectors are close to each other in most real images. The search is then made to terminate as soon as a simple yet novel test reports that any remaining vector in the codebook should have a larger Euclidean distance. Simulations show that the number of calculations can be reduced to as low as a fourth the number achievable by an algorithm known as the partial distance method. >
190 citations