DOCSLIB.ORG

Improved Compression Rate Using Quad-Byte Index Based Transformation As a Pre-Processing to Arithmetic Coding

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Improved Compression Rate Using Quad-Byte Index Based Transformation As a Pre-Processing to Arithmetic Coding International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 3 Issue 2, February - 2014 Improved Compression Rate using Quad-Byte Index Based Transformation as a Pre-Processing to Arithmetic Coding Jyotika Doshi GLS Inst.of Computer Technology Opp. Law Garden, Ellisbridge Ahmedabad-380006, INDIA Savita Gandhi Dept. of Computer Science, Gujarat University Navrangpura Ahmedabad-380009, INDIA Abstract—Transformation algorithms are used to increase Grammar—based codes [10] and JPEG-MPEG methods redundancy in data sets and achieve better compression when used for image and video compression. Earlier-generation conventional compression techniques applied later. Arithmetic image and video coding standards such as JPEG, H.263, and coding is the most widely preferred entropy encoder used in MPEG-2, MPEG-4 were using Huffman coding in the most of the compression methods. It is nearly optimal and entropy coding step; whereas recent generation standards compression rate cannot be further improved without including JPEG2000 [7, 23] and H.264 [13, 24] utilize changing the data model. In this paper, we have used QBT-I arithmetic coding. (Quad-Byte Transformation using Indexes) technique to change the data model and introduce more redundancy in the Arithmetic coding [9, 12, 27] is the most widely data. We have experimented QBT-I at a pre-processing stage preferred efficient entropy coding technique providing before applying arithmetic coding compression method. QBT-I optimal entropy. Here, the problem is that further transforms most frequent 4-byte (quad-byte) integers. Most improvement in compression is not possible due to its frequent quad-bytes are arranged in sorted order of their entropy limitations. To achieve better compression, the only frequency and then divided in a group of 256 quad-bytes. EachIJERT IJERTpossibility is to change the data model and have it more quad-byte in a group is encoded using two tokens: group skewed. One way to change the data model is applying data number and the location in a group. Group number is denoted transformation. using variable length codeword; whereas location within a group is denoted using 8-bit index. QBT-I can be applied on Authors of this paper have proposed Quad-Byte any source; not necessarily text or image or audio. Minimum of Transformation using Index (QBT-I) method with an 2.5% compression gain is observed using QBT-I at a pre- intention to introduce more redundancy in the data and make processing as compared to compression using only arithmetic it more compressible using arithmetic coding at the second coding. Increasing number of groups gives better compression. stage [6]. Implementation of this proposal has resulted in minimum of nearly 2.5% improvement in compression as Keywords—data compression, data transformation, quad-byte compared to compression using only arithmetic coding. transformation, arithmetic coding QBT-I transforms most frequent quad-bytes (4-byte I. INTRODUCTION integers) forming various groups of 256 quad-bytes and then encoding quad-byte using two tokens: group number and Data transformation transforms data from one format to location (8-bit index) of quad-byte within a group. another. When data transformation is applied before applying conventional compression, the main purpose of a data Due to two-stage process of transformation and then transformation is to re-structure the data such that the compression, it is obviously going to be somewhat slower. transformed file is more compressible by a second-stage This slowness is acceptable since the transform truly skews conventional compression algorithm. The intention here is to the data source to fulfil our purpose of achieving more improve the overall compression rate as compared to what compression. could have been achieved by using only arithmetic coding Another advantage of QBT-I is that it can be applied to compression algorithm. any type of source; may be text, binary file, image, video or Majority of the data compression methods transforms any other format. data first and then apply entropy coding in the last step. Some of such methods are: LZ algorithms [21, 25, 28, 29]; DMC (Dynamic Markov Compression) [2, 4]; PPM [15] and their variants, context-tree weighting method [26], IJERTV3IS20786 www.ijert.org 1381 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 3 Issue 2, February - 2014 II. LITERATURE REVIEW Compression Pre-processing to BWT, Later MTF and RLE and entropy methods that can encoding Most of the research work in data transformation is be applied later intended to compress specific type of files. Transformation Drawback Applicable to text source only techniques like DCT and wavelet are used for image files. Requires pattern matching Compression-time more as used as a pre-processing Burrows Wheeler Transform (BWT) [3, 16] performs to BWT block encoding. Even though it is intended for text source only, it can be used for any source. For each block, BWT Methods BPE (Byte Pair Encoding) [8], digram encoding requires rotation-sorting-indexing. It is very time consuming and ISSDC (Iterative Semi-Static Digram Coding) [14] are and requires better data structures for efficient pattern also intended for text files, but can be applied to any type of matching. It gives better compression only when it is source. They will benefit more only when applied to small- combined ad-hoc compression techniques Run Length alphabet source like text files. Encoding (RLE) and Move-To-Front (MTF) encoding and then entropy coding. TABLE III. DIGRAM BASED ENCODING TECHNIQUES Star family transformation techniques are intended to compress text files. Star Transform [11], Length Index Digram encoding ISSDC BPE Preserving Transform (LIPT) [1, 17], and StarNT [22] are Source Type Any Any Any some such techniques shown in Table 1. Dictionary semi-static semi-static --- TABLE I. STAR FAMILY TRANSFORMATION TECHNIQUES Size of token to Digram (2 bytes) be encoded Star encoding LIPT StarNT Source Type Text Text Text Matching string or integer comparision Dictionary 22 sub-dict 22 sub-dict single comparison O(Dict-size) O(Dict-size) O(1): 2-byte Size of token to be word upto 22 word upto 22 Word time per token comparison encoded letters letters Code length fixed, depends on dictionary size 1 byte comparison time per O(Sub-Dict-size) O(Sub-Dict-size) O(Dict- size) token Redundancy index index substitution using Code length variable length: variable length: variable length: Compression Huffman or Arithmetic coding word-size <*, word length, index with max. methods that index> 3-letters can be applied Redundancy using * index, length index, length later Compression methods RLE, LZW, Huffman or Arithmetic Coding Drawback benefits only with repetitive, benefits repetitive, that can be applied Huffman, small- alphabet only with small benefits only later Arithmetic coding source sized source file when source and small alphabet have some IJERTIJERT source unused symbols, Drawback Applicable to text source only i.e. for small Requires pattern matching alphabet source Dictionary Based Encoding (IDBE) [20], Enhance Many of the present day transformation techniques, along Intelligent Dictionary Based Encoding (EIDBE) [18] and with transforming data, may introduce some compression Improved Intelligent Dictionary Based Encoding (IIDBE) also. Additionally they retain enough context and [19] are the transformation methods used for text files as redundancy for later applied compression algorithms to be shown in Table 2. They transform words using their index beneficial. position in the dictionary. III. RESEARCH SCOPE TABLE II. DICTIONARY BASED ENCODING TECHNIQUES Star family and dictionary based methods are applicable IDBE EIDBE IIDBE to text source only and string matching is time consuming. Source Type Text Text Text BWT can be applied to any source even though it is single 22 sub-dict 22 sub-dict Dictionary designed for text files. It is very slow due to the need of Size of token to Word word word rotations, sorting and mapping. It gives good compression be encoded only when later applied sequence of MTF, RTF and entropy comparison time O(Dict-size) O(sub-dict-size) O(sub-dict-size) encoding. per token Code length variable length: <1- variable length: <1- variable length: <1- All these methods require better data structures and byte codeword byte word length, byte codeword pattern matching algorithms for efficiency. length, codeword> codeword> length, codeword> Digram based encoding can be applied to any type of Redundancy (index, length) (index, length) index (index, length) source, but they will be beneficial only for small-alphabet using index using ASCII using ASCII index using source files like text. Here the advantage is of integer characters 33-250, characters 33-231, characters (A-Z, a-z) length 1-4 using length 1-22 using as in StarNT, length comparison leading to speed in transformation. ASCII characters ASCII characters 1-22 using ASCII 251-254 232-253 characters 232-253 We saw a research scope in transforming quad-bytes instead of digrams. Our assumption is that it will result in a IJERTV3IS20786 www.ijert.org 1382 International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 3 Issue 2, February - 2014 reduced file size and take less transformation time as V. ALGORITHM compared to digram based transformation. Algorithm uses two output files: transformed data file As arithmetic coding is the most widely used entropy and code file. encoding method used with almost all compression The transformed data file contains the index codewords methods, we intend to apply quad-byte transformation that (for transformed quad-bytes only). Purpose of storing index can be applied to any type source data and introduce codewords separately is to introduce redundancy in the data redundancy to skew the distribution for getting better for better compression. compression using arithmetic coding later. Prefix codes denoting group codeword are copied in the We have already proposed Quad-Byte Transformation code file.
Load more

Recommended publications
  • 16.1 Digital “Modes”
    Contents 16.1 Digital “Modes” 16.5 Networking Modes 16.1.1 Symbols, Baud, Bits and Bandwidth 16.5.1 OSI Networking Model 16.1.2 Error Detection and Correction 16.5.2 Connected and Connectionless 16.1.3 Data Representations Protocols 16.1.4 Compression Techniques 16.5.3 The Terminal Node Controller (TNC) 16.1.5 Compression vs. Encryption 16.5.4 PACTOR-I 16.2 Unstructured Digital Modes 16.5.5 PACTOR-II 16.2.1 Radioteletype (RTTY) 16.5.6 PACTOR-III 16.2.2 PSK31 16.5.7 G-TOR 16.2.3 MFSK16 16.5.8 CLOVER-II 16.2.4 DominoEX 16.5.9 CLOVER-2000 16.2.5 THROB 16.5.10 WINMOR 16.2.6 MT63 16.5.11 Packet Radio 16.2.7 Olivia 16.5.12 APRS 16.3 Fuzzy Modes 16.5.13 Winlink 2000 16.3.1 Facsimile (fax) 16.5.14 D-STAR 16.3.2 Slow-Scan TV (SSTV) 16.5.15 P25 16.3.3 Hellschreiber, Feld-Hell or Hell 16.6 Digital Mode Table 16.4 Structured Digital Modes 16.7 Glossary 16.4.1 FSK441 16.8 References and Bibliography 16.4.2 JT6M 16.4.3 JT65 16.4.4 WSPR 16.4.5 HF Digital Voice 16.4.6 ALE Chapter 16 — CD-ROM Content Supplemental Files • Table of digital mode characteristics (section 16.6) • ASCII and ITA2 code tables • Varicode tables for PSK31, MFSK16 and DominoEX • Tips for using FreeDV HF digital voice software by Mel Whitten, KØPFX Chapter 16 Digital Modes There is a broad array of digital modes to service various needs with more coming.
    [Show full text]
  • The Deep Learning Solutions on Lossless Compression Methods for Alleviating Data Load on Iot Nodes in Smart Cities
    sensors Article The Deep Learning Solutions on Lossless Compression Methods for Alleviating Data Load on IoT Nodes in Smart Cities Ammar Nasif *, Zulaiha Ali Othman and Nor Samsiah Sani Center for Artificial Intelligence Technology (CAIT), Faculty of Information Science & Technology, University Kebangsaan Malaysia, Bangi 43600, Malaysia; [email protected] (Z.A.O.); [email protected] (N.S.S.) * Correspondence: [email protected] Abstract: Networking is crucial for smart city projects nowadays, as it offers an environment where people and things are connected. This paper presents a chronology of factors on the development of smart cities, including IoT technologies as network infrastructure. Increasing IoT nodes leads to increasing data flow, which is a potential source of failure for IoT networks. The biggest challenge of IoT networks is that the IoT may have insufficient memory to handle all transaction data within the IoT network. We aim in this paper to propose a potential compression method for reducing IoT network data traffic. Therefore, we investigate various lossless compression algorithms, such as entropy or dictionary-based algorithms, and general compression methods to determine which algorithm or method adheres to the IoT specifications. Furthermore, this study conducts compression experiments using entropy (Huffman, Adaptive Huffman) and Dictionary (LZ77, LZ78) as well as five different types of datasets of the IoT data traffic. Though the above algorithms can alleviate the IoT data traffic, adaptive Huffman gave the best compression algorithm. Therefore, in this paper, Citation: Nasif, A.; Othman, Z.A.; we aim to propose a conceptual compression method for IoT data traffic by improving an adaptive Sani, N.S.
    [Show full text]
  • Digram Coding Based Lossless Data Compression Algorithm
    Computing and Informatics, Vol. 29, 2010, 741–756 ISSDC: DIGRAM CODING BASED LOSSLESS DATA COMPRESSION ALGORITHM Altan Mesut, Aydin Carus Computer Engineering Department Trakya University Ahmet Karadeniz Yerleskesi Edirne, Turkey e-mail: {altanmesut, aydinc}@trakya.edu.tr Manuscript received 18 August 2008; revised 14 January 2009 Communicated by Jacek Kitowski Abstract. In this paper, a new lossless data compression method that is based on digram coding is introduced. This data compression method uses semi-static dic- tionaries: All of the used characters and most frequently used two character blocks (digrams) in the source are found and inserted into a dictionary in the first pass, compression is performed in the second pass. This two-pass structure is repeated several times and in every iteration particular number of elements is inserted in the dictionary until the dictionary is filled. This algorithm (ISSDC: Iterative Semi- Static Digram Coding) also includes some mechanisms that can decide about total number of iterations and dictionary size whenever these values are not given by the user. Our experiments show that ISSDC is better than LZW/GIF and BPE in com- pression ratio. It is worse than DEFLATE in compression of text and binary data, but better than PNG (which uses DEFLATE compression) in lossless compression of simple images. Keywords: Lossless data compression, dictionary-based compression, semi-static dictionary, digram coding 1 INTRODUCTION Lossy and lossless data compression techniques are widely used to increase capacity of data storage devices and to transfer data faster on networks. Lossy data com- 742 A. Mesut, A. Carus pression reduces the size of the source data by permanently eliminating redundant information.
    [Show full text]
  • Answers to Exercises
    Answers to Exercises A bird does not sing because he has an answer, he sings because he has a song. —Chinese Proverb Intro.1: abstemious, abstentious, adventitious, annelidous, arsenious, arterious, face- tious, sacrilegious. Intro.2: When a software house has a popular product they tend to come up with new versions. A user can update an old version to a new one, and the update usually comes as a compressed file on a floppy disk. Over time the updates get bigger and, at a certain point, an update may not fit on a single floppy. This is why good compression is important in the case of software updates. The time it takes to compress and decompress the update is unimportant since these operations are typically done just once. Recently, software makers have taken to providing updates over the Internet, but even in such cases it is important to have small files because of the download times involved. 1.1: (1) ask a question, (2) absolutely necessary, (3) advance warning, (4) boiling hot, (5) climb up, (6) close scrutiny, (7) exactly the same, (8) free gift, (9) hot water heater, (10) my personal opinion, (11) newborn baby, (12) postponed until later, (13) unexpected surprise, (14) unsolved mysteries. 1.2: A reasonable way to use them is to code the five most-common strings in the text. Because irreversible text compression is a special-purpose method, the user may know what strings are common in any particular text to be compressed. The user may specify five such strings to the encoder, and they should also be written at the start of the output stream, for the decoder’s use.
    [Show full text]
  • Superior Guarantees for Sequential Prediction and Lossless Compression Via Alphabet Decomposition
    Journal of Machine Learning Research 7 (2006) 379–411 Submitted 8/05; Published 2/06 Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition Ron Begleiter [email protected] Ran El-Yaniv [email protected] Department of Computer Science Technion - Israel Institute of Technology Haifa 32000, Israel Editor: Dana Ron Abstract We present worst case bounds for the learning rate of a known prediction method that is based on hierarchical applications of binary context tree weighting (CTW) predictors. A heuristic application of this approach that relies on Huffman’s alphabet decomposition is known to achieve state-of- the-art performance in prediction and lossless compression benchmarks. We show that our new bound for this heuristic is tighter than the best known performance guarantees for prediction and lossless compression algorithms in various settings. This result substantiates the efficiency of this hierarchical method and provides a compelling explanation for its practical success. In addition, we present the results of a few experiments that examine other possibilities for improving the multi- alphabet prediction performance of CTW-based algorithms. Keywords: sequential prediction, the context tree weighting method, variable order Markov mod- els, error bounds 1. Introduction Sequence prediction and entropy estimation are fundamental tasks in numerous machine learning and data mining applications. Here we consider a standard discrete sequence prediction setting where performance is measured via the log-loss (self-information). It is well known that this setting is intimately related to lossless compression, where in fact high quality prediction is essentially equivalent to high quality lossless compression.
    [Show full text]
  • Improved Adaptive Arithmetic Coding in MPEG-4 AVC/H.264 Video Compression Standard
    Improved Adaptive Arithmetic Coding in MPEG-4 AVC/H.264 Video Compression Standard Damian Karwowski Poznan University of Technology, Chair of Multimedia Telecomunications and Microelectronics [email protected] Summary. An Improved Adaptive Arithmetic Coding is presented in the paper to be applicable in contemporary hybrid video encoders. The proposed Adaptive Arithmetic Encoder makes the improvement of the state-of-the-art Context-based Adaptive Binary Arithmetic Coding (CABAC) method that is used in the new worldwide video compression standard MPEG-4 AVC/H.264. The improvements were obtained by the use of more accurate mechanism of data statistics estimation and bigger size context pattern relative to the original CABAC. Experimental results revealed bitrate savings of 1.5% - 3% when using the proposed Adaptive Arithmetic Encoder instead of CABAC in the framework of MPEG-4 AVC/H.264 video encoder. 1 Introduction In order to improve compression performance of video encoder, entropy coding is used at the final stage of coding. Two types of entropy coding methods are used in the new generation video encoders: Context-Adaptive Variable Length Coding and more efficient Context-Adaptive Arithmetic Coding. The state- of-the-art entropy coding method used in video compression is Context-based Adaptive Binary Arithmetic Coding (CABAC) [4, 5] that found the appli- cation in the new worldwide Advanced Video Coding (AVC) standard (ISO MPEG-4 AVC and ITU-T Rec. H.264) [1, 2, 3]. Through the application of sophisticated mechanisms of data statistics modeling in CABAC, it is distin- guished by the highest compression performance among standardized entropy encoders used in video compression.
    [Show full text]
  • Applications of Information Theory to Machine Learning Jeremy Bensadon
    Applications of Information Theory to Machine Learning Jeremy Bensadon To cite this version: Jeremy Bensadon. Applications of Information Theory to Machine Learning. Metric Geometry [math.MG]. Université Paris Saclay (COmUE), 2016. English. NNT : 2016SACLS025. tel-01297163 HAL Id: tel-01297163 https://tel.archives-ouvertes.fr/tel-01297163 Submitted on 3 Apr 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. NNT: 2016SACLS025 These` de doctorat de L'Universit´eParis-Saclay pr´epar´ee`aL'Universit´eParis-Sud Ecole´ Doctorale n°580 Sciences et technologies de l'information et de la communication Sp´ecialit´e: Math´ematiqueset informatique par J´er´emy Bensadon Applications de la th´eoriede l'information `al'apprentissage statistique Th`esepr´esent´eeet soutenue `aOrsay, le 2 f´evrier2016 Composition du Jury : M. Sylvain Arlot Professeur, Universit´eParis-Sud Pr´esident du jury M. Aur´elienGarivier Professeur, Universit´ePaul Sabatier Rapporteur M. Tobias Glasmachers Junior Professor, Ruhr-Universit¨atBochum Rapporteur M. Yann Ollivier Charg´ede recherche, Universit´eParis-Sud Directeur de th`ese Remerciements Cette th`eseest le r´esultatde trois ans de travail, pendant lesquels j'ai c^otoy´e de nombreuses personnes qui m'ont aid´e,soit par leurs conseils ou leurs id´ees, soit simplement par leur pr´esence, `aproduire ce document.
    [Show full text]
  • Skip Context Tree Switching
    Skip Context Tree Switching Marc G. Bellemare [email protected] Joel Veness [email protected] Google DeepMind Erik Talvitie [email protected] Franklin and Marshall College Abstract fixed in advance. As we discuss in Section 3, reorder- Context Tree Weighting is a powerful proba- ing these variables can lead to significant performance im- bilistic sequence prediction technique that effi- provements given limited data. This idea was leveraged ciently performs Bayesian model averaging over by the class III algorithm of Willems et al.(1996), which the class of all prediction suffix trees of bounded performs Bayesian model averaging over the collection of depth. In this paper we show how to generalize prediction suffix trees defined over all possible fixed vari- D this technique to the class of K-skip prediction able orderings. Unfortunately, the O(2 ) computational suffix trees. Contrary to regular prediction suffix requirements of the class III algorithm prohibit its use in trees, K-skip prediction suffix trees are permitted most practical applications. to ignore up to K contiguous portions of the con- Our main contribution is the Skip Context Tree Switching text. This allows for significant improvements in (SkipCTS) algorithm, a polynomial-time compromise be- predictive accuracy when irrelevant variables are tween the linear-time CTW and the exponential-time class present, a case which often occurs within record- III algorithm. We introduce a family of nested model aligned data and images. We provide a regret- classes, the Skip Context Tree classes, which form the ba- based analysis of our approach, and empirically sis of our approach.
    [Show full text]
  • Quad-Byte Transformation As a Pre-Processing to Arithmetic Coding
    International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 2 Issue 12, December - 2013 Quad-Byte Transformation as a Pre-processing to Arithmetic Coding Jyotika Doshi GLS Inst.of Computer Technology Opp. Law Garden, Ellisbridge Ahmedabad-380006, INDIA Savita Gandhi Dept. of Computer Science; Gujarat University Navrangpura Ahmedabad-380009, INDIA second-stage conventional compression algorithm. Abstract Thus, the intent is to use the paradigm to improve the overall compression ratio in comparison with Transformation algorithms are an interesting what could have been achieved by using only the class of data-compression techniques in which one compression algorithm. can perform reversible transformations on datasets Arithmetic coding [8, 11, 30] is the most widely to increase their susceptibility to other compression preferred efficient entropy coding technique techniques. In recent days, due to its optimal providing optimal entropy. Most of the data entropy, arithmetic coding is the most widely compression algorithms like LZ algorithms [22, 28, preferred entropy encoder in most of the 31, 32]; DMC (Dynamic Markov Compression) [2, compression methods. In this paper, we have 4]; PPM [15] and their variants such as PPMC, proposed QBT-I (Quad-Byte Transformation using PPMD and PPMD+ and others, context-tree Indexes) method to be used as a pre-processing weighting method [29], Grammar—based codes [9] stage before applying arithmetic codingIJERT IJERTand many methods of image compression, audio compression method. QBT-I is intended to and video compression transforms data first and introduce more redundancy in the data and make it then apply entropy coding in the last step. Earlier- more compressible using arithmetic coding.
    [Show full text]
  • Bi-Level Image Compression with Tree Coding
    Downloaded from orbit.dtu.dk on: Oct 05, 2021 Bi-level image compression with tree coding Martins, Bo; Forchhammer, Søren Published in: Proceedings of the Data Compression Conference Link to article, DOI: 10.1109/DCC.1996.488332 Publication date: 1996 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Martins, B., & Forchhammer, S. (1996). Bi-level image compression with tree coding. In Proceedings of the Data Compression Conference (pp. 270-279). IEEE. https://doi.org/10.1109/DCC.1996.488332 General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. Bi-level Image Compression with Tree Coding Bo Martins and Smen Forchhammer Dept. of Telecommunication, 343, Technical University of Denmark DK-2800 Lyngby, Denmark phone: f45 4525 2525, e-mail: [email protected] and [email protected] Abstract Presently, tree coders are the best bi-level image coders.
    [Show full text]
  • Leveraging Word and Phrase Alignments for Multilingual Learning
    Leveraging Word and Phrase Alignments for Multilingual Learning Junjie Hu CMU-LTI-21-012 Language Technologies Institute School of Computer Science Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh, PA 15123 www.lti.cs.cmu.edu Thesis Committee: Dr. Graham Neubig (Chair) Carnegie Mellon University Dr. Yulia Tsvetkov Carnegie Mellon University Dr. Zachary Lipton Carnegie Mellon University Dr. Kyunghyun Cho New York University Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. © 2020 Junjie Hu Keywords: natural language processing, multilingual learning, cross-lingual transfer learn- ing, machine translation, domain adaptation, deep learning Dedicated to my family for their wholehearted love and support in all my endeavours. iv Abstract Recent years have witnessed impressive success in natural language processing (NLP) thanks to the advances of neural networks and the availability of large amounts of labeled data. However, many NLP systems predominately have focused on high- resource languages (e.g., English, Chinese) that have large, computationally accessi- ble collections of labeled data for training. While the achievements on high-resource languages are exciting, there are more than 6,900 languages in the world and the ma- jority of them have far fewer resources for training deep neural networks. In fact, it is often expensive, or sometimes infeasible, to collect labeled data written in all possible languages. As a result, this data scarcity issue limits the generalization of NLP systems in many multilingual scenarios. Moreover, as models may be used to process text from a wide range of domains (e.g., social media or medical articles), the data scarcity issue is further exacerbated by the domain shift between the training and test data.
    [Show full text]
  • Quad-Byte Transformation Performs
    International Journal of Engineering Research and Development e-ISSN: 2278-067X, p-ISSN: 2278-800X, www.ijerd.com Volume 10, Issue 6 (June 2014), PP.16-21 Quad-Byte Transformation Performs Better Than Arithmetic Coding Jyotika Doshi, Savita Gandhi GLS Institute of Computer Technology, Gujarat Technological University, Ahmedabad, INDIA Department of Computer Science, Gujarat University, Ahmedabad, INDIA [email protected] [email protected] Abstract:- Arithmetic coding (AC) is the most widely used encoding/decoding technique used with most of the data compression programs in the later stage. Quad-byte transformation using zero frequency byte symbols (QBT-Z) is a technique used to compress/decompress data. With k-pass QBT-Z, the algorithm transforms half of the possible most-frequent byte pairs in each pass except the last. In the last pass, it transforms all remaining possible quad-bytes. Authors have experimented k-pass QBT-Z and AC on 18 different types of files with varying sizes having total size of 39,796,037 bytes. It is seen that arithmetic coding has taken 17.488 seconds to compress and the compression rate is 16.77%. The compression time is 7.629, 12.1839 and 16.091 seconds; decompression time is 2.147, 2.340 and 2.432 seconds; compression rate is 17.041%, 18.906% and 19.253% with k-pass QBT-Z for 1, 2, and 3 pass respectively. Decoder of QBT-Z is very fast, so significant saving is observed in decompression with QBT-Z as compared to arithmetic decoding. Both these techniques require computing the frequencies before starting compression.
    [Show full text]