One piece of information can often be expressed in different ways. Information is mostly stored directly, and can then also be interpreted directly. However, since each information can also always be assigned to a cer...
详细信息
One piece of information can often be expressed in different ways. Information is mostly stored directly, and can then also be interpreted directly. However, since each information can also always be assigned to a certain context, there is a close assumption that each information is also redundant. An adapted mathematical context-oriented transformation enables, therefore, a secured increase to the effectiveness of general compression algorithms, which can be used for data storage and transfer.
This paper presents an octree-based compression algorithm for LiDAR point cloud data. This solution is presented as an alternative to LASzip, the current state-of-the-art in LiDAR compression, that provides an average...
详细信息
ISBN:
(纸本)9781665448604
This paper presents an octree-based compression algorithm for LiDAR point cloud data. This solution is presented as an alternative to LASzip, the current state-of-the-art in LiDAR compression, that provides an average 60% higher compression ratio on Geiger-mode data, and is capable of natively compressing both LAS and BPF file formats.
An approach for filling-in blocks of missing data in wireless image transmission is presented in this paper. When compression algorithms such as JPEG are used as part of the wireless transmission process, images are f...
详细信息
An approach for filling-in blocks of missing data in wireless image transmission is presented in this paper. When compression algorithms such as JPEG are used as part of the wireless transmission process, images are first tiled into blocks of 8/spl times/8 pixels. When such images are transmitted over fading channels, the effects of noise can kill entire blocks of the image. Instead of using common retransmission query protocols, we aim to reconstruct the lost data using correlation between the lost block and its neighbors. If the lost block contained structure, it is reconstructed using an image inpainting algorithm, while texture synthesis is used for the textured blocks. The switch between the two schemes is done in a fully automatic fashion based on the surrounding available blocks. The performance of this method is tested for various images and combinations of lost blocks. The viability of this method for image compression, in association with lossy JPEG, is also discussed.
Nomadic computing often refers to people using computer support working anywhere, anytime and not necessarily attached to a specific location or time of the day. Mobile computing and wireless ad-hoc networks are impor...
详细信息
Nomadic computing often refers to people using computer support working anywhere, anytime and not necessarily attached to a specific location or time of the day. Mobile computing and wireless ad-hoc networks are important elements in this kind of scenarios. Nowadays it is common to see architects, engineers, geologists and/or designers working on the field and sharing ideas on a collaborative media using sketches and freehand writing. On this scenario, data overflow among the peer applications often happens, since the sketches have to be distributed among all participants in real time. This paper presents a work on characterization and compression algorithms for sketches, with and without loss of information, to be used on mobile devices, in order to reduce the data traffic. We focused our study on three parameters of the algorithms: time required characterizing and compressing the sketch, size of the resulting information and human perceived of lost information. Our results present algorithms with a compression ratio lower than 1% the size of the original image without information loosing under human perception.
A novel discrete cosine transform (DCT) and fractal transform coding (FTC) hybrid image compression algorithm is proposed which dramatically improves the speed of the FTC coding and JPEG's ability of preserving im...
详细信息
ISBN:
(纸本)0780325168
A novel discrete cosine transform (DCT) and fractal transform coding (FTC) hybrid image compression algorithm is proposed which dramatically improves the speed of the FTC coding and JPEG's ability of preserving image details at high compression ratios. The overall subjective quality of the whole JPEG decoded image is also heightened.
High-throughput data-bus systems are crucial for recent high-performance computing, especially for data intensive computing. The effective throughput can be improved by applying a lossless data compression with high-t...
详细信息
ISBN:
(纸本)9781509020744
High-throughput data-bus systems are crucial for recent high-performance computing, especially for data intensive computing. The effective throughput can be improved by applying a lossless data compression with high-throughput codec. This paper proposes a lossless data compression codec using a simple context-base coding. Simulation results of compression ratio show that, compared to existing low-latency compression methods, the proposed method can achieve comparable compression ratios for many benchmark data sets with simple codec structure.
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed memory regions during application exec...
详细信息
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed memory regions during application execution. The primary goal of this work is to save memory in disk-less embedded systems, resulting in greater functionality, smaller size, and lower overall cost, without modifying applications or hardware. In comparison with algorithms that are commonly used in on-line memory compression, our new algorithm has a comparable compression ratio but is twice as fast. The adaptive memory management scheme effectively responds to the predicted needs of applications and prevents on-line memory compression deadlock, permitting reliable and efficient compression for a wide range of applications. We have evaluated our technique on an embedded portable device and have found that the memory available to applications can be increased by 150%, allowing the execution of applications with larger working data sets, or allowing existing applications to run with less physical memory
A compression method is proposed that takes advantage of a powerful property of acoustic unit inventories: In the appropriate acoustic space, units that share a (context-dependent or -independent) phoneme label must b...
详细信息
A compression method is proposed that takes advantage of a powerful property of acoustic unit inventories: In the appropriate acoustic space, units that share a (context-dependent or -independent) phoneme label must be close to a vector phoneme template associated with the phoneme. The method approximates units by interpolation between templates. The interpolation operation involves two asynchronous weight functions operating on the template. One is associated with spectral peak locations, the second with spectral balance. This enables approximating transitions such as [i:]/spl rarr/[v], in which formant movement precedes frication onset. The algorithm guarantees smooth concatenation points.
In this paper we propose a new approach for applying genetic programming to lossless data compression based on combining well-known lossless compression algorithms. The file to be compressed is divided into chunks of ...
详细信息
In this paper we propose a new approach for applying genetic programming to lossless data compression based on combining well-known lossless compression algorithms. The file to be compressed is divided into chunks of a predefined length, and GP is asked to find the best possible compression algorithm for each chunk in such a way to minimise the total length of the compressed file. This technique is referred to as ldquoGP-ziprdquo: The compression algorithms available to GP-zip (its function set) are: arithmetic coding (AC), Lempel-Ziv-Welch (LZW), unbounded prediction by partial matching (PPMD), run length encoding (RLE), and Boolean minimization. In addition, two transformation techniques are available: Burrows-Wheeler transformation (BWT) and move to front (MTF). In experimentation with this technique, we show that when the file to be compressed is composed of heterogeneous data fragments (as is the case, for example, in archive files), GP-zip is capable of achieving compression ratios that are superior to those obtained with well-known compression algorithms.
We propose an algorithm for the compression of ECG signals, in particular QRS complexes, based on the expansion of signals with compact support into a basis of discrete Hermite functions. These functions are obtained ...
详细信息
We propose an algorithm for the compression of ECG signals, in particular QRS complexes, based on the expansion of signals with compact support into a basis of discrete Hermite functions. These functions are obtained by sampling continuous Hermite functions, previously used for the compression of ECG signals. Our algorithm uses the theory of signal models based on orthogonal polynomials, and achieves higher compression ratios compared with previously reported algorithms, both those using Hermite functions, as well as those using the discrete Fourier and discrete cosine transforms.
暂无评论