International Journal of Engineering Sciences
Total Page:16
File Type:pdf, Size:1020Kb
[Mahalakshmi, 3(10): October, 2014] ISSN: 2277-9655 Scientific Journal Impact Factor: 3.449 (ISRA), Impact Factor: 2.114 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Data Compression in Multimedia (Text,Image,Audio and Video) R.Mahalakshmi*, S.K.Mahendran *Department of Compter Science,Madurai Kamaraj University College, India Department of Computer Science, Bharathiar University, India Abstracts Multimedia files are large and consume lots of hard disk space. The files size makes it time-consuming to move them from place to place over school networks or to distribute over the Internet. Compression shrinks files, making them smaller and more practical to store and share. Compression works by removing repetitious or redundant information, effectively summarizing the contents of a file in a way that preserves as much of the original meaning as possible. Keywords: data compression algorithm, text, image, audio and video. Introduction Beginning in the 1980s, the capacity and speed of for multimedia has reached it next generation to provide storage devices have been tremendously improving. smooth service even Today, new kinds of cheaper and more efficient memory in unreliable network infrastructure. devices are constantly emerging. Nevertheless, as files Data Compression shrinks down a file so that it become too large, it is helpful if we could somehow takes up less space. This is desirable for data storage and encode them into a smaller size and restore them back data communication. Storage space on disks is when needed later. That way, we can avail more of our expensive so a file which occupies less disk space is storage media like diskettes, hard disks, CDs, USB Flash cheaper than an uncompressed file. Smaller files are Disks, and tapes. Most data that we store in our computer also desirable for data communication, because the devices are digital each unit of information packed in smaller a file the faster it can be transferred. binary form. This binary nature of the source is how much information it really contains, and which better way to represent that information in a smaller number of binary digits, or bits. The compressed file is ultimately a concatenation of thousands or even millions of bit strings. Clearly, the cost of sending data over communications networks is minimized if the files are highly compressed. Data compression Data compression is the process of encoding data Figure 1: Examples of data compressed as digital like 1’s using a representation that reduces the overall size of and 0.s to reduce the space data. This reduction is possible when the original dataset . A compressed file appears to increase the speed of contains some type of redundancy. Data data transfer over an uncompressed file. Data compression, also called compaction, the process of compression involves a certain amount of raw data being reducing the amount of data needed for the storage or processed and stored in a much more compact form. The transmission of a given piece of information, typically processing is done by computer applications that use by the use of encoding techniques. Multimedia specific compression algorithms. There are many of compression is employing tools and techniques in order these, each with its own strengths and weaknesses and to reduce the file size of various media formats. With the particular areas where they are used. development of World Wide Web the importance of compress algorithm was highlighted because it performs Compression and decompression faster in networks due to its highly reduced file Compressing a file is the process by which a large size. Furthermore with the popularity of voice and video file is converted to a smaller file, such as a 10 KB conferencing over the internet, compression method (Kilobyte or 1000 bytes) file converted to a 1 KB file. http: // www.ijesrt.com (C)International Journal of Engineering Sciences & Research Technology [376] [Mahalakshmi, 3(10): October, 2014] ISSN: 2277-9655 Scientific Journal Impact Factor: 3.449 (ISRA), Impact Factor: 2.114 Decompressing a file is the process by which a Data compression algorithms compressed file is converted back to its standard state, The compression methods can be classified broadly such as if our 1 KB file were converted back to a 10 KB into lossy or lossless compression. Lossy compression file. The process by which files are compressed and can achieve a high compression ratio, 50:1 or higher, decompressed are defined in algorithms, of which there since it allows some acceptable degradation. Yet it are many. These algorithms are programmed into codecs cannot completely recover the original data. On the other (COmpression/DECompression) and used by your hand, lossless compression can completely recover the operating system or software programs to access these original data but this reduces the compression ratio to files. The block diagram of compression and around 2:1.Lossy compression is most commonly used decompression as show below. to compress multimedia data (audio, video, and still images), especially in applications such as streaming media and internet telephony. By contrast, lossless compression is typically required for text and data files, such as bank records and text articles. A. Lossless Compression Lossless compression is a class of data compression algorithms that allows the exact original data to be reconstructed from the compressed data. The term Figure 2: Structure of compression and decompression lossless is in contrast to lossy data compression, which Compression is the reduction in size of data in order only allows an approximation of the original data to be to save space or transmission time. For data reconstructed, in exchange for better compression rates. transmission, compression can be performed on just the Most lossless compression programs do two things in data content or on the entire transmission unit depending sequence: the first step generates a statistical model for on a number of factors. Content compression can be as the input data, and the second step uses this model to simple as removing all extra space characters, inserting map input data to bit sequences in such a way that a single repeat character to indicate a string of repeated "probable" data will produce shorter output than characters, and substituting smaller bit strings for "improbable" data. Refers to data compression frequently occurring characters. This kind of techniques in which no data is lost. compression can reduce a text file to 50% of its original B. Lossy compression. size. Compression is performed by a program that uses Lossy compression technologies attempt to a formula or algorithm to determine how to compress or eliminate redundant or unnecessary information. Most decompress data. video compression technologies, such as MPEG, use a A simple characterization of data compression is lossy technique. Is a data encoding method which that it involves transforming a string of characters in discards some of the data, in order to achieve its goal, some representation such as ASCII into a new string of with the result that decompressing the data yields bits, which contains the same information but whose content that is different from the original, though similar length is as small as possible. Data compression has enough to be useful in some way. Lossy compression is important application in the areas of data transmission most commonly used to compress multimedia data and data storage. Many data processing applications (audio, video, still images), especially in applications require storage of large volumes of data, and the number such as streaming media and internet telephony. Lossy of such applications is constantly increasing as the use compression formats suffer from generation loss: of computers extends to new disciplines. At the same repeatedly compressing and decompressing the file will time, the proliferation of computer communication cause it to progressively lose quality. This is in contrast networks is resulting in massive transfer of data over with lossless data compression. communication links. Compressing data to be stored or C. Lossless Compression Algorithms transmitted reduces storage and/or communication costs. There will be no data loss in this type of When the amount of data to be transmitted is reduced, compression as it is defined by the name. Both original the effect is that of increasing the capacity of the data and the compressed data are the same in this communication channel. Similarly, compressing a file to compression. The algorithms for the compression and half of its original size is equivalent to doubling the decompression are exact inverse of each other in the capacity of the storage medium. It may then become Lossless Compression. The main mechanism in this feasible to store the data at a higher, thus faster, level of compression is removing the redundant data in the the storage hierarchy and reduce the load on the compression and adding them in the decompression. The input/output channels of the computer system. methods are http: // www.ijesrt.com (C)International Journal of Engineering Sciences & Research Technology [377] [Mahalakshmi, 3(10): October, 2014] ISSN: 2277-9655 Scientific Journal Impact Factor: 3.449 (ISRA), Impact Factor: 2.114 Run Length Encoding In this process, images are converted to the Huffman Coding mathematical functions. Discreet Cosine Lempel Ziv Encoding Transformation uses series of cosine functions to Advantages: The original format of the data remains approximate image. This technique is used with JPEG, even it is compressed. MPEG1 and MPEG 2 formats. A wavelet function is Disadvantages: Reduction of the size of the data is a used to approximate the image. This can be used with small. Sometimes the size can increase instead of the JPEG 2000 and MPEG 4 formats. decrease. ii. JPEG Encoding i. Run-length Encoding In this encoding, an image is represented by a two Run-length encoding can be named as the simplest dimensional array of pixels.