Search results for "Data Compression"
showing 10 items of 99 documents
Efficient image compression using directionlets
2007
Directionlets are built as basis functions of critically sampled perfect-reconstruction transforms with directional vanishing moments imposed along different directions. We combine the directionlets with the space-frequency quantization (SFQ) image compression method, originally based on the standard two-dimensional wavelet transform. We show that our new compression method outperforms the standard SFQ as well as the state-of-the-art image compression methods, such as SPIHT and JPEG-2000, in terms of the quality of compressed images, especially in a low-rate compression regime. We also show that the order of computational complexity remains the same, as compared to the complexity of the sta…
Image compression based on a multi-directional map-dependent algorithm
2007
Abstract This work is devoted to the construction of a new multi-directional edge-adapted compression algorithm for images. It is based on a multi-scale transform that is performed in two steps: a detection step producing a map of edges and a prediction/multi-resolution step which takes into account the information given by the map. A short analysis of the multi-scale transform is performed and an estimate of the error associated to the largest coefficients for a piecewise regular function with Lipschitz edges is provided. Comparisons between this map-dependent algorithm and different classical algorithms are given.
Phase-matching measurements and Sellmeier equations over the complete transparency range of KTiOAsO_4, RbTiOAsO_4, and CsTiOAsO_4
2000
The sphere method is used for the direct measurement of sum- and difference-frequency generation phase matched in the principal planes of KTiOAsO4, RbTiOAsO4, and CsTiOAsO4, including the tuning curves of 1.064-µm-pumped OPO’s emitting between 3 and 5 µm. The nonlinear least-squares fitting of our experimental data leads to refined dispersion equations of the principal refractive indices; the resulting dual-oscillator form equations are valid over the complete transparency range of the three studied materials.
Hardware Implementation of a Configurable Motion Estimator for Adjusting the Video Coding Performances
2012
International audience; Despite the diversity of video compression standard, the motion estimation still remains a key process which is used in most of them. Moreover, the required coding performances (bit-rate, PSNR, image spatial resolution, etc.) depend obviously of the application, the environment and the network communication. The motion estimation can therefore be adapted to fit with these performances. Meanwhile, the real time encoding is required in many applications. In order to reach this goal, we propose in this paper a hardware implementation of the motion estimator which enables the integer motion search algorithms to be modified and the fractional search and variable block siz…
Suffix Array Construction on Multi-GPU Systems
2019
Suffix arrays are prevalent data structures being fundamental to a wide range of applications including bioinformatics, data compression, and information retrieval. Therefore, various algorithms for (parallel) suffix array construction both on CPUs and GPUs have been proposed over the years. Although providing significant speedup over their CPU-based counterparts, existing GPU implementations share a common disadvantage: input text sizes are limited by the scarce memory of a single GPU. In this paper, we overcome aforementioned memory limitations by exploiting multi-GPU nodes featuring fast NVLink interconnects. In order to achieve high performance for this communication-intensive task, we …
A New Combinatorial Approach to Sequence Comparison
2008
In this paper we introduce a new alignment-free method for comparing sequences which is combinatorial by nature and does not use any compressor nor any information-theoretic notion. Such a method is based on an extension of the Burrows-Wheeler Transform, a transformation widely used in the context of Data Compression. The new extended transformation takes as input a multiset of sequences and produces as output a string obtained by a suitable rearrangement of the characters of all the input sequences. By using such a transformation we give a general method for comparing sequences that takes into account how much the characters coming from the different input sequences are mixed in the output…
Bandwidth Resource Management for Neural Signal Telemetry
2009
Recent advances in modern neurocomputing have shown the utmost necessity of wireless communication systems that allow real-time (RT) monitoring of neural signals meeting several requirements such as source compression and high fidelity of the received signal. Neural recordings require multielectrode probes with up to hundreds of electrodes and transmission of signals wirelessly over a limited bandwidth (BW). In this paper, a RT resource management algorithm is proposed so that adequate source compression is applied to each channel in order to fit them into the available BW. Performance of the algorithm is analyzed using dynamically changing BW and neural recordings with different neural act…
Data Compression with ENO Schemes: A Case Study
2001
Abstract We study the compresion properties of ENO-type nonlinear multiresolution transformations on digital images. Specific error control algorithms are used to ensure a prescribed accuracy. The numerical results reveal that these methods strongly outperform the more classical wavelet decompositions in the case of piecewise smooth geometric images.
Image Compression by 2D Motif Basis
2011
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, but are affected instead by a controlled number of undetermined or don't care pixels. Such patches are chosen from a set of candidate motifs that are extracted in turn from the image 2D motif basis, the latter consisting of a compact set of patterns that result from the autocorrelation of the image w…
Accelerating H.264 inter prediction in a GPU by using CUDA
2010
H.264/AVC defines a very efficient algorithm for the inter prediction but it takes too much time. With the emergence of General Purpose Graphics Processing Units (GPGPU), a new door has been opened to support this video algorithm into these small processing units. In this paper, a forward step is developed towards an implementation of the H.264/AVC inter prediction algorithm into a GPU using Compute Unified Device Architecture (CUDA). The results show a negligible rate distortion drop with a time reduction on average up to 93.6%.