The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Summary form only given. Recently, parallel processing technologies have been applied to a variety of applications to boost its performance. We implemented a parallel algorithm with "double strip-mining" method of optimal codeword search for VQ compression on a shared-memory parallel environment and evaluated the effectiveness of the parallel algorithm. Namely, by applying strip-mining method...
Wyner-Ziv coding is presented in this paper. It is extended to the scenario of multivariate source and side information, whose rate-distortion function is obtained by a reverse water-filling method for the joint quadratic-Gaussian case.
A statistical physics analysis for the variational problem encountered in rate distortion (RD) theory and the information bottleneck (IB) method, derived within the generalized nonextensive statistics framework of Tsallis, is presented. The governing equations of the alternate minimization algorithm for the generalized Bergman RD (GBRD) model are described.
Gaussian sources are observed in vast wide areas. Contrarily to what happens for the geometric and double-sided geometric distributions, there is no simple, instantaneous code for the normal distribution.
The goal of the prefix coding is to assign codewords to elements of the input alphabet A, so that no codeword is a prefix of another one, and the total length of the encoded message S is minimized. In the case of static prefix coding, symbol frequencies are known in advance. In the case of adaptive (or dynamic) prefix coding, every symbol Si is encoded before the next symbol Si+1 is read.
In this paper, a content-based error resilient RDO mode decision scheme is proposed for Internet videophone applications. The experimental results based on typical head-and-shoulder video sequences under common Internet channel condition show that, comparing with conventional error resilient RDO mode decision schemes, the proposed mode decision scheme improves the average luminance PSNR of visually...
Summary form only given. We propose a fast and efficient lossless codec of continuous-tone images, SPEDIC (simple predictor and edge detector based image codec), which is uniquely suitable for coding screen updates generated by multimedia applications in thin client computing systems. A codec for thin client computing should take account of the tradeoff between compression ratio and coding complexity,...
This paper proposes an enhanced RVLC coder, context-adaptive reversible variable length coder (CRVLC), for DCT coefficients by using the techniques of data sub-partitioning and context modeling. The data sub-partitioning means that the data part of DCT coefficients is split into several small sub-partitions. As each sub-partition can be reversibly decoded by RVLC, more data as well as higher error...
We study the asymptotic detection performance of large sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards the root of the tree. We show that the error probability decays exponentially fast, and we provide bounds for the error exponent. We analyze further the case where the tree has certain symmetry properties, and derive simple,...
This paper proposes a low-complexity wavelet-based method for progressive lossy-to-lossless compression of four dimensional (4-D) medical images. The subband block hierarchal partitioning (SBHP) algorithm is modified and extended to four dimensions, and applied to every code block independently. The resultant algorithm, 4D-SBHP, efficiently encodes 4D image data by the exploitation of the dependencies...
Considering that quincunx lattice is a more efficient spatial sampling scheme than square lattice, we investigate a new approach of image coding for quincunx sample arrangement. The key findings are: 1) adaptive directional lifting is particularly suited to decorrelate samples on quincunx lattice, and 2) quincunx samples can be processed by a 2D piecewise autoregressive model to reproduce the image...
Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from the database. An efficient data synopsis must provide accurate information about the distribution of data to the query optimizer at any point in time. Due to the fact that some data will be queried more often than others,...
It has been recently shown that if a, signal can be compressed in some basis, then it can be reconstructed in such basis from, a certain number of random, projections. By allowing additional distortion, this holds even if the projections are corrupted by noise. We extend this result by showing that it is possible to exploit prior knowledge (e.g., if the signal is a realization of a stochastic process,)...
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software developers for program optimization, performance tuning, and debugging. Such traces are typically very large and need to be compressed to reduce the storage, processing, and communication bandwidth requirements. However, preexisting...
Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. This work is to compare the single file parsing methods used on input text files by means of Burrows-Wheeler Transform for different languages (English, Czech,...
The interferential spectrometer is considered as the next generation of imaging spectrometers in aerial remote sensing. The customary multispectral images compression methods only consider the quality of reconstructed images in spatial domain without concerning the effect in Fourier domain where the application of spectrum is often used, such as substance classification and recognition. Our method...
In this paper we address the connection between the multiple-description (MD) problem and delta-sigma quantization. Specifically, we exploit the inherent redundancy due to oversampling in delta-sigma quantization, and the simple linear-additive noise model resulting from dithered lattice quantization, in order to construct a symmetric MD coding scheme. We show that the use of feedback by means of...
We present the NML model for classes of models with memory described by first order dependencies. The model is used for efficiently locating and encoding the best regressor present in a dictionary. By combining the order-1 NML with the order-0 NML model the resulting algorithm achieves a consistent improvement over the earlier order-0 NML algorithm, and it is demonstrated to have superior performance...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.