Code Transformation of DFExpression between Bintree and Quadtree


 Imogene Preston
 1 years ago
 Views:
Transcription
1 Code Transformation of DFExpression between Bintree and Quadtree ChinChen Chang*, ChienFa Li*, and YuChen Hu** *Department of Computer Science and Information Engineering, National Chung Cheng University ** Department of Computer Science and Information Management Providence University Abstract In this paper, algorithms for transforming code between bintree and quadtree are proposed. The quadtree and bintree are two commonly used representations for image manipulations. However, there exists no algorithm for transforming code between bintree and quadtree. When one receiver a DFexpression of a bintree or quadtree code and does not have the corresponding decoding program, she/he, with our new code transformation algorithms at hand, can transform the received code into a quadtree or bintree code that she/he can handle. After code transformation, the receiver can see whether the output code is smaller than the input code. From it, she/he can further decide which code is more economic in its memory space needed; therefore, she/he can store the code with smaller size for saving more memory space. Keywords: bintree, quadtree, code transformation 1. Introduction In the fields of computer graphics, geographic information systems, and image processing, the representation of spatial data, such as arbitrary regions, point data, collections of lines, curves, surfaces, volumes, and so on, is an important issue. Because of the huge storage requirements and the high computational complexity of image manipulations, the extensive study of efficient image representations has become an important research issue. Up to the present, several spatial data structures for representing compressed binary images and the related image manipulations [7,8,9,11,12] have been presented. Basically, these data structures can be classified into six categories, namely, chaincodes, runlength codes, trees, lineartrees, depthfirst representation, and breadthfirst representation. The first category, chaincodes [15], can be used to represent a series of numbers that record the boundary of each object with a given image. The second category, runlength codes [18], can be used to represent, for an image, a list of pixels that are ordered by rows. Trees [7] can be used to represent a tree structure and store it by using the pointertype data structure, such as the octree, the quadtree, the bintree, and so on. Linear trees can be used to represent a set of codes which are formed by the black leaf nodes of the corresponding quadtree or bintree of the image, such as FDlocational codes, FLlocational codes, VLlocational codes [7], bincode [17], and so on. Depthfirst representations can be used to represent an image by traversing the nodes of quadtree or bintree in depthfirst order. Finally, breadthfirst representations can be used to represent the nodes of a quadtree or bintree in breadthfirst order [1,3,4,5,6,10]. Many important and efficient algorithms for these different spatial representations, for example, rotation, mirroring, hiddensurface elimination, ray tracing, bean tracing, medial axis transforms, set operations, neighbors finding, moments, connected component labeling, Euler number, area, perimeter, windowing, expansion, and dilation, have been presented in recent decades [7,8]. Thus, it is very important and interesting to design an efficient transformation among these representations. That is, if any two representations can be transformed by each other, the algorithms that were developed for transforming the two representations can be shared by the two representations. In addition, the storage space required in each representation is quite different. We can choose the one with less storage cost to save storage costs. The algorithm for converting a quadtree from chain codes [19] has been presented. In addition, the algorithm for converting a quadtree representation to its corresponding chain codes representation has been presented [14]. The algorithm for converting a quadtree representation to its corresponding runlength codes [20] has also been presented. Furthermore, the algorithm for converting a quadtree to runlength codes was presented in [21]. The transformation between chain codes and runlength codes are straightforward [7]. The code transformation between the DF linear quadtree and BF linear quadtree has already been proposed [2]. When a DFexpression code of a quadtree/bintree is received without a corresponding decoding program, this problem can be solved if the DFexpression code of a quadtree/bintree can be transformed into its corresponding DFexpression code of the bintree/quadtree. Taking advantage of this flexibility, the storage space of one image can also be reduced by changing it from one code to another. In this paper, we intend to provide the code transformation algorithm for two commonly used DFexpressions, which are the quadtree and bintree scheme. The remainder of this paper is organized as follows. In Section 2, we shall
2 review the DFexpression of a bintree and quadtree. In Section 3, our new code transformation algorithms for using the DFexpression between a bintree and quadtree will be presented. Finally, the conclusion will be given in the last section. 2. Previous Works In this section, we will review some related schemes of the DFexpression and the quadtree and the bintree algorithms. The DFexpression was introduced by Kawaguchi and Endo [16]. In Section 2.1, we will briefly describe one DFexpression quadtree representation. In Section 2.2, the proposed DFexpression bintree code will be briefly introduced. 2.1 The DFexpression Representations of a Quadtree A quadtree is a hierarchical data structure for representing a binary image. It is constructed by successively subdividing an image into four equalsized subimages in four quadrants: NW (northwest) quadrant, NE (northeast) quadrant, SW (southwest) quadrant, and SE (southeast) quadrant. A leaf node in the tree alone can represent a homogeneous quadrant of the image. On the other hand, an internal node represents a heterogeneous quadrant of the image. Each internal node is further divided into four subquadrants, and each subquadrant can be even further divided into four smaller subquadrants until each subquadrant has only one color. An external node whose color is black (white) is called a black (white) node, and an internal node is called a gray node. Fig. 1 shows an example of the quadtree segmentation process. The original binary image of pixels is shown in Fig. 1(a). The corresponding quadtree is depicted in Fig. 1(b). In 1980, Kawaguchi and Endo proposed an effective way for the DFexpression of a quadtree representation [16]. When an internal node is visited, the symbol ( is used to represent it. When a black leaf node and a white leaf node are encountered, the symbols B and W are used to represent them, respectively. The DFexpression quadtree representation of the image shown in Fig. 2 is ((BBWW((WBWWWW(BWWWB(W(WWBBBW. DFexpression codes:((bbww((wbwwww(bwwwb(w(wwbbbw Fig. 2 The DFexpression of quadtree codes for the image shown in Fig. 1(a) 2.2 The DFexpression Representations of a Bintree In this subsection, we will introduce the DFexpression of a bintree, which was proposed in [13]. A bintree is a hierarchical data structure used to represent a binary image. The root of the bintree represents the image, if the entire image is completely black or white. Otherwise, the root is grey. The image is splitted into two equalsized subimages, and its children corresponding to the two subimages are added to the root. This subdivision process is then repeated recursively for each of the two subimages until the subimage is completely black or white. At each step, the partition alternates between the x and yaxes. If a subdivision is either black or white, then its corresponding node is an external node; otherwise, it is an 3 3 internal node. Given a binary image of size 2 2 and shown in Fig. 1(a). Fig. 3 depicts an example of the corresponding bintree segmentation process. Some as the way for the DFexpression of a quadtree representation in[16], when an internal node is visited, the symbol ( is used to represent it. When a black leaf node and a white leaf node are encountered, the symbols B and W are used to represent them, respectively. The DFexpression for a bintree of the image shown in Fig. 1(a) is shown in Fig. 3. The result is ((((BW(BWB((((W(BWW(W((BWW((WB(((WB (WBW. (a)the binary image (b) The corresponding quadtree Fig. 1 Example of the quadtree segmentation process DFexpression:((((BW(BWB((((W(BWW(W((BWW((WB(((WB(WBW Fig. 3 The corresponding DFexpression codes of a bintree for the image in Fig. 1(a)
3 3. The Proposed Algorithms In this section, the algorithm that transforms a DFexpression of a quadtree into its corresponding DFexpression of a bintree shall be introduced. Next, the algorithms for the transformation of a DFexpression of a bintree into its corresponding DFexpression of a quadtree shall also be described. To transform the DFexpression of a quadtree into the corresponding DFexpression of a bintree, the following steps are executed. If an internal node, that is, the symbol (, is found, it will be transformed into the symbols (( S1S3(S2S4. The symbols S1, S2, S3, and S4 denote these four subtree expressions of a quadtree. When we scan the next quadtree symbol, we record the DFexpression expression of a bintree in reverse order, from the S2 and S3 subtree node of a quadtree. If the scanned symbol indicates that a leaf node, that is, the symbols B or W, is found, then the corresponding bintree codes, the symbols B or W, are produced. The above steps are recursively executed until all the symbols in the DFexpression of a quadtree are processed. After all the symbols of the DF quadtree expression are processed, the corresponding DFexpression of bintree is generated. (a) The 2 2 binary image (b) DFexpression of quadtree and bintree (c) DFexpression transformation from quadtree to bintree Fig. 4 A quadtree to a bintree transformation for a DFexpression A simple example of a transformation from the DFexpression of a quadtree to the DFexpression of a bintree is demonstrated in Fig. 4. The DFexpression of a bintree can be obtained by scanning the symbols in the DF quadtree expression. In Fig. 4(b), an internal node of a quadtree produces three internal nodes of a bintree. The second and third leaf nodes of a quadtree become the third and second leaf nodes of a bintree. Therefore, we must change the positions of these two nodes. In Fig. 4(c), the original DFexpression of a quadtree and its resultant DF bintree expression are given. When a DFexpression of a quadtree wants to transform into its DFexpression of bintree, the DFexpression of a quadtree is inputted and Procedure QTB is executed. Procedure QTB: /* Quadtree code to Bintree code transformation */ Step 1: Get the current DFexpression code of quadtree qc. If qc is NULL, then go to Step 6. Step 2: If qc= (, four recursive procedures of QTB are sequentially performed to process the next four expression codes, S 1, S 2, S 3, and S 4, respectively. Step 3: If qc= B or W, return qc to the caller. Step 4: If all the recursive calls generated by the current procedure are terminated, generate the DFexpression of a bintree for qc according to the following rules: (( S1S 3 ( S 2 S 4 if qc = '(', here S1, S 2, S 3, and S 4 denote the retruned results of these bintree code = four recursive calls, ' B' if qc = ' B', ' W' if qc = ' W'. Step 5: When an internal node records the symbol ( and the leaf nodes of its two children have the same color B or W, the symbol B or W is used to represent these three symbols. Step 6: Output the bintree code. A complete transformation example of the DFexpression of a quadtree to the DFexpression of a bintree code is given in Fig. 5. The DFexpression of a bintree representation is obtained by scanning the DFexpression code of a quadtree representation. In Fig. 5, the quadtree code without the underline denotes a subquadtree of the root node. A code with the underline is another subtree of the quadtree root node. When a symbol with the value ( is found in the DFexpression of a quadtree, the symbols (( ( are used to replace the previous one. At the same time, the program will start to generate four recursive procedure calls sequentially. Finally, it reads each code and appends the corresponding code to the previously output code list which gives the corresponding DFexpression of a bintree. Let us now look at the guidelines for transforming a DFexpression of a bintree into its corresponding DFexpression of a quadtree. First, if the scanned DFexpression symbols are two successive internal nodes
4 with the value ((, then the second symbol is removed to generate (. If the scanned code is a leaf node with the value B or W, then the corresponding quadtree codes are produced. The above steps are recursively processed until all the symbols in the DFexpression of the quadtree are scanned. Fig. 5 Example of a DFexpression from a quadtree to a bintree transformation (a) The 2 2 binary image (b) DFexpression of bintree and quadtree (c) DFexpression transformation from bintree to quadtree Fig. 6 A bintree to quadtree transformation for a DFexpression An example illustrating the transformation of a DFexpression of a bintree to a DFexpression of a quadtree is given in Fig. 6. In Fig. 6(b), the three internal nodes of the twolevel bintree are transformed into a single level quadtree with one internal node. The second and third leaf nodes of a bintree become the third and second leaf nodes of the quadtree. For this reason, when the codes are transformed, we must change the positions of these two subtrees. In Fig. 6(c), a DFexpression of a bintree and the resultant DFexpression of quadtree is given. When a DFexpression of a bintree wants to transform into a DFexpression of quadtree, Procedure BTQ described as follows is executed. Procedure BTQ: /* Bintree code to Quadtree code transformation */ Step 1: Get the current DFexpression code of bindtree bc. If bc is NULL, then go to Step 4. Step 2: Suppose bc= ( and the next bc= (. Four recursive procedures of BTQ are called sequentially to process the next four bintree code S 1, S 3, S 2, and S 4, respectively. Step 3: If bc= B or W, return bc to the caller. Step 4: If all the recursive calls generated by the current procedure are terminated, generate the DFexpression codes of the quadtree for the bc according to the following rules: ( S1 S 2 S 3 S 4 if bc = '(' and next bc = '(', here S1 S 2 S 3 S 4 denote the results of the quadtree code = four recursive procedures 'B' if bc = 'B', ' W' if bc = ' W'. Step 5: Output the quadtree code. A complete example for transforming the DFexpression of a bintree to the DFexpression of a quadtree is given in Fig. 7. In Fig. 7, the bintree code with a single underline is a grandchild subtree of the bintree root node; a code with a double underline is a grandchild subtree of the bintree root node. As it visits the continue symbol (( of code, the symbol ( is used to replace the previous one. At the same time, four recursive calls will be executed sequentially. 4. Conclusions Code transformation algorithms between different image representations are very important. The demand for code transformation algorithms between two different image representations is quite important because they provide flexibility for the usage of different image representations. Generally, we can choose the one requiring less storage cost to save space while transforming it to another image representation for effective image manipulation.
5 Quadtrees and bintrees are commonly used techniques to represent binary images because they can effectively reduce the required storage space. This paper presented algorithms for transforming codes between quadtree and bintree. If we receive a DFexpression code of a quadtree/bintree that we cannot handle, we can transform it into another DFexpression code of a bintree/quadtree with our algorithms. Combined with other algorithms for transforming code between a bincode [17] and a DFexpression of a bintree, the use of a quadtree and bintree representation would be very flexible. In addition, the new algorithms can also be used to reduce the storage space that an image requires, if necessary. Fig. 7 Example of a DFexpression of a bintree to quadtree transformation References [1] Chang, H. K. and Chang, J. W., The fixed binary linear quadtree coding scheme for spatial data, SPIE Proceedings  Visual Communication and Image Processing, Vol. 2308, 1994, pp [2] Chen, P. M., Variant code transformations for linear quadtrees, Pattern Recognition Letters, Vol. 23, 2002, pp [3] Dyer, C., The space efficiency of quadtrees, Computing Graphics Image Process, Vol. 19, No. 4, 1982, pp [4] Gargantini, I., An effective way to represent quadtrees, Communications of the ACM, Vol. 25, No. 12, 1982, pp [5] Hunter, G. M. and Steiglitz, K., Operations on images using quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 1, No. 2, 1979, pp [6] Lin, T. W., Set operations on constant bitlength linear quadtrees, Pattern Recognition, Vol. 30, No. 7, 1997, pp [7] Samet, H., Application of spatial data structures, AddisonWesley, New York [8] Samet, H., Design and analysis of spatial data structure, AddisonWesley, New York [9] Tsai, Y. H. and Chung K. L., Some image operations on Streerelated spatial data structure, Image and Vision Computing, Vol. 17, 1999, pp [10] Wang, F., Relationallinear quadtree approach for two dimensional spatial representation and manipulation, IEEE Transactions on Knowledge and Data Engineering, Vol. 3, No. 1, 1991, pp [11] Wu, J. G. and Chung, K. L., The logical representation of bincode and its applications in manipulating binary images, RealTime Imaging, Vol. 5, 1999, pp [12] Yang, Y. H., Chung K. L. and Tsai, Y. H., A compact improved quadtree representation with image manipulations, Image and Vision Computing, Vol. 18, 2000, pp [13] Jonge, W. De., Scheuermann, P. and Schijf, A., S+trees: an efficient structure for the representation of large pictures, Computer Vision, Graphics & Image Processing: Image Understanding, Vol. 59,No. 3, 1994, pp [14] Dyer, C. R., Rosenfeld, A. and Samet, H., Region representation: boundary codes from quadtree, Communications of the ACM, Vol. 23, No. 3, 1980, pp [15] Freeman, H., Computer processing of linedrawing image, ACM Computing Surveys, Vol. 6, No. 1, 1974, pp [16] Kawaguchi, E. and Endo, T., On a method of binary picture representation and its application to data compression, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 2, No. 1, 1980, pp [17] Ouksel, M. A. and Yaagoub, A., The interpolationbased bintree and encoding of binary images, Computer Vision, Graphics & Image Processing: Graphical Models and Image Processing, Vol. 54, No. 1, 1992, pp [18] Rutovitz, D., Data structures for operations on digital images, Pattern Recognition, 1968, pp [19] Samet, H., Region representation: quadtrees from boundary codes, Communications of the ACM, Vol. 23, No. 3, 1980, pp [20] Samet, H., An algorithm for converting rasters to quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 3, No. 1, 1981, pp [21] Samet, H., Algorithm for conversion of quadtrees to rasters, Computer Vision, Graphics, and Image Processing, Vol. 26, No. 1, 1984, pp
Linear Quadtree Construction in Real Time *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 26, 19171930 (2010) Short Paper Linear Quadtree Construction in Real Time * CHIYEN HUANG AND YUWEI CHEN + Department of Information Management National
More informationOrganizing Spatial Data
Organizing Spatial Data Spatial data records include a sense of location as an attribute. Typically location is represented by coordinate data (in 2D or 3D). 1 If we are to search spatial data using the
More informationA Bintree Representation of Generalized Binary. Digital Images
A intree Representation of Generalized inary Digital mages Hanspeter ieri gor Metz 1 inary Digital mages and Hyperimages A ddimensional binary digital image can most easily be modelled by a ddimensional
More informationSpatial Data Structures
CSCI 480 Computer Graphics Lecture 7 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids BSP Trees [Ch. 0.] March 8, 0 Jernej Barbic University of Southern California http://wwwbcf.usc.edu/~jbarbic/cs480s/
More informationAPPLICATION OF FLOYDWARSHALL LABELLING TECHNIQUE: IDENTIFICATION OF CONNECTED PIXEL COMPONENTS IN BINARY IMAGE. Hyunkyung Shin and Joong Sang Shin
KangweonKyungki Math. Jour. 14 (2006), No. 1, pp. 47 55 APPLICATION OF FLOYDWARSHALL LABELLING TECHNIQUE: IDENTIFICATION OF CONNECTED PIXEL COMPONENTS IN BINARY IMAGE Hyunkyung Shin and Joong Sang Shin
More informationData Structures I. C omputer graphics applications require the manipulation. Hierarchical Data Structures. Hanan Samet University of Maryland
Data Structures I Hierarchical Data Structures Hanan Samet University of Maryland Robert E. Webber Rutgers University This is the first part of a twopart overview of the use of hierarchical data structures
More informationProgramming Assignment 1: A Data Structure For VLSI Applications 1
Fall 2016 CMSC 420 Hanan Samet Programming Assignment 1: A Data Structure For VLSI Applications 1 Abstract In this assignment you are required to implement an information management system for handling
More informationA QUADTREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION. YiChen Tsai, MingSui Lee, Meiyin Shen and C.C. Jay Kuo
A QUADTREE DECOMPOSITION APPROACH TO CARTOON IMAGE COMPRESSION YiChen Tsai, MingSui Lee, Meiyin Shen and C.C. Jay Kuo Integrated Media Systems Center and Department of Electrical Engineering University
More informationSpatial Data Structures
15462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie
More informationComputer Graphics. BingYu Chen National Taiwan University
Computer Graphics BingYu Chen National Taiwan University VisibleSurface Determination BackFace Culling The DepthSort Algorithm Binary SpacePartitioning Trees The zbuffer Algorithm ScanLine Algorithm
More informationUserFriendly Sharing System using Polynomials with Different Primes in Two Images
UserFriendly Sharing System using Polynomials with Different Primes in Two Images Hung P. Vo Department of Engineering and Technology, Tra Vinh University, No. 16 National Road 53, Tra Vinh City, Tra
More informationCSG obj. oper3. obj1 obj2 obj3. obj5. obj4
Solid Modeling Solid: Boundary + Interior Volume occupied by geometry Solid representation schemes Constructive Solid Geometry (CSG) Boundary representations (Breps) Spacepartition representations Operations
More informationComputer Science. Using Ordered BinaryDecision Diagrams for Compressing Images and Image Sequences
Computer Science Using Ordered BinaryDecision Diagrams for Compressing Images and Image Sequences Mike Star key and Randy Bryant January 1995 CMUCS95105 Carnegie Mellon gültekimlifj^; Apj«o«d lev pobflb
More informationThe Evolution and Trend of Chain Code Scheme
The Evolution and Trend of Chain Scheme 1 Lili Ayu Wulandhari, 2 Habibolah Haron Department of Modelling and Industrial Computing Faculty of Computer Science and Information Systems Universiti Teknologi
More informationA New Technique of Lossless Image Compression using PPMTree
A New Technique of Lossless Image Compression PPTree Shams ahmood Imam, S.. Rezaul Hoque, ohammad Kabir Hossain, William Perrizo Department of Computer Science and Engineering, North South University,
More informationAn Improved Run Length Encoding Scheme for Image Compression Ch.Samson 1, VUK Sastry 2
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:23197242 Volume 6 Issue 3 March 2017, Page No. 2071620720 Index Copernicus value (2015): 58.10 DOI: 10.18535/ijecs/v6i3.57
More informationTopic 5: Raster and Vector Data Models
Geography 38/42:286 GIS 1 Topic 5: Raster and Vector Data Models Chapters 3 & 4: Chang (Chapter 4: DeMers) 1 The Nature of Geographic Data Most features or phenomena occur as either: discrete entities
More informationThis research was supported in part by DOE Grant #DEFG0588ER25063 and JPL Contract #957721
Q TREE: A DYNAMIC STRUCTURE FOR ACCESSING SPATIAL OBJECTS WITH ARBITRARY SHAPES Ratko Orlandic John L. Pfaltz IPCTR9 December 6, 99 Institute for Parallel Computation School of Engineering and Applied
More informationLecture 25 of 41. Spatial Sorting: Binary Space Partitioning Quadtrees & Octrees
Spatial Sorting: Binary Space Partitioning Quadtrees & Octrees William H. Hsu Department of Computing and Information Sciences, KSU KSOL course pages: http://bit.ly/hgvxlh / http://bit.ly/evizre Public
More informationإستخدام األشجار الرباعية و تقسيم المسافة الهرمي
إستخدام األشجار الرباعية و تقسيم المسافة الهرمي أ.م مكي ة كاظم حمد كلية العلوم جامعة بغداد م.م مها شاكر إبراهيم الثالث Abstract A quad tree :is a nonlinear data structure in which each internal node has
More informationUnit III  Tree TREES
TREES Unit III  Tree Consider a scenario where you are required to represent the directory structure of your operating system. The directory structure contains various folders and files. A folder may
More informationIntersection Acceleration
Advanced Computer Graphics Intersection Acceleration Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volume hierarchies uniform grids kdtrees octrees
More informationPictorial Query by Example PQBE. Vida Movahedi Mar. 2007
Pictorial Query by Example PQBE Vida Movahedi Mar. 2007 Contents Symbolic Images Direction Relations PQBE Implementation of queries using skeleton images Sample application Construction of Symbolic Images
More informationProgramming Assignment 1: A Data Structure For VLSI Applications 1
Fall 2014 CMSC 420 Hanan Samet Programming Assignment 1: A Data Structure For VLSI Applications 1 Abstract In this assignment you are required to implement an information management system for handling
More informationDigital image steganography using LSB substitution, PVD, and EMD
Digital image steganography using LSB substitution, PVD, and EMD Anita Pradhan, K. Raja Sekhar, Gandharba Swain* Department of Computer Science and Engineering, K L University, Vaddeswaram522502, Andhra
More informationIdentifying those parts of a scene that are visible from a chosen viewing position, and only process (scan convert) those parts
Visible Surface Detection Identifying those parts of a scene that are visible from a chosen viewing position, and only process (scan convert) those parts Two approaches: 1. Object space methods 2. Image
More informationMorphological 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 informationBitPlane Decomposition Steganography Using Wavelet Compressed Video
BitPlane Decomposition Steganography Using Wavelet Compressed Video Tomonori Furuta, Hideki Noda, Michiharu Niimi, Eiji Kawaguchi Kyushu Institute of Technology, Dept. of Electrical, Electronic and Computer
More informationQuadtrees and Meshing
Computational Geometry Lecture INSTITUT FÜR THEORETISCHE INFORMATIK FAKULTÄT FÜR INFORMATIK Tamara Mchedlidze Darren Strash 14.12.2015 Motivation: Meshing PC Board Layouts To simulate the heat produced
More informationCS443: 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 information1. Meshes. D7013E Lecture 14
D7013E Lecture 14 Quadtrees Mesh Generation 1. Meshes Input: Components in the form of disjoint polygonal objects Integer coordinates, 0, 45, 90, or 135 angles Output: A triangular mesh Conforming: A triangle
More informationSpatial 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 informationCARTR990 CSTR4526 UMIACS September 2003
CARTR990 CSTR4526 UMIACS 200394 September 2003 Objectbased and Imagebased Object Representations Hanan Samet Computer Science Department Center for Automation Research Institute for Advanced Computer
More informationA PROBABILISTIC ANALYSIS OF TRIEBASED SORTING OF LARGE COLLECTIONS OF LINE SEGMENTS IN SPATIAL DATABASES
SIAM J. COMPUT. Vol. 35, No., pp. 58 c 005 Society for Industrial and Applied Mathematics A PROBABILISTIC ANALYSIS OF TRIEBASED SORTING OF LARGE COLLECTIONS OF LINE SEGMENTS IN SPATIAL DATABASES MICHAEL
More informationAPPLICATIONS OF SPATIAL DATA STRUCTURES: COMPUTER GRAPHICS, IMAGE PROCESSING, AND GEOGRAPHIC INFORMATION SYSTEMS (REVISED)
APPLICATIONS OF SPATIAL DATA STRUCTURES: COMPUTER GRAPHICS, IMAGE PROCESSING, AND GEOGRAPHIC INFORMATION SYSTEMS (REVISED) Hanan Samet Computer Science Department University of Maryland College Park, Maryland
More informationUniversity of Illinois at UrbanaChampaign Department of Computer Science. Second Examination
University of Illinois at UrbanaChampaign Department of Computer Science Second Examination CS 225 Data Structures and Software Principles Fall 2011 9a11a, Wednesday, November 2 Name: NetID: Lab Section
More information8. Hidden Surface Elimination
8. Hidden Surface Elimination Identification and Removal of parts of picture that are not visible from a chosen viewing position. 1 8. Hidden Surface Elimination Basic idea: Overwriting Paint things in
More informationHidden Surface Elimination: BSP trees
Hidden Surface Elimination: BSP trees Outline Binary space partition (BSP) trees Polygonaligned 1 BSP Trees Basic idea: Preprocess geometric primitives in scene to build a spatial data structure such
More informationUniversity of Illinois at UrbanaChampaign Department of Computer Science. Second Examination
University of Illinois at UrbanaChampaign Department of Computer Science Second Examination CS 225 Data Structures and Software Principles Spring 2014 710p, Tuesday, April 8 Name: NetID: Lab Section
More informationThe Quadtree and Related Hierarchical Data Structures
The Quadtree and Related Hierarchical Data Structures HANAN SAMET Computer Sdence Department, University of Maryland, College Park, Maryland 20742 A tutorial survey is presented of the quadtree and related
More informationTopic 6 Representation and Description
Topic 6 Representation and Description Background Segmentation divides the image into regions Each region should be represented and described in a form suitable for further processing/decisionmaking Representation
More informationBinary Trees. College of Computing & Information Technology King Abdulaziz University. CPCS204 Data Structures I
Binary Trees College of Computing & Information Technology King Abdulaziz University CPCS204 Data Structures I Outline Tree Stuff Trees Binary Trees Implementation of a Binary Tree Tree Traversals Depth
More informationUNIT IV NONLINEAR DATA STRUCTURES 4.1 Trees TREE: A tree is a finite set of one or more nodes such that there is a specially designated node called the Root, and zero or more non empty sub trees T1,
More informationCE 221 Data Structures and Algorithms
CE 221 Data Structures and Algorithms Chapter 4: Trees (Binary) Text: Read Weiss, 4.1 4.2 Izmir University of Economics 1 Preliminaries  I (Recursive) Definition: A tree is a collection of nodes. The
More information3D Modeling: Solid Models
CS 430/536 Computer Graphics I 3D Modeling: Solid Models Week 9, Lecture 18 David Breen, William Regli and Maxim Peysakhov Geometric and Intelligent Computing Laboratory Department of Computer Science
More informationCollision Detection based on Spatial Partitioning
Simulation in Computer Graphics Collision Detection based on Spatial Partitioning Matthias Teschner Computer Science Department University of Freiburg Outline introduction uniform grid Octree and kd tree
More informationA Comparison of Two FullyDynamic Delaunay Triangulation Methods
A Comparison of Two FullyDynamic Delaunay Triangulation Methods Michael D Adams Department of Electrical and Computer Engineering University of Victoria Victoria, BC, V8W 3P6, Canada Web: http://wwweceuvicca/
More informationInformation Science 2
Information Science 2  Path Lengths and Huffman s Algorithm Week 06 College of Information Science and Engineering Ritsumeikan University Agenda l Review of Weeks 0305 l Tree traversals and notations
More informationVisit ::: Original Website For Placement Papers. ::: Data Structure
Data Structure 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship
More informationProcessing of binary images
Binary Image Processing Tuesday, 14/02/2017 ntonis rgyros email: argyros@csd.uoc.gr 1 Today From gray level to binary images Processing of binary images Mathematical morphology 2 Computer Vision, Spring
More informationTexture Image Segmentation using FCM
Proceedings of 2012 4th International Conference on Machine Learning and Computing IPCSIT vol. 25 (2012) (2012) IACSIT Press, Singapore Texture Image Segmentation using FCM Kanchan S. Deshmukh + M.G.M
More informationCopyright 1998 by AddisonWesley Publishing Company 147. Chapter 15. Stacks and Queues
Copyright 1998 by AddisonWesley Publishing Company 147 Chapter 15 Stacks and Queues Copyright 1998 by AddisonWesley Publishing Company 148 tos (1) B tos (1) A tos (0) A A tos (0) How the stack routines
More informationOverview of Quadtreebased Terrain Triangulation and Visualization
Overview of Quadtreebased Terrain Triangulation and Visualization Renato Pajarola UCIICS Technical Report No. 0201 Department of Information & Computer Science University of California, Irvine January
More informationCompression of Large Binary Images in Digital Spatial Libraries
ompression of Large Binary Images in Digital Spatial Libraries Eugene Ageenko * and Pasi Fränti Dept. of omputer Science, Univ. of Joensuu, Box, 800 Joensuu, Finland ABSTRAT A method for lossless compression
More informationProblem 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 informationCIS 121 Data Structures and Algorithms with Java Spring 2018
CIS 121 Data Structures and Algorithms with Java Spring 2018 Homework 2 Thursday, January 18 Due Monday, January 29 by 11:59 PM 7 Required Problems (85 points), and Style and Tests (15 points) DO NOT modify
More informationFigure 1: A directed graph.
1 Graphs A graph is a data structure that expresses relationships between objects. The objects are called nodes and the relationships are called edges. For example, social networks can be represented as
More informationComputer Graphics. Lecture 9 Hidden Surface Removal. Taku Komura
Computer Graphics Lecture 9 Hidden Surface Removal Taku Komura 1 Why Hidden Surface Removal? A correct rendering requires correct visibility calculations When multiple opaque polygons cover the same screen
More informationJan Terje Bj0rke The Norwegian Institute of Technology Department of Geodesy and Photogrammetry 1034Trondheim Norway C omm iss ion no.
ND TRNGULTON Jan Terje j0rke The Norwegian nstitute of Technology Department of Geodesy and Photogrammetry 1034Trondheim Norway C omm iss ion no.: V bstract This paper is a report on the design and the
More informationA BTCCOMPRESSED DOMAIN INFORMATION HIDING METHOD BASED ON HISTOGRAM MODIFICATION AND VISUAL CRYPTOGRAPHY. HangYu Fan and ZheMing Lu
International Journal of Innovative Computing, Information and Control ICIC International c 2016 ISSN 13494198 Volume 12, Number 2, April 2016 pp. 395 405 A BTCCOMPRESSED DOMAIN INFORMATION HIDING METHOD
More informationTree Structures. A hierarchical data structure whose point of entry is the root node
Binary Trees 1 Tree Structures A tree is A hierarchical data structure whose point of entry is the root node This structure can be partitioned into disjoint subsets These subsets are themselves trees and
More informationJoint Image Classification and Compression Using Hierarchical TableLookup Vector Quantization
Joint Image Classification and Compression Using Hierarchical TableLookup Vector Quantization Navin Chadda, Keren Perlmuter and Robert M. Gray Information Systems Laboratory Stanford University CA934305
More informationSearch. The Nearest Neighbor Problem
3 Nearest Neighbor Search Lab Objective: The nearest neighbor problem is an optimization problem that arises in applications such as computer vision, pattern recognition, internet marketing, and data compression.
More informationProgress in Image Analysis and Processing III, pp , World Scientic, Singapore, AUTOMATIC INTERPRETATION OF FLOOR PLANS USING
Progress in Image Analysis and Processing III, pp. 233240, World Scientic, Singapore, 1994. 1 AUTOMATIC INTERPRETATION OF FLOOR PLANS USING SPATIAL INDEXING HANAN SAMET AYA SOFFER Computer Science Department
More informationStereo Vision Image Processing Strategy for Moving Object Detecting
Stereo Vision Image Processing Strategy for Moving Object Detecting SHIUHJER HUANG, FUREN YING Department of Mechanical Engineering National Taiwan University of Science and Technology No. 43, Keelung
More informationSkeletonization Algorithm for Numeral Patterns
International Journal of Signal Processing, Image Processing and Pattern Recognition 63 Skeletonization Algorithm for Numeral Patterns Gupta Rakesh and Kaur Rajpreet Department. of CSE, SDDIET Barwala,
More informationTHE DEPTHBUFFER VISIBLE SURFACE ALGORITHM
OnLine Computer Graphics Notes THE DEPTHBUFFER VISIBLE SURFACE ALGORITHM Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis To accurately
More information23 Tree. Outline BTREE. catch(...){ printf( "Assignment::SolveProblem() AAAA!"); } ADD SLIDES ON DISJOINT SETS
Outline catch(...){ printf( "Assignment::SolveProblem() AAAA!"); } Balanced Search Trees 23 Trees 234 Trees Slide 4 Why care about advanced implementations? Same entries, different insertion sequence:
More informationStacked Integral Image
2010 IEEE International Conference on Robotics and Automation Anchorage Convention District May 38, 2010, Anchorage, Alaska, USA Stacked Integral Image Amit Bhatia, Wesley E. Snyder and Griff Bilbro Abstract
More informationA METHOD FOR CONTENTBASED SEARCHING OF 3D MODEL DATABASES
A METHOD FOR CONTENTBASED SEARCHING OF 3D MODEL DATABASES Jiale Wang *, Hongming Cai 2 and Yuanjun He * Department of Computer Science & Technology, Shanghai Jiaotong University, China Email: wjl8026@yahoo.com.cn
More informationA Hybrid Image Compression Technique using Quadtree Decomposition and Parametric Line Fitting for Synthetic Images
A Hybrid Image Compression Technique using Quadtree Decomposition and Parametric Line Fitting for Synthetic Images Murtaza Khan and Yoshio Ohno Graduate School of Science and Technology, Keio University
More informationA Three Dimensional Image Cache for Virtual Reality
A Three Dimensional Image Cache for Virtual Reality Gernot Schaufler and Wolfgang Stürzlinger GUP, Johannes Kepler Universität Linz, Altenbergerstr.69, A Linz, Austria/Europe schaufler@gup.unilinz.ac.at
More informationTwo ImageTemplate Operations for Binary Image Processing. Hongchi Shi. Department of Computer Engineering and Computer Science
Two ImageTemplate Operations for Binary Image Processing Hongchi Shi Department of Computer Engineering and Computer Science Engineering Building West, Room 331 University of Missouri  Columbia Columbia,
More informationA NEW APPROACH TO OBJECT RECOGNITION ON HIGH RESOLUTION SATELLITE IMAGE *
A NEW APPROACH TO OBJECT RECOGNITION ON HIGH RESOLUTION SATELLITE IMAGE Qiming QIN,Yinhuan YUAN, Rongjian LU Peking University, P.R China,100871 Institute of Remote Sensing and Geographic Information System
More informationGraphs: basic concepts and algorithms
: basic concepts and algorithms Topics covered by this lecture:  Reminder Trees Trees (inorder,postorder,preorder) s (BFS, DFS) Denitions: Reminder Directed graph (digraph): G = (V, E), V  vertex
More informationLOSSLESS COMPRESSION OF LARGE BINARY IMAGES IN DIGITAL SPATIAL LIBRARIES
LOSSLESS OMPRESSION OF LARGE BINARY IMAGES IN DIGITAL SPATIAL LIBRARIES EUGENE AGEENKO and PASI FRÄNTI Department of omputer Science, University of Joensuu Box, FIN800 Joensuu, FINLAND email: {ageenko
More informationIrene Gargantini The University of Western Ontario
References 1. Berztiss, A.T. Data Structures: Theory and Practice. 2nd Ed. Academic Press, New York, 1975. 2. Cavouras, J.C. On the conversion of programs to decision tables: Methods and objectives. Comm,
More informationRegionbased Segmentation
Regionbased Segmentation Image Segmentation Group similar components (such as, pixels in an image, image frames in a video) to obtain a compact representation. Applications: Finding tumors, veins, etc.
More informationUniversity of Illinois at UrbanaChampaign Department of Computer Science. Second Examination
University of Illinois at UrbanaChampaign Department of Computer Science Second Examination CS 225 Data Structures and Software Principles Spring 2012 7p9p, Tuesday, April 3 Name: NetID: Lab Section
More informationJana Kosecka. RedBlack Trees Graph Algorithms. Many slides here are based on E. Demaine, D. Luebke slides
Jana Kosecka RedBlack Trees Graph Algorithms Many slides here are based on E. Demaine, D. Luebke slides Binary Search Trees (BSTs) are an important data structure for dynamic sets In addition to satellite
More informationAdaptive Tessellation for Trimmed NURBS Surface
Adaptive Tessellation for Trimmed NURBS Surface Ma YingLiang and Terry Hewitt 2 Manchester Visualization Centre, University of Manchester, Manchester, M3 9PL, U.K. may@cs.man.ac.uk 2 W.T.Hewitt@man.ac.uk
More informationRobust Steganography Using Texture Synthesis
Robust Steganography Using Texture Synthesis Zhenxing Qian 1, Hang Zhou 2, Weiming Zhang 2, Xinpeng Zhang 1 1. School of Communication and Information Engineering, Shanghai University, Shanghai, 200444,
More information1. INTRODUCTION 2012 DSRC
2012 DSRC Sri Lakshmi U* 1, Mr. Siva Rama Krishna K* 2, Dr.Raja Prakash Rao P* 3 1. II.M.TechCSE, TRREC 2. Associate Professor, Dept of CSE, TRREC 3. Professor & Head, Dept of CSE, TRREC Abstract: This
More informationIndexing by Shape of Image Databases Based on Extended Grid Files
Indexing by Shape of Image Databases Based on Extended Grid Files Carlo Combi, Gian Luca Foresti, Massimo Franceschet, Angelo Montanari Department of Mathematics and ComputerScience, University of Udine
More informationDATA MODELS IN GIS. Prachi Misra Sahoo I.A.S.R.I., New Delhi
DATA MODELS IN GIS Prachi Misra Sahoo I.A.S.R.I., New Delhi 110012 1. Introduction GIS depicts the real world through models involving geometry, attributes, relations, and data quality. Here the realization
More informationCIS265/ Trees RedBlack Trees. Some of the following material is from:
CIS265/506 234 Trees RedBlack Trees Some of the following material is from: Data Structures for Java William H. Ford William R. Topp ISBN 0130477249 Chapter 27 Balanced Search Trees Bret Ford 2005,
More informationEliminating False Loops Caused by Sharing in Control Path
Eliminating False Loops Caused by Sharing in Control Path ALAN SU and YUCHIN HSU University of California Riverside and TAYUNG LIU and MIKE TIENCHIEN LEE Avant! Corporation In highlevel synthesis,
More informationComparison of Compressed Quadtrees and Compressed kd Tries for Range Search
Comparison of Compressed Quadtrees and Compressed kd Tries for Range Search Nathan Scott December 19, 2005 1 Introduction There is an enourmous number of data structures in existence to represent spatial
More informationRESEARCH ON OBJECTORIENTED THREE DIMENSIONAL DATA MODEL
ISPRS SIPT IGU UCI CIG ACSG Table of contents Table des matières Authors index Index des auteurs Search Recherches Exit Sortir RESEARCH ON OBJECTORIENTED THREE DIMENSIONAL DATA MODEL Xiaojun Tan a, Fuling
More informationTopic 18 Binary Trees "A tree may grow a thousand feet tall, but its leaves will return to its roots." Chinese Proverb
Topic 18 "A tree may grow a thousand feet tall, but its leaves will return to its roots." Chinese Proverb Definitions A tree is an abstract data type one entry point, the root Each node is either a leaf
More informationImplication of variable code block size in JPEG 2000 and its VLSI implementation
Implication of variable code block size in JPEG 2000 and its VLSI implementation PingSing Tsai a, Tinku Acharya b,c a Dept. of Computer Science, Univ. of Texas Pan American, 1201 W. Univ. Dr., Edinburg,
More informationCSC Computer Graphics
// CSC. Computer Graphics Lecture Kasun@dscs.sjp.ac.lk Department of Computer Science University of Sri Jayewardanepura Polygon Filling ScanLine Polygon Fill Algorithm Span FloodFill Algorithm Insideoutside
More informationMore Hidden Surface Removal
Lecture 8 More Hidden Surface Removal Efficient Painter  binary space partition (BSP) tree Efficient Ray Casting  spatial partitioning (uniform, octrees)  bounding volumes Recall last lecture... front
More informationSubpixel Corner Detection Using Spatial Moment 1)
Vol.31, No.5 ACTA AUTOMATICA SINICA September, 25 Subpixel Corner Detection Using Spatial Moment 1) WANG SheYang SONG ShenMin QIANG WenYi CHEN XingLin (Department of Control Engineering, Harbin Institute
More informationTREES. Trees  Introduction
TREES Chapter 6 Trees  Introduction All previous data organizations we've studied are linear each element can have only one predecessor and successor Accessing all elements in a linear sequence is O(n)
More informationThreshold Visual Cryptography Scheme for Color Images with No Pixel Expansion
ISBN 9789525726077 (Print), 9789525726084 (CDROM) Proceedings of the Second Symposium International Computer Science and Computational Technology(ISCSCT 09) Huangshan, P. R. China, 2628,Dec.
More informationA NOVEL METHOD FOR EDGE DRAWING OR LINKING USING SOBEL GRADIENT
A NOVEL METHOD FOR EDGE DRAWING OR LINKING USING SOBEL GRADIENT R.PRIYAKANTH 1 Associate Professor, Electronics & Communication Department, Devineni Venkata Ramana & Dr.Hima Sekhar MIC College of Technology,
More informationPR Quadtree Implementation
Implementation 1 Of course, the PR quadtree will be implemented as a formal Java generic. However, it may be somewhat less generic than the general BST discussed earlier. During insertion and search, it
More informationTowards Automatic Recognition of Fonts using Genetic Approach
Towards Automatic Recognition of Fonts using Genetic Approach M. SARFRAZ Department of Information and Computer Science King Fahd University of Petroleum and Minerals KFUPM # 1510, Dhahran 31261, Saudi
More informationBinary Space Partition Trees. Overview. Binary Space Partitioning Trees (Fuchs, Kedem and Naylor `80)
Binary Space Partition Trees Anthony Steed, Yiorgos Chrysanthou 999200, Celine Loscos 200, Jan Kautz 20072009 Overview Previous list priority algorithms fail in a number of cases, non of them is completely
More information