A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
|
|
- Dortha Richard
- 5 years ago
- Views:
Transcription
1 A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia R. M. Udrea Politehica Uiversity Bucharest, Romaia Abstract Oe of the mai image represetatios i Mathematical Morphology is the 3D Shape Decompositio Represetatio, useful for Image Compressio, ad Patter Recogitio. The 3D Morphological Shape Decompositio represetatio ca be geeralized a umber of times, to eted the scope of its algebraic characteristics as much as possible. With these geeralizatios, the Morphological Shape Decompositio 's role to serve as a efficiet image decompositio tool was eteded to discrete images ad grayscale images. This work follows the above lie, ad further develops it. A ew evolutioary brach is added to the 3D Morphological Shape Decompositio's developmet, by the itroductio of a 3D Multi Structurig Elemet Morphological Shape Decompositio, which permits 3D Morphological Shape Decompositio of 3D biary images (grayscale iamges ito "multiparameter" families of elemets. At the begiig, 3D Morphological Shape Decompositio represetatios are based oly o "1 parameter" families of elemets for image decompositio. This paper addresses the gray scale iterframe iterpolatio by meas of mathematical morphology. The ew iterframe iterpolatio method, called 3D Shape Decompositio iterpolatio is based o morphological 3D Shape Decompositio. This article will preset the theoretical backgroud of the morphological iterframe iterpolatio, deduce the ew represetatio ad show some applicatio eamples. Computer simulatios could illustrate results. 1. Itroductio Image Represetatio is a key compoet i may tasks i Computer Visio ad Image Processig. It cosists geerally of presetig a image i a form, differet from the origial oe, i which desired characteristics of the image are emphasized ad more easily accessed. I this work, we cosider morphological methods for both biary ad grayscale image represetatio. They are based o Mathematical Morphology, which is a relatively ew, ad rapidly growig, oliear theory for Image Processig. Mathematical Morphology is part of Set Theory, ad it has a strog geometric orietatio. Its theory was developed by Mathero ad Serra, i the middle 6's, with the purpose of describig the shape decompositio of materials by image aalysis of their sectios. Beig origially developed for biary images, it was later (durig the 7's geeralized for grayscale images as well. For biary images (2D ad 3D, Mathematical Morphology provides a well fouded theory for aalysis ad processig. Therefore, Biary Morphological Represetatios ca be developed ad aalyzed. Grayscale Morphological Represetatios are a geeralizatio of the biary represetatios i 3D space, ad they emphasize geometrical characteristics of the image, which are ot easily accessed i a liear represetatio. The mai morphological represetatio for 3D biary images is the Shape decompositio. The 3D Shape decompositio ca be calculated etirely by the basic operatios of Mathematical Morphology, which makes the 3D Shape decompositio a morphological represetatio, suitable for aalysis by morphological tools. Based o 3D Shape decompositio a morphological represetatio, called 3D Morphological Shape Decompositio is preseted. It cosists of first calculatig the ball (or other predefied cove 3D shapes with the greatest size cotaied iside the shape, the takig the residue (set differece betwee the origial shape to the above greatest balls, ad fially reiteratig the above procedure o the residue util the whole shape is decomposed. The resultig decompositio elemets are, therefore, disjoit. Followig the geeralizatio of the whole morphological theory, from biary to grayscale images, the Morphological Shape Decompositio Represetatio could be geeralized as well to grayscale images [2,3]. The motivatio of this work is to ivestigate the use of Morphological Shape Decompositio's for biary ad grayscale Image Represetatio, ad their applicatios, with special iterest i iterframe iterpolatio. Iterframe iterpolatio problem is the process of creatig itermediary frames betwee two gives oe. Two kow frames iput frame ad output frame, as well as itermediary frames are of the same type. Iterpolated frame ( i depeds o the cotet of iput frame ad output frame ad the positio of the iterpolated
2 oe betwee them. It is a umber betwee ad M deoted i this paper as m, M. For m = iterpolated frame is equal with iput frame,, for m = M iterpolated frame is equal with output frame, M. I the followig pages we will cosider a morphological methods for grayscale frame iterpolatio. These methods are based o 3D biary mathematical morphology. Mathematical Morphology is a geeral theory based of simple operators: erosio, dilatio, opeig ad closig. The morphological operatios have bee successfully used i may applicatios icludig object recogitio, frame ehacemet, teture aalysis, ad idustrial ispectio. The ew iterpolatio frame method preseted i this article is based o 3D morphological Shape Decompositio. It cosists of chagig, step by step, the Shape Decompositio subsets of iput frame with the Shape Decompositio subsets of out frame [1,4,5]. 2. 3D Morphological Shape Decompositio The 3D Shape Decompositio ca be calculated etirely usig the basic morphological operators. Dilatio ad erosio are the fudametal operators of the Mathematical Morphology. The key process i the dilatio ad erosio operators is the local compariso of a shape, called structurig elemet, with the object to be trasformed. The structurig elemet is a predefied shape, which is used for morphological processig of the frames. The most commo shapes used as structurig elemets are horizotal ad vertical lies, squares, digital discs, crosses, etc. The fudametal morphological operators are based o the operatio of traslatio. Let B be a set cotaied i Z 3, ad let be a poit i Z 3. The traslatio of the set B by the poit, deoted B, is defied as follows: { } B = b+ b B (1 The dilatio of the 3D biary shape by the structurig elemet B, deoted B, is defied by: B = B (2 The erosio of 3D biary shape by the structurig elemet B, deoted B, is defied i the followig way: B = b (3 b B Based o those fudametal operators, two morphological operators are developed. These are the opeig ad closig operators. The opeig operator, deoted, ca be epressed as a compositio of erosio followed by dilatio, both by the same iput structurig elemet: B B B (4 The closig operator, deoted, ca be epressed as compositio of dilatio followed by erosio by the same iput structurig elemet: B = ( B B (5 The Shape Decompositio ST(,B of 3D biary shape i Z 3 ca be calculated by meas of morphological operatios. The Morphological Shape Decompositio is a compact error free represetatio of images Origial Morphological Shape Decompositio The 3D morphological shape decompositio is a compact error free represetatio of images, a property useful for image compressio. The Shape decompositio is a redudat represetatio, i.e., some of its poits may be discarded without affectig its error free characteristic. The morphological shape decompositio represetatio of a biary image, with a give biary 3D structurig elemet B, is a collectio of sets SD (, B called Shape decompositio subsets of order. Morphological shape decompositio is defied us followig: I Iitial coditio a is the maimum value defied by with ad b We defie, B B B = > (6 B B B (7 ( (8 (, SD B B B B (9
3 II Recursive relatios We ca defie iteratively, for =, 1,...,2,1 ( 1 (, SD B B (1 (, SD B B B B (11 From the collectio of morphological shape decompositio subsets SD (, B the origial shape ca be perfectly recostruct by (, (12 = SD B B A geeralizatio of the 3D shape decompositio framework should be sought, based either o a topological or a algebraic approach. I the topological approach, such a geeralizatio should aspire to solve problems like robustess, coectivity ad precisio as a shape descriptor; whereas, i the algebraic oe, framework fleibility, self-duality, ad represetatio efficiecy are the mai issues. The 3D morphological shape decompositio satisfies the above requiremets. The algebraic framework of the 3D shape decompositio will be eteded several times. The purpose was always to obtai decompositios accordig to richer families of elemets, ot failig to satisfy the above algebraic requiremets. The above evolutio will be described. The morphological shape decompositio is a error-free represetatio sice the origial 3D biary image (gray scale image ca be recostructed from SD (, B Modified Shape decompositio The family of 3D elemets B used i the discrete morphological shape decompositio is geerated by recursively dilatig the structurig elemet B by itself. B serves here as a geerator, beig costat at every step of the family geeratio. The family geerator ca have a variable size. The Modified Shape decompositio decomposes ito maimal elemets from the family { B,1 B,2 B,4 B,8 B,16 B,...}. This family ca be geerated, as before, by a series of dilatios, but ot with a costat geerator. The sizes of the geerator, at the various steps, are the differeces { 1,1, 2, 4, 8,16,... } betwee the sizes of the elemets of the family. We ca observe, by comparig the coditios for the modified shape decompositio with those for the morphological shape decompositio that the oly sigificat differece is i the family geeratio. The modified shape decompositio also fully represets the 3D biary origial image. Geerally, codig simulatios, the modified morphological shape decompositio show better results tha the previous morphological shape decompositio. For modified shape decompositio, is bouded, the family is ideed by, ad epoetially geerated: 1 A = 2 B, 1 (13 The "sigle-poit'' elemet belogs to the family: A = {(, }. B is topologically ope ad cotais the origi. Geeratio formulas are give by: I Iitial coditio a is the maimum value defied by with ad b We defie 2 B 2 B B =, > (14 2 B 2 B B (15 ( 2 (16 SD, B 2 B 2 B B (17 2 II Recursive relatios We ca defie iteratively, for =, 1,...,2,1 ( 2 1 ( 2 SD (, B 2 B 2 SD (, B 2 B 2 ( 2 B B... (18 ( 1 SD B B 1 (, ( SD B B B B 1, 2.3. Geeralized-Step Shape decompositio ot oly the size of the geerator ca vary at each step of the family geeratio, but also the geerator's shape. Let B be a series of structurig elemets, topologically ope all of them cotaiig the origi ad satisfyig B B = B (19
4 Let this series geerate a family of elemets the followig way: ad A i A+ 1 = A B, =,1, 2,... (2 A A(, The collectio subsets (, = (21 SD B is called i this A case Geeralized-Step Morphological Shape decompositio. The coditios for the bouded shape decompositio are: I Iitial coditio a is the maimum value defied by with ad b We defie (, A A B = > (22 ( A A B (23 ( (24 (, = ( SD B A A B (25 II Recursive relatios We ca defie iteratively, for =, 1,...,2,1 ( 1 (, SD B A (26 (, = ( SD B A A B (27 From the collectio of morphological shape decompositio subsets SD (, B( the origial shape ca be perfectly recostruct by (, (28 = SD B A 3. Iterpolatio Method The ew iterpolatio frame method preseted i this article is based o 3D biary morphological Shape Decompositio. It cosists of chagig, step by step, the Shape Decompositio subsets of iput frame with the Shape Decompositio subsets of out frame Iterpolatio usig origial shape decompositio The method: a Shape Decompositio subsets ST (, B, for =, 1,...,1,, of iput frame are computed. The origial shape ca be perfectly recostructed i the followig way: (, (29 = ST B B = b Shape Decompositio subsets (, ST M B M, for = M, M 1,...,1,, of output frame are computed. The output frame M ca be perfectly recostructed i the followig way: M (, (3 = ST B B M M = c Iterpolated frame ( i depeds o the cotet of iput frame ad output frame ad the positio of the iterpolated oe betwee them ad must be computed usig morphological formulas. Iterpolated frame, i, is defied, for = ma (, M ad M = + 1, i= i 1 (, i M (, = ST B B ST B B, i= 1,..., M 1 = = i M, i= M (31
5 3.2. Iterpolatio usig Geeralized-Step Shape decompositio The method: a Shape Decompositio subsets ST (, B (, for =, 1,...,1,, of iput frame are computed. The origial shape ca be perfectly recostructed i the followig way: (, (32 = ST B A = b Shape Decompositio subsets (, ST M B M, for = M, M 1,...,1,, of output frame are computed. The output frame M ca be perfectly recostructed i the followig way: M M M = (, = ST B A (33 2D ad 3D Shape Decompositio. This article presets the theoretical backgroud of the morphological frame iterpolatio ad deduce the ew represetatio. Refereces [1] J. Serra, Frame Aalisis ad Mathematical Morphology, Lodo Academic Press, 1982 [2] J. Serra, Shape Decompositio Decompositios, SPIE Vol. 1769, Frame Algebra ad Morphological Frame Processig III, pp , [3] D.. Vizireau, Digital Image Processig A Itroductio, TTC, 1998, Bucharest, Romaia. [4] D.. Vizireau, C. Pirog, oliear Digital Sigal Processig, Electroica 2, Bucharest, 21, Romaia. [5] Gh. Gavriloaia, D.. Vizireau, Low level digital image processig, Techical Military Academy, Bucharest, Romaia, 21. c Iterpolated frame ( i depeds o the cotet of iput frame ad output frame ad the positio of the iterpolated oe betwee them ad must be computed usig morphological formulas. Iterpolated frame, i, is defied, for = ma (, M ad M = + 1, i= i 1 (, i M (, = ST B A ST B A, i= 1,..., M 1 = = i M, i= M (34 4. Coclusios Iterframe iterpolatio problem is the process of creatig itermediary frames betwee two gives oe. Two kow frames iput frame ad output frame, as well as itermediary frames are of the same type. Iterpolated frame depeds o the cotet of iput frame ad output frame ad the positio of the iterpolated oe betwee them. It is a umber betwee ad M deoted i this paper as,. For = iterpolated frame is equal with iput frame,, for = iterpolated frame is equal with output frame,. This paper addresses the gray scale iterframe iterpolatio by meas of mathematical morphology. The ew frame iterpolatio method, called Shape Decompositio iterpolatio is based o morphological
Ones Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationSpatially-Variant Morphological Restoration and Skeleton Representation
IEEE TRANSACTIONS ON IMAGE PROCESSING 1 Spatially-Variat Morphological Restoratio ad Skeleto Represetatio Nidhal Bouayaya, Studet Member, IEEE, Mohammed Charif-Chefchaoui ad Da Schofeld, Seior Member,
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationHandwriting Stroke Extraction Using a New XYTC Transform
Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationStrong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationOCR Statistics 1. Working with data. Section 3: Measures of spread
Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More informationPrimitive polynomials selection method for pseudo-random number generator
Joural of hysics: Coferece Series AER OEN ACCESS rimitive polyomials selectio method for pseudo-radom umber geerator To cite this article: I V Aiki ad Kh Alajjar 08 J. hys.: Cof. Ser. 944 0003 View the
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationprerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:
Itro Admiistrivia. Sigup sheet. prerequisites: 6.046, 6.041/2, ability to do proofs homework weekly (first ext week) collaboratio idepedet homeworks gradig requiremet term project books. questio: scribig?
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationEE 459/500 HDL Based Digital Design with Programmable Logic. Lecture 13 Control and Sequencing: Hardwired and Microprogrammed Control
EE 459/500 HDL Based Digital Desig with Programmable Logic Lecture 13 Cotrol ad Sequecig: Hardwired ad Microprogrammed Cotrol Refereces: Chapter s 4,5 from textbook Chapter 7 of M.M. Mao ad C.R. Kime,
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationChapter 8. Strings and Vectors. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 8 Strigs ad Vectors Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Slide 8-3 8.1 A Array Type for Strigs A Array Type for Strigs C-strigs ca be used to represet strigs
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationChapter 24. Sorting. Objectives. 1. To study and analyze time efficiency of various sorting algorithms
Chapter 4 Sortig 1 Objectives 1. o study ad aalyze time efficiecy of various sortig algorithms 4. 4.7.. o desig, implemet, ad aalyze bubble sort 4.. 3. o desig, implemet, ad aalyze merge sort 4.3. 4. o
More informationText Line Segmentation Based on Morphology and Histogram Projection
2009 10th Iteratioal Coferece o Documet Aalsis ad Recogitio Tet Lie Segmetatio Based o Morpholog ad Histogram Projectio Rodolfo P. dos Satos, Gabriela S. Clemete, Tsag Ig Re ad George D.C. Calvalcati Ceter
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationCompactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationHeaps. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 201 Heaps 201 Goodrich ad Tamassia xkcd. http://xkcd.com/83/. Tree. Used with permissio uder
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationNumerical Methods Lecture 6 - Curve Fitting Techniques
Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationReconstruction of pore space from a pore connectivity network
Joural of Microscopy, Vol. 219, Pt 2 August 2005, pp. 76 85 Received 1 December 2003; accepted 30 May 2005 Recostructio of pore space from a pore coectivity etwork Blackwell Publishig, Ltd. via morphological
More informationOn the Accuracy of Vector Metrics for Quality Assessment in Image Filtering
0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationComputer Graphics Hardware An Overview
Computer Graphics Hardware A Overview Graphics System Moitor Iput devices CPU/Memory GPU Raster Graphics System Raster: A array of picture elemets Based o raster-sca TV techology The scree (ad a picture)
More informationFINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)
FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationAnalysis of Documents Clustering Using Sampled Agglomerative Technique
Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based
More informationChapter 8. Strings and Vectors. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 8 Strigs ad Vectors Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 8.1 A Array Type for Strigs 8.2 The Stadard strig Class 8.3 Vectors Copyright 2015 Pearso Educatio, Ltd..
More informationCMSC Computer Architecture Lecture 2: ISA. Prof. Yanjing Li Department of Computer Science University of Chicago
CMSC 22200 Computer Architecture Lecture 2: ISA Prof. Yajig Li Departmet of Computer Sciece Uiversity of Chicago Admiistrative Stuff Lab1 out toight Due Thursday (10/18) Lab1 review sessio Tomorrow, 10/05,
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationVALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING
VALIDATING DIRECTIONAL EDGE-BASED IMAGE FEATURE REPRESENTATIONS IN FACE RECOGNITION BY SPATIAL CORRELATION-BASED CLUSTERING Yasufumi Suzuki ad Tadashi Shibata Departmet of Frotier Iformatics, School of
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationAutomatic Road Extraction from Satellite Image
Automatic Road Extractio from Satellite Image B.Sowmya Dept. of Electroics & Cotrol Egg., Sathyabama Istitute of Sciece & Techology, Deemed Uiversity, Cheai bsowya@yahoo.com Abstract This paper explais
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationAn Efficient Image Rectification Method for Parallel Multi-Camera Arrangement
Y.-S. Kag ad Y.-S. Ho: A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet 141 A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet Yu-Suk Kag ad Yo-Sug Ho, Seior
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
More information