DOCSLIB.ORG

A Survey of Various Data Compression Techniques

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Survey of Various Data Compression Techniques A Survey of Various Data Compression Techniques Charles Alexander Smith April 1, 2010 1 Introduction This paper is a survey of various methods of data compression. When the computer age came about in the 1940's, storage space became an issue. Data compression was the answer to that problem. The compression process takes an original data set and reduces its size by taking out unnecessary data. There are two main types of compression, lossy and lossless. This paper will deal exclusively with lossy compression. So, through the compression/decompression algorithm, some data from the original file is deleted and not recovered. There are many methods of compression, and this paper will go into depth about compression using Fourier Transformations and Wavelet Compression. Each of these methods has strengths and weaknesses in regards to different types of file; the paper will also cover those aspects of the two methods. 2 Background 2.1 History The beginnings of data compression began as early as 1838 with its use is morse code.1 Letters that were common in English were given shorter codes to save time as the messages were being typed.1 Over 100 years later, as the computer ago was on the rise, this simple morse code method, was built upon and became a study that is known as Information Theory. However, even before Information Theory, a mathematician by the name of Joseph Fourier observed that \any sufficiently smooth function could be decomposed into sums of sine waves with frequencies corresponding to successive integers."2 Fourier's method was applied to sounds. After breaking a function into frequencies, Fourier was able to drop the highest and lowest frequencies, but keep the rest. This change was unable to be heard by the human ear, and space was able to be saved during recordings. This methodology is still used today in Compression algorithms. This method was also applied to images in the 1950's, in the attempt to decrease the amount of data that needed to be sent to television; however, no solution was given at that time. In fact, it took another 30 years until the notion of image compression became prevelant in mainstream technology.2 The area of Wavelet Compression was founded by Alfred Haar, a Hungarian Mathematician, in the early 20th Century.3 Haar created the first known wavelet, which is now known as a Haar Wavelet. This area of compression has grown rapidly since the 1970's when interest in Wavelets and their uses began to spread through the mathematical field. Fractal compression is a lossy image compression, which is has proven to be more efficient than image compression using Fourier transformations. In 1987, Michael Barnsley was at the top of field in the development of fractal compression, and currently has many patents on the algorithms.4 Fractal Compression has incredible compression ratios, which is an attractive aspect to much commercial use, especially to companies that transfer much data over the internet. Many companies, from Microsoft to NetFlix, now use this type of algorithm. Without this method, streaming information over the internet would take many times longer. Although Compressive Sensing has been studied for over 40 years, it did not see significant strides until 2004.5 At that time, a mathematician, by the name of Emmanuel J. Candes, was performing research with magnetic resonance imaging.5 He found that an image could be reconstructed even when the data seemed insufficient by the Nyquist-Shannon criterion.5 This criterion states that any bandlimited signal can be reconstructed if the sampling rate, per second, is greater than twice the 1 highest frequency in the original file.6 With this finding, the area of compressive sensing exploded, and is a current hot-spot in Information Theory. 2.2 Mathematical Background In order for us to understand the theory behind compression and decompression, it is necessary to recall several key ideas from Linear Algebra. These underlying ideas make the compression process n possible. Let β = fb1; b2; ··· ; bkg be a set of vectors in C . We say that a linear combination of these vectors is any expression of the form c1b1 + c2b2 + ··· + ckbk where c1; c2; : : : ; ck are scalars. A set of vectors are linearly independent if k X cjbj = 0 implies that cj = 0 for all j = 1; 2; : : : ; k. j=1 Additionally, the set of all linear combinations of the vectors in β is called the span of β.A basis is a set of vectors that are both linearly independent and spanning. The conjugate of a complex number z = a + bi will be denoted by z = a − bi. If B is an n × k matrix with complex entries, B = (bj;l : j = 1; 2; : : : ; n; l = 1; 2; : : : k; ) then the conjugate transpose of B is the k × n matrix B∗ given by ∗ B = bl;j : l = 1; 2; : : : k; j = 1; 2; : : : ; n : The inner product of two vectors bj and bl is defined by ∗ (bj; bl) = bl bj Note that the inner product of two vectors is a single complex number. Two vectors are said to be orthogonal if their inner product is equal to zero. A set of non-zero vectors is said to be orthogonal if every pair of distinct vectors from it are orthogonal. The length or norm of a vector b is defined by p kbk = b∗b: A set β of non-zero vectors is said to be orthonormal if β is orthogonal and the length of each vector in β is one. Theorem 1. If fb1 ··· bkg is orthogonal, then fb1 ··· bkg is linearly independent. Proof. First, assume that c1b1 + ··· + ckbk = 0. To show linear independence, we must show that c1 = c2 = ··· = cn = 0. To do this, fix a j 2 f1; 2; ··· ; ng. Now, compute the inner product of our ∗ first equation with bj . ∗ ∗ bj (c1b1 + ··· + cjbj + ··· + ckbk) = bj 0 Using the distributive law, we obtain the simplified equation ∗ ∗ ∗ c1bj b1 + ··· + cjbj bj + ··· + ckbj bk = 0 (1) And by orthogonality, ( ∗ 0 if j 6= l bj bl = 2 kbjk if j = l So, using this information in conjunction with (1), 2 c1 (0) + ··· + cj kbjk + ··· + ck (0) = 0 2 This shows that cj kbjk = 0; however, since we know that bj is nonzero, it must be true that cj = 0. And, since j was arbitrary in f1; 2; ··· ; kg, we have completed our proof. 2 n n Corollary 1. If fb1 ··· bng is an orthogonal set in C , then it is a basis for C . Proof. By Theorem 1, the n vectors fb1; b2; ··· ; bng are linearly independent. Since the dimension of Cn is n, it follows that the vectors must form a basis for Cn. n Given the basis β = fb1 ··· bng in C , we will define the basis matrix, B, as the n × n matrix whose columns are composed of the basis vectors bi, for i = 1; 2; ··· ; n. Theorem 2. If β is a basis in Cn, then the associated basis matrix, B, is invertible. Proof. From basic linear algebra, we know that B will be invertible if and only if Bx = s has a solution for all s in Cn. Let s 2 Cn. Since β is a basis for Cn, there exists a vector x whose components are the scalars x1, x2, ··· , xn, such that s = x1b1 + x2b2 + ··· + xnbn So, Bx = s has the solution x = c, where c is a vector of scalars that satisfies the above equation. To show uniqueness, suppose there exists a vector y such that y 6= x and By = s. Then, it is true that B (c − y) = Bc − By = s − s = 0, which yields (c1 − y1) b1 + ··· + (cn − yn) bn Since all of the indices are linearly independent, we say that ci − yi = 0 for all i in N. However, this introduces a contradiction since y = c = x. This shows uniqueness, which proves that B is invertible. Theorem 3. Let β be an orthogonal basis in Cn with the associated basis matrix B. Then B∗B is a diagonal matrix. ∗ ∗ Proof. The (j; l) entry of B B is bj bl. However, because the vectors are orthogonal, we have ( ∗ 0 if j 6= l bj bl = 2 kbjk if j = l Hence, 2 2 3 kb1k 0 ··· 0 2 6 0 kb2k ··· 0 7 B∗B = 6 7 6 . .. 7 4 . 5 2 0 0 · · · kbnk n Corollary 2. If fb1 ··· bng is an orthonormal basis in C , then the associated basis matrix B is orthonormal. Proof. We need to show that B∗B = I, where I is the n×n identity matrix. However, this directly follows from Theorem 3 and the property of orthonormality. Note the implication that if the columns of B are orthonormal, then B−1 = B∗. 3 Overview of the Compression/Decompression Process For our purposes a signal is a vector s in Cn. Usually, n will be quite large. The individual entries in a signal, s, are samples that represent the values of some continuous waveform, s(t), at discrete times. We will always assume that the samples are evenly spaced in time; in other words, we assume that they were obtained at a constant sampling frequency, which we will denote as fs. For example, if we sample an audio signal, s(t), at the standard rate of fs = 44; 100 hertz for T = 5 seconds, the result will yield a signal vector s with n = fsT = 220; 500 samples. 3 Both the Fourier and wavelet compression algorithms studied in this project have equivalent overall structure. The original signal, s, is written in terms of some basis, β, in Cn: s = Bc = c1b1 + c2b2 + ··· + cnbn (2) The vector c = (c1; c2; ··· ; cn) is called the coefficient vector of s with respect to the basis β.
Load more

Recommended publications
  • Information and Compression Introduction Summary of Course
    Information and compression Introduction ■ We will be looking at what information is Information and Compression ■ Methods of measuring it ■ The idea of compression ■ 2 distinct ways of compressing images Paul Cockshott Faraday partnership Summary of Course Agenda ■ At the end of this lecture you should have ■ Encoding systems an idea what information is, its relation to ■ BCD versus decimal order, and why data compression is possible ■ Information efficiency ■ Shannons Measure ■ Chaitin, Kolmogorov Complexity Theory ■ Relation to Goedels theorem Overview Connections ■ Data coms channels bounded ■ Simple encoding example shows different ■ Images take great deal of information in raw densities possible form ■ Shannons information theory deals with ■ Efficient transmission requires denser transmission encoding ■ Chaitin relates this to Turing machines and ■ This requires that we understand what computability information actually is ■ Goedels theorem limits what we know about compression paul 1 Information and compression Vocabulary What is information ■ information, ■ Information measured in bits ■ entropy, ■ Bit equivalent to binary digit ■ compression, ■ Why use binary system not decimal? ■ redundancy, ■ Decimal would seem more natural ■ lossless encoding, ■ Alternatively why not use e, base of natural ■ lossy encoding logarithms instead of 2 or 10 ? Voltage encoding Noise Immunity Binary voltage ■ ■ ■ 5v Digital information BINARY DECIMAL encoded as ranges of ■ 2 values 0,1 ■ 10 values 0..9 continuous variables 1 ■ 1 isolation band ■
    [Show full text]
  • An Improved Fast Fractal Image Compression Coding Method
    Rev. Téc. Ing. Univ. Zulia. Vol. 39, Nº 9, 241 - 247, 2016 doi:10.21311/001.39.9.32 An Improved Fast Fractal Image Compression Coding Method Haibo Gao, Wenjuan Zeng, Jifeng Chen, Cheng Zhang College of Information Science and Engineering, Hunan International Economics University, Changsha 410205, Hunan, China Abstract The main purpose of image compression is to use as many bits as possible to represent the source image by eliminating the image redundancy with acceptable restoration. Fractal image compression coding has achieved good results in the field of image compression due to its high compression ratio, fast decoding speed as well as independency between decoding image and resolution. However, there is a big problem in this method, i.e. long coding time because there are considerable searches of fractal blocks in the coding. Based on the theoretical foundation of fractal coding and fractal compression algorithm, this paper researches every step of this compression method, including block partition, block search and the representation of affine transformation coefficient, in order to come up with optimization and improvement strategies. The simulation result shows that the algorithm of this paper can achieve excellent effects in coding time and compression ratio while ensuring better image quality. The work on fractal coding in this paper has made certain contributions to the research of fractal coding. Key words: Image Compression, Fractal Theory, Coding and Decoding. 1. INTRODUCTION Image compression is aimed to use as many bytes as possible to represent and transmit the original big image and to have a better quality in the restored image.
    [Show full text]
  • Hardware Architecture for Elliptic Curve Cryptography and Lossless Data Compression
    Hardware architecture for elliptic curve cryptography and lossless data compression by Miguel Morales-Sandoval A thesis presented to the National Institute for Astrophysics, Optics and Electronics in partial ful¯lment of the requirement for the degree of Master of Computer Science Thesis Advisor: PhD. Claudia Feregrino-Uribe Computer Science Department National Institute for Astrophysics, Optics and Electronics Tonantzintla, Puebla M¶exico December 2004 Abstract Data compression and cryptography play an important role when transmitting data across a public computer network. While compression reduces the amount of data to be transferred or stored, cryptography ensures that data is transmitted with reliability and integrity. Compression and encryption have to be applied in the correct way: data are compressed before they are encrypted. If it were the opposite case the result of the cryptographic operation would be illegible data and no patterns or redundancy would be present, leading to very poor or no compression. In this research work, a hardware architecture that joins lossless compression and public-key cryptography for secure data transmission applications is discussed. The architecture consists of a dictionary-based lossless data compressor to compress the incoming data, and an elliptic curve crypto- graphic module that performs two EC (elliptic curve) cryptographic schemes: encryp- tion and digital signature. For lossless data compression, the dictionary-based LZ77 algorithm is implemented using a systolic array aproach. The elliptic curve cryptosys- tem is de¯ned over the binary ¯eld F2m , using polynomial basis, a±ne coordinates and the binary method to compute an scalar multiplication. While the model of the complete system was implemented in software, the hardware architecture was described in the Very High Speed Integrated Circuit Hardware Description Language (VHDL).
    [Show full text]
  • A Review of Data Compression Technique
    International Journal of Computer Science Trends and Technology (IJCST) – Volume 2 Issue 4, Jul-Aug 2014 RESEARCH ARTICLE OPEN ACCESS A Review of Data Compression Technique Ritu1, Puneet Sharma2 Department of Computer Science and Engineering, Hindu College of Engineering, Sonipat Deenbandhu Chhotu Ram University, Murthal Haryana-India ABSTRACT With the growth of technology and the entrance into the Digital Age, the world has found itself amid a vast amount of information. Dealing with such enormous amount of information can often present difficulties. Digital information must be stored and retrieved in an efficient manner, in order for it to be put to practical use. Compression is one way to deal with this problem. Images require substantial storage and transmission resources, thus image compression is advantageous to reduce these requirements. Image compression is a key technology in transmission and storage of digital images because of vast data associated with them. This paper addresses about various image compression techniques. There are two types of image compression: lossless and lossy. Keywords:- Image Compression, JPEG, Discrete wavelet Transform. I. INTRODUCTION redundancies. An inverse process called decompression Image compression is important for many applications (decoding) is applied to the compressed data to get the that involve huge data storage, transmission and retrieval reconstructed image. The objective of compression is to such as for multimedia, documents, videoconferencing, and reduce the number of bits as much as possible, while medical imaging. Uncompressed images require keeping the resolution and the visual quality of the considerable storage capacity and transmission bandwidth. reconstructed image as close to the original image as The objective of image compression technique is to reduce possible.
    [Show full text]
  • A Review on Different Lossless Image Compression Techniques
    Ilam Parithi.T et. al. /International Journal of Modern Sciences and Engineering Technology (IJMSET) ISSN 2349-3755; Available at https://www.ijmset.com Volume 2, Issue 4, 2015, pp.86-94 A Review on Different Lossless Image Compression Techniques 1Ilam Parithi.T * 2Balasubramanian.R Research Scholar/CSE Professor/CSE Manonmaniam Sundaranar Manonmaniam Sundaranar University, University, Tirunelveli, India Tirunelveli, India [email protected] [email protected] Abstract In the Morden world sharing and storing the data in the form of image is a great challenge for the social networks. People are sharing and storing a millions of images for every second. Though the data compression is done to reduce the amount of space required to store a data, there is need for a perfect image compression algorithm which will reduce the size of data for both sharing and storing. Keywords: Huffman Coding, Run Length Encoding (RLE), Arithmetic Coding, Lempel – Ziv-Welch Coding (LZW), Differential Pulse Code Modulation (DPCM). 1. INTRODUCTION: The Image compression is a technique for effectively coding the digital image by minimizing the numbers of bits needed for representing the image. The aim is to reduce the storage space, transmission cost and to maintain a good quality. The compression is also achieved by removing the redundancies like coding redundancy, inter pixel redundancy, and psycho visual redundancy. Generally the compression techniques are divided into two types. i) Lossy compression techniques and ii) Lossless compression techniques. Compression Techniques Lossless Compression Lossy Compression Run Length Coding Huffman Coding Wavelet based Fractal Compression Compression Arithmetic Coding LZW Coding Vector Quantization Block Truncation Coding Fig.
    [Show full text]
  • Video/Image Compression Technologies an Overview
    Video/Image Compression Technologies An Overview Ahmad Ansari, Ph.D., Principal Member of Technical Staff SBC Technology Resources, Inc. 9505 Arboretum Blvd. Austin, TX 78759 (512) 372 - 5653 [email protected] May 15, 2001- A. C. Ansari 1 Video Compression, An Overview ■ Introduction – Impact of Digitization, Sampling and Quantization on Compression ■ Lossless Compression – Bit Plane Coding – Predictive Coding ■ Lossy Compression – Transform Coding (MPEG-X) – Vector Quantization (VQ) – Subband Coding (Wavelets) – Fractals – Model-Based Coding May 15, 2001- A. C. Ansari 2 Introduction ■ Digitization Impact – Generating Large number of bits; impacts storage and transmission » Image/video is correlated » Human Visual System has limitations ■ Types of Redundancies – Spatial - Correlation between neighboring pixel values – Spectral - Correlation between different color planes or spectral bands – Temporal - Correlation between different frames in a video sequence ■ Know Facts – Sampling » Higher sampling rate results in higher pixel-to-pixel correlation – Quantization » Increasing the number of quantization levels reduces pixel-to-pixel correlation May 15, 2001- A. C. Ansari 3 Lossless Compression May 15, 2001- A. C. Ansari 4 Lossless Compression ■ Lossless – Numerically identical to the original content on a pixel-by-pixel basis – Motion Compensation is not used ■ Applications – Medical Imaging – Contribution video applications ■ Techniques – Bit Plane Coding – Lossless Predictive Coding » DPCM, Huffman Coding of Differential Frames, Arithmetic Coding of Differential Frames May 15, 2001- A. C. Ansari 5 Lossless Compression ■ Bit Plane Coding – A video frame with NxN pixels and each pixel is encoded by “K” bits – Converts this frame into K x (NxN) binary frames and encode each binary frame independently. » Runlength Encoding, Gray Coding, Arithmetic coding Binary Frame #1 .
    [Show full text]
  • A Review on Fractal Image Compression
    INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 12, DECEMBER 2019 ISSN 2277-8616 A Review On Fractal Image Compression Geeta Chauhan, Ashish Negi Abstract: This study aims to review the recent techniques in digital multimedia compression with respect to fractal coding techniques. It covers the proposed fractal coding methods in audio and image domain and the techniques that were used for accelerating the encoding time process which is considered the main challenge in fractal compression. This study also presents the trends of the researcher's interests in applying fractal coding in image domain in comparison to the audio domain. This review opens directions for further researches in the area of fractal coding in audio compression and removes the obstacles that face its implementation in order to compare fractal audio with the renowned audio compression techniques. Index Terms: Compression, Discrete Cosine Transformation, Fractal, Fractal Encoding, Fractal Decoding, Quadtree partitioning. —————————— —————————— 1. INTRODUCTION of contractive transformations through exploiting the self- THE development of digital multimedia and communication similarity in the image parts using PIFS. The encoding process applications and the huge volume of data transfer through the consists of three sub-processes: first, partitioning the image internet place the necessity for data compression methods at into non-overlapped range and overlapped domain blocks, the first priority [1]. The main purpose of data compression is second, searching for similar range-domain with minimum to reduce the amount of transferred data by eliminating the error and third, storing the IFS coefficients in a file that redundant information to keep the transmission bandwidth and represents a compress file and use it decompression process without significant effects on the quality of the data [2].
    [Show full text]
  • Fractal Image Compression Technique
    FRACTAL IMAGE COMPRESSION A thesis submitted to the Faculty of Graduate Studies and Research in partial mrnent of the requirernents for the degree of Master of Science Information and S ystems Science Department of Mathematics and Statistics Carleton University Ottawa, Ontario April, 1998 National Library Bibliothèque nationale I*B of Canada du Canada Acquisitions and Acquisitions et Bibliographie Services services bibliographiques 395 Wellington Street 395. rue Weltington Ottawa ON KI A ON4 Ottawa ON KIA ON4 Canada Canada Yow fik Votre referenco Our Ne Notre rëftirence The author has granted a non- L'auteur a accorde une licence non exclusive licence allowing the exclusive permettant à la National Library of Canada to Bibliothèque nationale du Canada de reproduce, loan, distriiute or sell reproduire, prêter, distribuer ou copies of this thesis in microform, vendre des copies de cette thèse sous paper or electronic formats. la fome de microfiche/nlm, de reproduction sur papier ou sur fomat électronique. The author retains ownership of the L'auteur conserve la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor substantial extracts fiom it Ni la thèse ni des extraits substantiels may be printed or otherwise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. ACKNOWLEDGEMENTS I would iike to express my sincere t hanks to my supe~so~~Professor Bnan h[ortimrr, for providing me with the rïght balance of freedom and ,guidance throughout this research. My thanks are extended to the Department of Mat hematics and Statistics at Carleton University for providing a constructive environment for graduate work, and hancial assistance.
    [Show full text]
  • Introduction to Data Compression
    Introduction to Data Compression Guy E. Blelloch Computer Science Department Carnegie Mellon University [email protected] October 16, 2001 Contents 1 Introduction 3 2 Information Theory 5 2.1 Entropy . 5 2.2 The Entropy of the English Language . 6 2.3 Conditional Entropy and Markov Chains . 7 3 Probability Coding 9 3.1 Prefix Codes . 10 3.1.1 Relationship to Entropy . 11 3.2 Huffman Codes . 12 3.2.1 Combining Messages . 14 3.2.2 Minimum Variance Huffman Codes . 14 3.3 Arithmetic Coding . 15 3.3.1 Integer Implementation . 18 4 Applications of Probability Coding 21 4.1 Run-length Coding . 24 4.2 Move-To-Front Coding . 25 4.3 Residual Coding: JPEG-LS . 25 4.4 Context Coding: JBIG . 26 4.5 Context Coding: PPM . 28 ¡ This is an early draft of a chapter of a book I’m starting to write on “algorithms in the real world”. There are surely many mistakes, and please feel free to point them out. In general the Lossless compression part is more polished than the lossy compression part. Some of the text and figures in the Lossy Compression sections are from scribe notes taken by Ben Liblit at UC Berkeley. Thanks for many comments from students that helped improve the presentation. ¢ c 2000, 2001 Guy Blelloch 1 5 The Lempel-Ziv Algorithms 31 5.1 Lempel-Ziv 77 (Sliding Windows) . 31 5.2 Lempel-Ziv-Welch . 33 6 Other Lossless Compression 36 6.1 Burrows Wheeler . 36 7 Lossy Compression Techniques 39 7.1 Scalar Quantization .
    [Show full text]
  • Compression of the Mammography Images Using Quadtree Based Energy and Pattern Blocks
    Compression of the Mammography Images using Quadtree based Energy and Pattern Blocks Spideh Nahavandi Gargari M.S., Electronics Engineering, IS¸IK UNIVERSITY, 2017 Submitted to the Graduate School of Science and Engineering in partial fulfillment of the requirements for the degree of Master of Science in Electronics Engineering IS¸IK UNIVERSITY 2017 Compression of the Mammography Images using Quadtree Based Energy and Pattern Blocks Abstract Medical images, like any other digital data, require compression in order to reduce disk space needed for storage and time needed for transmission. This thesis offers , a novel image compression method based on generation of the so-called classified energy and pattern blocks (CEPB) is introduced and evaluation results are presented. The CEPB is constructed using the training images and then located at both the transmitter and receiver sides of the communication system. Then the energy and pattern blocks of input images to be reconstructed are determined by the same way in the construction of the CEPB. This process is also associated with a matching procedure to determine the index numbers of the classified energy and pattern blocks in the CEPB which best represents (matches) the energy and pattern blocks of the input images. Encoding parameters are block scaling coefficient and index numbers of energy and pattern blocks determined for each block of the input images. These parameters are sent from the transmitter part to the receiver part and the classified energy and pattern blocks associated with the index numbers are pulled from the CEPB. Moreover, in the second part of our method we used Quadtree too.
    [Show full text]
  • Fractal Based Image Compression Techniques
    International Journal of Computer Applications (0975 – 8887) Volume 178 – No.1, November 2017 Fractal based Image Compression Techniques Sandhya Kadam Vijay Rathod Research Scholar, Faculty of Engg, Pacific Academy St. Xavier’s Institute of Technology of Higher Education and Research, Udaipur, India Mumbai, India ABSTRACT Fractal image compression offers high compression ratios and algorithm by Fisher [1] partitions the image into two basic quality image reconstruction. It uses various techniques as the elements: range blocks and domain blocks. The range blocks fractal with DCT, wavelet, neural network, genetic form a tiling of the image. The domain blocks are twice the algorithms, quantum acceleration etc. Additionally, because size of the range blocks and overlap such that a new domain fractals are infinitely magnifiable, fractal compression is block starts at every pixel. Determining the global resolution independent and so a single compressed image can transformation for the image requires for each range block be used efficiently for display in any image resolution finding a domain block that can be mapped onto a close including resolution higher than the resolution of the original approximation of the range block via a predefined set of image. Breaking an image into pieces and identifying self- contractive transformations. These transformations contract similar ones is the main principle of the approach. In this the domain blocks spatially to the size of range block and then paper, the different issues in fractal image compression as transform the grey levels by a combination of rescaling, offset partitioning, larger encoding time, compression ratio, quality adjustment, reflection, and rotation. The rescaling is restricted of the reconstructed image, decoding time, SSIM(Structured to a range that ensures a contractive transformation.
    [Show full text]
  • Fractal Image Compression-State of The
    Volume-9 • Number-2 June -Dec 2017 pp. 64-68 available online at www.csjournals.com Fractal Imaage Compression-State of the Art Suvidha Kumari1, Priyanka Anand2, Rohtash Dhiman3 1M.tech Scholar, B.P.S. Women University Khanpur, Sonipat 2Assistant Professor, B.P.S. Women University Khanpur, Sonipat 3Assistant Professor, D.C.R. University of Science and Technology Murthal, Sonipat Abstract: Fractal compression is a new technique in the compression of images. Related contract transformations support and use the existence of self-symmetry within the image. This method has attracted a lot of attention in recent years due to multiple Advantages such as high compression rate compression high speed decompression, high bit rate determination and independence. Fractal compression includes the operation of fractals and is a compression technique with data loss. The strategy is more suitable for textures and natural images, with the fact that the components of an image often resemble other identical image components. The Fractal algorithms convert these components into mathematical information called "fractal codes" that are usually recreated from the encoded image. The Fractal1compression differs from the pixel-based compression methods like MPEG, JPEG and GIF, in view of the fact that no pixels are put asides. A picture has been regenerated into fractal image code; the image may be recreated to fill any screen size while not losing the sharpness, that happens in typical lossy compression schemes. This paper presents an overview of fractal based compression and literature survey on the same. Key words: Fractal, Image compression, compression technique, lossy image compression technique. 1. Introduction: Image Compression plays a very important role in applications like medical imaging, remote sensing, tele-video conferencing and satellite image application.
    [Show full text]