Filters








1,347 Hits in 2.1 sec

Burrows-Wheeler compression with variable length integer codes

Peter Fenwick
2002 Software, Practice & Experience  
The final coder in Burrows-Wheeler compression is usually either an adaptive Huffman coder (for speed) or a complex of arithmetic coders for better compression.  ...  The paper also describes a "sticky Move-to-Front" modification which gives a useful improvement in compression for most files.  ...  Burrows-Wheeler compression The compression algorithm described by Burrows and Wheeler [1] differs from most compression methods in that it processes a file in blocks.  ... 
doi:10.1002/spe.484 fatcat:ya4aa6yd2jdenobegsk372iobm

Burrows-Wheeler based JPEG

Yair Wiseman
2007 Data Science Journal  
Recently, the use of the Burrows-Wheeler method for data compression has been expanded.  ...  The paper suggests a replacement of the traditional Huffman compression used by JPEG by the Burrows-Wheeler compression.  ...  Burrows-Wheeler based JPEG will compress the same data in about double time.  ... 
doi:10.2481/dsj.6.19 fatcat:2xnq45r7jbfundbaemytt4qjlq

Second step algorithms in the Burrows-Wheeler compression algorithm

Sebastian Deorowicz
2002 Software, Practice & Experience  
In this paper we fix our attention on the second step algorithms of the Burrows-Wheeler compression algorithm, which in the original version is the Move To Front transform.  ...  Then we propose a new algorithm that yields a better compression ratio than the previous ones.  ...  INTRODUCTION In 1994, Burrows and Wheeler developed a new data compression algorithm [1] . It is based on the Burrows-Wheeler transform introduced in the same paper.  ... 
doi:10.1002/spe.426 fatcat:dtaufcgadrbh7cxvvnzdxqgwau

A Framework for Space-Efficient String Kernels

Djamal Belazzougui, Fabio Cunial
2017 Algorithmica  
O(n log log σ) Burrows-Wheeler tr. [1] D. Belazzougui. Linear time construction of compressed text indices in compact space. STOC 2014. [2] D. Belazzougui, G. Navarro, D. Valenzuela.  ...  Versatile succinct representations of the bidirectional Burrows-Wheeler transform. ESA 2013. D. Belazzougui, G. Navarro, D. Valenzuela. Improved compressed indexes for full-text document retrieval.  ... 
doi:10.1007/s00453-017-0286-4 fatcat:e2r44hskgrhfvo4f6who3fphgi

Foreword

Costas S. Iliopoulos, Alessio Langiu
2017 Mathematics in Computer Science  
to the Burrows-Wheeler Transform computation algorithm, in the case of partial use of external memory.  ...  Faster Average Case Low Memory Semi-External Construction of the Burrows-Wheeler Transform paper contains an interesting advancement for the suffix array construction algorithm, which is intimately connected  ... 
doi:10.1007/s11786-017-0323-3 fatcat:fwxwq2gdvvh5zjcp62gqs3saye

Burrows—Wheeler Compression [chapter]

Peter Fenwick
2003 Lossless Compression Handbook  
The material of this chapter, while quoting extensively from other work, is in part a summary of my own experience and thoughts in working with the Burrows-Wheeler compression algorithm.  ...  Solving this problem led to a much better understanding of Burrows-Wheeler compression.  ...  Final comments An enormous amount of work has been done on Burrows-Wheeler compression Despite all of this work however, the author feels that Burrows-Wheeler compression is still not really understood  ... 
doi:10.1016/b978-012620861-0/50008-5 fatcat:bmdaqour2fea3lqzco5k5im4ym

Parallelization of Weighted Sequence Comparision By Using EBWT

Binay Kumar Pandey, Rajdeep Niyogi, Ankush Mittal
2011 International Journal of Distributed and Parallel systems  
Our extended burrow wheeler transform based weighted sequence comparison algorithm with thrust library implementation on CUDA is the fastest implementation of weighted sequence comparison algorithm than  ...  the our previous implementation of extended burrow wheeler transform based weighted sequence algorithm without using thrust library, and it is on average 56.3X times faster.  ...  Section VIII dictates final conclusion of our experiment performed BURROW WHEELER TRANSFORM: Preliminaries In the field of lossless textual data compression, burrows-wheeler transform [5] can be considered  ... 
doi:10.5121/ijdps.2011.2102 fatcat:qoeu3vjvenehnpcj7hn46akuxa

Image compression with B-tree coding algorithm enhanced by data modelling with Burrows-Wheeler transformation

Irena Galić, Časlav Livada, Branka Zovko-Cihlar
2016 Automatika  
Huffman coding will be changed with an entropy coder accompanied with Burrows-Wheeler transformation and context mixing. Images, graphs and tables show image compression results.  ...  better than present compression standard -JPEG2000 thus presenting a novel method for image compression.  ...  Image compression with B-tree coding algorithm enhanced by data modelling with Burrows-Wheeler... I. Galić,Č. Livada, B.  ... 
doi:10.7305/automatika.2016.07.282 fatcat:abfc5ykbabfqjgrggxs4u7hmku

Parallelization of Weighted Sequence Comparison by using EBWT [article]

Shashank Srikant
2011 arXiv   pre-print
The Extended Burrows Wheeler transform (EBWT) helps to find the distance between two sequences. Implementation of an existing algorithm takes considerable amount of time for small size sequences.  ...  BURROWS WHEELER TRANSFORM: Preliminaries In the field of lossless textual data compression, Burrows Wheeler transform [5] can be considered as an extremely useful tool.  ...  An important fact of the extended Burrows Wheeler transforms is that when the set S has only one element, the extended Burrows Wheeler transformation works exactly as same as the Burrows Wheeler transform  ... 
arXiv:1011.0597v3 fatcat:x6yslbkxuvajbeon4raxvnewpu

ECG Signal Compression Based on Burrows-Wheeler Transformation and Inversion Ranks of Linear Prediction

Ziya Arnavut
2007 IEEE Transactions on Biomedical Engineering  
We show that when compressing ECG signals, utilization of linear prediction, Burrows-Wheeler Transformation, and inversion ranks yield better compression gain in terms of weighted average bit per sample  ...  However, the recently introduced Burrows-Wheeler Transformation has not been completely investigated. In this paper, we investigate the lossless compression of ECG signals.  ...  Burrows-Wheeler Coder. Fig. 4 . 4 Fig. 4. Effect of AR orders (p) when compressing with bwic.  ... 
doi:10.1109/tbme.2006.888820 pmid:17355052 fatcat:q46cuxvapzaipa5fzdusyo7hr4

High Density Data Storage In Dna Using An Efficient Message Encoding Scheme

Rahul Vishwakarma
2012 International Journal of Advanced Information Technology  
Compression of small text files must fulfill special requirement since they have small context.  ...  The use of transformation algorithm generates better context information for compression with Huffman encoding. We tested the suggested scheme on collection of small text size files.  ...  One of them is Burrow Wheeler transform [8] [9] .  ... 
doi:10.5121/ijitcs.2012.2204 fatcat:gdvwk3bxczbzdolotfbtrjfdfe

On the Utilization of Reversible Colour Transforms for Lossless 2-D Data Compression

Muhammad Waleed, Tai-Won Um, Aftab Khan, Ali Khan
2020 Applied Sciences  
This aids the BurrowsWheeler Transform (BWT) based compression scheme and achieves compression ratios of high degree at the subsequent steps of the program.  ...  Reversible Colour Transforms (RCTs) in conjunction with Bi-level BurrowsWheeler Compression Algorithm (BBWCA) allows for high-level lossless image compression as demonstrated in this study.  ...  Burrows-Wheeler Compression Algorithm (BWCA) The classical Burrows-Wheeler Compression Algorithm (BWCA) was presented by J. Abel in [17] and is shown in Figure 1 .  ... 
doi:10.3390/app10030937 fatcat:tchevw66efdi5agnvqv73mdaqy

A New Burrows Wheeler Transform Markov Distance

Edward Raff, Charles Nicholas, Mark McLean
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Prior work inspired by compression algorithms has described how the Burrows Wheeler Transform can be used to create a distance measure for bioinformatics problems.  ...  We describe issues with this approach that were not widely known, and introduce our new Burrows Wheeler Markov Distance (BWMD) as an alternative.  ...  Extended Burrows Wheeler Transform The Burrows Wheeler Transform (BWT) (Burrows and Wheeler 1994 ) is a core component of the bzip compression algorithm, and has been widely used in information retrieval  ... 
doi:10.1609/aaai.v34i04.5994 fatcat:5cm7gszwqfbkjdexfgqvgd55ea

The impact of lossless image compression to radiographs

Thomas M. Lehmann, Jürgen Abel, Claudia Weiss, Steven C. Horii, Osman M. Ratib
2006 Medical Imaging 2006: PACS and Imaging Informatics  
Borrows-Wheeler compression algorithm (BWCA) with respect to image content and origin.  ...  However, novel compression schemes have been developed recently allowing efficient but lossless compression.  ...  Burrows-Wheeler Compression. The Burrows-Wheeler compression algorithm (BWCA) achieves strong compression rates and a high throughput.  ... 
doi:10.1117/12.651697 fatcat:bxc7fmjjtrhl3oo2efllc6gcei

A New Burrows Wheeler Transform Markov Distance [article]

Edward Raff, Charles Nicholas, Mark McLean
2019 arXiv   pre-print
Prior work inspired by compression algorithms has described how the Burrows Wheeler Transform can be used to create a distance measure for bioinformatics problems.  ...  We describe issues with this approach that were not widely known, and introduce our new Burrows Wheeler Markov Distance (BWMD) as an alternative.  ...  Burrows and Wheeler, 1994) algorithm for use in bioinformatics.  ... 
arXiv:1912.13046v1 fatcat:ijlx4t7v25ao3djlo43oimlcte
« Previous Showing results 1 — 15 out of 1,347 results