DOCSLIB.ORG

Evaluating Lossless Data Compression Algorithms for Use on Mobile Devices Literature Synthesis Paul Brittan (BRTPAU008)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Evaluating Lossless Data Compression Algorithms for Use on Mobile Devices Literature Synthesis Paul Brittan (BRTPAU008) Evaluating Lossless Data Compression Algorithms for Use on Mobile Devices Literature Synthesis Paul Brittan (BRTPAU008) Abstract references the upcoming data, to match the exact data that has already been encoded. Prediction with Partial Match With an increase in the usage of mobile devices, users have (PPM) which is a statistical data compression algorithm to continually store and transport data on their mobile based on context modeling and prediction [3] and Burrows- devices. In order for this to happen efficiently, the data first Wheeler Transform (BWT) which on its own does not needs to be compressed using a data compression reduces the size of the data, it only makes the data easier to application. Data compression is the process of converting an compress [4]. These algorithms are then compared using input data stream into a new data stream that has a smaller benchmark tests to find which one is optimal for size. This paper describes four lossless data compression implementing on mobile devices. algorithms. Lempel-Ziv 77 (LZ77) and Lempel-Ziv-Welch (LZW) which are based on the dictionary methods, 2. Lempel-Ziv 77 Prediction with Partial Match (PPM) which is based on the statistical methods and Burrows-Wheeler Transform (BWT) The Lempel-Ziv 77 (LZ77) lossless compression algorithm is which was found to be inadequate since the algorithm does used as the foundation for compression tools, such as GZip not compression the data only optimizes it for compression. [5]. The algorithm is asymmetric because, with time and After comparison of the algorithms using benchmark testing, memory, encoding is much more demanding than decoding. it was found that using LZ77 was the optimal algorithm The LZ77 algorithm uses data structures like binary trees, because of its speed and low memory usage. suffix trees and hash tables which provides fast searching without the need for high memory [6]. LZ77 compresses data by replacing sections of the data with a reference to matching 1. Introduction data that has already passed through both the encoder and decoder [3]. No searching is needed when decompressing the The advancements in mobile technologies and mobile data because, the compressor has issued an explicit stream of computing power have caused an increase in the popularity literals, locations, and match lengths [7]. The process of mobile devices. Mobile devices are now being used for becomes even more efficient if the window is stored entirely everyday tasks such as communication through emails or in the cache, so that retrieving a match is fast no matter instant messages and daily scheduling with the help of where it occurs in the window [7]. The LZ77 algorithm calendars. With this increase, usage of mobile devices has works by maintaining a current pointer into the input data, a been broadening through industries such as Healthcare, search and a look-ahead buffer. Symbols that are found Insurance and Field Services [1]. To keep up with all the data before the current symbol make up the search buffer, were as that needs to be stored on a mobile device or transferred symbols that appear after the current symbol are placed in the quickly across a network, there needs to be a way to look-ahead buffer. The buffers make a window which shows efficiently compress and decompression the data without the section of input currently being viewed. As the current losing the information. Lossless data compression is a set pointer moves forward the window moves through the input. of data compression algorithms that allows the original data While symbols are found in the look-ahead buffer, the to be reconstructed from the compressed data [2]. With algorithm looks in the search buffer for the longest match [7]. lossless data compression algorithms compression and Instead of send off the matched symbols, they are encoded decompression can be efficiently implemented on a mobile with the offset from the current pointer, the size of match and device, even with the hardware limitations such as low the symbol in the look-ahead buffer that is following the processing power, static memory and battery life [1]. match. The encoder and decoder must both keep track of the Lossless data compression has many advantages on a mobile last 2KB or 4KB of the most recent data. The encoder needs device, such as reducing the network bandwidth required for to keep this data to look for matches, while the decoder needs data exchange, reducing the disk space required for storage to keep it to understand the matches the encoder refers to. and minimizing the main memory required [3]. This paper The LZ77 provides option to increase the memory to describes four commonly used lossless compression improve performance. With a larger window there are algorithms used today. Lempel-Ziv 77(LZ77) and Lempel- improvements in the speed in which matches are found. Ziv-Welch (LZW) which uses dictionary methods to 3. Lempel-Ziv-Welch updated regularly. The symbol that occurs is encoded in relation to its predicted probability, using arithmetic coding. The Lempel-Ziv-Welch (LZW) algorithm was introduced for Although PPM is simple, it is also computationally expensive cases in which a match cannot be found using LZ77. Instead [3]. An arithmetic encoder can use the probabilities to code of the sliding buffers, LZW uses a separate dictionary which the input efficiently. Longer contexts will improve the is used as a codebook [8]. From the input stream the probability, but will take more time to calculate. To deal with compressor builds its dictionary from the input data. When a this, escape symbols are created to slowly reduce context group of symbols is found the dictionary is then checked. lengths. This creates a downfall were encoding a large string The longest prefix that matches the input and the unmatched of escape symbols can use up more space, that which would symbol which follows are then added to the dictionary, see of been saved by the use of large contexts. Storing and table 1 for example of LZW compression. The decompressor searching through each context is the reason for the large will then build a dictionary so that it can receive the indices memory usage of PPM algorithm [7]. With the PPM that refer to the same symbol that are in the compressors algorithm a table is built for each order, from 0 to the highest dictionary. order of the model. After parsing the input into substrings, the context for each substring is the characters that come Input Stream: AAAABAAABCC before the sub-string. The table keeps count of the frequency Encoded String Output Stream New Dictionary each substring has been found for the given context [10]. Entry When the PPM algorithm is used, it searches the highest- A 65 256 - AA order table for the given context. If the context is found, the AA 65 256 257 - AAA next character with the highest frequency count is returned as A 65 256 65 258 - AB the prediction. If there are no matches to any entries in the B 65 256 65 66 259 - BA table, the context is reduced by one character and the next lowest-order table is searched. This process is repeated until AAA 65 256 65 66 257 260 - AAAB the context is matched or the Zeroth-order table is reached. B 65 256 65 66 257 66 261 - BC The Zeroth-order table simply returns the most common C 65 256 65 66 257 66 262 - CC character seen in the training string [10]. 67 C 65 256 65 66 257 66 67 67 5. Burrows-Wheeler Transform Table 1. Example of LZW Compression [5]. The Burrows-Wheeler Transform (BWT) is a reversible This algorithm provides a quick build up of long patterns that algorithm that is used in the bzip2 compression algorithm [4]. can be stored, but there are multiple downfalls. Until the On its own, BWT does not reduce the size of the data, it only dictionary is filled with large commonly seen patterns, the formats the data so it becomes easier to compress by other resulting output will be bigger than the original input. Since algorithms. When a string of characters is transformed using the dictionary can grow without bound, LZW must be BWT the size of the characters remain the same, the implemented so it deletes the existing dictionary when it gets algorithm just calculates the order that the characters appear too big or finds a way to limit memory usage [7]. This in. If the input string has multiple substrings that have a high algorithm has no communication overhead and is frequency of appearing, then the transformed string will have computationally simple. Since both the compressor and the multiple locations in which a character will recur several decompressor have the initial dictionary, and all new entries times in a row. This helps with compression, since most into the dictionary are created based on entries in the compression algorithms are more effective when the input dictionary that already exists, the decompressor can recreate contains sets of repeated characters. After the BWT is the dictionary quickly as data is received. To decode a completed, the data is then compressed by running the dictionary entry the decoder must have received all previous transformed input through a Move-to-Front encoder and then entries in the block [5]. a run-length encoder. BWT takes advantage of symbols which are located further on in the string, not just those that have passed. The biggest problem is that the BWT requires 4. Prediction with Partial Match the allocation of RAM for the entire input and output streams and a large buffer is needed to perform the required sorts [5].
Load more

Recommended publications
  • A Survey Paper on Different Speech Compression Techniques
    Vol-2 Issue-5 2016 IJARIIE-ISSN (O)-2395-4396 A Survey Paper on Different Speech Compression Techniques Kanawade Pramila.R1, Prof. Gundal Shital.S2 1 M.E. Electronics, Department of Electronics Engineering, Amrutvahini College of Engineering, Sangamner, Maharashtra, India. 2 HOD in Electronics Department, Department of Electronics Engineering , Amrutvahini College of Engineering, Sangamner, Maharashtra, India. ABSTRACT This paper describes the different types of speech compression techniques. Speech compression can be divided into two main types such as lossless and lossy compression. This survey paper has been written with the help of different types of Waveform-based speech compression, Parametric-based speech compression, Hybrid based speech compression etc. Compression is nothing but reducing size of data with considering memory size. Speech compression means voiced signal compress for different application such as high quality database of speech signals, multimedia applications, music database and internet applications. Today speech compression is very useful in our life. The main purpose or aim of speech compression is to compress any type of audio that is transfer over the communication channel, because of the limited channel bandwidth and data storage capacity and low bit rate. The use of lossless and lossy techniques for speech compression means that reduced the numbers of bits in the original information. By the use of lossless data compression there is no loss in the original information but while using lossy data compression technique some numbers of bits are loss. Keyword: - Bit rate, Compression, Waveform-based speech compression, Parametric-based speech compression, Hybrid based speech compression. 1. INTRODUCTION -1 Speech compression is use in the encoding system.
    [Show full text]
  • Arxiv:2004.10531V1 [Cs.OH] 8 Apr 2020
    ROOT I/O compression improvements for HEP analysis Oksana Shadura1;∗ Brian Paul Bockelman2;∗∗ Philippe Canal3;∗∗∗ Danilo Piparo4;∗∗∗∗ and Zhe Zhang1;y 1University of Nebraska-Lincoln, 1400 R St, Lincoln, NE 68588, United States 2Morgridge Institute for Research, 330 N Orchard St, Madison, WI 53715, United States 3Fermilab, Kirk Road and Pine St, Batavia, IL 60510, United States 4CERN, Meyrin 1211, Geneve, Switzerland Abstract. We overview recent changes in the ROOT I/O system, increasing per- formance and enhancing it and improving its interaction with other data analy- sis ecosystems. Both the newly introduced compression algorithms, the much faster bulk I/O data path, and a few additional techniques have the potential to significantly to improve experiment’s software performance. The need for efficient lossless data compression has grown significantly as the amount of HEP data collected, transmitted, and stored has dramatically in- creased during the LHC era. While compression reduces storage space and, potentially, I/O bandwidth usage, it should not be applied blindly: there are sig- nificant trade-offs between the increased CPU cost for reading and writing files and the reduce storage space. 1 Introduction In the past years LHC experiments are commissioned and now manages about an exabyte of storage for analysis purposes, approximately half of which is used for archival purposes, and half is used for traditional disk storage. Meanwhile for HL-LHC storage requirements per year are expected to be increased by factor 10 [1]. arXiv:2004.10531v1 [cs.OH] 8 Apr 2020 Looking at these predictions, we would like to state that storage will remain one of the major cost drivers and at the same time the bottlenecks for HEP computing.
    [Show full text]
  • Lossless Compression of Audio Data
    CHAPTER 12 Lossless Compression of Audio Data ROBERT C. MAHER OVERVIEW Lossless data compression of digital audio signals is useful when it is necessary to minimize the storage space or transmission bandwidth of audio data while still maintaining archival quality. Available techniques for lossless audio compression, or lossless audio packing, generally employ an adaptive waveform predictor with a variable-rate entropy coding of the residual, such as Huffman or Golomb-Rice coding. The amount of data compression can vary considerably from one audio waveform to another, but ratios of less than 3 are typical. Several freeware, shareware, and proprietary commercial lossless audio packing programs are available. 12.1 INTRODUCTION The Internet is increasingly being used as a means to deliver audio content to end-users for en­ tertainment, education, and commerce. It is clearly advantageous to minimize the time required to download an audio data file and the storage capacity required to hold it. Moreover, the expec­ tations of end-users with regard to signal quality, number of audio channels, meta-data such as song lyrics, and similar additional features provide incentives to compress the audio data. 12.1.1 Background In the past decade there have been significant breakthroughs in audio data compression using lossy perceptual coding [1]. These techniques lower the bit rate required to represent the signal by establishing perceptual error criteria, meaning that a model of human hearing perception is Copyright 2003. Elsevier Science (USA). 255 AU rights reserved. 256 PART III / APPLICATIONS used to guide the elimination of excess bits that can be either reconstructed (redundancy in the signal) orignored (inaudible components in the signal).
    [Show full text]
  • Comparison of Image Compressions: Analog Transformations P
    Proceedings Comparison of Image Compressions: Analog † Transformations P Jose Balsa P CITIC Research Center, Universidade da Coruña (University of A Coruña), 15071 A Coruña, Spain; [email protected] † Presented at the 3rd XoveTIC Conference, A Coruña, Spain, 8–9 October 2020. Published: 21 August 2020 Abstract: A comparison between the four most used transforms, the discrete Fourier transform (DFT), discrete cosine transform (DCT), the Walsh–Hadamard transform (WHT) and the Haar- wavelet transform (DWT), for the transmission of analog images, varying their compression and comparing their quality, is presented. Additionally, performance tests are done for different levels of white Gaussian additive noise. Keywords: analog image transformation; analog image compression; analog image quality 1. Introduction Digitized image coding systems employ reversible mathematical transformations. These transformations change values and function domains in order to rearrange information in a way that condenses information important to human vision [1]. In the new domain, it is possible to filter out relevant information and discard information that is irrelevant or of lesser importance for image quality [2]. Both digital and analog systems use the same transformations in source coding. Some examples of digital systems that employ these transformations are JPEG, M-JPEG, JPEG2000, MPEG- 1, 2, 3 and 4, DV and HDV, among others. Although digital systems after transformation and filtering make use of digital lossless compression techniques, such as Huffman. In this work, we aim to make a comparison of the most commonly used transformations in state- of-the-art image compression systems. Typically, the transformations used to compress analog images work either on the entire image or on regions of the image.
    [Show full text]
  • Data Compression
    Data Compression Data Compression Compression reduces the size of a file: ! To save space when storing it. ! To save time when transmitting it. ! Most files have lots of redundancy. Who needs compression? ! Moore's law: # transistors on a chip doubles every 18-24 months. ! Parkinson's law: data expands to fill space available. ! Text, images, sound, video, . All of the books in the world contain no more information than is Reference: Chapter 22, Algorithms in C, 2nd Edition, Robert Sedgewick. broadcast as video in a single large American city in a single year. Reference: Introduction to Data Compression, Guy Blelloch. Not all bits have equal value. -Carl Sagan Basic concepts ancient (1950s), best technology recently developed. Robert Sedgewick and Kevin Wayne • Copyright © 2005 • http://www.Princeton.EDU/~cos226 2 Applications of Data Compression Encoding and Decoding hopefully uses fewer bits Generic file compression. Message. Binary data M we want to compress. ! Files: GZIP, BZIP, BOA. Encode. Generate a "compressed" representation C(M). ! Archivers: PKZIP. Decode. Reconstruct original message or some approximation M'. ! File systems: NTFS. Multimedia. M Encoder C(M) Decoder M' ! Images: GIF, JPEG. ! Sound: MP3. ! Video: MPEG, DivX™, HDTV. Compression ratio. Bits in C(M) / bits in M. Communication. ! ITU-T T4 Group 3 Fax. Lossless. M = M', 50-75% or lower. ! V.42bis modem. Ex. Natural language, source code, executables. Databases. Google. Lossy. M ! M', 10% or lower. Ex. Images, sound, video. 3 4 Ancient Ideas Run-Length Encoding Ancient ideas. Natural encoding. (19 " 51) + 6 = 975 bits. ! Braille. needed to encode number of characters per line ! Morse code.
    [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]
  • Comparison Between (RLE and Huffman) Algorithmsfor Lossless Data Compression Dr
    Amin Mubarak Alamin Ibrahim* et al. (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH Volume No.3, Issue No.1, December – January 2015, 1808 – 1812. Comparison Between (RLE And Huffman) Algorithmsfor Lossless Data Compression Dr. AMIN MUBARK ALAMIN IBRAHIM Dr. MUSTAFA ELGILI MUSTAFA Department of mathematics Computer Science Department Faculty of Education Community College Shagra University Shaqra University Afif, Saudi Arabia Shaqra, Saudi Arabia Home affilation Assistant Professor, Faculty of Computer Science and Information Technology–Neelian University, Khartoum, Sudan Abstract: Multimedia field is distinguished from other areas of the need for massive storage volumes. This caused a lot of problems, particularly the speed of reading files when (transmission and reception) and increase the cost (up capacities petition) was to be the presence of ways we can get rid of these problems resulting from the increase Size was one of the successful solutions innovation algorithms to compress files. This paper aims to compare between (RLE and Huffman) algorithms which are also non- compression algorithms devoid texts, according to the standard file size. Propagated the comparison between the original file size and file size after compression using (RLE & HUFFMAN) algorithms for more than (30) text file. We used c++ program to compress the files and Microsoft excel program in the description analysis so as to calculate the compression ratio and others things. The study pointed to the effectiveness of the algorithm (HUFFMAN) in the process of reducing the size of the files. Keywords: RlE,Huffman I. INTRODUCTION compression), and the computational resources required to compress and uncompressed the In computer science and information theory, data data.[5] However, the most important reason for compression, source coding,[1] or bit-rate compressing data is that more and more we share reduction involves encoding information using data.
    [Show full text]
  • Source Coding Basics and Speech Coding
    Source Coding Basics and Speech Coding Yao Wang Polytechnic University, Brooklyn, NY11201 http://eeweb.poly.edu/~yao Outline • Why do we need to compress speech signals • Basic components in a source coding system • Variable length binary encoding: Huffman coding • Speech coding overview • Predictive coding: DPCM, ADPCM • Vocoder • Hybrid coding • Speech coding standards ©Yao Wang, 2006 EE3414: Speech Coding 2 Why do we need to compress? • Raw PCM speech (sampled at 8 kbps, represented with 8 bit/sample) has data rate of 64 kbps • Speech coding refers to a process that reduces the bit rate of a speech file • Speech coding enables a telephone company to carry more voice calls in a single fiber or cable • Speech coding is necessary for cellular phones, which has limited data rate for each user (<=16 kbps is desired!). • For the same mobile user, the lower the bit rate for a voice call, the more other services (data/image/video) can be accommodated. • Speech coding is also necessary for voice-over-IP, audio-visual teleconferencing, etc, to reduce the bandwidth consumption over the Internet ©Yao Wang, 2006 EE3414: Speech Coding 3 Basic Components in a Source Coding System Input Transformed Quantized Binary Samples parameters parameters bitstreams Transfor- Quanti- Binary mation zation Encoding Lossy Lossless Prediction Scalar Q Fixed length Transforms Vector Q Variable length Model fitting (Huffman, …... arithmetic, LZW) • Motivation for transformation --- To yield a more efficient representation of the original samples. ©Yao Wang, 2006 EE3414:
    [Show full text]
  • A Scalable High-Bandwidth Architecture for Lossless Compression on Fpgas
    A Scalable High-Bandwidth Architecture for Lossless Compression on FPGAs Jeremy Fowers∗, Joo-Young Kim∗ and Doug Burger∗ Scott Hauck∗y ∗Microsoft Research yDepartment of Electrical Engineering Redmond, WA, USA University of Washington, Seattle, WA, USA Abstract—Data compression techniques have been the subject [10] have suffered from low throughput performance. How- of intense study over the past several decades due to exponential ever, recent efforts from industrial vendors [11]–[14] have increases in the quantity of data stored and transmitted by demonstrated 10 GB/s and 4 GB/s lossless compression on computer systems. Compression algorithms are traditionally forced to make tradeoffs between throughput and compression ASICs and FPGAs, respectively, proving that these devices quality (the ratio of original file size to compressed file are indeed a compelling substrate for compression. These size). FPGAs represent a compelling substrate for streaming accelerators are useful for both higher throughput and for applications such as data compression thanks to their capacity alleviating the computational cost of compression from the for deep pipelines and custom caching solutions. Unfortunately, CPU. data hazards in compression algorithms such as LZ77 inhibit the creation of deep pipelines without sacrificing some amount While these new accelerators provide an order-of- of compression quality. In this work we detail a scalable fully magnitude throughput increase over modern CPUs, they are pipelined FPGA accelerator that performs LZ77 compression resource intensive and will not scale to significantly higher and static Huffman encoding at rates up to 5.6 GB/s. Further- more, we explore tradeoffs between compression quality and bandwidths on existing hardware.
    [Show full text]
  • A Scalable High-Bandwidth Architecture for Lossless Compression on Fpgas
    2015 IEEE 23rd Annual International Symposium on Field-Programmable Custom Computing Machines A Scalable High-Bandwidth Architecture for Lossless Compression on FPGAs ∗ ∗ ∗ Jeremy Fowers , Joo-Young Kim and Doug Burger Scott Hauck∗† ∗ Microsoft Research †Department of Electrical Engineering Redmond, WA, USA University of Washington, Seattle, WA, USA Abstract—Data compression techniques have been the subject [10] have suffered from low throughput performance. How- of intense study over the past several decades due to exponential ever, recent efforts from industrial vendors [11]–[14] have increases in the quantity of data stored and transmitted by demonstrated 10 GB/s and 4 GB/s lossless compression on computer systems. Compression algorithms are traditionally forced to make tradeoffs between throughput and compression ASICs and FPGAs, respectively, proving that these devices quality (the ratio of original file size to compressed file are indeed a compelling substrate for compression. These size). FPGAs represent a compelling substrate for streaming accelerators are useful for both higher throughput and for applications such as data compression thanks to their capacity alleviating the computational cost of compression from the for deep pipelines and custom caching solutions. Unfortunately, CPU. data hazards in compression algorithms such as LZ77 inhibit the creation of deep pipelines without sacrificing some amount While these new accelerators provide an order-of- of compression quality. In this work we detail a scalable fully magnitude throughput increase over modern CPUs, they are pipelined FPGA accelerator that performs LZ77 compression resource intensive and will not scale to significantly higher and static Huffman encoding at rates up to 5.6 GB/s.
    [Show full text]
  • Visually Lossless H.264 Compression of Natural Videos
    Visually Lossless H.264 Compression of Natural Videos Anish Mittal, Anush K. Moorthy and Alan C. Bovik Laboratory for Image and Video Engineering (LIVE), The University of Texas at Austin, Austin, Texas, USA. Email: [email protected] We performed a systematic evaluation of visually lossless (VL) threshold selection for H.264/AVC (Advanced Video Coding) compressed natural videos spanning a wide range of content and motion. A psychovisual study was conducted using a 2AFC (alternative forced choice) task design, where by a series of reference vs. compressed video pairs were displayed to the subjects, where bit rates were varied to achieve a spread in the amount of compression. A statistical analysis was conducted on this data to estimate the VL threshold. Based on the visual thresholds estimated from the observed human ratings, we learn a mapping from `perceptually relevant' statistical video features that capture visual lossless-ness, to statistically-determined VL threshold. Using this VL threshold, we derive an H.264 Compressibility Index. This new Compressibility Index is shown to correlate well with human subjective judgments of VL thresholds. We have also made the code for compressibility index available online [1] for its use in practical applications and facilitate future research in this area. Keywords: Visually lossless compression, psycho-visual study, visually lossless threshold, distorted video, H.264/AVC, compressibility index Received 01 March 2012 1. INTRODUCTION respectively), the HVS cannot record all possible shapes, colors, edges, motions, objects, and all of the A simple interpretation of the human visual system features of the visual world. Interpreting a continuum is that it functions akin to a camera, capturing the of light and information using a large number of world around us and transmitting the data onto the discrete neurons and photoreceptors has necessitated brain which in turn produces streams of visual stimuli the evolution of intelligent sampling and estimation that form a continuous narrative.
    [Show full text]
  • Application and Uses of Lossless Image Compression Techniques: a Review
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 07 Issue: 10 | Oct 2020 www.irjet.net p-ISSN: 2395-0072 Application and Uses of Lossless Image Compression Techniques: A Review Neeraja Sharma1, Prof. Rohit Bansal2, Prof. Ajeet Shrivastava3 1,2,3SISTEC-R, Bhopal (M.P) -------------------------------------------------------------------------***------------------------------------------------------------------------ Abstract: Image processing modifies pictures to improve, extract information and change their structure (composition, image editing and image compression etc.). The image may be handled by optical, photographic, but image processing industries commonly using digital and efficient computers that fixed our required problem very easily & accurate. Image compression is such type of process by which as a researcher or industry people we can reduce the redundancy in given image. After Image compression when we transmit our data through any network that is very efficient in terms of data consumption. If we want to store in any drive that will give better result as storage requirement. Here we are trying to define and explore different types of image compression techniques. During analysis of different algorithms, we find that Differential Pulse Code Modulation (DPCM) may give better result. 1. Introduction The objective of image compression is to reduce the redundancy of an image. Lossless compression is to reduce the redundancy of an image. Lossless compression method applies when data are critical and loss information is not acceptable. Medical image compressions are based on lossless compression method. Medical imaging is been used for diagnosis of diseases and surgical planning, and they need long-term storage for profiling patient’s data as well as efficient transmission for long diagnosis [1].
    [Show full text]