# DYNAMIC DOMAIN CLASSIFICATION FOR FRACTAL IMAGE COMPRESSION

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 DYNAMIC DOMAIN CLASSIFICATION FOR FRACTAL IMAGE COMPRESSION K. Revathy 1 & M. Jayamohan 2 Department of Computer Science, University of Kerala, Thiruvananthapuram, Kerala, India 1 2 ABSTRACT Fractal image compression is attractive except for its high encoding time requirements. The image is encoded as a set of contractive affine transformations. The image is partitioned into non-overlapping range blocks, and a best matching domain block larger than the range block is identified. There are many attempts on improving the encoding time by reducing the size of search pool for range-domain matching. But these methods are attempting to prepare a static domain pool that remains unchanged throughout the encoding process. This paper proposes dynamic preparation of separate domain pool for each range block. This will result in significant reduction in the encoding time. The domain pool for a particular range block can be decided based upon a parametric value. Here we use classification based on local fractal dimension. KEYWORDS Fractal image compression, dynamic domain pool, RMS, fractal dimension 1. INTRODUCTION The basic assumption of fractal compression is that some regions of the image resemble some other regions within the same image which can be regarded as possessing fractal nature. Fractals are geometric objects/shapes that possess self-similarity nature at different scales. The term fractal was introduced into the geometric world by Benoit B. Mandelbrot [1]. According to Mandelbrot, a set of mathematical equations when subjected to iterative transformations can yield a complex image and we can create many such natural-looking fractal images through such iterations. It was Michael Barnsley [2] who introduced the idea of applying fractals in image compression technique by incorporating the theory of Iterated Function Systems (IFS) of J. Hutchinson [3]. According to Barnsley, an image can be represented as a set of mathematical equations and this idea of taking an image and express it as an IFS forms the basis of fractal image compression. But Barnsley s IFS based compression was impractical due to its computational complexity. Advancement is made in this route by Arnaud Jacquin [4], by using Partitioned Iterated Function Systems (PIFS). Unlike Barnsley s approach of finding IFS for the entire image, Jacquin proposed to partition the image into non-overlapping blocks called range blocks and find an appropriate IFS (called as PIFS) for each range. Since then, Jacquin s approach is followed by the researchers in fractal image compression. DOI : /ijcsit

2 In PIFS compression technique, the image is partitioned into non-overlapping blocks called range. Another set of blocks larger than and similar to the range block, called domain, is also selected from the same image based on a similarity criterion. This required each range block to be compared with all possible domain blocks within the image. Such an exhaustive search adds immense operations which results in high time requirement to the encoding process. Fractal compression lacks a wide acceptance due to this high encoding time. A variety of criteria from different aspects have been proposed by researchers in fractal image compression to achieve a significant reduction in the computation time. All of them aimed to decrease the encoding time by reducing the size of the domain pool to be searched, but a standard approach is not yet defined. Each selected domain is mapped to a range block using a set of affine transformation such as rotation, translation and resizing as well as the transformations in pixel intensity. The transformations are contractive, and, on applying a limited number of iterations the resultant image gets attracted to a fixed set. The domain information and the transformation coefficients corresponding to each range block are stored in the compressed file. In the reconstruction phase the transformations are applied on an initial image, mostly a background image, yielding parts of the original image. The initial image can be any image, and be of any size, irrespective of the original one. This resolution independence is a unique feature of fractal image compression which no other compression technique can offer. The decoding process is simple and fast compared to the encoding process. It is still a question whether all natural images possess fractal nature or self-similarity, that the fractal compression technique depends on. But it is proved that by approximating this resemblance property fractal technique achieve high compression ratios. High compression ratios normally cause more data loss resulting in lesser image quality. However, fractal compression gives a satisfactory balance between this compression ratio and image quality compared to other image compression techniques. This makes the researchers to foresee this compression technique as a best solution in many image compression application issues. Another benefit of fractal compression is its ability to reconstruct the compressed image to any size without the loss of details. 2. DOMAIN CLASSIFICATION Fractal compression is an asymmetric process in terms of algorithmic operations and executing time. Fractal encoding and decoding are different, one cannot be described as the reverse of the other. Encoding time is very high compared to the decoding time. Before we start encoding, we have to find a domain block from the same image which best matches the range block. In order to improve the quality of compression, the domain blocks are allowed to be overlapping. But, although there can be a significant gain in the quality of reconstructed image, this results in huge domain pools for each range block. For example, consider an image of size 1024x1024. Let the image be partitioned into 8x8 range blocks. There will be 2 14 =16384 range blocks. Let the size of domain blocks be 16x16. (Most of the researchers use domains with a scale size double that of range block). Then for an extensive search, each range block shall be compared with 1009x1009 = 10, 18, 081 domain blocks. Thus the total number of comparisons will cumulate to around The time complexity can be estimated as Ω (2 n ). 96

3 Image size (n) Table 1. Time requirements for range-domain matching Number of range blocks Number of domains Number of comparisons > Investigations have been done on classifying domains in order to reduce the search pool for best matching range-domain pair. The no-search algorithm by Furao [5] and the improvements suggested by Wang [6] are the methods which use minimum encoding time, but compromise more on image quality. Dauda et.al. [7] have attempted to reduce the domain pool based on DCT coefficients. Conci & Acquino classifies the domain pool based on the local fractal dimension of image blocks [8]. All these methods gain in reducing the pool size in one or other way, but the domains remain static, selected before the comparison starts. We propose methods for selecting the domain pool dynamically, based on the properties of the range block. 3. DYNAMIC DECISION METHOD In conventional methods, the domain classification decisions are made as the first phase in encoding. Though this will help to reduce the search pool, the dynamic features of each range block selected cannot be taken into account. We propose to postpone the classification process making it part of the comparison module. Domain pool for each range block will be selected dynamically, considering the local features of range block. The issue of deciding on which features of range block shall be considered for domain selection needs further investigations. We propose to use the local fractal dimension of image partitions to check for similarity. 3.1 Local fractal dimension Barnsley presents fractal dimension (FD) as a quantity that can measure the similarity of two fractals. Fractal dimension estimates how densely a fractal occupies the metric space in which it lies. Let A be the matrix representing the image. Let the space R 2 be covered by closed square boxes of side length 1/2 n. Let N (A) denote the number of boxes which intersect A. Then the box counting theorem states that, the fractal dimension D of A can be obtained as D = Different methods are available for estimating the fractal dimension of grayscale images. For color images, fractal dimension can be estimated either by converting it to grayscale or by 97

4 averaging the fractal dimensions of each color place computed separately. Since natural images are not purely self-similar, if we calculate the fractal dimension of each range block separately it will be different from that of the entire image. However this value can be used to compare the complexities two image regions. Conci A. in [8] has attempted to classify domains based on their local fractal dimension. The paper suggests separating the domains into two groups based on their fractal dimension. The FD of range block will be estimated and the search for a matching pair will be limited to the pool corresponding to the range FD. In our method, we use the differential-box counting method proposed by Sarkar and Choudhari [9] to calculate fractal dimension. In our method, first the fractal dimension of the range blocks are calculated and listed in a linear array. Then the FD values of the overlapping domain blocks are calculated and listed in a balanced binary search tree. The policy is to search for a match in only those domains having fractal dimension close to that of the range. This can be done by fixing a fractal distance value in advance. Here, the fractal distance is fixed as D f = (F m F l )/3, where F m is the maximum FD value in the set, and F l is the least FD in the set. This will allow us to limit the pool size to 1/3 of the entire set, in an average. Using differential box-counting we get the FD values of images mostly in between 2.0 and 3.0. Now, if the FD of range block is d r, we can confine our search to domains with FD in d r - D f d d d r + D f, where d d is the FD of domain block. The domain pool is decided at run time, corresponding to the FD of the candidate range block. Since we use a height balanced binary tree, the searching and traversal can be performed in O(logn) time. The time required to construct the tree is O (n). Thus the total overhead expense incurred in this is O (n) + O (logn). 3.2 Height balanced trees The balance factor of a node in a binary tree is measured as the difference between the number of levels of its left subtree and the number of levels in its right subtree (or vice versa). A tree is said to be height balanced if the balance factor b f of every node in it satisfies the relation -1 b f 1 Height balanced binary trees have the advantage of having a stable time complexity for operations like traversal, insertion, deletion and search. On insertion and deletion, the tree needs to be rotated to maintain the balance factor in the interval. However, the search operation is exactly similar to that in a binary search tree. The time complexity for a search in a height balanced binary search tree is estimated to O (n) in average case and worst case. There are variations on balanced trees such as red-black trees and splay trees, but AVL trees give the best stable time complexity in operations [10, 11]. 98

5 4. EXPERIMENTAL RESULTS A program which implements exhaustive search method and domain classification by fractal dimension suggested by Conci and the No-search method suggested by Furao has been tested for comparison with the proposed method. The no-search method results in minimum encoding time but with loss of image fidelity. Among the other methods this dynamic classification scheme consumes minimum encoding time without compromising quality. The results are given in Table 2 and Table 3. The reconstructed images of Lena and Highcourt are given. The original images were taken at different sizes, 512x512 and 256x256 pixels. The PSNR values obtained from the three methods for selected images are given in Table 4. The programs are written in Scilab and tested on a computer with Intel Core2 duo 2.53GHz processor with 2MB cache memory. Image Table 2. Encoding time for images with 512x512 pixels Exhaustive search Encoding time in seconds No search Conci s New method Lena Cameraman Highcourt Sachu Flowers X-mas Boyandgirl Street Statue Lord Medical

6 Image Table 3. Encoding time for images with 256x256 pixels Exhaustive search Encoding time for No search Conci s New method Lena Cameraman Highcourt Sachu Flowers X-mas Boyandgirl Street Statue Lord Medical Image Table 4. PSNR values for tested methods Exhaustive search PSNR No search Conci s New method Lena Cameraman Highcourt Sachu Flowers X-mas Boyandgirl Street Statue Lord Medical

7 a b c d e f Figure 1. (a) X-mas original (b) X-mas reconstructed (c) Lena original (d) Lena reconstructed (e) Highcourt original (f) highcourt reconstructed 101

8 5. CONCLUSION Image compression algorithms are still in search of better alternatives though there are well accepted standards. Fractal image compression technique, in spite of its unique features in resolution independence and decoding speed, is yet to find its place in the industry. We have attempted to use a dynamic decision approach on selecting the domain blocks to be compared with each range block. Experiments show that the method gains significant advantage in encoding time with good quality and compression ratio. The local features of image blocks can be used to classify domains dynamically. Further investigations are to be done on finding better similarity measures and on using better data structures. REFERENCES [1] Mandelbrot, B.B. (1982) The fractal geometry of nature, W. H. Freeman, New York. [2] Barnsley, M.F. (1993) Fractals Everywhere, Academic Press, New York. [3] Hutchinson, John. E. (1981) Fractals and self similarity, Indiana Univ. Math. J., Vol. 30, No. 5, pp [4] Jacquin, A.E. (1992) Image Coding Based on a Fractal Theory of Iterated Contractive Image Transformations, IEEE trans. on Image Processing, Vol. 2, pp [5] Furao S. & Hasegawa O. (2004) A fast no search fractal image coding method, Signal Processing and Image Communication, Vol.19, No.5, pp [6] Wang, X. & Wang, S. (2008) An improved no-search fractal image coding method basedon a modified grey-level transform, Computers & Graphics, Vol. 32, pp [7] Doudal, S. et.al. (2011) A reduced domain pool based on DCT for a fast fractal image encoding, Electronic Letters on Computer Vision and Image Analysis, Vol.10, No.1, pp [8] Conci, A. & Aquino, F. R. (2005) Fractal coding based on image local fractal dimension, Computational and Applied Mathematics, Vol. 24, pp [9] Sarkar, N. & Choudhuri, B.B. (1994) An efficient differential box counting approach to compute fractal dimension of image, IEEE trans. on Syst. Man & Cybernetics, Vol. 24, pp.115, 120. [10] Tremblay, J. & Sorenson, P.G. (1991) An introduction to data structures with applications, Mcgraw-Hill Education, NewDelhi. [11] Knuth, D. E. (1997) The Art of Computer Programming, Addison-Wesley, NewYork. [12] Fisher, Y. (1995) Fractal Image Compression-Theory and Application, Springer-Verlag. [13] Welstead, S.T. (1999) Fractal and Wavelet Image Compression Techniques, SPIE Press. 102

### Fractal Images Compressing by Estimating the Closest Neighborhood with Using of Schema Theory

Journal of Computer Science 6 (5): 591-596, 2010 ISSN 1549-3636 2010 Science Publications Fractal Images Compressing by Estimating the Closest Neighborhood with Using of Schema Theory Mahdi Jampour, Mahdi

### Image Compression through DCT and Huffman Coding Technique

International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul

### Binary Search Trees. Data in each node. Larger than the data in its left child Smaller than the data in its right child

Binary Search Trees Data in each node Larger than the data in its left child Smaller than the data in its right child FIGURE 11-6 Arbitrary binary tree FIGURE 11-7 Binary search tree Data Structures Using

### Fractal Image Compression Michael F. Barnsley

Fractal Image Compression Michael F. Barnsley The top-selling multimedia encyclopedia Encarta, published by Microsoft Corporation, includes on one CD-ROM seven thousand color photographs which may be viewed

### Image Compression with a Hybrid Wavelet-Fractal Coder

868 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 8, NO. 6, JUNE 1999 Image Compression with a Hybrid Wavelet-Fractal Coder Jin Li and C.-C. Jay Kuo Abstract A hybrid wavelet-fractal coder (WFC) for image

### Performance Analysis of medical Image Using Fractal Image Compression

Performance Analysis of medical Image Using Fractal Image Compression Akhil Singal 1, Rajni 2 1 M.Tech Scholar, ECE, D.C.R.U.S.T, Murthal, Sonepat, Haryana, India 2 Assistant Professor, ECE, D.C.R.U.S.T,

### Fractal coding based on image local fractal dimension

Volume 24, N. 1, pp. 83 98, 2005 Copyright 2005 SBMAC ISSN 0101-8205 www.scielo.br/cam Fractal coding based on image local fractal dimension AURA CONCI and FELIPE R. AQUINO IC Computer Institute, Department

### Guojun Lu "Fractal-Based Image and Video Compression" The Transform and Data Compression Handbook Ed. K. R. Rao et al. Boca Raton, CRC Press LLC, 2001

20001 CRC Press LLC Guojun Lu "Fractal-Based Image and Video Compression" The Transform and Data Compression Handbook Ed. K. R. Rao et al. Boca Raton, CRC Press LLC, 2001 Chapter 7 Fractal-Based Image

### An Introduction to Fractal Image Compression

An Introduction to Fractal Image Compression Literature Number: BPRA065 Texas Instruments Europe October 1997 IMPORTANT NOTICE Texas Instruments (TI) reserves the right to make changes to its products

### JPEG Image Compression by Using DCT

International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Issue-4 E-ISSN: 2347-2693 JPEG Image Compression by Using DCT Sarika P. Bagal 1* and Vishal B. Raskar 2 1*

### A transputer based system for real-time processing of CCD astronomical images

A transputer based system for real-time processing of CCD astronomical images A.Balestra 1, C.Cumani 1, G.Sedmak 1,2, R.Smareglia 1 (1) Osservatorio Astronomico di Trieste (OAT), Italy (2) Dipartimento

### Sachin Dhawan Deptt. of ECE, UIET, Kurukshetra University, Kurukshetra, Haryana, India

Abstract Image compression is now essential for applications such as transmission and storage in data bases. In this paper we review and discuss about the image compression, need of compression, its principles,

### Introduction Advantages and Disadvantages Algorithm TIME COMPLEXITY. Splay Tree. Cheruku Ravi Teja. November 14, 2011

November 14, 2011 1 Real Time Applications 2 3 Results of 4 Real Time Applications Splay trees are self branching binary search tree which has the property of reaccessing the elements quickly that which

### Image compression predicated on recurrent iterated function systems **

1 Image compression preicate on recurrent iterate function systems ** W. Metzler a, *, C.H. Yun b, M. Barski a a Faculty of Mathematics University of Kassel, Kassel, F. R. Germany b Faculty of Mathematics

### A Robust Image Watermark Algorithm for AD/DA Conversion

A Robust Image Watermark Algorithm for AD/DA Conversion DongHwan Shin 1, KyungJun Park, TaeYoon Lee, ChangWon Kim and JongUk Choi Content Solution Business Division MarkAny Inc. Seoul, Korea e-mail:{dhshin

### Image Compression Effects on Face Recognition for Images with Reduction in Size

Image Compression Effects on Face Recognition for Images with Reduction in Size Padmaja.V.K Jawaharlal Nehru Technological University, Anantapur Giri Prasad, PhD. B. Chandrasekhar, PhD. ABSTRACT In this

### A deterministic fractal is an image which has low information content and no inherent scale.

FRACTAL IMAGE COMPRESSION: A RESOLUTION INDEPENDENT REPRESENTATION FOR IMAGER?? Alan D. Sloan 5550 Peachtree Parkway Iterated Systems, Inc. Norcross, Georgia 30092 1. Background A deterministic fractal

### Key Terms Colour image compression, DCT, Edge detection & JPEG.

Efficient Compression using all the Coefficients of 16x16 DCT Sub- Sahav Singh Yadav (Research scholar), Sanjay k. Sharma (Assistant Prof.) Abstract compression is the prominent need of modern digital

### Using fractal compression scheme to embed a digital signature into an image

Using fractal compression scheme to embed a digital signature into an image Joan Puate, Fred Jordan Swiss federal institute of technology Signal Processing Laboratory CH-1015 Lausanne Switzerland Email:

### Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate

### Image compression and encryption scheme via satellite

Article Image compression and encryption scheme via satellite Journal of Vibration and Control 2016, Vol. 22(13) 3118 3122! The Author(s) 2014 Reprints and permissions: sagepub.co.uk/journalspermissions.nav

### A Hybrid Chaining Model with AVL and Binary Search Tree to Enhance Search Speed in Hashing

, pp.185-194 http://dx.doi.org/10.14257/ijhit.2015.8.3.18 A Hybrid Chaining Model with AVL and Binary Search Tree to Enhance Search Speed in Hashing 1 Akshay Saxena, 2 Harsh Anand, 3 Tribikram Pradhan

### Using Linear Fractal Interpolation Functions to Compress Video. The paper in this appendix was presented at the Fractals in Engineering '94

Appendix F Using Linear Fractal Interpolation Functions to Compress Video Images The paper in this appendix was presented at the Fractals in Engineering '94 Conference which was held in the École Polytechnic,

### Performance Analysis of Compression Techniques Using SVD, BTC, DCT and GP

IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 1, Ver. 2 (Jan Feb. 2015), PP 06-11 www.iosrjournals.org Performance Analysis of Compression Techniques

### Chaos Based Spread Spectrum Watermarking algorithm

Chaos Based Spread Spectrum Watermarking algorithm Kais Feltekh Laboratoire SysCom, Ecole Nationale d Ingenieurs de Tunis Email: kais.feltekh@gmail.com Zouhair Ben Jemaa Laboratoire SysCom, Ecole Nationale

### Time Complexity Analysis of Binary Space Partitioning Scheme for Image Compression

Time Complexity Analysis of Binary Space Partitioning Scheme for Image Compression Rehna. V. J, M. K. Jeyakumar Abstract Segmentation-based image coding methods provide high compression ratios when compared

### IMPROVED GOLOMB CODE FOR JOINT GEOMETRIC DISTRIBUTION DATA AND ITS APPLICATIONS IN IMAGE PROCESSING

IMPROVED GOLOMB CODE FOR JOINT GEOMETRIC DISTRIBUTION DATA AND ITS APPLICATIONS IN IMAGE PROCESSING Jian-Jiun Ding ( 丁建均 ), Soo-Chang Pei ( 貝蘇章 ), Wei-Yi Wei ( 魏維毅 ) Tzu-Heng Henry Lee ( 李自恆 ) Department

### Performance Evaluation of Online Image Compression Tools

Performance Evaluation of Online Image Compression Tools Rupali Sharma 1, aresh Kumar 1, Department of Computer Science, PTUGZS Campus, Bathinda (Punjab), India 1 rupali_sharma891@yahoo.com, naresh834@rediffmail.com

### JPEG compression of monochrome 2D-barcode images using DCT coefficient distributions

Edith Cowan University Research Online ECU Publications Pre. JPEG compression of monochrome D-barcode images using DCT coefficient distributions Keng Teong Tan Hong Kong Baptist University Douglas Chai

### Leaf recognition for plant classification using GLCM and PCA methods

Oriental Journal of Computer Science & Technology Vol. 3(1), 31-36 (2010) Leaf recognition for plant classification using GLCM and PCA methods ABDOLVAHAB EHSANIRAD and SHARATH KUMAR Y. H. Department of

### Compressive Sensing. Examples in Image Compression. Lecture 4, July 30, Luiz Velho Eduardo A. B. da Silva Adriana Schulz

Compressive Sensing Examples in Image Compression Lecture 4, July, 09 Luiz Velho Eduardo A. B. da Silva Adriana Schulz Today s Lecture Discuss applications of CS in image compression Evaluate CS efficiency

### S. Muthusundari. Research Scholar, Dept of CSE, Sathyabama University Chennai, India e-mail: nellailath@yahoo.co.in. Dr. R. M.

A Sorting based Algorithm for the Construction of Balanced Search Tree Automatically for smaller elements and with minimum of one Rotation for Greater Elements from BST S. Muthusundari Research Scholar,

### PIXEL-LEVEL IMAGE FUSION USING BROVEY TRANSFORME AND WAVELET TRANSFORM

PIXEL-LEVEL IMAGE FUSION USING BROVEY TRANSFORME AND WAVELET TRANSFORM Rohan Ashok Mandhare 1, Pragati Upadhyay 2,Sudha Gupta 3 ME Student, K.J.SOMIYA College of Engineering, Vidyavihar, Mumbai, Maharashtra,

### ECE 842 Report Implementation of Elliptic Curve Cryptography

ECE 842 Report Implementation of Elliptic Curve Cryptography Wei-Yang Lin December 15, 2004 Abstract The aim of this report is to illustrate the issues in implementing a practical elliptic curve cryptographic

### A Simple Feature Extraction Technique of a Pattern By Hopfield Network

A Simple Feature Extraction Technique of a Pattern By Hopfield Network A.Nag!, S. Biswas *, D. Sarkar *, P.P. Sarkar *, B. Gupta **! Academy of Technology, Hoogly - 722 *USIC, University of Kalyani, Kalyani

### A Comparison of Dictionary Implementations

A Comparison of Dictionary Implementations Mark P Neyer April 10, 2009 1 Introduction A common problem in computer science is the representation of a mapping between two sets. A mapping f : A B is a function

### An Implementation of Leaf Recognition System using Leaf Vein and Shape

An Implementation of Leaf Recognition System using Leaf Vein and Shape Kue-Bum Lee and Kwang-Seok Hong College of Information and Communication Engineering, Sungkyunkwan University, 300, Chunchun-dong,

### Principles of Image Compression

Principles of Image Compression Catania 03/04/2008 Arcangelo Bruna Overview Image Compression is the Image Data Elaboration branch dedicated to the image data representation It analyzes the techniques

### STRAND B: Number Theory. UNIT B2 Number Classification and Bases: Text * * * * * Contents. Section. B2.1 Number Classification. B2.

STRAND B: Number Theory B2 Number Classification and Bases Text Contents * * * * * Section B2. Number Classification B2.2 Binary Numbers B2.3 Adding and Subtracting Binary Numbers B2.4 Multiplying Binary

### The enhancement of the operating speed of the algorithm of adaptive compression of binary bitmap images

The enhancement of the operating speed of the algorithm of adaptive compression of binary bitmap images Borusyak A.V. Research Institute of Applied Mathematics and Cybernetics Lobachevsky Nizhni Novgorod

### Performance Analysis and Comparison of JM 15.1 and Intel IPP H.264 Encoder and Decoder

Performance Analysis and Comparison of 15.1 and H.264 Encoder and Decoder K.V.Suchethan Swaroop and K.R.Rao, IEEE Fellow Department of Electrical Engineering, University of Texas at Arlington Arlington,

### Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding

Lossless Grey-scale Image Compression using Source Symbols Reduction and Huffman Coding C. SARAVANAN cs@cc.nitdgp.ac.in Assistant Professor, Computer Centre, National Institute of Technology, Durgapur,WestBengal,

### Image Compression and Decompression using Adaptive Interpolation

Image Compression and Decompression using Adaptive Interpolation SUNILBHOOSHAN 1,SHIPRASHARMA 2 Jaypee University of Information Technology 1 Electronicsand Communication EngineeringDepartment 2 ComputerScience

### Calculating Fractal Dimension from Vector Images

Calculating Fractal Dimension from Vector Images Kelly Ran TJHSST Computer Systems Laboratory 2007-2008 1 Abstract Fractal dimension can be used as an index of complexity in research applications. Currently,

### Polygonal Approximation of Closed Curves across Multiple Views

Polygonal Approximation of Closed Curves across Multiple Views M. Pawan Kumar Saurabh Goyal C. V. Jawahar P. J. Narayanan Centre for Visual Information Technology International Institute of Information

### Optimized mapping of pixels into memory for H.264/AVC decoding

Optimized mapping of pixels into memory for H.264/AVC decoding Youhui Zhang a), Yuejian Xie, and Weimin Zheng Department of Computer Science and Technology, Tsinghua University, Beijng, 100084, China.

### A comprehensive survey on various ETC techniques for secure Data transmission

A comprehensive survey on various ETC techniques for secure Data transmission Shaikh Nasreen 1, Prof. Suchita Wankhade 2 1, 2 Department of Computer Engineering 1, 2 Trinity College of Engineering and

### Data Structures For IP Lookup With Bursty Access Patterns

Data Structures For IP Lookup With Bursty Access Patterns Sartaj Sahni & Kun Suk Kim sahni, kskim @cise.ufl.edu Department of Computer and Information Science and Engineering University of Florida, Gainesville,

### IP Lookup using Two-level indexing and B-Trees

IP Lookup using Two-level indexing and B-Trees Monther Aldwairi and Noor Al-Tarazi Network Engineering and Security Department, Jordan University of Science and Technology, Irbid, Jordan Abstract - Networks

### Characterizing the Performance of Dynamic Distribution and Load-Balancing Techniques for Adaptive Grid Hierarchies

Proceedings of the IASTED International Conference Parallel and Distributed Computing and Systems November 3-6, 1999 in Cambridge Massachusetts, USA Characterizing the Performance of Dynamic Distribution

### SOLVING DATABASE QUERIES USING ORTHOGONAL RANGE SEARCHING

SOLVING DATABASE QUERIES USING ORTHOGONAL RANGE SEARCHING CPS234: Computational Geometry Prof. Pankaj Agarwal Prepared by: Khalid Al Issa (khalid@cs.duke.edu) Fall 2005 BACKGROUND : RANGE SEARCHING, a

### A New Image Compression Scheme Using Hyperanalytic Wavelet Transform and SPIHT

Contemporary Engineering Sciences, Vol. 6, 2013, no. 2, 87-98 HIKARI Ltd, www.m-hikari.com A New Image Compression Scheme Using Hyperanalytic Wavelet Transform and SPIHT D. Prathyusha Reddi Dept. of ECE,

### COT5405 Analysis of Algorithms Homework 3 Solutions

COT0 Analysis of Algorithms Homework 3 Solutions. Prove or give a counter example: (a) In the textbook, we have two routines for graph traversal - DFS(G) and BFS(G,s) - where G is a graph and s is any

### Parametric Comparison of H.264 with Existing Video Standards

Parametric Comparison of H.264 with Existing Video Standards Sumit Bhardwaj Department of Electronics and Communication Engineering Amity School of Engineering, Noida, Uttar Pradesh,INDIA Jyoti Bhardwaj

### Color Image Compression Algorithm Based on the DCT Blocks

Color Image Compression Algorithm Based on the DCT Blocks * Walaa M. Abd-Elhafiez, ** Wajeb Gharibi * Mathematical Department, Faculty of Science, Sohag University, 82524, Sohag, Egypt. *, ** College of

### Decision Trees for Mining Data Streams Based on the Gaussian Approximation

International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-3 E-ISSN: 2347-2693 Decision Trees for Mining Data Streams Based on the Gaussian Approximation S.Babu

### Low-resolution Image Processing based on FPGA

Abstract Research Journal of Recent Sciences ISSN 2277-2502. Low-resolution Image Processing based on FPGA Mahshid Aghania Kiau, Islamic Azad university of Karaj, IRAN Available online at: www.isca.in,

### Centroid Distance Function and the Fourier Descriptor with Applications to Cancer Cell Clustering

Centroid Distance Function and the Fourier Descriptor with Applications to Cancer Cell Clustering By, Swati Bhonsle Alissa Klinzmann Mentors Fred Park Department of Mathematics Ernie Esser Department of

### A Fast Algorithm for Multilevel Thresholding

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 17, 713-727 (2001) A Fast Algorithm for Multilevel Thresholding PING-SUNG LIAO, TSE-SHENG CHEN * AND PAU-CHOO CHUNG + Department of Electrical Engineering

### BINARY SEARCH TREE PERFORMANCE

BINARY SEARCH TREE PERFORMANCE Operation Best Time Average Time Worst Time (on a tree of n nodes) Find Insert Delete O(lg n)?? O(lg n)?? O(n) Fastest Running Time The find, insert and delete algorithms

### Symbol Tables. Introduction

Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The

### Improved N Level Decomposition-Hybrid DCT-DWT Image Compression

International Journal of Engineering and Technical Research (IJETR) ISSN: 2321-0869, Volume-2, Issue-6, June 2014 Improved N Level Decomposition-Hybrid DCT-DWT Image Compression Sangeeta Abstract With

### DEFECT IDENTIFICATION AND CHARACTERISATION ALGORITHMS FOR ASSESSING EFFECT ON COMPONENT STRENGTH

DEFECT IDENTIFICATION AND CHARACTERISATION ALGORITHMS FOR ASSESSING EFFECT ON COMPONENT STRENGTH A. J McMillan Aeronautical Engineering, Faculty of Advanced Technology, University of Glamorgan, Pontypridd,

### Balanced Trees Part One

Balanced Trees Part One Balanced Trees Balanced trees are surprisingly versatile data structures. Many programming languages ship with a balanced tree library. C++: std::map / std::set Java: TreeMap /

### Chapter 2 Framework of Rapid Product Cost Estimation Based on the Modular Product Family

Chapter 2 Framework of Rapid Product Cost Estimation Based on the Modular Product Family Guangxing Wei and Yanhong Qin Abstract By decomposing the product family into generic modules, the model of a modular

### Quality Estimation for Scalable Video Codec. Presented by Ann Ukhanova (DTU Fotonik, Denmark) Kashaf Mazhar (KTH, Sweden)

Quality Estimation for Scalable Video Codec Presented by Ann Ukhanova (DTU Fotonik, Denmark) Kashaf Mazhar (KTH, Sweden) Purpose of scalable video coding Multiple video streams are needed for heterogeneous

### Vimal P.Parmar Research Scholar, Department of Computer Science Saurashtra University, Rajkot Gujarat, INDIA

Comparing Linear Search and Binary Search Algorithms to Search an Element from a Linear List Implemented through Static Array, Dynamic Array and Linked List Vimal P.Parmar Research Scholar, Department

### 5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The

### Assessment. Presenter: Yupu Zhang, Guoliang Jin, Tuo Wang Computer Vision 2008 Fall

Automatic Photo Quality Assessment Presenter: Yupu Zhang, Guoliang Jin, Tuo Wang Computer Vision 2008 Fall Estimating i the photorealism of images: Distinguishing i i paintings from photographs h Florin

### Improved Billboard Clouds for Extreme Model Simplification

Improved Billboard Clouds for Extreme Model Simplification I.-T. Huang, K. L. Novins and B. C. Wünsche Graphics Group, Department of Computer Science, University of Auckland, Private Bag 92019, Auckland,

### Hybrid Lossless Compression Method For Binary Images

M.F. TALU AND İ. TÜRKOĞLU/ IU-JEEE Vol. 11(2), (2011), 1399-1405 Hybrid Lossless Compression Method For Binary Images M. Fatih TALU, İbrahim TÜRKOĞLU Inonu University, Dept. of Computer Engineering, Engineering

### Fast Compressed Sensing Based High Resolution Image Reconstruction

International Journal of New Technology and Research (IJNTR) ISSN:24-4116, Volume-2, Issue-3, March 16 Pages 71-76 Fast Compressed Sensing Based High Resolution Image Reconstruction Dr G Vijay Kumar Abstract

### Introduction to image coding

Introduction to image coding Image coding aims at reducing amount of data required for image representation, storage or transmission. This is achieved by removing redundant data from an image, i.e. by

### Key words: Fractal Dimension, Gray Scale Image, Colour Image, Differential Box Counting, Reticular Cell Counting

Volume 5, Issue 7, July 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Fractal Dimension

### 2695 P a g e. IV Semester M.Tech (DCN) SJCIT Chickballapur Karnataka India

Integrity Preservation and Privacy Protection for Digital Medical Images M.Krishna Rani Dr.S.Bhargavi IV Semester M.Tech (DCN) SJCIT Chickballapur Karnataka India Abstract- In medical treatments, the integrity

Tracking Moving Objects In Video Sequences Yiwei Wang, Robert E. Van Dyck, and John F. Doherty Department of Electrical Engineering The Pennsylvania State University University Park, PA16802 Abstract{Object

### Study and Implementation of Video Compression Standards (H.264/AVC and Dirac)

Project Proposal Study and Implementation of Video Compression Standards (H.264/AVC and Dirac) Sumedha Phatak-1000731131- sumedha.phatak@mavs.uta.edu Objective: A study, implementation and comparison of

### 11/14/2010 Intelligent Systems and Soft Computing 1

Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic

### HIGH LEVEL SYNTHESIS OF A 2D-DWT SYSTEM ARCHITECTURE FOR JPEG 2000 USING FPGAs

HIGH LEVEL SYNTHESIS OF A 2D-DWT SYSTEM ARCHITECTURE FOR JPEG 2000 USING FPGAs V. Srinivasa Rao 1, Dr P.Rajesh Kumar 2, Dr Rajesh Kumar. Pullakura 3 1 ECE Dept. Shri Vishnu Engineering College for Women,

### Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

### Honors Math 7 Credit by Exam Information Plano ISD

Honors Math 7 Credit by Exam Information Plano ISD This exam is for students who have completed 6 th grade math (or honors 6 th grade math) and wish to accelerate into Honors Algebra I for the following

### Previous Lectures. B-Trees. External storage. Two types of memory. B-trees. Main principles

B-Trees Algorithms and data structures for external memory as opposed to the main memory B-Trees Previous Lectures Height balanced binary search trees: AVL trees, red-black trees. Multiway search trees:

### Relative Data Redundancy

Image Compression Relative Data Redundancy Let b and b denote the number of bits in two representations of the same information, the relative data redundancy R is R = 1-1/C C is called the compression

### Video compression: Performance of available codec software

Video compression: Performance of available codec software Introduction. Digital Video A digital video is a collection of images presented sequentially to produce the effect of continuous motion. It takes

### IMAGE COMPRESSION BY EMBEDDING FIVE MODULUS METHOD INTO JPEG

IMAGE COMPRESSION BY EMBEDDING FIVE MODULUS METHOD INTO JPEG Firas A. Jassim Management Information Systems Department, Irbid National University, Irbid 2600, Jordan Firasajil@yahoo.com ABSTRACT The standard

### APP INVENTOR. Test Review

APP INVENTOR Test Review Main Concepts App Inventor Lists Creating Random Numbers Variables Searching and Sorting Data Linear Search Binary Search Selection Sort Quick Sort Abstraction Modulus Division

### Binary Search Trees CMPSC 122

Binary Search Trees CMPSC 122 Note: This notes packet has significant overlap with the first set of trees notes I do in CMPSC 360, but goes into much greater depth on turning BSTs into pseudocode than

### PES Institute of Technology-BSC QUESTION BANK

PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions

### Face detection is a process of localizing and extracting the face region from the

Chapter 4 FACE NORMALIZATION 4.1 INTRODUCTION Face detection is a process of localizing and extracting the face region from the background. The detected face varies in rotation, brightness, size, etc.

### Content. Chapter 4 Functions 61 4.1 Basic concepts on real functions 62. Credits 11

Content Credits 11 Chapter 1 Arithmetic Refresher 13 1.1 Algebra 14 Real Numbers 14 Real Polynomials 19 1.2 Equations in one variable 21 Linear Equations 21 Quadratic Equations 22 1.3 Exercises 28 Chapter

### A Note on Maximum Independent Sets in Rectangle Intersection Graphs

A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,

### A PHOTOGRAMMETRIC APPRAOCH FOR AUTOMATIC TRAFFIC ASSESSMENT USING CONVENTIONAL CCTV CAMERA

A PHOTOGRAMMETRIC APPRAOCH FOR AUTOMATIC TRAFFIC ASSESSMENT USING CONVENTIONAL CCTV CAMERA N. Zarrinpanjeh a, F. Dadrassjavan b, H. Fattahi c * a Islamic Azad University of Qazvin - nzarrin@qiau.ac.ir

### A PERFORMANCE EVALUATION OF COMMON ENCRYPTION TECHNIQUES WITH SECURE WATERMARK SYSTEM (SWS)

A PERFORMANCE EVALUATION OF COMMON ENCRYPTION TECHNIQUES WITH SECURE WATERMARK SYSTEM (SWS) Ashraf Odeh 1, Shadi R.Masadeh 2, Ahmad Azzazi 3 1 Computer Information Systems Department, Isra University,

### VESA Display Stream Compression

Written by Frederick Walls, Associate Technical Director, and Sandy MacInnis, Senior Technical Director, Broadcom Corporation (VESA member) OVERVIEW Display manufacturers are turning to higher- resolution

### A Chain Code Approach for Recognizing Basic Shapes

A Chain Code Approach for Recognizing Basic Shapes Dr. Azzam Talal Sleit (Previously, Azzam Ibrahim) azzam_sleit@yahoo.com Rahmeh Omar Jabay King Abdullah II for Information Technology College University

### A Fast Method For Accessing Nodes In The Binary Search Trees

A Fast Method For Accessing Nodes In The Binary Search Trees İbrahim Ates, Mustafa Akpınar, Beyza Eken, Nejat YUMUSAK Sakarya University, Department of Computer Engineering, Serdivan-Sakarya, Turkey ibrahimates@yahoo.com

### VOL. 2, NO. 4, May 2012 ISSN ARPN Journal of Science and Technology All rights reserved.

Analysis of Various Image Compression Techniques 1 G.M.Padmaja, 2 P.Nirupama 1 Senior Assistant Professor in CSE Dept, BVRIT 2 Associate Professor in CSE Dept, SIET 1 padmaja.gmp@gmail.com, 2 nirupama.cse1@gmail.com