DOCSLIB.ORG

Energy Efficiency in Wireless Sensor Networks, Through Data

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Energy Efficiency in Wireless Sensor Networks, Through Data Energy Efficiency in Wireless Sensor Networks, Through Data Compression Srod Karim Master’s Thesis, Autumn 2017 Abstract Wireless sensor networks are an ever-growing market in today’s society; Smart homes with wirelessly connected and controllable devices, continuous monitoring in environmental, health care and industrial settings, and automated, self-adjusting systems in homes and factories are all growing technologies that are built using wireless sensor networks. In many of these systems, energy consumption can be a major concern; Most devices in the network rely on small batteries as their energy source. Because of this, any energy usage optimization can lead to greatly increased lifetime. Often, radio communication between microcontrollers and other devices is the biggest energy drain in the system. Compression of sensor data before transfer between nodes can be used to reduce the energy consumed by the radio transmissions. By first compressing the data, it is possible to reduce the size of the message transmitted over radio, which in turn will lead to less energy consumed. However, energy is required to perform the compression and decompression. It can be important to have a good idea of when compression may be beneficial for the overall energy efficiency of a wireless sensor network, and when it might be better to send the data without compression. In this thesis we will look at typical properties of wireless sensor networks, wireless transfer protocols for sensor networks, and sensor data. We will analyze the effects of compressing sensor data before sending it over the network, and perform experiments and measurements in a simple wireless sensor network, to assess the effects data compression can have on the energy consumption in wireless sensor networks. i Acknowledgments My thanks go to my advisor Kjetil Østerås, who provided guidance, advice, proofreading, suggestions and general feedback, and for helping me all around throughout my thesis. I also want to thank Silicon Labs, for giving me the opportunity, and for providing me with the microcontrollers and tools required to perform the experiments. I also owe thanks to my advisor at the University of Oslo, Associate Professor Arne Maus, for providing guidance, and for giving feedback on the structure and content of this thesis. I would also like to thank Jonathan Ringstad for providing in depth proofreading and valuable feedback on the structure and wording of the text. ii Preface Overview In this thesis, we perform experiments and measurements to asses the effects of compression in wireless sensor networks. For this purpose, we have divided our thesis into 6 distinct chapters that each cover a aspect of our thesis. In chapter 1, we provide motivation for our thesis, and look at previous work in the field of energy efficiency in wireless sensor networks. In chapter 2, we look at Wireless sensor networks and wireless data transfer, including many factors that contribute to the overall energy usage of wireless transmissions. In chapter 3, we outline various encoding and compression algorithms that can be useful for wireless sensor networks, and create a basis for the algorithms we use for our experiments. In chapter 4, we explain the experiments we perform, and examine the algorithms and datasets we use for our experiments. In chapter 5, we look at the results from our experiments, and asses the effects compression has on energy usage in wireless sensor networks. Finally, in chapter 6 we discuss potential future work in the fields of energy efficient wireless data transfer. iii Contents 1 Introduction 1 1.1 Motivation . .1 1.2 Energy efficient hardware . .2 1.2.1 Energy efficient processors . .2 1.2.2 Energy efficient microcontrollers . .3 1.3 Energy efficient software . .4 1.3.1 Clockspeeds and dynamic speed scaling . .4 1.3.2 Parallelization and vectorization . .5 1.3.3 Wireless sensor networks and compression . .5 2 Wireless data transfer 7 2.1 Wireless sensor networks . .7 2.2 Energy usage in radio transmissions . .9 2.2.1 Energy calculations . .9 2.2.2 Transmission energy usage . 10 2.2.3 Network packets . 11 2.2.4 Receiver timing . 12 2.3 Wireless transfer protocols . 14 2.3.1 Wi-Fi . 16 2.3.2 Bluetooth . 16 2.3.3 ZigBee . 17 2.3.4 Proprietary Protocols . 17 3 Encoding and compression 18 3.1 Sensor Data . 19 3.2 Reducing range or precision . 20 3.3 Run-length encoding . 20 3.4 Delta encoding . 21 3.5 Huffman Encoding . 23 3.6 Arithmetic coding . 25 3.6.1 Prediction by partial matching . 27 3.7 Lempel–Ziv 77 . 28 iv Contents Energy efficiency in wireless sensor Section Contents networks, through data compression 3.8 Lempel–Ziv–Welch . 31 3.8.1 Sensor Lempel–Ziv–Welch . 34 3.8.2 Lempel–Ziv–Welch with minicache . 34 4 Experiments 36 4.1 Compression algorithms . 36 4.1.1 Delta encoding . 36 4.1.2 Variable-width delta encoding . 37 4.1.3 Snappy . 40 4.1.4 LZ4 . 41 4.1.5 LZW . 41 4.1.6 PPMs . 42 4.1.7 fpaq0 . 42 4.2 Datasets . 43 4.2.1 Relative humidity . 43 4.2.2 Sea surface temperature . 45 4.2.3 Mixed data . 46 4.3 Experiments . 47 4.3.1 Compression efficiency . 47 4.3.2 Energy cost of compression . 48 5 Results and Conclusion 51 5.1 Compression efficiency . 51 5.1.1 Results . 51 5.1.2 Conclusion . 55 5.2 Energy cost of compression . 57 5.2.1 Results . 57 5.2.2 Conclusion . 76 5.3 Summary . 78 6 Future work 79 6.1 Compression algorithms . 79 6.2 Retained compression information . 80 6.3 Struct delta encoding . 80 7 Appendix 84 7.1 Results . 84 7.1.1 Experiment 1 . 84 7.1.2 Experiment 2 . 88 v Introduction 1.1 Motivation Energy consumption is an emerging topic in the field of computer science. Excessive production and consumption of electricity can have hazardous effects on the environment, due to the use of non renewable energy sources. Energy consumption is also a big concern for many companies with focus on computation and IT. Power consumption has been a design constraint for many businesses, most importantly due to the high monetary costs of supplying power. The electricity costs of modern computers have become one of the biggest strains on the budget of many firms and data centers. In 2005, Google engineer Luiz André Barosso published an article in which he analyzed the performance costs of their computer severs. In this article he stated that electricity costs made up for roughly one third of the total cost of running the servers. He additionally theorized that energy costs could end up becoming the most expensive part of maintaining a computer server by the end of the decade, even more expensive than the cost of the computer hardware[1]. Energy consumption is also a major concern in mobile, battery-driven devices. For laptops and phones, long battery times are an important feature. Yet, it can be hard to maintain long battery times, given the power consumption of the various components of modern laptops and phones[2][3]. Phones are not the only mobile devices that depend on getting energy through battery usage, as more and more devices using microcontrollers are being produced. Microcontrollers are small processors used in a variety of fields. These include remote controls, power tools, toys, office machines and automatically controlled products and devices such as sensor networks, control systems and implantable medical devices, as well as other embedded systems. Given their small structure and autonomous nature, they tend to be heavily power constrained. Many microcontrollors reside in locations that are hard to access, such as 1 Chapter 1. Introduction Energy efficiency in wireless sensor Section 1.2. Energy efficient hardware networks, through data compression medicinal devices implanted in the body, or distributed sensor networks operating in forests, seas, and other locations far from civilization. In some cases, the changing of batteries for these products can be a difficult or maybe even impossible task, further underlining the importance of energy conservation. Additionally, microcontrollers in IoT devices and wireless sensor networks in homes aim to be easily installable, without requiring rewiring by electricians or drawing long extension cords, and therefore have to rely on batteries. Finally, a lot of devices operating on microcontrollers are intended to reduce energy consumption in larger systems, such as smart light bulbs that automatically turn on and off when people enter and leave the room, and that adjusts brightness depending on the time of day. It is of course important that the microcontrollers are are energy efficient as well, to reduce the overall energy consumption in the system. In this thesis, we want to add to the scientific knowledge of energy consumption in mobile devices, with focus on wireless sensor networks. We want to measure the energy consumption of data transfer in wireless sensor networks, and asses how this property is affected by using compression algorithms to compress data before transfer. 1.2 Energy efficient hardware Due to the importance of power consumption, and the benefits energy efficiency can have, there has emerged a market for the design and production of energy friendly solutions in large portions of the computer science landscape. There is a constant flow of newer and more effective hardware and software designed with energy consumption in mind; tools, peripherals, code and even specifications are being made to be more energy-aware. Perhaps most important is the development of energy efficient Central Processing Units (CPUs), as these can be the most energy hungry part of any microcontroller. With the rise of the Internet Of Things (IoT) and smart devices, there has been a rise to the energy friendly processors market.
Load more

Recommended publications
  • Data Compression: Dictionary-Based Coding 2 / 37 Dictionary-Based Coding Dictionary-Based Coding
    Dictionary-based Coding already coded not yet coded search buffer look-ahead buffer cursor (N symbols) (L symbols) We know the past but cannot control it. We control the future but... Last Lecture Last Lecture: Predictive Lossless Coding Predictive Lossless Coding Simple and effective way to exploit dependencies between neighboring symbols / samples Optimal predictor: Conditional mean (requires storage of large tables) Affine and Linear Prediction Simple structure, low-complex implementation possible Optimal prediction parameters are given by solution of Yule-Walker equations Works very well for real signals (e.g., audio, images, ...) Efficient Lossless Coding for Real-World Signals Affine/linear prediction (often: block-adaptive choice of prediction parameters) Entropy coding of prediction errors (e.g., arithmetic coding) Using marginal pmf often already yields good results Can be improved by using conditional pmfs (with simple conditions) Heiko Schwarz (Freie Universität Berlin) — Data Compression: Dictionary-based Coding 2 / 37 Dictionary-based Coding Dictionary-Based Coding Coding of Text Files Very high amount of dependencies Affine prediction does not work (requires linear dependencies) Higher-order conditional coding should work well, but is way to complex (memory) Alternative: Do not code single characters, but words or phrases Example: English Texts Oxford English Dictionary lists less than 230 000 words (including obsolete words) On average, a word contains about 6 characters Average codeword length per character would be limited by 1
    [Show full text]
  • Schematic Entry
    Schematic Entry Copyrights Software, documentation and related materials: Copyright © 2002 Altium Limited This software product is copyrighted and all rights are reserved. The distribution and sale of this product are intended for the use of the original purchaser only per the terms of the License Agreement. This document may not, in whole or part, be copied, photocopied, reproduced, translated, reduced or transferred to any electronic medium or machine-readable form without prior consent in writing from Altium Limited. U.S. Government use, duplication or disclosure is subject to RESTRICTED RIGHTS under applicable government regulations pertaining to trade secret, commercial computer software developed at private expense, including FAR 227-14 subparagraph (g)(3)(i), Alternative III and DFAR 252.227-7013 subparagraph (c)(1)(ii). P-CAD is a registered trademark and P-CAD Schematic, P-CAD Relay, P-CAD PCB, P-CAD ProRoute, P-CAD QuickRoute, P-CAD InterRoute, P-CAD InterRoute Gold, P-CAD Library Manager, P-CAD Library Executive, P-CAD Document Toolbox, P-CAD InterPlace, P-CAD Parametric Constraint Solver, P-CAD Signal Integrity, P-CAD Shape-Based Autorouter, P-CAD DesignFlow, P-CAD ViewCenter, Master Designer and Associate Designer are trademarks of Altium Limited. Other brand names are trademarks of their respective companies. Altium Limited www.altium.com Table of Contents chapter 1 Introducing P-CAD Schematic P-CAD Schematic Features ................................................................................................1 About
    [Show full text]
  • Word-Based Text Compression
    WORD-BASED TEXT COMPRESSION Jan Platoš, Jiří Dvorský Department of Computer Science VŠB – Technical University of Ostrava, Czech Republic {jan.platos.fei, jiri.dvorsky}@vsb.cz ABSTRACT Today there are many universal compression algorithms, but in most cases is for specific data better using specific algorithm - JPEG for images, MPEG for movies, etc. For textual documents there are special methods based on PPM algorithm or methods with non-character access, e.g. word-based compression. In the past, several papers describing variants of word- based compression using Huffman encoding or LZW method were published. The subject of this paper is the description of a word-based compression variant based on the LZ77 algorithm. The LZ77 algorithm and its modifications are described in this paper. Moreover, various ways of sliding window implementation and various possibilities of output encoding are described, as well. This paper also includes the implementation of an experimental application, testing of its efficiency and finding the best combination of all parts of the LZ77 coder. This is done to achieve the best compression ratio. In conclusion there is comparison of this implemented application with other word-based compression programs and with other commonly used compression programs. Key Words: LZ77, word-based compression, text compression 1. Introduction Data compression is used more and more the text compression. In the past, word- in these days, because larger amount of based compression methods based on data require to be transferred or backed-up Huffman encoding, LZW or BWT were and capacity of media or speed of network tested. This paper describes word-based lines increase slowly.
    [Show full text]
  • The Basic Principles of Data Compression
    The Basic Principles of Data Compression Author: Conrad Chung, 2BrightSparks Introduction Internet users who download or upload files from/to the web, or use email to send or receive attachments will most likely have encountered files in compressed format. In this topic we will cover how compression works, the advantages and disadvantages of compression, as well as types of compression. What is Compression? Compression is the process of encoding data more efficiently to achieve a reduction in file size. One type of compression available is referred to as lossless compression. This means the compressed file will be restored exactly to its original state with no loss of data during the decompression process. This is essential to data compression as the file would be corrupted and unusable should data be lost. Another compression category which will not be covered in this article is “lossy” compression often used in multimedia files for music and images and where data is discarded. Lossless compression algorithms use statistic modeling techniques to reduce repetitive information in a file. Some of the methods may include removal of spacing characters, representing a string of repeated characters with a single character or replacing recurring characters with smaller bit sequences. Advantages/Disadvantages of Compression Compression of files offer many advantages. When compressed, the quantity of bits used to store the information is reduced. Files that are smaller in size will result in shorter transmission times when they are transferred on the Internet. Compressed files also take up less storage space. File compression can zip up several small files into a single file for more convenient email transmission.
    [Show full text]
  • Lzw Compression and Decompression
    LZW COMPRESSION AND DECOMPRESSION December 4, 2015 1 Contents 1 INTRODUCTION 3 2 CONCEPT 3 3 COMPRESSION 3 4 DECOMPRESSION: 4 5 ADVANTAGES OF LZW: 6 6 DISADVANTAGES OF LZW: 6 2 1 INTRODUCTION LZW stands for Lempel-Ziv-Welch. This algorithm was created in 1984 by these people namely Abraham Lempel, Jacob Ziv, and Terry Welch. This algorithm is very simple to implement. In 1977, Lempel and Ziv published a paper on the \sliding-window" compression followed by the \dictionary" based compression which were named LZ77 and LZ78, respectively. later, Welch made a contri- bution to LZ78 algorithm, which was then renamed to be LZW Compression algorithm. 2 CONCEPT Many files in real time, especially text files, have certain set of strings that repeat very often, for example " The ","of","on"etc., . With the spaces, any string takes 5 bytes, or 40 bits to encode. But what if we need to add the whole string to the list of characters after the last one, at 256. Then every time we came across the string like" the ", we could send the code 256 instead of 32,116,104 etc.,. This would take 9 bits instead of 40bits. This is the algorithm of LZW compression. It starts with a "dictionary" of all the single character with indexes from 0 to 255. It then starts to expand the dictionary as information gets sent through. Pretty soon, all the strings will be encoded as a single bit, and compression would have occurred. LZW compression replaces strings of characters with single codes. It does not analyze the input text.
    [Show full text]
  • Randomized Lempel-Ziv Compression for Anti-Compression Side-Channel Attacks
    Randomized Lempel-Ziv Compression for Anti-Compression Side-Channel Attacks by Meng Yang A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Applied Science in Electrical and Computer Engineering Waterloo, Ontario, Canada, 2018 c Meng Yang 2018 I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract Security experts confront new attacks on TLS/SSL every year. Ever since the compres- sion side-channel attacks CRIME and BREACH were presented during security conferences in 2012 and 2013, online users connecting to HTTP servers that run TLS version 1.2 are susceptible of being impersonated. We set up three Randomized Lempel-Ziv Models, which are built on Lempel-Ziv77, to confront this attack. Our three models change the determin- istic characteristic of the compression algorithm: each compression with the same input gives output of different lengths. We implemented SSL/TLS protocol and the Lempel- Ziv77 compression algorithm, and used them as a base for our simulations of compression side-channel attack. After performing the simulations, all three models successfully pre- vented the attack. However, we demonstrate that our randomized models can still be broken by a stronger version of compression side-channel attack that we created. But this latter attack has a greater time complexity and is easily detectable. Finally, from the results, we conclude that our models couldn't compress as well as Lempel-Ziv77, but they can be used against compression side-channel attacks.
    [Show full text]
  • Lossless Compression of Internal Files in Parallel Reservoir Simulation
    Lossless Compression of Internal Files in Parallel Reservoir Simulation Suha Kayum Marcin Rogowski Florian Mannuss 9/26/2019 Outline • I/O Challenges in Reservoir Simulation • Evaluation of Compression Algorithms on Reservoir Simulation Data • Real-world application - Constraints - Algorithm - Results • Conclusions 2 Challenge Reservoir simulation 1 3 Reservoir Simulation • Largest field in the world are represented as 50 million – 1 billion grid block models • Each runs takes hours on 500-5000 cores • Calibrating the model requires 100s of runs and sophisticated methods • “History matched” model is only a beginning 4 Files in Reservoir Simulation • Internal Files • Input / Output Files - Interact with pre- & post-processing tools Date Restart/Checkpoint Files 5 Reservoir Simulation in Saudi Aramco • 100’000+ simulations annually • The largest simulation of 10 billion cells • Currently multiple machines in TOP500 • Petabytes of storage required 600x • Resources are Finite • File Compression is one solution 50x 6 Compression algorithm evaluation 2 7 Compression ratio Tested a number of algorithms on a GRID restart file for two models 4 - Model A – 77.3 million active grid blocks 3.5 - Model K – 8.7 million active grid blocks 3 - 15.6 GB and 7.2 GB respectively 2.5 2 Compression ratio is between 1.5 1 compression ratio compression - From 2.27 for snappy (Model A) 0.5 0 - Up to 3.5 for bzip2 -9 (Model K) Model A Model K lz4 snappy gzip -1 gzip -9 bzip2 -1 bzip2 -9 8 Compression speed • LZ4 and Snappy significantly outperformed other algorithms
    [Show full text]
  • Dictionary Based Compression for Images
    INTERNATIONAL JOURNAL OF COMPUTERS Issue 3, Volume 6, 2012 Dictionary Based Compression for Images Bruno Carpentieri Ziv and Lempel in [1]. Abstract—Lempel-Ziv methods were original introduced to By limiting what could enter the dictionary, LZ2 assures compress one-dimensional data (text, object codes, etc.) but recently that there is at most one instance for each possible pattern in they have been successfully used in image compression. the dictionary. Constantinescu and Storer in [6] introduced a single-pass vector Initially the dictionary is empty. The coding pass consists of quantization algorithm that, with no training or previous knowledge of the digital data was able to achieve better compression results with searching the dictionary for the longest entry that is a prefix of respect to the JPEG standard and had also important computational a string starting at the current coding position. advantages. The index of the match is transmitted to the decoder using We review some of our recent work on LZ-based, single pass, log N bits, where N is the current size of the dictionary. adaptive algorithms for the compression of digital images, taking into 2 account the theoretical optimality of these approach, and we A new pattern is introduced into the dictionary by experimentally analyze the behavior of this algorithm with respect to concatenating the current match with the next character that the local dictionary size and with respect to the compression of bi- has to be encoded. level images. The dictionary of LZ2 continues to grow throughout the coding process. Keywords—Image compression, textual substitution methods.
    [Show full text]
  • A Software Tool for Data Compression Using the LZ77 ("Sliding Window") Algorithm Student Authors: Vladan R
    A Software Tool for Data Compression Using the LZ77 ("Sliding Window") Algorithm Student authors: Vladan R. Djokić1, Miodrag G. Vidojković1 Mentors: Radomir S. Stanković2, Dušan B. Gajić2 Abstract – Data compression is a field of computer science that close the paper with some conclusions in the final section. is always in need of fast algorithms and their efficient implementations. Lempel-Ziv algorithm is the first which used a dictionary method for data compression. In this paper, we II. LEMPEL-ZIV ALGORITHM present the software implementation of this so-called "sliding window" method for compression and decompression. We also include experimental results considering data compression rate A. Theoretical basis and running time. This software tool includes a graphical user interface and is meant for use in educational purposes. The Lempel-Ziv algorithm [1] is an algorithm for lossless data compression. It is actually a whole family of algorithms, Keywords – Lempel-Ziv algorithm, C# programming solution, (see Figure 1) stemming from the two original algorithms that text compression. were first proposed by Jacob Ziv and Abraham Lempel in their landmark papers in 1977. [1] and 1978. [2]. LZ77 and I. INTRODUCTION LZ78 got their name by year of publishing. The Lempel-Ziv algorithms belong to adaptive dictionary While reading a book it is noticeable that some words are coders [1]. On start of encoding process, dictionary does not repeating very often. In computer world, textual files exist. The dictionary is created during encoding. There is no represent those books and same logic may be applied there. final state of dictionary and it does not have fixed size.
    [Show full text]
  • A Survey on Different Compression Techniques Algorithm for Data Compression Ihardik Jani, Iijeegar Trivedi IC
    International Journal of Advanced Research in ISSN : 2347 - 8446 (Online) Computer Science & Technology (IJARCST 2014) Vol. 2, Issue 3 (July - Sept. 2014) ISSN : 2347 - 9817 (Print) A Survey on Different Compression Techniques Algorithm for Data Compression IHardik Jani, IIJeegar Trivedi IC. U. Shah University, India IIS. P. University, India Abstract Compression is useful because it helps us to reduce the resources usage, such as data storage space or transmission capacity. Data Compression is the technique of representing information in a compacted form. The actual aim of data compression is to be reduced redundancy in stored or communicated data, as well as increasing effectively data density. The data compression has important tool for the areas of file storage and distributed systems. To desirable Storage space on disks is expensively so a file which occupies less disk space is “cheapest” than an uncompressed files. The main purpose of data compression is asymptotically optimum data storage for all resources. The field data compression algorithm can be divided into different ways: lossless data compression and optimum lossy data compression as well as storage areas. Basically there are so many Compression methods available, which have a long list. In this paper, reviews of different basic lossless data and lossy compression algorithms are considered. On the basis of these techniques researcher have tried to purpose a bit reduction algorithm used for compression of data which is based on number theory system and file differential technique. The statistical coding techniques the algorithms such as Shannon-Fano Coding, Huffman coding, Adaptive Huffman coding, Run Length Encoding and Arithmetic coding are considered.
    [Show full text]
  • Enhanced Data Reduction, Segmentation, and Spatial
    ENHANCED DATA REDUCTION, SEGMENTATION, AND SPATIAL MULTIPLEXING METHODS FOR HYPERSPECTRAL IMAGING LEANNA N. ERGIN Bachelor of Forensic Chemistry Ohio University June 2006 Submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY IN BIOANALYTICAL CHEMISTRY at the CLEVELAND STATE UNIVERSITY July 19th, 2017 We hereby approve this dissertation for Leanna N. Ergin Candidate for the Doctor of Philosophy in Clinical-Bioanalytical Chemistry degree for the Department of Chemistry and CLEVELAND STATE UNIVERSITY College of Graduate Studies ________________________________________________ Dissertation Committee Chairperson, Dr. John F. Turner II ________________________________ Department/Date ________________________________________________ Dissertation Committee Member, Dr. David W. Ball ________________________________ Department/Date ________________________________________________ Dissertation Committee Member, Dr. Petru S. Fodor ________________________________ Department/Date ________________________________________________ Dissertation Committee Member, Dr. Xue-Long Sun ________________________________ Department/Date ________________________________________________ Dissertation Committee Member, Dr. Yan Xu ________________________________ Department/Date ________________________________________________ Dissertation Committee Member, Dr. Aimin Zhou ________________________________ Department/Date Date of Defense: July 19th, 2017 Dedicated to my husband, Can Ergin. ACKNOWLEDGEMENT I would like to thank my advisor,
    [Show full text]
  • Effective Variations on Opened GIF Format Images
    70 IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.5, May 2008 Effective Variations on Opened GIF Format Images Hamza A. Ali1† and Bashar M. Ne’ma2††, Isra Private University, Amman, JORDAN Picture Format (Pict), Portable Network Graphic Summary (PNG), Photoshop native file (PSD), PCX from Zsoft, The CompuServe GIF format and the LZW compression method Kodac PCD. Usually scanners and digital cameras used to compress image data in this format is investigated in this acquire images in bitmapped formats. paper. Because of its better compression and greater color depth, JPEG has generally replaced GIF for photographic images. - Vector formats: images are a series of pixels that are Thorough study and discussion on GIF format images is carried "turned on" based on a mathematical formula. They are out in details in this work. Although, opening the header of GIF format images is difficult to achieve, we opened this format and basically defined by shapes and lines with no more studied all acceptable variations which may be have influence on than 256 colors. They are not resolution dependent, the viewing of any GIF format images. To get appropriate results, infinitely scalable and not appropriate for photo all practical is carried out via both Object Oriented Programming realistic images. Examples of vector file formats are (OOP) and concepts of software engineering tools. Windows Metafile Format (MWF), PostScript Format, Portable Document Format (PDF), and Computer Key words: Graphic Metafile (CGM). GIF format, Image Header, Image processing, LZW, Compression, Software Engineering Tools, and Security. In the rest of this section, a short definition is included for the most widely used computer graphic formats.
    [Show full text]