MORPHOLOGICAL IMAGE ANALYSIS III

Size: px
Start display at page:

Download "MORPHOLOGICAL IMAGE ANALYSIS III"

Transcription

1 MORPHOLOGICAL IMAGE ANALYSIS III Secondary inary Morphological Operators A set operator Ψ( ) which is: Increasing; i.e., Ψ( ) Ψ( ) Anti-extensive; i.e., Ψ( ) Idempotent; i.e., ΨΨ ( ( )) = Ψ( ) is called an opening. A set operator Ψ( ) which is: Increasing; i.e., Ψ( ) Ψ( ) Extensive; i.e., Ψ( ) Idempotent; i.e., ΨΨ ( ( )) = Ψ( ) is called a closing. If ( Ψ ε, Ψ δ ) is an adjunction, then ΨΨ δ ε ( ) is an opening whereas ΨΨ ε δ ( ) is a closing. If { Ψ i } is a collection of openings, then Ψ( ) = i Ψ i ( ) is an opening as well; i.e., unions of openings is also an opening! If { Ψ i } is a collection of closings, then Ψ( ) = i Ψ i ( ) is a closing as well; i.e., intersection of closings is also a closing! John Goutsias (ebruary, 02) 1

2 inary Structural Opening The (binary) structural opening of an image with a structuring element is given by: = ( 8) It can be shown that: = { + h ( + h) } This formula suggests that the structural opening of a set (shape) by a structuring element is the union of all translated structuring elements + h that fit inside (geometric interpretation of the structural opening). =( 8) 8 + h Opening a shape by a structuring element eliminates all components of which are smaller than, in the sense that they cannot contain any translated replica of! It therefore acts as a shape filter. John Goutsias (ebruary, 02) 2

3 inary Structural Opening Example 2 3 : r = { rb b } John Goutsias (ebruary, 02) 3

4 inary Structural Opening The structural opening is a smoothing filter! The amount and type of smoothing is determined by the shape and size of the structuring element used. It attempts to undo the effect of erosion 8 by applying the associated dilation ( 8). The structural opening approximates a shape from below, since John Goutsias (ebruary, 02) 4

5 inary Structural Closing The (binary) structural closing of an image with a structuring element is given by: ² = ( ) 8 It can be shown that: ² = { u u + h ( + h) } This formula suggests that a point u belongs to the structural closing of a set (shape) by a structuring element if all translated structuring elements + h that contain u intersect (geometric interpretation of the closing). ² John Goutsias (ebruary, 02) 5

6 inary Structural Closing Example ² ²2 ²3 : r = { rb b } John Goutsias (ebruary, 02) 6

7 inary Structural Closing The structural closing is a smoothing filter! The amount and type of smoothing is determined by the shape and size of the structuring element used. It attempts to undo the effect of dilation erosion ( ) 8. by applying the associated The structural closing approximates a shape from above, since ² John Goutsias (ebruary, 02) 7

8 Properties of inary Structural Opening { h}= ( + h) = ( ) + h Translation invariance ( + h) = Increasingness with respect to shape r r = r( ) Homogeneity Anti-extensitivity ( ) = Idempotence c = ( ² ) c Duality Properties of inary Structural Closing ²{ h}= ( + h) ² = ( ² ) + h Translation invariance ² ( + h) = ² ² ² Increasingness with respect to shape r² r = r( ² ) Homogeneity ² Extensitivity ( ² ) ² = ² Idempotence c ² = ( ) c Duality John Goutsias (ebruary, 02) 8

9 Some Advanced Properties of Structural Opening and Closing Aset is called open if =. Aset is called closed if ² =. Property: Aset is open if and only if = G for some set G. Proof: Assume first that is open. Then = = ( 8) = G where G 8. Assume now that = G, for some set G. Then = ( G ) = (( G ) 8 ) = ( G² ) G =. Also,, due to the anti-extensitivity property of the opening; therefore, since and, we get =, which shows that is open. Property: Aset is closed if and only if = G8 for some set G. Property: Let A and be two structuring elements such that A is open. Then, A ( A) = ( ) A= A ² A ² ( ² A) ² = ( ² ) ² A= ² A John Goutsias (ebruary, 02) 9

10 Morphological Shape Smoothing Example 1 Example 2 ( ) ² Example 3 D ( D) ² D John Goutsias (ebruary, 02) 10

11 inary Erosion-Dilation-Opening-Closing Example 1 : Henri Matisse, Nu leu III, ² John Goutsias (ebruary, 02) 11

12 inary Erosion-Dilation-Opening-Closing Example 2 : 8 ² John Goutsias (ebruary, 02) 12

13 inary Erosion-Dilation-Opening-Closing Example 3 : 8 ² John Goutsias (ebruary, 02) 13

14 Remark rom the previous examples it is clear that the choice of the structuring element is very important here. Here is another example 8, : 8, : 8, : Most of the time, the structuring element is chosen by the algorithm designer in a way that makes most sense in practical applications. However, many researchers have identified the need to build-up an approach that allows the automatic specification of the structuring element that best fits a particular application. John Goutsias (ebruary, 02) 14

Chapter III: Opening, Closing

Chapter III: Opening, Closing Chapter III: Opening, Closing Opening and Closing by adjunction Algebraic Opening and Closing Top-Hat Transformation Granulometry J. Serra Ecole des Mines de Paris ( 2000 ) Course on Math. Morphology III.

More information

Mathematical Morphology and Distance Transforms

Mathematical Morphology and Distance Transforms Mathematical Morphology and Distance Transforms Vladimir Curic Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University About the teacher PhD student at CBA Background in

More information

Chapter I : Basic Notions

Chapter I : Basic Notions Chapter I : Basic Notions - Image Processing - Lattices - Residues - Measurements J. Serra Ecole des Mines de Paris ( 2000 ) Course on Math. Morphology I. 1 Image Processing (I) => Image processing may

More information

Digital Signal Processing

Digital Signal Processing 1 PART 1: SUMMARY OF THEORY Digital Signal Processing Image Processing: Introduction to Morphological Processing 1 Part 1: Summary of Theory 1.1 Image (digital) 1.1.1 Concept and types An image I is a

More information

Part I : Bases. Part I : Bases

Part I : Bases. Part I : Bases Indian Statistical Institute System Science and Informatics Unit Bengalore, India Bengalore, 19-22 October 2010 ESIEE University of Paris-Est France Part I : Bases - ordering and lattices - erosion and

More information

Chapter VIII : Thinnings

Chapter VIII : Thinnings Chapter VIII : Thinnings Hit-or-Miss Thinning thickening Homotopy Homotopy and Connectivity Homotopic Thinnings and Thickenings J. Serra Ecole des Mines de Paris ( 2000 ) Course on Math. Morphology VIII.

More information

Identification of Finite Lattice Dynamical Systems

Identification of Finite Lattice Dynamical Systems Identification of Finite Lattice Dynamical Systems Junior Barrera BIOINFO-USP University of São Paulo, Brazil Outline Introduction Lattice operator representation Lattice operator design Lattice dynamical

More information

Mathematical Morphology

Mathematical Morphology Mathematical Morphology Isabelle Bloch http://www.tsi.enst.fr/ bloch Ecole Nationale Supérieure des Télécommunications - CNRS UMR 5141 LTCI Paris - France Mathematical Morphology p.1/84 A few references

More information

Duality vs Adjunction and General Form for Fuzzy Mathematical Morphology

Duality vs Adjunction and General Form for Fuzzy Mathematical Morphology Duality vs Adjunction and General Form for Fuzzy Mathematical Morphology Isabelle Bloch GET - Ecole Nationale Supérieure des Télécommunications, Dept. TSI - CNRS UMR 5141 LTCI, 46 rue Barrault, 7513 Paris,

More information

A new class of morphological pyramids for multiresolution image analysis

A new class of morphological pyramids for multiresolution image analysis new class of morphological pyramids for multiresolution image analysis Jos B.T.M. Roerdink Institute for Mathematics and Computing Science University of Groningen P.O. Box 800, 9700 V Groningen, The Netherlands

More information

Chapter VI. Set Connection and Numerical Functions

Chapter VI. Set Connection and Numerical Functions Chapter VI Set Connection and Numerical Functions Concepts : -> Extension to functions -> Connected operators -> Numerical Geodesy -> Leveling and self-duality Applications : -> Extrema analysis -> Contour

More information

Used to extract image components that are useful in the representation and description of region shape, such as

Used to extract image components that are useful in the representation and description of region shape, such as Used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction skeletons convex hull morphological filtering thinning pruning Sets

More information

Relations on Hypergraphs

Relations on Hypergraphs Relations on Hypergraphs John Stell School of Computing, University of Leeds RAMiCS 13 Cambridge, 17th September 2012 Relations on a Set Boolean algebra Converse R = R Complement R = R Composition & residuation

More information

CS 4495 Computer Vision Binary images and Morphology

CS 4495 Computer Vision Binary images and Morphology CS 4495 Computer Vision Binary images and Aaron Bobick School of Interactive Computing Administrivia PS6 should be working on it! Due Sunday Nov 24 th. Some issues with reading frames. Resolved? Exam:

More information

Part II : Connection

Part II : Connection Indian Statistical Institute System Science and Informatics Unit Bengalore, India Bengalore, 19-22 October 2010 ESIEE University of Paris-Est France Part II : Connection - Set case - Function case Jean

More information

Chapter IV : Morphological Filtering

Chapter IV : Morphological Filtering Chapter IV : Morphological Filtering Serial composition -> Products θψ, θψθ -> Alternating sequential filters Parallel composition -> Morphological centers -> Contrast enhancement J. Serra Ecole des Mines

More information

ELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2)

ELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) ELEC 2200-002 Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL

More information

Mathematical Morphology

Mathematical Morphology Mathematical Morphology Erosions and Dilations Luc Brun (d après le cours de M. Coster) 25 janvier 2018 1 / 61 Plan (1/2) Structuring element Definition, Example, Transpose Set erosion and dilatation Hit

More information

Some Relationships Between Fuzzy Sets, Mathematical Morphology, Rough Sets, F-Transforms, and Formal Concept Analysis

Some Relationships Between Fuzzy Sets, Mathematical Morphology, Rough Sets, F-Transforms, and Formal Concept Analysis International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems Vol. 24, Suppl. 2 (December 2016) 1 32 c World Scientific Publishing Company DOI: 10.1142/S0218488516400080 Some Relationships

More information

Vector-attribute filters

Vector-attribute filters Vector-attribute filters Erik R. Urbach, Niek J. Boersma, and Michael H.F. Wilkinson Institute for Mathematics and Computing Science University of Groningen The Netherlands April 2005 Outline Purpose Binary

More information

BASIC MATHEMATICAL TECHNIQUES

BASIC MATHEMATICAL TECHNIQUES CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing

More information

Chapter 14. Duality for Normed Linear Spaces

Chapter 14. Duality for Normed Linear Spaces 14.1. Linear Functionals, Bounded Linear Functionals, and Weak Topologies 1 Chapter 14. Duality for Normed Linear Spaces Note. In Section 8.1, we defined a linear functional on a normed linear space, a

More information

Morphological image processing

Morphological image processing INF 4300 Digital Image Analysis Morphological image processing Fritz Albregtsen 09.11.2017 1 Today Gonzalez and Woods, Chapter 9 Except sections 9.5.7 (skeletons), 9.5.8 (pruning), 9.5.9 (reconstruction)

More information

Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results

Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results Isabelle Bloch, Alain Bretto DGCI 2011 I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI

More information

Multimedia Databases. Previous Lecture. 4.1 Multiresolution Analysis. 4 Shape-based Features. 4.1 Multiresolution Analysis

Multimedia Databases. Previous Lecture. 4.1 Multiresolution Analysis. 4 Shape-based Features. 4.1 Multiresolution Analysis Previous Lecture Multimedia Databases Texture-Based Image Retrieval Low Level Features Tamura Measure, Random Field Model High-Level Features Fourier-Transform, Wavelets Wolf-Tilo Balke Silviu Homoceanu

More information

Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig

Multimedia Databases. Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig Multimedia Databases Wolf-Tilo Balke Philipp Wille Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 4 Previous Lecture Texture-Based Image Retrieval Low

More information

Multimedia Databases. 4 Shape-based Features. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis

Multimedia Databases. 4 Shape-based Features. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis. 4.1 Multiresolution Analysis 4 Shape-based Features Multimedia Databases Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 4 Multiresolution Analysis

More information

Geometric Algebra. 4. Algebraic Foundations and 4D. Dr Chris Doran ARM Research

Geometric Algebra. 4. Algebraic Foundations and 4D. Dr Chris Doran ARM Research Geometric Algebra 4. Algebraic Foundations and 4D Dr Chris Doran ARM Research L4 S2 Axioms Elements of a geometric algebra are called multivectors Multivectors can be classified by grade Grade-0 terms

More information

Fuzzy Sets and Fuzzy Techniques. Sladoje. Introduction. Operations. Combinations. Aggregation Operations. An Application: Fuzzy Morphologies

Fuzzy Sets and Fuzzy Techniques. Sladoje. Introduction. Operations. Combinations. Aggregation Operations. An Application: Fuzzy Morphologies Sets and Sets and Outline of Sets and Lecture 8 on Sets of 1 2 Centre for Image alysis Uppsala University 3 of February 15, 2007 4 5 Sets and Standard fuzzy operations Sets and Properties of the standard

More information

Morphology Gonzalez and Woods, Chapter 9 Except sections 9.5.7, 9.5.8, and Repetition of binary dilatation, erosion, opening, closing

Morphology Gonzalez and Woods, Chapter 9 Except sections 9.5.7, 9.5.8, and Repetition of binary dilatation, erosion, opening, closing 09.11.2011 Anne Solberg Morphology Gonzalez and Woods, Chapter 9 Except sections 9.5.7, 9.5.8, 9.5.9 and 9.6.4 Repetition of binary dilatation, erosion, opening, closing Binary region processing: connected

More information

Morphological Operations. GV12/3072 Image Processing.

Morphological Operations. GV12/3072 Image Processing. Morphological Operations 1 Outline Basic concepts: Erode and dilate Open and close. Granulometry Hit and miss transform Thinning and thickening Skeletonization and the medial axis transform Introduction

More information

(9) Morphological Image Processing (a) Basic set operations

(9) Morphological Image Processing (a) Basic set operations (9) Morphological Image Processing - Morphology A branch of biology that deals with the form and structure of animals and plants - Mathematical morphology A tool to extract image components for representing

More information

( nonlinear constraints)

( nonlinear constraints) Wavelet Design & Applications Basic requirements: Admissibility (single constraint) Orthogonality ( nonlinear constraints) Sparse Representation Smooth functions well approx. by Fourier High-frequency

More information

A Logical Perspective on Mathematical Morphology

A Logical Perspective on Mathematical Morphology A Logical Perspective on Mathematical Morphology A MsC Thesis in Artificial Intelligence Brammert Ottens supervisors Marco Aiello Rein van den Boomgaard February 2, 2007 ii abstract In this thesis a link

More information

Nonlinear Multiresolution Signal Decomposition Schemes Part I: Morphological Pyramids

Nonlinear Multiresolution Signal Decomposition Schemes Part I: Morphological Pyramids 1862 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 9, NO. 11, NOVEMBER 2000 Nonlinear Multiresolution Signal Decomposition Schemes Part I: Morphological Pyramids John Goutsias, Senior Member, IEEE, and Henk

More information

MATH 8. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability

MATH 8. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability MATH 8 Unit 1: Rational and Irrational Numbers (Term 1) 1. I CAN write an algebraic expression for a given phrase. 2. I CAN define a variable and write an equation given a relationship. 3. I CAN use order

More information

Digital Image Processing

Digital Image Processing Digital Image Processing Wavelets and Multiresolution Processing () Christophoros Nikou cnikou@cs.uoi.gr University of Ioannina - Department of Computer Science 2 Contents Image pyramids Subband coding

More information

Connectivity on Complete Lattices

Connectivity on Complete Lattices Connectivity on Complete Lattices Jean Serra Centre de Morphologie Mathématique Ecole des Mines de Paris 35, rue Saint-Honoré 77305 Fontainebleau (France) Phone: 33(1) 64.69.47.06 - Fax: 33(1) 64.69.47.07

More information

MATH 7 HONORS. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability

MATH 7 HONORS. Unit 1: Rational and Irrational Numbers (Term 1) Unit 2: Using Algebraic Properties to Simplify Expressions - Probability MATH 7 HONORS Unit 1: Rational and Irrational Numbers (Term 1) 1. I CAN write an algebraic expression for a given phrase. 2. I CAN define a variable and write an equation given a relationship. 3. I CAN

More information

Geometry GENERAL GEOMETRY

Geometry GENERAL GEOMETRY Geometry GENERAL GEOMETRY Essential Vocabulary: point, line, plane, segment, segment bisector, midpoint, congruence I can use the distance formula to determine the area and perimeters of triangles and

More information

Created by T. Madas VECTOR OPERATORS. Created by T. Madas

Created by T. Madas VECTOR OPERATORS. Created by T. Madas VECTOR OPERATORS GRADIENT gradϕ ϕ Question 1 A surface S is given by the Cartesian equation x 2 2 + y = 25. a) Draw a sketch of S, and describe it geometrically. b) Determine an equation of the tangent

More information

arxiv: v1 [math.ds] 22 Jan 2019

arxiv: v1 [math.ds] 22 Jan 2019 A STUDY OF HOLOMORPHIC SEMIGROUPS arxiv:1901.07364v1 [math.ds] 22 Jan 2019 BISHNU HARI SUBEDI Abstract. In this paper, we investigate some characteristic features of holomorphic semigroups. In particular,

More information

Feature Extraction and Image Processing

Feature Extraction and Image Processing Feature Extraction and Image Processing Second edition Mark S. Nixon Alberto S. Aguado :*авш JBK IIP AMSTERDAM BOSTON HEIDELBERG LONDON NEW YORK OXFORD PARIS SAN DIEGO SAN FRANCISCO SINGAPORE SYDNEY TOKYO

More information

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA

3 Boolean Algebra 3.1 BOOLEAN ALGEBRA 3 Boolean Algebra 3.1 BOOLEAN ALGEBRA In 1854, George Boole introduced the following formalism which eventually became Boolean Algebra. Definition. An algebraic system consisting of a set B of elements

More information

Mathematical Morphology on Complete Lattices for Imperfect Information Processing Application to Image Understanding and Spatial Reasoning

Mathematical Morphology on Complete Lattices for Imperfect Information Processing Application to Image Understanding and Spatial Reasoning Mathematical Morphology on Complete Lattices for Imperfect Information Processing Application to Image Understanding and Spatial Reasoning Isabelle Bloch isabelle.bloch@telecom-paristech.fr April 2014

More information

Dynamical systems on weighted lattices: general theory

Dynamical systems on weighted lattices: general theory Math. Control Signals Syst. (2017) 29:21 https://doi.org/10.1007/s00498-017-0207-8 ORIGINAL ARTICLE Dynamical systems on weighted lattices: general theory Petros Maragos 1 Received: 31 July 2016 / Accepted:

More information

The Frequency Domain. Many slides borrowed from Steve Seitz

The Frequency Domain. Many slides borrowed from Steve Seitz The Frequency Domain Many slides borrowed from Steve Seitz Somewhere in Cinque Terre, May 2005 15-463: Computational Photography Alexei Efros, CMU, Spring 2010 Salvador Dali Gala Contemplating the Mediterranean

More information

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution

More information

Analogs of Hodge Riemann relations

Analogs of Hodge Riemann relations Analogs of Hodge Riemann relations in algebraic geometry, convex geometry and linear algebra V. Timorin State University of New York at Stony Brook March 28, 2006 Hodge Riemann form Let X be a compact

More information

CHARACTERIZATION OF LINEAR AND MORPHOLOGICAL OPERATORS. Gerald Jean Francis Banon

CHARACTERIZATION OF LINEAR AND MORPHOLOGICAL OPERATORS. Gerald Jean Francis Banon OF LINAR AND MORPHOLOGICAL OPRATORS Gerald Jean Francis Banon Instituto Nacional de Pesquisas spaciais INP Divisão de Processamento de Imagens DPI CP 515 12 21 97, São José dos Campos, SP, Brazil São José

More information

Symmetry Preserving Numerical Methods via Moving Frames

Symmetry Preserving Numerical Methods via Moving Frames Symmetry Preserving Numerical Methods via Moving Frames Peter J. Olver University of Minnesota http://www.math.umn.edu/ olver = Pilwon Kim, Martin Welk Cambridge, June, 2007 Symmetry Preserving Numerical

More information

2018 Fall 2210Q Section 013 Midterm Exam I Solution

2018 Fall 2210Q Section 013 Midterm Exam I Solution 8 Fall Q Section 3 Midterm Exam I Solution True or False questions ( points = points) () An example of a linear combination of vectors v, v is the vector v. True. We can write v as v + v. () If two matrices

More information

1 Differentiable manifolds and smooth maps

1 Differentiable manifolds and smooth maps 1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set

More information

Why is Deep Learning so effective?

Why is Deep Learning so effective? Ma191b Winter 2017 Geometry of Neuroscience The unreasonable effectiveness of deep learning This lecture is based entirely on the paper: Reference: Henry W. Lin and Max Tegmark, Why does deep and cheap

More information

Foundation for Neutrosophic Mathematical Morphology

Foundation for Neutrosophic Mathematical Morphology EMAN.M.EL-NAKEEB 1, H. ELGHAWALBY 2, A.A.SALAMA 3, S.A.EL-HAFEEZ 4 1,2 Port Said University, Faculty of Engineering, Physics and Engineering Mathematics Department, Egypt. E-mails: emanmarzouk1991@gmail.com,

More information

Homework 1 Real Analysis

Homework 1 Real Analysis Homework 1 Real Analysis Joshua Ruiter March 23, 2018 Note on notation: When I use the symbol, it does not imply that the subset is proper. In writing A X, I mean only that a A = a X, leaving open the

More information

Course and Wavelets and Filter Banks

Course and Wavelets and Filter Banks Course 8.327 and.30 Wavelets and Filter Banks Multiresolution Analysis (MRA): Requirements for MRA; Nested Spaces and Complementary Spaces; Scaling Functions and Wavelets Scaling Functions and Wavelets

More information

Sections 8.1 & 8.2 Systems of Linear Equations in Two Variables

Sections 8.1 & 8.2 Systems of Linear Equations in Two Variables Sections 8.1 & 8.2 Systems of Linear Equations in Two Variables Department of Mathematics Porterville College September 7, 2014 Systems of Linear Equations in Two Variables Learning Objectives: Solve Systems

More information

Fourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California

Fourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California Fourier Analysis and Imaging Ronald Bracewell L.M. Terman Professor of Electrical Engineering Emeritus Stanford University Stanford, California 4u Springer Contents fa 1 PREFACE INTRODUCTION xiii 1 11

More information

Symmetry Groups conservation law quantum numbers Gauge symmetries local bosons mediate the interaction Group Abelian Product of Groups simple

Symmetry Groups conservation law quantum numbers Gauge symmetries local bosons mediate the interaction Group Abelian Product of Groups simple Symmetry Groups Symmetry plays an essential role in particle theory. If a theory is invariant under transformations by a symmetry group one obtains a conservation law and quantum numbers. For example,

More information

Higher representation theory in algebra and geometry: Lecture II

Higher representation theory in algebra and geometry: Lecture II Higher representation theory in algebra and geometry: Lecture II Ben Webster UVA ebruary 10, 2014 Ben Webster (UVA) HRT : Lecture II ebruary 10, 2014 1 / 35 References or this lecture, useful references

More information

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics

Spring Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics 1 / 17 L545 Spring 2013 Based on Partee, ter Meulen, & Wall (1993), Mathematical Methods in Linguistics 2 / 17 Why set theory? Set theory sets the foundation for much of mathematics For us: provides precise

More information

1. Projective geometry

1. Projective geometry 1. Projective geometry Homogeneous representation of points and lines in D space D projective space Points at infinity and the line at infinity Conics and dual conics Projective transformation Hierarchy

More information

V j+1 W j+1 Synthesis. ψ j. ω j. Ψ j. V j

V j+1 W j+1 Synthesis. ψ j. ω j. Ψ j. V j MORPHOLOGICAL PYRAMIDS AND WAVELETS BASED ON THE QUINCUNX LATTICE HENK J.A.M. HEIJMANS CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and JOHN GOUTSIAS Center for Imaging Science, Dept. of Electrical

More information

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors

Overview. Introduction to local features. Harris interest points + SSD, ZNCC, SIFT. Evaluation and comparison of different detectors Overview Introduction to local features Harris interest points + SSD, ZNCC, SIFT Scale & affine invariant interest point detectors Evaluation and comparison of different detectors Region descriptors and

More information

Binary Image Analysis

Binary Image Analysis Binary Image Analysis Binary image analysis consists of a set of image analysis operations that are used to produce or process binary images, usually images of 0 s and 1 s. 0 represents the background

More information

Designing Kernel Functions Using the Karhunen-Loève Expansion

Designing Kernel Functions Using the Karhunen-Loève Expansion July 7, 2004. Designing Kernel Functions Using the Karhunen-Loève Expansion 2 1 Fraunhofer FIRST, Germany Tokyo Institute of Technology, Japan 1,2 2 Masashi Sugiyama and Hidemitsu Ogawa Learning with Kernels

More information

Boolean Algebras, Boolean Rings and Stone s Representation Theorem

Boolean Algebras, Boolean Rings and Stone s Representation Theorem Boolean Algebras, Boolean Rings and Stone s Representation Theorem Hongtaek Jung December 27, 2017 Abstract This is a part of a supplementary note for a Logic and Set Theory course. The main goal is to

More information

2. Function spaces and approximation

2. Function spaces and approximation 2.1 2. Function spaces and approximation 2.1. The space of test functions. Notation and prerequisites are collected in Appendix A. Let Ω be an open subset of R n. The space C0 (Ω), consisting of the C

More information

Map automatic scale reduction by means of mathematical morphology

Map automatic scale reduction by means of mathematical morphology Map automatic scale reduction by means of mathematical morphology Luiz Alberto Vieira Dias 1 Júlio Cesar Lima d Alge 2 Fernando Augusto Mitsuo Ii 2 Sílvia Shizue Ii 2 National Institute for Space Research

More information

s P = f(ξ n )(x i x i 1 ). i=1

s P = f(ξ n )(x i x i 1 ). i=1 Compactness and total boundedness via nets The aim of this chapter is to define the notion of a net (generalized sequence) and to characterize compactness and total boundedness by this important topological

More information

Connected morphological operators for binary images

Connected morphological operators for binary images Centrum voor Wiskunde en Informatica Connected morphological operators for binary images H.J.A.M. Heijmans Probability, Networks and Algorithms (PNA) PNA-R9708 1997 Report PNA-R9708 ISSN 1386-3711 CWI

More information

Special Conformal Invariance

Special Conformal Invariance Chapter 6 Special Conformal Invariance Conformal transformation on the d-dimensional flat space-time manifold M is an invertible mapping of the space-time coordinate x x x the metric tensor invariant up

More information

History (Minimal Dynamics Theorem, Meeks-Perez-Ros 2005, CMC Dynamics Theorem, Meeks-Tinaglia 2008) Giuseppe Tinaglia

History (Minimal Dynamics Theorem, Meeks-Perez-Ros 2005, CMC Dynamics Theorem, Meeks-Tinaglia 2008) Giuseppe Tinaglia History (Minimal Dynamics Theorem, Meeks-Perez-Ros 2005, CMC Dynamics Theorem, Meeks-Tinaglia 2008) Briefly stated, these Dynamics Theorems deal with describing all of the periodic or repeated geometric

More information

Transformation of functions

Transformation of functions Transformation of functions Translations Dilations (from the x axis) Dilations (from the y axis) Reflections (in the x axis) Reflections (in the y axis) Summary Applying transformations Finding equations

More information

Systems of linear equations. We start with some linear algebra. Let K be a field. We consider a system of linear homogeneous equations over K,

Systems of linear equations. We start with some linear algebra. Let K be a field. We consider a system of linear homogeneous equations over K, Systems of linear equations We start with some linear algebra. Let K be a field. We consider a system of linear homogeneous equations over K, f 11 t 1 +... + f 1n t n = 0, f 21 t 1 +... + f 2n t n = 0,.

More information

Lecture 1. Toric Varieties: Basics

Lecture 1. Toric Varieties: Basics Lecture 1. Toric Varieties: Basics Taras Panov Lomonosov Moscow State University Summer School Current Developments in Geometry Novosibirsk, 27 August1 September 2018 Taras Panov (Moscow University) Lecture

More information

VCE. VCE Maths Methods 1 and 2 Pocket Study Guide

VCE. VCE Maths Methods 1 and 2 Pocket Study Guide VCE VCE Maths Methods 1 and 2 Pocket Study Guide Contents Introduction iv 1 Linear functions 1 2 Quadratic functions 10 3 Cubic functions 16 4 Advanced functions and relations 24 5 Probability and simulation

More information

Relational Algebra on Bags. Why Bags? Operations on Bags. Example: Bag Selection. σ A+B < 5 (R) = A B

Relational Algebra on Bags. Why Bags? Operations on Bags. Example: Bag Selection. σ A+B < 5 (R) = A B Relational Algebra on Bags Why Bags? 13 14 A bag (or multiset ) is like a set, but an element may appear more than once. Example: {1,2,1,3} is a bag. Example: {1,2,3} is also a bag that happens to be a

More information

Support weight enumerators and coset weight distributions of isodual codes

Support weight enumerators and coset weight distributions of isodual codes Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In

More information

Maxwell s equations in Carnot groups

Maxwell s equations in Carnot groups Maxwell s equations in Carnot groups B. Franchi (U. Bologna) INDAM Meeting on Geometric Control and sub-riemannian Geometry Cortona, May 21-25, 2012 in honor of Andrey Agrachev s 60th birthday Researches

More information

Linear Filters and Convolution. Ahmed Ashraf

Linear Filters and Convolution. Ahmed Ashraf Linear Filters and Convolution Ahmed Ashraf Linear Time(Shift) Invariant (LTI) Systems The Linear Filters that we are studying in the course belong to a class of systems known as Linear Time Invariant

More information

A mathematical morphology approach to cell shape analysis

A mathematical morphology approach to cell shape analysis Author manuscript, published in "Progress in Industrial Mathematics at ECMI 2006, part II, Luis L. Bonilla, Miguel Moscoso, Gloria Platero, and Jose M. Vega (Ed.) (2008) 543-547" DOI : 10.1007/978-3-540-71992-2_87

More information

Lattice Theory Lecture 5. Completions

Lattice Theory Lecture 5. Completions Lattice Theory Lecture 5 Completions John Harding New Mexico State University www.math.nmsu.edu/ JohnHarding.html jharding@nmsu.edu Toulouse, July 2017 Completions Definition A completion of a poset P

More information

Levelings, Image Simplification Filters for Segmentation

Levelings, Image Simplification Filters for Segmentation Journal of Mathematical Imaging and Vision 20: 59 72, 2004 c 2004 Kluwer Academic Publishers. Manufactured in The Netherlands. Levelings, Image Simplification Filters for Segmentation FERNAND MEYER Centre

More information

An Introduction to Geometric Algebra

An Introduction to Geometric Algebra An Introduction to Geometric Algebra Alan Bromborsky Army Research Lab (Retired) brombo@comcast.net November 2, 2005 Typeset by FoilTEX History Geometric algebra is the Clifford algebra of a finite dimensional

More information

On a class of pseudodifferential operators with mixed homogeneities

On a class of pseudodifferential operators with mixed homogeneities On a class of pseudodifferential operators with mixed homogeneities Po-Lam Yung University of Oxford July 25, 2014 Introduction Joint work with E. Stein (and an outgrowth of work of Nagel-Ricci-Stein-Wainger,

More information

Problem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set?

Problem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set? Assignment 4 Solutions Problem1: (Section 2.1 Exercise 9) (a.) List all the subsets of the set {a, b, c, d} which contain: (i.) four elements (ii.) three elements (iii.) two elements (iv.) one element

More information

Enumerative Geometry: from Classical to Modern

Enumerative Geometry: from Classical to Modern : from Classical to Modern February 28, 2008 Summary Classical enumerative geometry: examples Modern tools: Gromov-Witten invariants counts of holomorphic maps Insights from string theory: quantum cohomology:

More information

Contributions to the general theory of transformations

Contributions to the general theory of transformations Beiträge zur allgemeinen Transformationstheorie, Leipziger Berichte (895), Heft V, VI, submitted on --896, pp. 494-508. Presented at the session on 9-7-895; Gesammelte Abhandlungen, v. VI, art. III. Contributions

More information

A bitopological point-free approach to compactifications

A bitopological point-free approach to compactifications A bitopological point-free approach to compactifications Olaf Karl Klinke a, Achim Jung a, M. Andrew Moshier b a School of Computer Science University of Birmingham Birmingham, B15 2TT England b School

More information

The topological differences between the Mandelbrot set and the tricorn

The topological differences between the Mandelbrot set and the tricorn The topological differences between the Mandelbrot set and the tricorn Sabyasachi Mukherjee Jacobs University Bremen Warwick, November 2014 Basic definitions We consider the iteration of quadratic anti-polynomials

More information

446 SCIENCE IN CHINA (Series F) Vol. 46 introduced in refs. [6, ]. Based on this inequality, we add normalization condition, symmetric conditions and

446 SCIENCE IN CHINA (Series F) Vol. 46 introduced in refs. [6, ]. Based on this inequality, we add normalization condition, symmetric conditions and Vol. 46 No. 6 SCIENCE IN CHINA (Series F) December 003 Construction for a class of smooth wavelet tight frames PENG Lizhong (Λ Π) & WANG Haihui (Ξ ) LMAM, School of Mathematical Sciences, Peking University,

More information

A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC

A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC A FRAGMENT OF BOOLE S ALGEBRAIC LOGIC SUITABLE FOR TRADITIONAL SYLLOGISTIC LOGIC STANLEY BURRIS 1. Introduction Boole introduced his agebraic approach to logic in 1847 in an 82 page monograph, The Mathematical

More information

Linear Algebra Review Part I: Geometry

Linear Algebra Review Part I: Geometry Linear Algebra Review Part I: Geometry Edwin Olson University of Michigan The Three-Day Plan Geometry of Linear Algebra Vectors, matrices, basic operations, lines, planes, homogeneous coordinates, transformations

More information

1) 2) Algebra (3-2) Solving Inequalities with Additon and Subtraction

1) 2) Algebra (3-2) Solving Inequalities with Additon and Subtraction Algebra (3-2) Solving Inequalities with Additon and Subtraction N# The Equality Properties of Addition and Subtraction also apply to INEQUALITIES. If you or the same value to each side of an inequality,

More information

Inf-Semilattice Approach to Self-DualMorph ology

Inf-Semilattice Approach to Self-DualMorph ology Inf-Semilattice Approach to Self-DualMorph ology Henk J.A.M. H eijmans, Renato Keshet HP Laboratories Israel HPL-2-13 August 2 nd, 2* E-mail: renato@h pli.h pl.h p.com Self-dual filtering, mathematical

More information

Morphological Scale-Space Representation with Levelings

Morphological Scale-Space Representation with Levelings Morphological Scale-Space Representation with Levelings Fernand Meyer 1 and Petros Maragos 2 1 Centre de Morphologie Mathématique, Ecole des Mines de Paris, 35, Rue Saint Honoré, 77305 Fontainebleau, France.

More information

Tamagawa Numbers in the Function Field Case (Lecture 2)

Tamagawa Numbers in the Function Field Case (Lecture 2) Tamagawa Numbers in the Function Field Case (Lecture 2) February 5, 204 In the previous lecture, we defined the Tamagawa measure associated to a connected semisimple algebraic group G over the field Q

More information

MASTERCLASS MARCH 2013 BY Ben Elias, MIT, Boston and Geordie Williamson, MPI, Bonn Titel: Soergel bimodules & Kazhdan-Lusztig conjectures

MASTERCLASS MARCH 2013 BY Ben Elias, MIT, Boston and Geordie Williamson, MPI, Bonn Titel: Soergel bimodules & Kazhdan-Lusztig conjectures Venue: aud. G1 Monday 18 March, The Cast 10.00-10.45 Introduction: Category O and the Kazhdan-Lusztig conjectures The happenings of 1979. The miracle of KL polynomials. Arbitrary Coxeter groups. The miracle

More information