Skip to content
SPark
SPark

What ignites sp

  • Home
  • Reporting
  • Columns
  • Magazines
SPark
SPark

What ignites sp

Geekonic – Data Compression

Posted on September 13, 2017 By Team SPark

What is data compression?

Data compression is a set of steps for packing data into a smaller space by reducing the number of bits needed to represent data while allowing for the original data to be seen again.

Compressing data can save storage capacity, speed up file transfer, and decrease costs for storage hardware and network bandwidth.

The design of data compression schemes involves trade-offs among various factors, for example, the degree of compression, the amount of distortion introduced, the computational resources required for compression and decompression etc.

How compression works

Compression is performed by a program that uses a formula or algorithm to determine how to shrink the size of the data.

Data compression may be lossy or lossless.

  •    Lossless Compression:

Lossless compression enables the restoration of a file to its original state, without the loss of a single bit of data, when the file is decompressed.

It is done by eliminating data redundancy.  Data redundancy is a condition created within a database or data storage environment in which the same piece of data is held in multiple places.

By eliminating redundancy, you are left with just one instance of each bit of data.

For example, data containing “AAAAABBBB” can be compressed into “5A4B”. This type of compression is called “run-length encoding” because the “run” of a character is defined. In the above example, there are two runs: one of 5 A’s, another of 4 B’s.

However, run-length encoding only works on long pieces of the same value of data. If your data contains “ABBAABAAB”, run-length encoding would yield “1A2B2A1B2A1B”; which is longer than the original. Here another method can be used: checking how often a particular value comes up in the whole data package, called frequency compression.

The most common kind of frequency compression is called Huffman coding. The basic idea is to give each distinct value in a piece of data a code: more frequent values get shorter codes, less frequent ones get longer codes.

Lossless compression is the typical approach with executables, and text and spreadsheet files, where the loss of data would change the information.

Examples of lossless compression:

Archiving formats: Zip, GZip, bZip2, 7-Zip, etc.

Images/diagrams: GIF, PNG, PCX

Video: HEVC, MPEG-4 AVC

  •    Lossy compression

Lossy compression permanently eliminates bits of data that are redundant, unimportant or imperceptible.

Lossy compression is used for graphics, audio, video, and images, where the removal of some data bits has little or no discernible effect on the representation of the content.

A downside to this method is a reduction in quality if you compress the same file over and over again using the lossy method.

Examples of lossy compression:

Images: JPEG

Audio: MP3, Windows Media

Video: MPEG, DivX, Windows Video

  • Lossy vs Lossless

While the performance of lossless compression is measured by its degree of compression, lossy compression is evaluated on the basis of the error it introduces.

Several compression techniques are used today, for example, Burrows-Wheeler technique, Huffman encoding, Entropy encoding etc.

Most cannot stand on their own but must be combined together to form a compression algorithm. Examples of compression algorithms include LZW and its various improvisations, DEFLATE etc.

 

Geekonic

Post navigation

Previous post
Next post

Related Posts

Columns

Tech Trends 2019

Posted on September 4, 2019

In today’s rapidly modernising world, technology is assisting us in innumerable ways to create sustainable futures with enhanced degrees of comfort. Here’s presenting some innovations which took the world by storm in the past year: 1.Babel Fish Earbuds Hands down among the most incredible and audacious technologies ever created, the…

Read More
Columns

Hawk-Eye in Tennis

Posted on February 21, 2019

How the technology has revolutionized the sport in recent years “Line officials probably have as much future as newspapers” Scoring in tennis is based on accuracy of the shot among other factors such as topspin, power, timing etc. Hence, line officials are a crucial component in the sport of tennis….

Read More
Columns

Geekonic – Internet Beaming Drones

Posted on October 18, 2017

You’re probably reading this article via the good old internet, however at this very moment 4.3 billion people don’t have any sort of access to the World Wide Web.  While Europe has a connection rate of about 75%, the connection rate in Africa is closer to just 20%. Cabling the…

Read More

Recent Posts

  • SPark Magazine 2023-24
  • Agility Cup 2023: Unleashing Cricket Madness
  • Agility Cup 2023: Men’s Football Tournament
  • Code Housie 2023
  • Agility Cup 2023: Badminton Tournament

Recent Comments

No comments to show.

Archives

  • October 2024
  • February 2024
  • May 2023
  • January 2023
  • August 2022
  • July 2022
  • June 2022
  • March 2022
  • February 2022
  • December 2021
  • November 2021
  • May 2021
  • April 2021
  • March 2021
  • February 2021
  • January 2021
  • October 2020
  • September 2020
  • April 2020
  • March 2020
  • February 2020
  • January 2020
  • December 2019
  • November 2019
  • October 2019
  • September 2019
  • August 2019
  • July 2019
  • April 2019
  • March 2019
  • February 2019
  • January 2019
  • December 2018
  • November 2018
  • October 2018
  • September 2018
  • August 2018
  • July 2018
  • April 2018
  • March 2018
  • February 2018
  • January 2018
  • December 2017
  • November 2017
  • October 2017
  • September 2017
  • August 2017

Categories

  • Alumni
  • Ayntka
  • Columns
  • Creatives
  • Geekonic
  • Guest Article
  • Holiday articles
  • Magazines
  • Miscellaneous
  • Podcast
  • Recommends
  • Reporting
  • Sports
  • Trends
  • Uncategorized
©2026 SPark | WordPress Theme by SuperbThemes