else end while End References
|
|
- Rosanna Holmes
- 5 years ago
- Views:
Transcription
1 [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized binary picture, IEEE Tranaction Sytem, Man & Cybernetic, vol. SMC-6, Sept.,1976, pp
2 which p=b wa entered); ele advance the current pixel p to the next clockwie pixel in M(b). end while End While the Moore-neighborhood contour tracing algorithm will work correctly on the example of Fig. 5 whether the pixel marked S i black or not, it i not guaranteed to work correctly on all 8-connected pattern. It i left a an exercie for the reader to find uitable counter-example. However, performance can again be improved by waiting to encounter the tarting pixel for a third time. Thee algorithm are ueful neverthele, particularly in mot practical ituation where the thickne of the pattern i much greater than one pixel. In uch ituation counter-example are much harder to find. A more eriou drawback i that if the pattern P ha hole the contour tracing algorithm decribed above only deliver the outer boundary of P and not the boundarie of the hole. Such would be the cae for example for pattern uch a the letter O, P, B, Q, D and R. In order to make precie tatement about the ituation in which thee algorithm are guaranteed to compute the entire boundary of connected et care mut be taken in defining the connectivity of the background and the hole [RM89], [Ro79]. A pecial cae of interet i the that when not only the pattern i 4-connected but the background (et of white pixel) i alo 4-connected. It i left a an exercie for the reader to determine if the Moore-neighborhood contour tracing algorithm will work correctly on uch image. Finally we mention that the contour tracing algorithm decribed above are inherently equential and a mitake made early in the game tay or amplifie the problem later on. One can attribute the weaknee of thee algorithm to their equential nature although their weaknee may be overcome by additional equential procedure. However, we hall ee in later chapter that with parallel algorithm we can avoid uch problem in a impler and more elegant manner. 4. Reference [De72] [De70] [FT83] [GS87] [Po40] [Ro79] Deutch, E. S., Thinning algorithm on rectangular, hexagonal, and triangular array, Communication of the ACM, vol. 15, No. 9, Sept. 1972, pp Deutch, E. S., On parallel operation on hexagonal array, IEEE Tran. Computer, vol. C-19, Oct. 1970, pp Feje Toth, New reult in the theory of packing and covering, in Convexity and It Application, P. M. Gruber and J. M. Will, ed., Birkhauer, Bael, 1983, pp Grunbaum, B. and Shephard, G. C., Tiling and Pattern, W. H. Freeman and Co., Polachek, H., The tructure of the honeycomb, Scripta Mathematica, vol. 7, 1940, pp Roenfeld, A., Digital topology, American Mathematical Monthly, vol. 86, 1979, pp
3 S S Fig. 6 Searching for the next black contour pixel in Moore-neighborhood contour tracing. Fig. 5 Square tracing an 8-connected pattern. rent pixel p i black, the Moore neighborhood of p i examined in a clockwie manner tarting with the pixel from which p wa entered and advancing pixel by pixel until a new black pixel in P i encountered a illutrated in Fig. 6. The algorithm i decribed more preciely below. ALGORITHM Moore-Neighborhood-Tracing Input: A quare teellation T containing a connected component P of black cell. Output: A equence B (b 1, b 2,..., b k ) of boundary pixel. Begin {Initialization: find a pixel in P, initialize B, define M(p) to be the Moore neighborhood of the current pixel p} 1. Set B to be empty. 2. From bottom to top and left to right can the cell of T until a pixel of P i found (until the current pixel p= i a black pixel of P), inert in B. Let b denote the current boundary point, i.e., b=. 3. Backtrack (move the current pixel to the pixel from which wa entered) and advance the current pixel p being examined to the next clockwie pixel in M(b). while p i not equal to do if p i black, inert p in B, et b=p and backtrack (move the current pixel to the pixel from
4 p Fig. 4 A pixel in a quare teellation and it eight-neighbor. Update p. ele turn right (viit the right adjacent pixel of p); Update p. end while End Note: The notion of left and right in the above algorithm i not to be interpreted with repect to the page or the reader but rather with repect to the direction of entering the current pixel during the execution of the can. Fig. 5 how an example of how the quare tracing algorithm tarting at the pixel marked S produce a equence of boundary pixel in the cae P i 8-connected. It would be nice to be able to prove that Algorithm Square-Tracing alway work correctly, i.e., that for all connected pattern it extract the entire et of boundary pixel a defined above. Unfortunately thi i not the cae. Note that in Fig. 5 the 8-connected pattern conit of two eparate 4-connected component, i.e., two 4-connected component that are not 4-connected to each other. If the black pixel marked S were marked white intead then the algorithm would only trace one of the 4-connected component of P. Since there are imple procedure for converting 8-connected pattern to 4-connected one without appreciably changing their hape it would be nice to be able to prove that the quare tracing algorithm alway work correctly at leat for 4-connected pattern. It i left a an exercie for the reader to provide an example of a 4-connected pattern that i not completely contour traced either by the quare tracing algorithm. However, there are way of modifying the algorithm to obtain an increae in the chance that the algorithm will terminate correctly in practice. For example one may try to make the algorithm continue executing when S i encountered for the econd time to determine if an un-explored portion of P i dicovered and terminate only after S i encountered again for the third time. More popular modification of Algorithm Square-Tracing to handle 8-connected pattern dicard the left-turn-right-turn rule altogether. One uch procedure i known a Moore-neighborhood tracing. The eight neighbor of a pixel hown in Fig. 4 are alo referred to in the literature a the Moore neighborhood of a pixel. In the Moore neighborhood tracing algorithm, when the cur
5 p Fig. 3 A pixel in a hexagonal teellation and it ix neighbor. ueful definition of border point which are intimately related to the boundary. We ay that a black pixel of P i a 4-border point if at leat one of it 4-neighbor i white. We ay that a black pixel of P i an 8-border point if at leat one of it 8-neighbor i white. One particularly imple procedure for contour tracing connected component of binary picture i called quare-tracing and i decribed below. The idea i to imagine you are a bug crawling along the black and white boundary pixel and making 90 degree turn to the left or right with repect to the direction in which you are pointing at any one given moment depending on what the color of the pixel you are tanding i. ALGORITHM Square-Tracing Input: A quare teellation T containing a connected component P of black cell. Output: A equence B (b 1, b 2,..., b k ) of boundary pixel. Begin {find a pixel in P and initialize B} 1. Set B to be empty. 2. From bottom to top and left to right can the cell of T until a pixel of P i found (until the current pixel p being examined i the black tarting pixel of P). Inert in B. Turn left (viit the left adjacent pixel of p). Update p. while p not equal to do if the current pixel p i black inert p in B and turn left (viit the left adjacent pixel of p);
6 f f p f each type of teellation T we can define an object or pattern in T a a connected component of black pixel. Thu one of the firt tage in a pattern recognition ytem i to actually find all the object in the digitized field of view T. Conider for example an hexagonal teellation T and let P denote the et of pixel in T that are black. We ay that two pixel in T are neighbor if they hare an edge in common. We ay that P i connected (or a connected component) if for every pair of pixel p i, p j in P there exit a equence of pixel p i,..., p j uch that (1) it i contained in P and (2) every pair of pixel adjacent in the equence are neighbor of each other. We can obtain analogou definition of connectivity for quare array. However, becaue we now have two different type of neighbor we obtain two different type of connectivity. Accordingly let P be a et of black pixel in a quare teellation T. We ay that P i 4-connected (or a 4-connected component) if for every pair of pixel p i, p j in P there exit a equence of pixel p i,..., p j uch that (1) it i contained in P and (2) every pair of pixel adjacent in the equence are 4-neighbor of each other. Similarly, We ay that P i 8-connected (or an 8-connected component) if for every pair of pixel p i, p j in P there exit a equence of pixel p i,..., p j uch that (1) it i contained in P and (2) every pair of pixel adjacent in the equence are 8-neighbor of each other. Obviouly a 4-connected pattern i an 8- connected pattern but not vice-vera. 3. Contour Tracing Fig. 2 A pixel in a triangular teellation and it three type of neighbor. One method of finding and analyzing the connected component of T i to can T in ome manner until a border pixel of a component P i found and ubequently to trace the boundary of P until the entire boundary i obtained. The boundary thu obtained can be tored a a doublylinked circular lit of pixel or a a polygon of the boundary of the pixel in quetion. Such procedure are generally termed contour tracing. There i frequently no tandard formal definition given of the boundary of a connected pattern. In practice the boundary i what eem appropriate a the boundary to human and algorithm are judged in accordance to how well they agree with human perception. However in order to make more precie tatement about our algorithm there are two
7 Triangular Hexagonal Square view the reulting grid a a graph, all the node in thi graph have degree ix wherea the degree are four and three in quare and hexagonal teellation, repectively. More importantly however are the neighborhood propertie of a ingle pixel. Conider the pixel marked black in Fig. 2 and call it p. The neighborhood of p i defined a the et of pixel that interect p. We ee that p ha 12 neighbor and thee can be claified into three group: thoe that have an edge in common with p (hown haded in Fig. 2), and thoe that only have a point in common. Of the latter we can ditinguih between thoe that are facing a vertex of p (marked f) and thoe that are kewed with a vertex of p (marked ). The complicated nature of thi ituation and it complicating effect on the reulting image proceing algorithm deigned to work on uch teellation make thi type of teellation un-attractive although much reearch wa done on all three type of teellation during the early day of pattern recognition [De72]. 1.2 Hexagonal Teellation From the point of view of the neighborhood propertie of a ingle pixel, the hexagonal teellation i the mot elegant a can be een from Fig. 3 where a black pixel p i hown urrounded by it ix neighbor. All the ix neighbor belong to the ame equivalence cla in the ene that they hare one edge with p. Beide their ue in image proceing hexagonal array are notoriouly preent in nature ingularly evident in the honeycomb of the bee. A a reult many facinating mathematical propertie of thee teellation and their 3-dimenional relative have been the ubject of invetigation for two thouand year [Po40]. 1.3 Square Teellation Square teellation are the mot widely ued in practice. Fig. 4 illutrate a black pixel p and it neighborhood. We ee that p ha 8 neighbor and thee can be claified into two group: thoe that have an edge in common with p (hown haded in Fig. 4), and thoe that only have a point in common. The haded group are called the 4-neighbor of p wherea the totality of neighbor i called the 8-neighborhood of p. Thu a 4-neighbor i an 8-neighbor but not vice-vera. 2. Connectivity Fig. 1 Illutrating the three type of regular teellation. One of the mot important concept in image proceing i the notion of connectivity, In
8 CHAPTER 2 GRIDS, CONNECTIVITY AND CONTOUR TRACING Godfried Touaint ABSTRACT Thi chapter introduce the three baic type of grid ued to repreent a digital pattern: triangular, hexagonal and quare. The notion of 4-connectedne and 8-connectedne are defined and their impact on tracing the boundary of a digital pattern i analyzed. 1. Teellation A teellation of the plane i eentially a partitioning of the plane into region. Typical example of bounded region that form teellation are a quilted bedpread and a tiled bathroom floor. There exit coniderable variation in the terminology of teellation. In the mathematical literature the word tiling and moaic are often ued and one alo encounter the word paving and parqueting [GS87]. More formally we ay that a planar teellation T i a countable family of cloed et T = {T 1, T 2,...} which cover the plane without gap or overlap. A in a well contructed bathroom floor we would not want ome tile to be miing (gap) or to be lying on top of other (overlap). More preciely, the union of all the et T 1, T 2,... (alo referred to a cell) contitute the entire plane and the interection of the interior of every pair of cell i empty. It i ueful to define two related notion here. A packing i a family of et which ha no overlapping. A covering i a family of et that ha no gap. Clearly, a teellation i both a packing and a covering. Furthermore, when the object of interet i not the entire plane but a ubet of it a for example a imple polygon then the term teellation i replaced by partition. Covering and packing of the plane are of interet to mathematician and a good urvey on recent reult in thi area can be found in [FT83]. Partition and other covering of polygon, on the other hand, are very ueful in computer cience and will be of interet when we tudy feature extraction and the meaurement of hape. Here we are intereted in teellation a model for the repreentation of digital image and therefore it i convenient to let all the cell (pixel in thi context) be the ame hape and ize. Such teellation are termed monohedral. Thi mean that every pixel in T i congruent either directly or reflectively to one fixed hape T called the prototile or protocell. Thi i of coure not a neceary condition for obtaining effective computer viion ytem. The teellation induced by the ditribution of rod and cone in the retina of our eye are certainly not monohedral. Some reearch ha alo been done on image proceing algorithm on non-monohedral teellation [SK76]. However, our primary concern i with a retricted verion of monohedral teellation. If we alo init that each cell be a regular polygon, i.e., a polygon with all it ide and angle equal, then we obtain the o-called regular teellation. It turn out that there exit only three different type of uch teellation: triangular, hexagonal and quare a illutrated in Fig Triangular Teellation Triangular teellation are the mot complicated of the three in ome ene. For one, if we - 9 -
Minimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationQuadrilaterals. Learning Objectives. Pre-Activity
Section 3.4 Pre-Activity Preparation Quadrilateral Intereting geometric hape and pattern are all around u when we tart looking for them. Examine a row of fencing or the tiling deign at the wimming pool.
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationLecture Outline. Global flow analysis. Global Optimization. Global constant propagation. Liveness analysis. Local Optimization. Global Optimization
Lecture Outline Global flow analyi Global Optimization Global contant propagation Livene analyi Adapted from Lecture by Prof. Alex Aiken and George Necula (UCB) CS781(Praad) L27OP 1 CS781(Praad) L27OP
More informationCERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu
CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,
More informationKaren L. Collins. Wesleyan University. Middletown, CT and. Mark Hovey MIT. Cambridge, MA Abstract
Mot Graph are Edge-Cordial Karen L. Collin Dept. of Mathematic Weleyan Univerity Middletown, CT 6457 and Mark Hovey Dept. of Mathematic MIT Cambridge, MA 239 Abtract We extend the definition of edge-cordial
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationGeneric Traverse. CS 362, Lecture 19. DFS and BFS. Today s Outline
Generic Travere CS 62, Lecture 9 Jared Saia Univerity of New Mexico Travere(){ put (nil,) in bag; while (the bag i not empty){ take ome edge (p,v) from the bag if (v i unmarked) mark v; parent(v) = p;
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationShortest Paths Problem. CS 362, Lecture 20. Today s Outline. Negative Weights
Shortet Path Problem CS 6, Lecture Jared Saia Univerity of New Mexico Another intereting problem for graph i that of finding hortet path Aume we are given a weighted directed graph G = (V, E) with two
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationarxiv: v3 [cs.cg] 1 Oct 2018
Improved Time-Space Trade-off for Computing Voronoi Diagram Bahareh Banyaady Matia Korman Wolfgang Mulzer André van Renen Marcel Roeloffzen Paul Seiferth Yannik Stein arxiv:1708.00814v3 [c.cg] 1 Oct 2018
More informationCS 467/567: Divide and Conquer on the PRAM
CS 467/567: Divide and Conquer on the PRAM Stefan D. Bruda Winter 2017 BINARY SEARCH Problem: Given a equence S 1..n orted in nondecreaing order and a value x, find the ubcript k uch that S i x If n proceor
More informationToday s Outline. CS 561, Lecture 23. Negative Weights. Shortest Paths Problem. The presence of a negative cycle might mean that there is
Today Outline CS 56, Lecture Jared Saia Univerity of New Mexico The path that can be trodden i not the enduring and unchanging Path. The name that can be named i not the enduring and unchanging Name. -
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationA note on degenerate and spectrally degenerate graphs
A note on degenerate and pectrally degenerate graph Noga Alon Abtract A graph G i called pectrally d-degenerate if the larget eigenvalue of each ubgraph of it with maximum degree D i at mot dd. We prove
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationAreas of Regular Polygons. To find the area of a regular polygon. The Solve It involves the area of a polygon.
10- Area of Regular Polygon Common Core State Standard G-MG.A.1 Ue geometric hape, their meaure, and their propertie to decribe object. Alo G-CO.D.1 MP 1, MP, MP 4, MP 6, MP 7 Objective To find the area
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationExploring Simple Grid Polygons
Exploring Simple Grid Polygon Chritian Icking 1, Tom Kamphan 2, Rolf Klein 2, and Elmar Langetepe 2 1 Univerity of Hagen, Praktiche Informatik VI, 58084 Hagen, Germany. 2 Univerity of Bonn, Computer Science
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationAlgorithmic Discrete Mathematics 4. Exercise Sheet
Algorithmic Dicrete Mathematic. Exercie Sheet Department of Mathematic SS 0 PD Dr. Ulf Lorenz 0. and. May 0 Dipl.-Math. David Meffert Verion of May, 0 Groupwork Exercie G (Shortet path I) (a) Calculate
More informationExercise 4: Markov Processes, Cellular Automata and Fuzzy Logic
Exercie 4: Marko rocee, Cellular Automata and Fuzzy Logic Formal Method II, Fall Semeter 203 Solution Sheet Marko rocee Theoretical Exercie. (a) ( point) 0.2 0.7 0.3 tanding 0.25 lying 0.5 0.4 0.2 0.05
More informationKS3 Maths Assessment Objectives
KS3 Math Aement Objective Tranition Stage 9 Ratio & Proportion Probabilit y & Statitic Appreciate the infinite nature of the et of integer, real and rational number Can interpret fraction and percentage
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
More informationAnalyzing Hydra Historical Statistics Part 2
Analyzing Hydra Hitorical Statitic Part Fabio Maimo Ottaviani EPV Technologie White paper 5 hnode HSM Hitorical Record The hnode i the hierarchical data torage management node and ha to perform all the
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationarxiv: v1 [cs.ds] 27 Feb 2018
Incremental Strong Connectivity and 2-Connectivity in Directed Graph Louka Georgiadi 1, Giueppe F. Italiano 2, and Niko Parotidi 2 arxiv:1802.10189v1 [c.ds] 27 Feb 2018 1 Univerity of Ioannina, Greece.
More informationTouring a Sequence of Polygons
Touring a Sequence of Polygon Mohe Dror (1) Alon Efrat (1) Anna Lubiw (2) Joe Mitchell (3) (1) Univerity of Arizona (2) Univerity of Waterloo (3) Stony Brook Univerity Problem: Given a equence of k polygon
More informationRepresentations and Transformations. Objectives
Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationThe Split Domination and Irredundant Number of a Graph
The Split Domination and Irredundant Number of a Graph S. Delbin Prema 1, C. Jayaekaran 2 1 Department of Mathematic, RVS Technical Campu-Coimbatore, Coimbatore - 641402, Tamil Nadu, India 2 Department
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in VHL and implemented
More informationInterface Tracking in Eulerian and MMALE Calculations
Interface Tracking in Eulerian and MMALE Calculation Gabi Luttwak Rafael P.O.Box 2250, Haifa 31021,Irael Interface Tracking in Eulerian and MMALE Calculation 3D Volume of Fluid (VOF) baed recontruction
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationShortest Path Routing in Arbitrary Networks
Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationComputer Arithmetic Homework Solutions. 1 An adder for graphics. 2 Partitioned adder. 3 HDL implementation of a partitioned adder
Computer Arithmetic Homework 3 2016 2017 Solution 1 An adder for graphic In a normal ripple carry addition of two poitive number, the carry i the ignal for a reult exceeding the maximum. We ue thi ignal
More informationCourse Project: Adders, Subtractors, and Multipliers a
In the name Allah Department of Computer Engineering 215 Spring emeter Computer Architecture Coure Intructor: Dr. Mahdi Abbai Coure Project: Adder, Subtractor, and Multiplier a a The purpoe of thi p roject
More informationCS201: Data Structures and Algorithms. Assignment 2. Version 1d
CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and
More informationTesting Structural Properties in Textual Data: Beyond Document Grammars
Teting Structural Propertie in Textual Data: Beyond Document Grammar Felix Saaki and Jen Pönninghau Univerity of Bielefeld, Germany Abtract Schema language concentrate on grammatical contraint on document
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationNumerical Modeling of Material Discontinuity Using Mixed MLPG Collocation Method
umerical odeling of aterial Dicontinuit Uing ied LPG Collocation ethod B. alušić 1,. Sorić 1 and T. arak 1 Abtract A mied LPG collocation method i applied for the modeling of material dicontinuit in heterogeneou
More informationLemma 1. A 3-connected maximal generalized outerplanar graph is a wheel.
122 (1997) MATHEMATICA BOHEMICA No. 3, 225{230 A LINEAR ALGORITHM TO RECOGNIZE MAXIMAL GENERALIZED OUTERPLANAR GRAPHS Jo C cere, Almer a, Alberto M rquez, Sevilla (Received November 16, 1994, revied May
More informationA NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE CONSTITUTED WITH MACHINING PROCESS BY MATERIAL REMOVAL
International Journal of Mechanical and Production Engineering Reearch and Development (IJMPERD) ISSN 49-689 Vol. 3, Iue, Mar 3, 4-5 TJPRC Pvt. Ltd. A NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE
More informationPolygon Side Lengths NAME DATE TIME
Home Link 5- Polygon Side Length Find any miing coordinate. Plot and label the point on the coordinate grid. Draw the polygon by connecting the point. y a. Rectangle ABCD A: (, ) B: (-, ) The length of
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More information(12) Patent Application Publication (10) Pub. No.: US 2003/ A1
US 2003O196031A1 (19) United State (12) Patent Application Publication (10) Pub. No.: US 2003/0196031 A1 Chen (43) Pub. Date: Oct. 16, 2003 (54) STORAGE CONTROLLER WITH THE DISK Related U.S. Application
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationCORRECTNESS ISSUES AND LOOP INVARIANTS
The next everal lecture 2 Study algorithm for earching and orting array. Invetigate their complexity how much time and pace they take Formalize the notion of average-cae and wort-cae complexity CORRECTNESS
More informationIMPLEMENTATION OF CHORD LENGTH SAMPLING FOR TRANSPORT THROUGH A BINARY STOCHASTIC MIXTURE
Nuclear Mathematical and Computational Science: A Century in Review, A Century Anew Gatlinburg, Tenneee, April 6-, 003, on CD-ROM, American Nuclear Society, LaGrange Park, IL (003) IMPLEMENTATION OF CHORD
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationA Boyer-Moore Approach for. Two-Dimensional Matching. Jorma Tarhio. University of California. Berkeley, CA Abstract
A Boyer-Moore Approach for Two-Dimenional Matching Jorma Tarhio Computer Science Diviion Univerity of California Berkeley, CA 94720 Abtract An imple ublinear algorithm i preented for two-dimenional tring
More informationComputing C-space Entropy for View Planning
Computing C-pace Entropy for View Planning for a Generic Range Senor Model Pengpeng Wang (pwangf@c.fu.ca) Kamal Gupta (kamal@c.fu.ca) Robotic Lab School of Engineering Science Simon Fraer Univerity Burnaby,
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationSIMIT 7. Component Type Editor (CTE) User manual. Siemens Industrial
SIMIT 7 Component Type Editor (CTE) Uer manual Siemen Indutrial Edition January 2013 Siemen offer imulation oftware to plan, imulate and optimize plant and machine. The imulation- and optimizationreult
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationToday s Outline. CS 362, Lecture 19. DFS and BFS. Generic Traverse. BFS and DFS Wrapup Shortest Paths. Jared Saia University of New Mexico
Today Outline CS 362, Lecture 9 Jared Saia Univerity of New Mexico BFS and DFS Wrapup Shortet Path Generic Travere DFS and BFS Travere(){ put (nil,) in bag; while (the bag i not empty){ take ome edge (p,v)
More informationA Sparse Shared-Memory Multifrontal Solver in SCAD Software
Proceeding of the International Multiconference on ISBN 978-83-6080--9 Computer Science and Information echnology, pp. 77 83 ISSN 896-709 A Spare Shared-Memory Multifrontal Solver in SCAD Software Sergiy
More informationNearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Nearly Contant Approximation for Data Aggregation Scheduling in Wirele Senor Network Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yinghu Li and France Yao Computer Science Department, City Univerity of
More informationTemporal Abstract Interpretation. To have a continuum of program analysis techniques ranging from model-checking to static analysis.
Temporal Abtract Interpretation Patrick COUSOT DI, École normale upérieure 45 rue d Ulm 75230 Pari cedex 05, France mailto:patrick.couot@en.fr http://www.di.en.fr/ couot and Radhia COUSOT LIX École polytechnique
More informationBuilding a Compact On-line MRF Recognizer for Large Character Set using Structured Dictionary Representation and Vector Quantization Technique
202 International Conference on Frontier in Handwriting Recognition Building a Compact On-line MRF Recognizer for Large Character Set uing Structured Dictionary Repreentation and Vector Quantization Technique
More informationMid-term review ECE 161C Electrical and Computer Engineering University of California San Diego
Mid-term review ECE 161C Electrical and Computer Engineering Univerity of California San Diego Nuno Vaconcelo Spring 2014 1. We have een in cla that one popular technique for edge detection i the Canny
More informationAVL Tree. The height of the BST be as small as possible
1 AVL Tree re and Algorithm The height of the BST be a mall a poible The firt balanced BST. Alo called height-balanced tree. Introduced by Adel on-vel kii and Landi in 1962. BST with the following condition:
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationShortest-Path Routing in Arbitrary Networks
Ž. Journal of Algorithm 31, 105131 1999 Article ID jagm.1998.0980, available online at http:www.idealibrary.com on Shortet-Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vocking
More informationTouring a Sequence of Polygons
Touring a Sequence of Polygon Mohe Dror (1) Alon Efrat (1) Anna Lubiw (2) Joe Mitchell (3) (1) Univerity of Arizona (2) Univerity of Waterloo (3) Stony Brook Univerity Problem: Given a equence of k polygon
More informationChapter S:II (continued)
Chapter S:II (continued) II. Baic Search Algorithm Sytematic Search Graph Theory Baic State Space Search Depth-Firt Search Backtracking Breadth-Firt Search Uniform-Cot Search AND-OR Graph Baic Depth-Firt
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR
ADAM - A PROBLEM-ORIENTED SYMBOL PROCESSOR A. P. Mullery and R. F. Schauer Thoma J. Waton Reearch Center International Buine Machine Corporation Yorktown Height, New York R. Rice International Buine Machine
More informationThe norm Package. November 15, Title Analysis of multivariate normal datasets with missing values
The norm Package November 15, 2003 Verion 1.0-9 Date 2002/05/06 Title Analyi of multivariate normal dataet with miing value Author Ported to R by Alvaro A. Novo . Original by Joeph
More informationLecture 8: More Pipelining
Overview Lecture 8: More Pipelining David Black-Schaffer davidbb@tanford.edu EE8 Spring 00 Getting Started with Lab Jut get a ingle pixel calculating at one time Then look into filling your pipeline Multiplier
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationParameters, UVM, Coverage & Emulation Take Two and Call Me in the Morning
Parameter, UVM, Coverage & Emulation Take Two and Call Me in the Morning Michael Horn Mentor Graphic Corporation Colorado, USA Mike_Horn@mentor.com Bryan Ramirez Mentor Graphic Corporation Colorado, USA
More informationCSE 250B Assignment 4 Report
CSE 250B Aignment 4 Report March 24, 2012 Yuncong Chen yuncong@c.ucd.edu Pengfei Chen pec008@ucd.edu Yang Liu yal060@c.ucd.edu Abtract In thi project, we implemented the recurive autoencoder (RAE) a decribed
More information