Compressing 2-D Shapes using Concavity Trees

Size: px
Start display at page:

Download "Compressing 2-D Shapes using Concavity Trees"

Transcription

1 Compressing 2-D Shapes using Concavity Trees O. El Badawy 1 and M. S. Kamel 2 1 Dept. of Systems Design Engineering. 2 Dept. of Electrical and Computer Engineering. Pattern Analysis and Machine Intelligence Research Group, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada. Abstract. Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven t been explored further until recently. This paper shows how 2-D shapes can be concisely, but reversibly, represented during concavity tree extraction. The representation can be exact, or approximate to a pre-set degree. This is equivalent to a lossless, or lossy compression of the image containing the shape. This paper details the proposed technique and reports nearlossless compression ratios that are 1% better than the JBIG standard on a test set of binary silhouette images. 1 Introduction and Background A concavity tree is a data structure used for describing non-convex two dimensional shapes. It was first introduced by Sklansky [1] and has since been further researched by others [2 9]. A concavity tree is a rooted tree in which the root represents the whole object whose shape is to be analysed/represented. The next level of the tree contains nodes that represent concavities along the boundary of that object. Each of the nodes on the following levels represents one of the concavities of its parent, i.e., its meta-concavities. If an object or a concavity is itself convex, then the node representing it does not have any children. Figure 1 shows an example of a shape (a), its convex hull, concavities, and meta-concavities (b), and its corresponding concavity tree (c). The shape has f ive concavities as reflected in level one of the tree. The four leaf nodes in level one correspond to the highlighted triangular concavities shown in (d), whereas the non-leaf node corresponds to the (non-convex) concavity shown in (e). Similarly, the nodes in levels two and three correspond to the meta-concavities highlighted in (f) and (g), respectively. Typically, each node in a concavity tree stores information pertinent to the part of the object the node is describing (a feature vector for example), in addition to tree meta-data (like the level of the node; the height, number of nodes, and number of leaves in the subtree rooted at the node). We recently proposed an efficient (in terms of space and time) contour-based algorithm for concavity tree extraction [9] and we showed how it surpasses other concavity tree extraction methods [6] in terms of speed and the accuracy of the reconstructed image as a function of the number of nodes used in the reconstruction. In this paper, we explore the space efficiency of the method and compare

2 2 O. El Badawy and M. S. Kamel (a) (b) (c) (d) (e) (f) (g) Fig. 1. An object (a), its convex hull and concavities (b), the corresponding concavity tree (c), and contour sections corresponding to concavities (d-g). it to the JBIG standard compression algorithm. With some modifications to the base algorithm, we are able to achieve near-lossless compression with ratios 1% better than that of JBIG, and a subjectively imperceptible error of around The resulting compact representation is not the tree, but rather it is a sequence of vertices generated while the tree is extracted. The accuracy of the representation, and consequently the compression ratio, is controlled by specifying the minimum depth a concavity has to be in order to be taken into consideration. One direct advantage of this compressed representation is that the shape at hand can be analysed without the need to fully decompress the image. The resulting representation can as well be interpreted as a user-controlled polygonal approximation method whose degree of matching the original shape is also controlled by the same parameter as that controlling the compression ratio. The next section explains the methods while Section 3 discusses experimental results. 2 The Proposed Algorithm Consider a 256x256 binary image containing a 128x128 black (filled) square, this image would have an uncompressed size of 8 KB (1 bpp). JBIG is able to losslessly compress it 80:1. We note however that if we only store the four corners of the square in a vector-graphics fashion (which is enough information to losslessly reconstruct it), we should achieve much higher ratios (around 800:1). The proposed method generalizes this concept to any binary image (but it is particularly suited to silhouettes images, single or multiple, with or without holes).

3 Compressing 2-D Shapes using Concavity Trees 3 Algorithm 1 Concavity Tree Extraction and Compression Notation: I is the input image. F is the set of foreground ( 1 ) pixels (representing the shape in I). B is the set of background ( 0 ) pixels. C is the contour of F. T is a rooted tree (the concavity tree of the shape in I). S is the output sequence. N is a node in T. Require: I is bilevel, F is 8-connected, and B is 4-connected. 1: C contour of F 2: T, S = fct( C ) Function T, S = fct( C ) 3: S [] {Initialise sequence S} 4: H convex hull of C 5: Re-arrange H so that it is a subsequence of C 6: T NIL 7: New N {Instantiate a new tree node} 8: N.data H {In addition to any features as necessary} 9: T N {T now points to N} 10: for { each pair of consecutive points p 1 and p 2 in H } do 11: C 2 subsequence of C bounded between p 1 and p 2 {C 2 is a concave section along contour C} 12: S 2 [] 13: if depth(c 2) > mindepth then 14: T 2, S 2 = fct( C 2 ) 15: N.newchild T 2 {T has a new subtree T 2} 16: end if 17: S S, p 1, S 2, p 2 {such that no two consecutive elements are identical} 18: end for We focus on the case of an image containing a single object (no holes). The extension to multiple objects (with or without holes) is based on it (an example will be presented in Section 3; however, due to space constraints, the details are omitted). The main steps of the compression algorithm are shown in Algorithm 1. The input image I is a binary image. The condition that the set of foreground pixels F is 8-connected and the set of background pixels B is 4-connected will ensure that there is only one object with no holes in I (provided that F does not intersect the boundary of I). The output of the algorithm is a sequence S of pixels along the contour of F. S is generated during the concavity tree extraction process. If, for example, F is a rectangle, S will be the clockwise (or anti-clockwise) sequence of the four corner pixels. The algorithm basically computes the convex hull of F and makes it the output sequence. It then iterates on each pair of consecutive vertices and inserts, between each pair in the sequence, all the resulting subsequences generated by recursively calling the main function on the section of the contour bounded between the two points at hand. The sequence is only updated if the vertex is

4 4 O. El Badawy and M. S. Kamel Fig.2. Test set - originals different from the one just before it. The number of rows and columns in the image as well as the sequence S will be linearly stored on disk. (When the best bit-per-pixel resolution is used, it was found that RLE compression will result in no additional size reduction; an indication that the resulting file is quite compact and has a maximum entropy.) The complexity of the algorithm is O(nh) where n is the number of contour pixels and h is the height of the resulting tree. More details can be found in [9] with regard to the underlying base algorithm. (We note that the convex hull of a contour can be computed in O(n).) The reconstruction is done by a polygon filling algorithm applied to the resulting sequence of vertices S. Even though the pixels in S are just a (usually small) subset of the pixels in C, they are always enough for an exact (lossless) reconstruction of the original set F. By controlling the parameter mindepth (line 13 of Algorithm 1), shallow concavities along C can be ignored, consequently reducing the length of S, and therefore increasing the compression ratio. A mindepth value of zero will result in a lossless compression. A mindepth value of one, on the other hand, will result in a near-lossless compression with ratios that are usually much higher than the lossless case (for an n n image, where approximately 32 < n < 256). The method also allows for shape information to be extracted, possibly for shape retrieval and matching purposes, from the compressed domain; that is, without the need to fully decompress the image. This can be done since the

5 Compressing 2-D Shapes using Concavity Trees Error Compression Ratio Fig.3. Compression ratio versus error rate for the 37 images shown in Figure 2 concavity tree of the shape can be easily extracted from the compressed domain, without the need to reconstruct the image, and then find its contour(s), which can then be used for shape representation, matching, and retrieval as per [7,8], for example. 3 Experimental Results We test the method on a set of 37 binary trademark images (see Figure 2) and compare the resulting compression ratio with that of JBIG. Figure 3 shows the plot of the reconstruction error as a function of the compression ratio averaged for the 37 images. The average compression ratio for JBIG for the 37 images was 11.5:1. For a lossless reconstruction, our method achieved a compression ratio of 5.7:1. However, with a near lossless reconstruction (examples are shown in Figures 4 and 5), the compression ratio averages 17.4:1. The average error was then The method can simply be extended to multi-silhouette images, with or without holes, as shown in Figure 6. In addition, the resulting sequence of vertices that is used in the polygon filling operation can be used as a polygonal approximation of the object, either in the lossless or lossy case. Figure 7 shows some examples. 4 Summary and Conclusions This paper presents a concise shape representation generated during the extraction of concavity trees. The representation is reversible and is equivalent to a lossless, near lossless, or lossy compression. When compared to the JBIG standard, compression ratios that are on average 1% better are obtained with

6 6 O. El Badawy and M. S. Kamel JBIG/CCITT ratios:17/2.5/2.6/8.2 Error: JBIG/CCITT ratios:18/3.2/3.6/8.8 Error: JBIG/CCITT ratios:12/2.6/2.6/6.7 Error: JBIG/CCITT ratios:14/2.9/2.9/7.6 Error: CT ratio:24 CT ratio:23 CT ratio:16 CT ratio:21 (a) (b) (c) (d) Fig. 4. Four examples of original (top) and compressed/reconstructed images (bottom). Note the almost imperceptible pixel error in the images in the bottom. JBIG as well as CCITT, group III, and group IV fax compression ratios are indicated below original. Concavity tree compression ratios are below. a near-lossless error of 0.6%. The method is thus suitable for shape representation and matching in the compressed domain; polygonal approximation; and vector-based image compression. References 1. Sklansky, J.: Measuring concavity on a rectangular mosaic. IEEE Transactions on Computers C-21 (1972) Batchelor, B.: Hierarchical shape description based upon convex hulls of concavities. Journal of Cybernetics 10 (1980) Batchelor, B.: Shape descriptors for labeling concavity trees. Journal of Cybernetics 10 (1980) Borgefors, G., Sanniti di Baja, G.: Methods for hierarchical analysis of concavities. In: Proceedings of the International Conference on Pattern Recognition. Volume 3. (1992) Borgefors, G., Sanniti di Baja, G.: Analyzing nonconvex 2D and 3D patterns. Computer Vision and Image Understanding 63 (1996) Xu, J.: Hierarchical representation of 2-D shapes using convex polygons: A morphological approach. Pattern Recognition Letters 18 (1997) El Badawy, O., Kamel, M.: Shape retrieval using concavity trees. In: Proceedings of the International Conference on Pattern Recognition. Volume 3. (2004) El Badawy, O., Kamel, M.: Matching concavity trees. In: Proceedings of the Joint IAPR International Workshops on Structural, Syntactic, and Statistical Pattern Recognition. (2004) El Badawy, O., Kamel, M.: Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach. Pattern Recognition Letters 26 (2005)

7 Compressing 2-D Shapes using Concavity Trees 7 Original Error: Error: Error: JBIG: 14 CT ratio:13 CT ratio:17 CT ratio:20 Fig.5. This figure shows the effects of increasing the compression ratio for a given image. JBIG ratio is 14:1 Error: JBIG/CCITT ratios:18/2.6/3.3/8.3 CT ratio:22 Fig.6. Extensibility to multi-object shapes with holes.

8 8 O. El Badawy and M. S. Kamel (a) (b) (c) (d) Fig.7. The representation as a polygonal approximation of original (a) corresponding to a reconstruction error of (b), (c), and 0.01 (d)

Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach

Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach Hierarchical Representation of 2-D Shapes using Convex Polygons: a Contour-Based Approach O. El Badawy, M. S. Kamel Pattern Analysis and Machine Intelligence Laboratory, Department of Systems Design Engineering,

More information

Robust Shape Retrieval Using Maximum Likelihood Theory

Robust Shape Retrieval Using Maximum Likelihood Theory Robust Shape Retrieval Using Maximum Likelihood Theory Naif Alajlan 1, Paul Fieguth 2, and Mohamed Kamel 1 1 PAMI Lab, E & CE Dept., UW, Waterloo, ON, N2L 3G1, Canada. naif, mkamel@pami.uwaterloo.ca 2

More information

Lossless Compression Algorithms

Lossless Compression Algorithms Multimedia Data Compression Part I Chapter 7 Lossless Compression Algorithms 1 Chapter 7 Lossless Compression Algorithms 1. Introduction 2. Basics of Information Theory 3. Lossless Compression Algorithms

More information

Machine vision. Summary # 6: Shape descriptors

Machine vision. Summary # 6: Shape descriptors Machine vision Summary # : Shape descriptors SHAPE DESCRIPTORS Objects in an image are a collection of pixels. In order to describe an object or distinguish between objects, we need to understand the properties

More information

Morphological Image Processing

Morphological Image Processing Morphological Image Processing Morphology Identification, analysis, and description of the structure of the smallest unit of words Theory and technique for the analysis and processing of geometric structures

More information

CS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University

CS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University CS443: Digital Imaging and Multimedia Binary Image Analysis Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines A Simple Machine Vision System Image segmentation by thresholding

More information

A New Approach to Computation of Curvature Scale Space Image for Shape Similarity Retrieval

A New Approach to Computation of Curvature Scale Space Image for Shape Similarity Retrieval A New Approach to Computation of Curvature Scale Space Image for Shape Similarity Retrieval Farzin Mokhtarian, Sadegh Abbasi and Josef Kittler Centre for Vision Speech and Signal Processing Department

More information

Module 4: Index Structures Lecture 13: Index structure. The Lecture Contains: Index structure. Binary search tree (BST) B-tree. B+-tree.

Module 4: Index Structures Lecture 13: Index structure. The Lecture Contains: Index structure. Binary search tree (BST) B-tree. B+-tree. The Lecture Contains: Index structure Binary search tree (BST) B-tree B+-tree Order file:///c /Documents%20and%20Settings/iitkrana1/My%20Documents/Google%20Talk%20Received%20Files/ist_data/lecture13/13_1.htm[6/14/2012

More information

Morphological Image Processing

Morphological Image Processing Morphological Image Processing Binary image processing In binary images, we conventionally take background as black (0) and foreground objects as white (1 or 255) Morphology Figure 4.1 objects on a conveyor

More information

Morphological track 1

Morphological track 1 Morphological track 1 Shapes Painting of living beings on cave walls at Lascaux [about 1500 th BC] L homme qui marche by Alberto Giacometti, 1948, NOUVELLES IMAGES Editor (1976) Les lutteurs by Honoré

More information

Professor Louay Bazzi

Professor Louay Bazzi Final Year Project Representing & Matching Bi-level Images with Holes Under the supervision of Professor Louay Bazzi Group Members Bilal Fadlallah CCE ID # 200300846 bhf01@aub.edu.lb Mazen Hajjar CCE ID

More information

EECS490: Digital Image Processing. Lecture #23

EECS490: Digital Image Processing. Lecture #23 Lecture #23 Motion segmentation & motion tracking Boundary tracking Chain codes Minimum perimeter polygons Signatures Motion Segmentation P k Accumulative Difference Image Positive ADI Negative ADI (ADI)

More information

Spatial Data Structures for Computer Graphics

Spatial Data Structures for Computer Graphics Spatial Data Structures for Computer Graphics Page 1 of 65 http://www.cse.iitb.ac.in/ sharat November 2008 Spatial Data Structures for Computer Graphics Page 1 of 65 http://www.cse.iitb.ac.in/ sharat November

More information

Fingerprint Image Compression

Fingerprint Image Compression Fingerprint Image Compression Ms.Mansi Kambli 1*,Ms.Shalini Bhatia 2 * Student 1*, Professor 2 * Thadomal Shahani Engineering College * 1,2 Abstract Modified Set Partitioning in Hierarchical Tree with

More information

Direction-Length Code (DLC) To Represent Binary Objects

Direction-Length Code (DLC) To Represent Binary Objects IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 2, Ver. I (Mar-Apr. 2016), PP 29-35 www.iosrjournals.org Direction-Length Code (DLC) To Represent Binary

More information

morphology on binary images

morphology on binary images morphology on binary images Ole-Johan Skrede 10.05.2017 INF2310 - Digital Image Processing Department of Informatics The Faculty of Mathematics and Natural Sciences University of Oslo After original slides

More information

Biomedical Image Analysis. Mathematical Morphology

Biomedical Image Analysis. Mathematical Morphology Biomedical Image Analysis Mathematical Morphology Contents: Foundation of Mathematical Morphology Structuring Elements Applications BMIA 15 V. Roth & P. Cattin 265 Foundations of Mathematical Morphology

More information

2D Grey-Level Convex Hull Computation: A Discrete 3D Approach

2D Grey-Level Convex Hull Computation: A Discrete 3D Approach 2D Grey-Level Convex Hull Computation: A Discrete 3D Approach Ingela Nyström 1, Gunilla Borgefors 2, and Gabriella Sanniti di Baja 3 1 Centre for Image Analysis, Uppsala University Uppsala, Sweden ingela@cb.uu.se

More information

Computing Covering Polyhedra of Non-Convex Objects

Computing Covering Polyhedra of Non-Convex Objects Computing Covering Polyhedra of Non-Convex Objects Gunilla Borgefors 1, Ingela Nystrom 2, and Gabriella Sanniti di Baja 3 1: Centre for Image Analysis, Swedish University of Agricultural Sciences Lagerhyddvagen

More information

Mixed Raster Content for Compound Image Compression

Mixed Raster Content for Compound Image Compression Mixed Raster Content for Compound Image Compression Final Project Presentation EE-5359 Spring 2009 Submitted to: Dr. K.R. Rao Submitted by: Pritesh Shah (1000555858) MOTIVATION In today s world it is impossible

More information

Lecture 8 Object Descriptors

Lecture 8 Object Descriptors Lecture 8 Object Descriptors Azadeh Fakhrzadeh Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapter 11.1 11.4 in G-W Azadeh Fakhrzadeh

More information

A Research Paper on Lossless Data Compression Techniques

A Research Paper on Lossless Data Compression Techniques IJIRST International Journal for Innovative Research in Science & Technology Volume 4 Issue 1 June 2017 ISSN (online): 2349-6010 A Research Paper on Lossless Data Compression Techniques Prof. Dipti Mathpal

More information

Morphological Image Processing

Morphological Image Processing Morphological Image Processing Ranga Rodrigo October 9, 29 Outline Contents Preliminaries 2 Dilation and Erosion 3 2. Dilation.............................................. 3 2.2 Erosion..............................................

More information

An Efficient Visual Hull Computation Algorithm

An Efficient Visual Hull Computation Algorithm An Efficient Visual Hull Computation Algorithm Wojciech Matusik Chris Buehler Leonard McMillan Laboratory for Computer Science Massachusetts institute of Technology (wojciech, cbuehler, mcmillan)@graphics.lcs.mit.edu

More information

Dictionary Based Compression for Images

Dictionary Based Compression for Images Dictionary Based Compression for Images Bruno Carpentieri Abstract Lempel-Ziv methods were original introduced to compress one-dimensional data (text, object codes, etc.) but recently they have been successfully

More information

Compression of 3D Objects with Multistage Color-Depth Panoramic Maps

Compression of 3D Objects with Multistage Color-Depth Panoramic Maps Compression of 3D Objects with Multistage Color-Depth Panoramic Maps Chang-Ming Tsai 1,2, Wen-Yan Chang 1, Chu-Song Chen 1, Gregory Y. Tang 2 1 Institute of Information Science, Academia Sinica, Nankang

More information

Multimedia Networking ECE 599

Multimedia Networking ECE 599 Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on B. Lee s lecture notes. 1 Outline Compression basics Entropy and information theory basics

More information

Removing Spatial Redundancy from Image by Using Variable Vertex Chain Code

Removing Spatial Redundancy from Image by Using Variable Vertex Chain Code EUROPEAN ACADEMIC RESEARCH Vol. II, Issue 1/ April 2014 ISSN 2286-4822 www.euacademic.org Impact Factor: 3.1 (UIF) DRJI Value: 5.9 (B+) Removing Spatial Redundancy from Image by Using Variable Vertex Chain

More information

A New Technique of Lossless Image Compression using PPM-Tree

A New Technique of Lossless Image Compression using PPM-Tree A New Technique of Lossless Image Compression PP-Tree Shams ahmood Imam, S.. Rezaul Hoque, ohammad Kabir Hossain, William Perrizo Department of Computer Science and Engineering, North South University,

More information

EECS490: Digital Image Processing. Lecture #17

EECS490: Digital Image Processing. Lecture #17 Lecture #17 Morphology & set operations on images Structuring elements Erosion and dilation Opening and closing Morphological image processing, boundary extraction, region filling Connectivity: convex

More information

AHD: The Alternate Hierarchical Decomposition of Nonconvex Polytopes (Generalization of a Convex Polytope Based Spatial Data Model)

AHD: The Alternate Hierarchical Decomposition of Nonconvex Polytopes (Generalization of a Convex Polytope Based Spatial Data Model) AHD: The Alternate Hierarchical Decomposition of Nonconvex Polytopes (Generalization of a Convex Polytope Based Spatial Data Model) Rizwan Bulbul Institute of Geoinformation and Cartography Technical University

More information

Efficient View-Dependent Sampling of Visual Hulls

Efficient View-Dependent Sampling of Visual Hulls Efficient View-Dependent Sampling of Visual Hulls Wojciech Matusik Chris Buehler Leonard McMillan Computer Graphics Group MIT Laboratory for Computer Science Cambridge, MA 02141 Abstract In this paper

More information

CHAPTER 4 REVERSIBLE IMAGE WATERMARKING USING BIT PLANE CODING AND LIFTING WAVELET TRANSFORM

CHAPTER 4 REVERSIBLE IMAGE WATERMARKING USING BIT PLANE CODING AND LIFTING WAVELET TRANSFORM 74 CHAPTER 4 REVERSIBLE IMAGE WATERMARKING USING BIT PLANE CODING AND LIFTING WAVELET TRANSFORM Many data embedding methods use procedures that in which the original image is distorted by quite a small

More information

Fast Distance Transform Computation using Dual Scan Line Propagation

Fast Distance Transform Computation using Dual Scan Line Propagation Fast Distance Transform Computation using Dual Scan Line Propagation Fatih Porikli Tekin Kocak Mitsubishi Electric Research Laboratories, Cambridge, USA ABSTRACT We present two fast algorithms that approximate

More information

Context based optimal shape coding

Context based optimal shape coding IEEE Signal Processing Society 1999 Workshop on Multimedia Signal Processing September 13-15, 1999, Copenhagen, Denmark Electronic Proceedings 1999 IEEE Context based optimal shape coding Gerry Melnikov,

More information

Department of electronics and telecommunication, J.D.I.E.T.Yavatmal, India 2

Department of electronics and telecommunication, J.D.I.E.T.Yavatmal, India 2 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY LOSSLESS METHOD OF IMAGE COMPRESSION USING HUFFMAN CODING TECHNIQUES Trupti S Bobade *, Anushri S. sastikar 1 Department of electronics

More information

Image retrieval based on region shape similarity

Image retrieval based on region shape similarity Image retrieval based on region shape similarity Cheng Chang Liu Wenyin Hongjiang Zhang Microsoft Research China, 49 Zhichun Road, Beijing 8, China {wyliu, hjzhang}@microsoft.com ABSTRACT This paper presents

More information

Lossless Image Compression with Lossy Image Using Adaptive Prediction and Arithmetic Coding

Lossless Image Compression with Lossy Image Using Adaptive Prediction and Arithmetic Coding Lossless Image Compression with Lossy Image Using Adaptive Prediction and Arithmetic Coding Seishi Taka" and Mikio Takagi Institute of Industrial Science, University of Tokyo Abstract Lossless gray scale

More information

Coarse-to-Fine Search Technique to Detect Circles in Images

Coarse-to-Fine Search Technique to Detect Circles in Images Int J Adv Manuf Technol (1999) 15:96 102 1999 Springer-Verlag London Limited Coarse-to-Fine Search Technique to Detect Circles in Images M. Atiquzzaman Department of Electrical and Computer Engineering,

More information

Image Rotation Using Quad Tree

Image Rotation Using Quad Tree 80 Image Rotation Using Quad Tree Aashish Kumar, Lec. ECE Dept. Swami Vivekanand institute of Engneering & Technology, Ramnagar Banur ABSTRACT This paper presents a data structure based technique of rotating

More information

Digital Image Processing Fundamentals

Digital Image Processing Fundamentals Ioannis Pitas Digital Image Processing Fundamentals Chapter 7 Shape Description Answers to the Chapter Questions Thessaloniki 1998 Chapter 7: Shape description 7.1 Introduction 1. Why is invariance to

More information

Computer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL

Computer Graphics. The Two-Dimensional Viewing. Somsak Walairacht, Computer Engineering, KMITL Computer Graphics Chapter 6 The Two-Dimensional Viewing Somsak Walairacht, Computer Engineering, KMITL Outline The Two-Dimensional Viewing Pipeline The Clipping Window Normalization and Viewport Transformations

More information

Lofting 3D Shapes. Abstract

Lofting 3D Shapes. Abstract Lofting 3D Shapes Robby Prescott Department of Computer Science University of Wisconsin Eau Claire Eau Claire, Wisconsin 54701 robprescott715@gmail.com Chris Johnson Department of Computer Science University

More information

A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes

A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes Rizwan Bulbul, Farid Karimipour and Andrew U. Frank Institute of Geoinformation and Cartography Technical

More information

CITS 4402 Computer Vision

CITS 4402 Computer Vision CITS 4402 Computer Vision A/Prof Ajmal Mian Adj/A/Prof Mehdi Ravanbakhsh, CEO at Mapizy (www.mapizy.com) and InFarm (www.infarm.io) Lecture 02 Binary Image Analysis Objectives Revision of image formation

More information

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 14, NO. 3, MARCH

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 14, NO. 3, MARCH IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 14, NO. 3, MARCH 2005 343 Rate-Distortion Optimized Tree-Structured Compression Algorithms for Piecewise Polynomial Images Rahul Shukla, Member, IEEE, Pier Luigi

More information

Compression of 3-Dimensional Medical Image Data Using Part 2 of JPEG 2000

Compression of 3-Dimensional Medical Image Data Using Part 2 of JPEG 2000 Page 1 Compression of 3-Dimensional Medical Image Data Using Part 2 of JPEG 2000 Alexis Tzannes, Ph.D. Aware, Inc. Nov. 24, 2003 1. Introduction JPEG 2000 is the new ISO standard for image compression

More information

Orthogonal Range Search and its Relatives

Orthogonal Range Search and its Relatives Orthogonal Range Search and its Relatives Coordinate-wise dominance and minima Definition: dominates Say that point (x,y) dominates (x', y') if x

More information

CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT

CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT 9.1 Introduction In the previous chapters the inpainting was considered as an iterative algorithm. PDE based method uses iterations to converge

More information

Code Transformation of DF-Expression between Bintree and Quadtree

Code Transformation of DF-Expression between Bintree and Quadtree Code Transformation of DF-Expression between Bintree and Quadtree Chin-Chen Chang*, Chien-Fa Li*, and Yu-Chen Hu** *Department of Computer Science and Information Engineering, National Chung Cheng University

More information

A COMPRESSION TECHNIQUES IN DIGITAL IMAGE PROCESSING - REVIEW

A COMPRESSION TECHNIQUES IN DIGITAL IMAGE PROCESSING - REVIEW A COMPRESSION TECHNIQUES IN DIGITAL IMAGE PROCESSING - ABSTRACT: REVIEW M.JEYAPRATHA 1, B.POORNA VENNILA 2 Department of Computer Application, Nadar Saraswathi College of Arts and Science, Theni, Tamil

More information

Trees. Q: Why study trees? A: Many advance ADTs are implemented using tree-based data structures.

Trees. Q: Why study trees? A: Many advance ADTs are implemented using tree-based data structures. Trees Q: Why study trees? : Many advance DTs are implemented using tree-based data structures. Recursive Definition of (Rooted) Tree: Let T be a set with n 0 elements. (i) If n = 0, T is an empty tree,

More information

Trees : Part 1. Section 4.1. Theory and Terminology. A Tree? A Tree? Theory and Terminology. Theory and Terminology

Trees : Part 1. Section 4.1. Theory and Terminology. A Tree? A Tree? Theory and Terminology. Theory and Terminology Trees : Part Section. () (2) Preorder, Postorder and Levelorder Traversals Definition: A tree is a connected graph with no cycles Consequences: Between any two vertices, there is exactly one unique path

More information

Mixed Raster Content for Compound Image Compression

Mixed Raster Content for Compound Image Compression Mixed Raster Content for Compound Image Compression SPRING 2009 PROJECT REPORT EE-5359 MULTIMEDIA PROCESSING Submitted to: Dr. K. R. Rao Submitted by: (1000555858) 1 P a g e INDEX Sr. # TOPIC page (1)

More information

Boundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking

Boundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking Representation REPRESENTATION & DESCRIPTION After image segmentation the resulting collection of regions is usually represented and described in a form suitable for higher level processing. Most important

More information

1/60. Geometric Algorithms. Lecture 1: Introduction. Convex Hulls

1/60. Geometric Algorithms. Lecture 1: Introduction. Convex Hulls 1/60 Geometric Algorithms Lecture 1: Introduction Convex Hulls Geometric algorithms scope 2/60 Geometry algorithms (practice): Study of geometric problems that arise in various applications and how algorithms

More information

Compression of line-drawing images using vectorizing and feature-based filtering

Compression of line-drawing images using vectorizing and feature-based filtering Compression of line-drawing images using vectorizing and feature-based filtering Pasi Fränti, Eugene I. Ageenko Department of Computer Science, University of Joensuu P.O. Box 111, FIN-80101 Joensuu, FINLAND

More information

CS 335 Graphics and Multimedia. Image Compression

CS 335 Graphics and Multimedia. Image Compression CS 335 Graphics and Multimedia Image Compression CCITT Image Storage and Compression Group 3: Huffman-type encoding for binary (bilevel) data: FAX Group 4: Entropy encoding without error checks of group

More information

University of Cambridge Engineering Part IIB Module 4F12 - Computer Vision and Robotics Mobile Computer Vision

University of Cambridge Engineering Part IIB Module 4F12 - Computer Vision and Robotics Mobile Computer Vision report University of Cambridge Engineering Part IIB Module 4F12 - Computer Vision and Robotics Mobile Computer Vision Web Server master database User Interface Images + labels image feature algorithm Extract

More information

(Refer Slide Time 00:17) Welcome to the course on Digital Image Processing. (Refer Slide Time 00:22)

(Refer Slide Time 00:17) Welcome to the course on Digital Image Processing. (Refer Slide Time 00:22) Digital Image Processing Prof. P. K. Biswas Department of Electronics and Electrical Communications Engineering Indian Institute of Technology, Kharagpur Module Number 01 Lecture Number 02 Application

More information

IMAGE COMPRESSION. Image Compression. Why? Reducing transportation times Reducing file size. A two way event - compression and decompression

IMAGE COMPRESSION. Image Compression. Why? Reducing transportation times Reducing file size. A two way event - compression and decompression IMAGE COMPRESSION Image Compression Why? Reducing transportation times Reducing file size A two way event - compression and decompression 1 Compression categories Compression = Image coding Still-image

More information

A Vertex Chain Code Approach for Image Recognition

A Vertex Chain Code Approach for Image Recognition A Vertex Chain Code Approach for Image Recognition Abdel-Badeeh M. Salem, Adel A. Sewisy, Usama A. Elyan Faculty of Computer and Information Sciences, Assiut University, Assiut, Egypt, usama471@yahoo.com,

More information

Rate-Distortion Optimized Tree Structured Compression Algorithms for Piecewise Polynomial Images

Rate-Distortion Optimized Tree Structured Compression Algorithms for Piecewise Polynomial Images 1 Rate-Distortion Optimized Tree Structured Compression Algorithms for Piecewise Polynomial Images Rahul Shukla, Pier Luigi Dragotti 1, Minh N. Do and Martin Vetterli Audio-Visual Communications Laboratory,

More information

(Refer Slide Time: 00:02:00)

(Refer Slide Time: 00:02:00) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts

More information

Fundamentals of Multimedia. Lecture 5 Lossless Data Compression Variable Length Coding

Fundamentals of Multimedia. Lecture 5 Lossless Data Compression Variable Length Coding Fundamentals of Multimedia Lecture 5 Lossless Data Compression Variable Length Coding Mahmoud El-Gayyar elgayyar@ci.suez.edu.eg Mahmoud El-Gayyar / Fundamentals of Multimedia 1 Data Compression Compression

More information

Mesh Quality Tutorial

Mesh Quality Tutorial Mesh Quality Tutorial Figure 1: The MeshQuality model. See Figure 2 for close-up of bottom-right area This tutorial will illustrate the importance of Mesh Quality in PHASE 2. This tutorial will also show

More information

CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS

CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS CLASSIFICATION OF BOUNDARY AND REGION SHAPES USING HU-MOMENT INVARIANTS B.Vanajakshi Department of Electronics & Communications Engg. Assoc.prof. Sri Viveka Institute of Technology Vijayawada, India E-mail:

More information

MPEG-7 Visual shape descriptors

MPEG-7 Visual shape descriptors MPEG-7 Visual shape descriptors Miroslaw Bober presented by Peter Tylka Seminar on scientific soft skills 22.3.2012 Presentation Outline Presentation Outline Introduction to problem Shape spectrum - 3D

More information

Problem definition Image acquisition Image segmentation Connected component analysis. Machine vision systems - 1

Problem definition Image acquisition Image segmentation Connected component analysis. Machine vision systems - 1 Machine vision systems Problem definition Image acquisition Image segmentation Connected component analysis Machine vision systems - 1 Problem definition Design a vision system to see a flat world Page

More information

Embedded Rate Scalable Wavelet-Based Image Coding Algorithm with RPSWS

Embedded Rate Scalable Wavelet-Based Image Coding Algorithm with RPSWS Embedded Rate Scalable Wavelet-Based Image Coding Algorithm with RPSWS Farag I. Y. Elnagahy Telecommunications Faculty of Electrical Engineering Czech Technical University in Prague 16627, Praha 6, Czech

More information

Chapter 3. Sukhwinder Singh

Chapter 3. Sukhwinder Singh Chapter 3 Sukhwinder Singh PIXEL ADDRESSING AND OBJECT GEOMETRY Object descriptions are given in a world reference frame, chosen to suit a particular application, and input world coordinates are ultimately

More information

Digital Image Processing

Digital Image Processing Digital Image Processing Part 9: Representation and Description AASS Learning Systems Lab, Dep. Teknik Room T1209 (Fr, 11-12 o'clock) achim.lilienthal@oru.se Course Book Chapter 11 2011-05-17 Contents

More information

Image-Based Competitive Printed Circuit Board Analysis

Image-Based Competitive Printed Circuit Board Analysis Image-Based Competitive Printed Circuit Board Analysis Simon Basilico Department of Electrical Engineering Stanford University Stanford, CA basilico@stanford.edu Ford Rylander Department of Electrical

More information

Properties of red-black trees

Properties of red-black trees Red-Black Trees Introduction We have seen that a binary search tree is a useful tool. I.e., if its height is h, then we can implement any basic operation on it in O(h) units of time. The problem: given

More information

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms CS245-2008S-19 B-Trees David Galles Department of Computer Science University of San Francisco 19-0: Indexing Operations: Add an element Remove an element Find an element,

More information

IMAGE COMPRESSION USING HYBRID QUANTIZATION METHOD IN JPEG

IMAGE COMPRESSION USING HYBRID QUANTIZATION METHOD IN JPEG IMAGE COMPRESSION USING HYBRID QUANTIZATION METHOD IN JPEG MANGESH JADHAV a, SNEHA GHANEKAR b, JIGAR JAIN c a 13/A Krishi Housing Society, Gokhale Nagar, Pune 411016,Maharashtra, India. (mail2mangeshjadhav@gmail.com)

More information

Self-Balancing Search Trees. Chapter 11

Self-Balancing Search Trees. Chapter 11 Self-Balancing Search Trees Chapter 11 Chapter Objectives To understand the impact that balance has on the performance of binary search trees To learn about the AVL tree for storing and maintaining a binary

More information

EXAM ELEMENTARY MATH FOR GMT: ALGORITHM ANALYSIS NOVEMBER 7, 2013, 13:15-16:15, RUPPERT D

EXAM ELEMENTARY MATH FOR GMT: ALGORITHM ANALYSIS NOVEMBER 7, 2013, 13:15-16:15, RUPPERT D SOLUTIONS EXAM ELEMENTARY MATH FOR GMT: ALGORITHM ANALYSIS NOVEMBER 7, 2013, 13:15-16:15, RUPPERT D This exam consists of 6 questions, worth 10 points in total, and a bonus question for 1 more point. Using

More information

BST Deletion. First, we need to find the value which is easy because we can just use the method we developed for BST_Search.

BST Deletion. First, we need to find the value which is easy because we can just use the method we developed for BST_Search. BST Deletion Deleting a value from a Binary Search Tree is a bit more complicated than inserting a value, but we will deal with the steps one at a time. First, we need to find the value which is easy because

More information

CS 171: Introduction to Computer Science II. Binary Search Trees

CS 171: Introduction to Computer Science II. Binary Search Trees CS 171: Introduction to Computer Science II Binary Search Trees Binary Search Trees Symbol table applications BST definitions and terminologies Search and insert Traversal Ordered operations Delete Symbol

More information

CHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106

CHAPTER 6. 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform. 6.3 Wavelet Transform based compression technique 106 CHAPTER 6 6 Huffman Coding Based Image Compression Using Complex Wavelet Transform Page No 6.1 Introduction 103 6.2 Compression Techniques 104 103 6.2.1 Lossless compression 105 6.2.2 Lossy compression

More information

Lecture 3: Art Gallery Problems and Polygon Triangulation

Lecture 3: Art Gallery Problems and Polygon Triangulation EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified

More information

ECEN 447 Digital Image Processing

ECEN 447 Digital Image Processing ECEN 447 Digital Image Processing Lecture 7: Mathematical Morphology Ulisses Braga-Neto ECE Department Texas A&M University Basics of Mathematical Morphology Mathematical Morphology (MM) is a discipline

More information

A Fast Convex Hull Algorithm for Binary Image

A Fast Convex Hull Algorithm for Binary Image Informatica 34 (2010) 369-376 369 A Fast Convex Hull Algorithm for Binary Image Xianuan Zhang and Zhenjun Tang Department of Computer Science, Guangxi Normal University, Guilin 541004, P.R. China E-mail:

More information

Page 1. Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms

Page 1. Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms Visible Surface Determination Visibility Culling Area-Subdivision Algorithms z-buffer Algorithm List Priority Algorithms BSP (Binary Space Partitioning Tree) Scan-line Algorithms Divide-and-conquer strategy:

More information

Tracking and Recognizing People in Colour using the Earth Mover s Distance

Tracking and Recognizing People in Colour using the Earth Mover s Distance Tracking and Recognizing People in Colour using the Earth Mover s Distance DANIEL WOJTASZEK, ROBERT LAGANIÈRE S.I.T.E. University of Ottawa, Ottawa, Ontario, Canada K1N 6N5 danielw@site.uottawa.ca, laganier@site.uottawa.ca

More information

Chapter 11 Representation & Description

Chapter 11 Representation & Description Chain Codes Chain codes are used to represent a boundary by a connected sequence of straight-line segments of specified length and direction. The direction of each segment is coded by using a numbering

More information

Realtime Object Recognition Using Decision Tree Learning

Realtime Object Recognition Using Decision Tree Learning Realtime Object Recognition Using Decision Tree Learning Dirk Wilking 1 and Thomas Röfer 2 1 Chair for Computer Science XI, Embedded Software Group, RWTH Aachen wilking@informatik.rwth-aachen.de 2 Center

More information

Introduction. Computer Vision & Digital Image Processing. Preview. Basic Concepts from Set Theory

Introduction. Computer Vision & Digital Image Processing. Preview. Basic Concepts from Set Theory Introduction Computer Vision & Digital Image Processing Morphological Image Processing I Morphology a branch of biology concerned with the form and structure of plants and animals Mathematical morphology

More information

Computational Geometry. Lecture 17

Computational Geometry. Lecture 17 Computational Geometry Lecture 17 Computational geometry Algorithms for solving geometric problems in 2D and higher. Fundamental objects: Basic structures: point line segment line point set polygon L17.2

More information

SHAPE ENCODING FOR EDGE MAP IMAGE COMPRESSION. Demetrios P. Gerogiannis, Christophoros Nikou, Lisimachos P. Kondi

SHAPE ENCODING FOR EDGE MAP IMAGE COMPRESSION. Demetrios P. Gerogiannis, Christophoros Nikou, Lisimachos P. Kondi SHAPE ENCODING FOR EDGE MAP IMAGE COMPRESSION Demetrios P. Gerogiannis, Christophoros Nikou, Lisimachos P. Kondi Department of Computer Science and Engineering, University of Ioannina, 45110 Ioannina,

More information

9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B

9 length of contour = no. of horizontal and vertical components + ( 2 no. of diagonal components) diameter of boundary B 8. Boundary Descriptor 8.. Some Simple Descriptors length of contour : simplest descriptor - chain-coded curve 9 length of contour no. of horiontal and vertical components ( no. of diagonal components

More information

Wavelet Based Image Compression Using ROI SPIHT Coding

Wavelet Based Image Compression Using ROI SPIHT Coding International Journal of Information & Computation Technology. ISSN 0974-2255 Volume 1, Number 2 (2011), pp. 69-76 International Research Publications House http://www.irphouse.com Wavelet Based Image

More information

Lecture 06. Raster and Vector Data Models. Part (1) Common Data Models. Raster. Vector. Points. Points. ( x,y ) Area. Area Line.

Lecture 06. Raster and Vector Data Models. Part (1) Common Data Models. Raster. Vector. Points. Points. ( x,y ) Area. Area Line. Lecture 06 Raster and Vector Data Models Part (1) 1 Common Data Models Vector Raster Y Points Points ( x,y ) Line Area Line Area 2 X 1 3 Raster uses a grid cell structure Vector is more like a drawn map

More information

DIFFERENTIAL IMAGE COMPRESSION BASED ON ADAPTIVE PREDICTION

DIFFERENTIAL IMAGE COMPRESSION BASED ON ADAPTIVE PREDICTION DIFFERENTIAL IMAGE COMPRESSION BASED ON ADAPTIVE PREDICTION M.V. Gashnikov Samara National Research University, Samara, Russia Abstract. The paper describes the adaptive prediction algorithm for differential

More information

EE67I Multimedia Communication Systems Lecture 4

EE67I Multimedia Communication Systems Lecture 4 EE67I Multimedia Communication Systems Lecture 4 Lossless Compression Basics of Information Theory Compression is either lossless, in which no information is lost, or lossy in which information is lost.

More information

1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1

1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1 Asymptotics, Recurrence and Basic Algorithms 1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1 1. O(logn) 2. O(n) 3. O(nlogn) 4. O(n 2 ) 5. O(2 n ) 2. [1 pt] What is the solution

More information

CS 231A Computer Vision (Winter 2014) Problem Set 3

CS 231A Computer Vision (Winter 2014) Problem Set 3 CS 231A Computer Vision (Winter 2014) Problem Set 3 Due: Feb. 18 th, 2015 (11:59pm) 1 Single Object Recognition Via SIFT (45 points) In his 2004 SIFT paper, David Lowe demonstrates impressive object recognition

More information

Qin-Zhong Ye. Dept. of Electrical Engineering Linkiiping University S LinkGping, Sweden. 2. The signed Euclidean distance transform

Qin-Zhong Ye. Dept. of Electrical Engineering Linkiiping University S LinkGping, Sweden. 2. The signed Euclidean distance transform The Signed Euclidean Distance Transform and Its Applications QinZhong Ye Dept. of Electrical Engineering Linkiiping University S581 83 LinkGping, Sweden Abstract The signed Euclidean distance transform

More information

Decision trees. Decision trees are useful to a large degree because of their simplicity and interpretability

Decision trees. Decision trees are useful to a large degree because of their simplicity and interpretability Decision trees A decision tree is a method for classification/regression that aims to ask a few relatively simple questions about an input and then predicts the associated output Decision trees are useful

More information