Morphological Operations. GV12/3072 Image Processing.

Size: px
Start display at page:

Download "Morphological Operations. GV12/3072 Image Processing."

Transcription

1 Morphological Operations 1

2 Outline Basic concepts: Erode and dilate Open and close. Granulometry Hit and miss transform Thinning and thickening Skeletonization and the medial axis transform Introduction to gray level morphology. 2

3 What Are Morphological Operators? Local pixel transformations for processing region shapes Most often used on binary images Logical transformations based on comparison of pixel neighbourhoods with a pattern. 3

4 Simple Operations - Examples Eight-neighbour erode a.k.a. Minkowsky subtraction Erase any foreground pixel that has one eight-connected neighbour that is background. 4

5 8-neighbour erode Threshold Erode 1 Erode 2 Erode 5 5

6 8-neighbour dilate Eight-neighbour dilate a.k.a. Minkowsky addition Paint any background pixel that has one eight-connected neighbour that is foreground. 6

7 8-neighbour dilate Dilate 1 Dilate 2 Dilate 5 7

8 Why? Smooth region boundaries for shape analysis. Remove noise and artefacts from an imperfect segmentation. Match particular pixel configurations in an image for simple object recognition. 8

9 Structuring Elements Morphological operations take two arguments: A binary image A structuring element. Compare the structuring element to the neighbourhood of each pixel. This determines the output of the morphological operation. 9

10 Structuring elements The structuring element is also a binary array. A structuring element has an origin

11 Binary images as sets We can think of the binary image and the structuring element as sets containing the pixels with value I = {(1,1), (2,1), (3,1), (2,2), (3,2), (4,4)} 11

12 Some sets notation Union and intersection: I I 1 1 I I 2 2 x : x : Complement I C x : x x I x I I 1 1 or x I 2 and x I 2 Difference I 1 2 \ I x : xi and xi We use for the empty set

13 More sets notation The symmetrical set of S with respect to point o is S o x : x S

14 Fitting, Hitting and Missing S fits I at x if { y : y x s, ss} I S hits I at x if { y : y x s, ss} I S misses I at x if { y : y x s, ss} I 14

15 Fitting, Hitting and Missing Image Structuring element

16 Erosion The image E = I S is the erosion of image I by structuring element S. E( x) 1 0 if S fits I at otherwise x E x : x si for every ss 16

17 Implementation (naïve) % I is the input image, S is a structuring element % with origin (ox, oy). E is the output image. function E = erode(i, S, ox, oy) [X,Y] = size(i); [SX, SY] = size(s); E = ones(x, Y); for x=1:x; for y=1:y for i=1:sx; for j=1:sy if(s(i,j)) E(x,y) = E(x,y) & ImageEntry(I, x+i-ox, y+j-oy); end end; end end; end 17

18 Example Structuring element

19 Example Structuring element

20 Example Structuring element

21 Dilation The image D = I S is the dilation of image I by structuring element S. D( x) 1 0 if S hits I at otherwise x D x: x s, yi and s S 21

22 Example Structuring element

23 Example Structuring element

24 Example Structuring element

25 26 Erosion and dilation Erosion and dilation are dual operations: Commutativity and associativity S I S I C C ) ( I S S I I S S I ) ( ) ( ) ( ) ( T S I T S I T S I T S I

26 Opening and Closing The opening of I by S is I S ( I S) S The closing of I by S is I S ( I S) S 27

27 Opening and Closing Opening and closing are dual transformations: ( I S) C I C S Opening and closing are idempotent operations: I S I S ( I S) S ( I S) S 28

28 Example close open Structuring element

29 Example close open Structuring element

30 Example close open Structuring element

31 Morphological filtering To remove holes in the foreground and islands in the background, do both opening and closing. The size and shape of the structuring element determine which features survive. In the absence of knowledge about the shape of features to remove, use a circular structuring element. 32

32 Example Close then open Structuring element Open then close

33 Example Close then open Structuring element Open then close

34 Example Close then open Structuring element Open then close

35 Count the Red Blood Cells 36

36 Granulometry Provides a size distribution of distinct regions or granules in the image. We open the image with increasing structuring element size and count the number of regions after each operation. Creates a morphological sieve. 37

37 Granulometry function gspec = granulo(i, T, maxrad) % Segment the image I B = (I>T); % Open the image at each structuring element size up to a % maximum and count the remaining regions. for x=1:maxrad O = imopen(b,strel( disk,x)); numregions(x) = max(max(connectedcomponents(o))); end gspec = diff(numregions); 38

38 Count the Red Blood Cells 39

39 Threshold and Label 40

40 Disc(11) 41

41 Disc(19) 42

42 Disc(59) 43

43 Number of regions Number of Regions Struct. Elt. radius 44

44 Number of regions Granulometric Pattern Spectrum Struct. Elt. radius 45

45 Hit-and-miss transform Searches for an exact match of the structuring element. H = I S is the hit-and-miss transform of image I by structuring element S. Simple form of template matching. 46

46 Hit-and-miss transform = = *

47 Upper-Right Corner Detector 48

48 Thinning and Thickening Defined in terms of the hit-and-miss transform: The thinning of I by S is I S I \ ( I S) The thickening of I by S is I S I ( I S) Dual operations: C ( I S) I C S 49

49 Sequential Thinning/Thickening These operations are often performed in sequence with a selection of structuring elements S 1, S 2,, S n. Sequential thinning: I S i 1,..., n ((( I S ) S )... S ) i : 1 2 n Sequential thickening: I S i 1,..., n ((( I S ) S )... S ) i : 1 2 n 50

50 Sequential Thinning/Thickening Several sequences of structuring elements are useful in practice These are usually the set of rotations of a single structuring element. Sometimes called the Golay alphabet. 51

51 Golay element L * * 0 * 1 * L 1 * 1 * L L L * 1 * 1 * 0 * * 1 * 0 * * L 5 * 1 * L L L * 0 * 1 * 1 * 52

52 Sequential Thinning See bwmorph in matlab. 0 iterations 1 iteration 2 iterations 5 iterations Inf iterations 53

53 Sequential Thickening 1 iteration 5 iterations 2 iterations Inf iterations 54

54 Skeletonization and the Medial Axis Transform The skeleton and medial axis transform (MAT) are stick-figure representations of a region X 2. Start a grassfire at the boundary of the region. The skeleton is the set of points at which two fire fronts meet. 55

55 Skeletons 56

56 Medial axis transform Alternative skeleton definition: The skeleton is the union of centres of maximal discs within X. A maximal disc is a circular subset of X that touches the boundary in at least two places. The MAT is the skeleton with the maximal disc radius retained at each point. 57

57 Medial axis transform 58

58 Skeletonization using morphology Use structuring element B = The n-th skeleton subset is S n ( X ) ( X n B) \ The skeleton is the union of all the skeleton subsets: ( X n B) B n denotes n successive erosions. S( X ) n1 S n ( X ) 59

59 Reconstruction We can reconstruct region X from its skeleton subsets: X n0 S n ( X ) n B We can reconstruct X from the MAT. We cannot reconstruct X from S(X). 61

60 DiFi: Fast 3D Distance Field Computation Using Graphics Hardware Sud, Otaduy, Manocha, Eurographics

61 MAT in 3D from Transcendata Europe Medial Object Price, Stops, Butlin Transcendata Europe Ltd 63

62 Applications and Problems The skeleton/mat provides a stick figure representing the region shape Used in object recognition, in particular, character recognition. Problems: Definition of a maximal disc is poorly defined on a digital grid. Sensitive to noise on the boundary. Sequential thinning output sometimes preferred to skeleton/mat. 64

63 Example Skeletons: Thinned: 65

64 Gray-level Morphology Erosion, dilation Opening and closing The image and the structuring element are gray level arrays. Used to remove speckle noise. Also for smoothing, edge detection and segmentation. 66

65 Umbra U( f ) ( x, y): y f ( x) f U ( f ) 67

66 Top surface T( R) ( x, y) : y z for all( x, z) R R T(R) 68

67 Gray level erode and dilate Erosion: f k T( U( f ) U( k)) Dilation: f k T( U( f ) U( k)) Open and close defined as before. 69

68 f U ( f ) k U(k) U( f ) U( k) T( U( f ) U( k)) 70

69 Erosion S=ones(3,3) S=ones(5,5) S=ones(7,7) 72

70 Dilation S=ones(3,3) S=ones(5,5) S=ones(7,7) 73

71 Speckle removal Erode Open Salt and pepper noise Close Dilate 74

72 Favorites E = medfilt2() [D,L] = bwdist() 75

73 Summary Simple morphological operations Erode and dilate Open and close Applications: Granulometry Thinning and thickening Skeletons and the medial axis transform Gray level morphology 76

74 77

75 Find the Letter e 78

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

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

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

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

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

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

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

(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

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

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

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

Digital Image Processing COSC 6380/4393

Digital Image Processing COSC 6380/4393 Digital Image Processing COSC 6380/4393 Lecture 7 Sept 11 th, 2018 Pranav Mantini Slides from Dr. Shishir K Shah and Frank (Qingzhong) Liu Today Review Binary Image Processing Opening and Closing Skeletonization

More information

repetition, part ii Ole-Johan Skrede INF Digital Image Processing

repetition, part ii Ole-Johan Skrede INF Digital Image Processing repetition, part ii Ole-Johan Skrede 24.05.2017 INF2310 - Digital Image Processing Department of Informatics The Faculty of Mathematics and Natural Sciences University of Oslo today s lecture Coding and

More information

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

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

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

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

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

Differential Attribute Profiles in Remote Sensing

Differential Attribute Profiles in Remote Sensing Differential Attribute Profiles in Remote Sensing Georgios K. Ouzounis DigitalGlobe, Inc. 1601 Dry Creek Drive, Suite 260, Longmont, CO 80503, USA. Image: Dubai July 5, 2011 50cm Contents Overview Connected

More information

Bayes Theorem. Jan Kracík. Department of Applied Mathematics FEECS, VŠB - TU Ostrava

Bayes Theorem. Jan Kracík. Department of Applied Mathematics FEECS, VŠB - TU Ostrava Jan Kracík Department of Applied Mathematics FEECS, VŠB - TU Ostrava Introduction Bayes theorem fundamental theorem in probability theory named after reverend Thomas Bayes (1701 1761) discovered in Bayes

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

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

BOOLEAN ALGEBRA INTRODUCTION SUBSETS BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations

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

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Last Lecture : Edge Detection Preprocessing of image is desired to eliminate or at least minimize noise effects There is always tradeoff

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

Lecture 8: Interest Point Detection. Saad J Bedros

Lecture 8: Interest Point Detection. Saad J Bedros #1 Lecture 8: Interest Point Detection Saad J Bedros sbedros@umn.edu Review of Edge Detectors #2 Today s Lecture Interest Points Detection What do we mean with Interest Point Detection in an Image Goal:

More information

Pseudorandom Coding Techniques for Position Measurement

Pseudorandom Coding Techniques for Position Measurement Pseudorandom Coding Techniques for Position Measurement Emil M. Petriu, Dr. Eng., FIEEE School of Electrical Engineering and Computer Science University of Ottawa, Canada http://www.site.uottawa.ca/~petriu

More information

Representing regions in 2 ways:

Representing regions in 2 ways: Representing regions in 2 ways: Based on their external characteristics (its boundary): Shape characteristics Based on their internal characteristics (its region): Both Regional properties: color, texture,

More information

Image Enhancement: Methods. Digital Image Processing. No Explicit definition. Spatial Domain: Frequency Domain:

Image Enhancement: Methods. Digital Image Processing. No Explicit definition. Spatial Domain: Frequency Domain: Image Enhancement: No Explicit definition Methods Spatial Domain: Linear Nonlinear Frequency Domain: Linear Nonlinear 1 Spatial Domain Process,, g x y T f x y 2 For 1 1 neighborhood: Contrast Enhancement/Stretching/Point

More information

IJSRD - International Journal for Scientific Research & Development Vol. 4, Issue 05, 2016 ISSN (online):

IJSRD - International Journal for Scientific Research & Development Vol. 4, Issue 05, 2016 ISSN (online): IJSRD - International Journal for Scientific Research & Development Vol. 4, Issue 05, 2016 ISSN (online): 2321-0613 Identification and Automatic Counting of Stomata through Epidermis Microscopic Images

More information

Laplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters

Laplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters Sobel Filters Note that smoothing the image before applying a Sobel filter typically gives better results. Even thresholding the Sobel filtered image cannot usually create precise, i.e., -pixel wide, edges.

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

Region Description for Recognition

Region Description for Recognition Region Description for Recognition For object recognition, descriptions of regions in an image have to be compared with descriptions of regions of meaningful objects (models). The general problem of object

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

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

Problem Session #5. EE368/CS232 Digital Image Processing

Problem Session #5. EE368/CS232 Digital Image Processing Problem Session #5 EE368/CS232 Digital Image Processing 1. Solving a Jigsaw Puzzle Please download the image hw5_puzzle_pieces.jpg from the handouts webpage, which shows the pieces of a jigsaw puzzle.

More information

MATH 118 FINAL EXAM STUDY GUIDE

MATH 118 FINAL EXAM STUDY GUIDE MATH 118 FINAL EXAM STUDY GUIDE Recommendations: 1. Take the Final Practice Exam and take note of questions 2. Use this study guide as you take the tests and cross off what you know well 3. Take the Practice

More information

Edge Detection PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2005

Edge Detection PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2005 Edge Detection PSY 5018H: Math Models Hum Behavior, Prof. Paul Schrater, Spring 2005 Gradients and edges Points of sharp change in an image are interesting: change in reflectance change in object change

More information

MORPHOLOGICAL IMAGE ANALYSIS III

MORPHOLOGICAL IMAGE ANALYSIS III MORPHOLOGICAL IMAGE ANALYSIS III Secondary inary Morphological Operators A set operator Ψ( ) which is: Increasing; i.e., Ψ( ) Ψ( ) Anti-extensive; i.e., Ψ( ) 1 2 1 2 Idempotent; i.e., ΨΨ ( ( )) = Ψ( )

More information

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary An Algebra on Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing Spring, 2018 Alice E. Fischer... 1/37 An Algebra on 1 Definitions and Notation Venn Diagrams 2 An Algebra on 3 Alice E. Fischer...

More information

Local Enhancement. Local enhancement

Local Enhancement. Local enhancement Local Enhancement Local Enhancement Median filtering (see notes/slides, 3.5.2) HW4 due next Wednesday Required Reading: Sections 3.3, 3.4, 3.5, 3.6, 3.7 Local Enhancement 1 Local enhancement Sometimes

More information

Automata, Logic and Games: Theory and Application

Automata, Logic and Games: Theory and Application Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June

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

Reading. 3. Image processing. Pixel movement. Image processing Y R I G Q

Reading. 3. Image processing. Pixel movement. Image processing Y R I G Q Reading Jain, Kasturi, Schunck, Machine Vision. McGraw-Hill, 1995. Sections 4.-4.4, 4.5(intro), 4.5.5, 4.5.6, 5.1-5.4. 3. Image processing 1 Image processing An image processing operation typically defines

More information

CS:4330 Theory of Computation Spring Regular Languages. Finite Automata and Regular Expressions. Haniel Barbosa

CS:4330 Theory of Computation Spring Regular Languages. Finite Automata and Regular Expressions. Haniel Barbosa CS:4330 Theory of Computation Spring 2018 Regular Languages Finite Automata and Regular Expressions Haniel Barbosa Readings for this lecture Chapter 1 of [Sipser 1996], 3rd edition. Sections 1.1 and 1.3.

More information

Image Processing 1 (IP1) Bildverarbeitung 1

Image Processing 1 (IP1) Bildverarbeitung 1 MIN-Fakultät Fachbereich Informatik Arbeitsbereich SAV/BV (KOGS) Image Processing 1 (IP1) Bildverarbeitung 1 Lecture 14 Skeletonization and Matching Winter Semester 2015/16 Slides: Prof. Bernd Neumann

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

Blobs & Scale Invariance

Blobs & Scale Invariance Blobs & Scale Invariance Prof. Didier Stricker Doz. Gabriele Bleser Computer Vision: Object and People Tracking With slides from Bebis, S. Lazebnik & S. Seitz, D. Lowe, A. Efros 1 Apertizer: some videos

More information

Multivalued functions in digital topology

Multivalued functions in digital topology Note di Matematica ISSN 1123-2536, e-issn 1590-0932 Note Mat. 37 (2017) no. 2, 61 76. doi:10.1285/i15900932v37n2p61 Multivalued functions in digital topology Laurence Boxer Department of Computer and Information

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

Digital Systems and Information Part II

Digital Systems and Information Part II Digital Systems and Information Part II Overview Arithmetic Operations General Remarks Unsigned and Signed Binary Operations Number representation using Decimal Codes BCD code and Seven-Segment Code Text

More information

Lecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008

Lecture 6: Edge Detection. CAP 5415: Computer Vision Fall 2008 Lecture 6: Edge Detection CAP 5415: Computer Vision Fall 2008 Announcements PS 2 is available Please read it by Thursday During Thursday lecture, I will be going over it in some detail Monday - Computer

More information

A multivariate Hit-or-Miss Transform for conjoint spatial and spectral template matching

A multivariate Hit-or-Miss Transform for conjoint spatial and spectral template matching for conjoint spatial and spectral template matching LSIIT, CNRS / University Louis Pasteur - Strasbourg I July 2, 2008 Spatial template-matching = Binary/Grayscale Hit-or-Miss Transform (HMT) Spectral

More information

Stats Probability Theory

Stats Probability Theory Stats 241.3 Probability Theory Instructor: Office: W.H.Laverty 235 McLean Hall Phone: 966-6096 Lectures: Evaluation: M T W Th F 1:30pm - 2:50pm Thorv 105 Lab: T W Th 3:00-3:50 Thorv 105 Assignments, Labs,

More information

Edge Detection. Computer Vision P. Schrater Spring 2003

Edge Detection. Computer Vision P. Schrater Spring 2003 Edge Detection Computer Vision P. Schrater Spring 2003 Simplest Model: (Canny) Edge(x) = a U(x) + n(x) U(x)? x=0 Convolve image with U and find points with high magnitude. Choose value by comparing with

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

Document Image Analysis with Leptonica

Document Image Analysis with Leptonica Document Image Analysis with Leptonica Phototech EDU, 4 April 07 Dan Bloomberg bloomberg@ieee.org Document Image Analysis with Leptonica Dan Bloomberg, April 4, 2007 - p. 1/52 Introduction Image analysis

More information

3. Abstract Boolean Algebras

3. Abstract Boolean Algebras 3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,

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

Boolean Algebra CHAPTER 15

Boolean Algebra CHAPTER 15 CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an

More information

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering Boolean Algebra Boolean Algebra A Boolean algebra is defined with: A set of

More information

ECE 661: Homework 10 Fall 2014

ECE 661: Homework 10 Fall 2014 ECE 661: Homework 10 Fall 2014 This homework consists of the following two parts: (1) Face recognition with PCA and LDA for dimensionality reduction and the nearest-neighborhood rule for classification;

More information

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and

More information

CSCI 150 Discrete Mathematics Homework 5 Solution

CSCI 150 Discrete Mathematics Homework 5 Solution CSCI 150 Discrete Mathematics Homework 5 Solution Saad Mneimneh Computer Science Hunter College of CUNY Problem 1: Happy Birthday (if it applies to you)! Based on the size of the class, there is approximately

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

MAT 271E Probability and Statistics

MAT 271E Probability and Statistics MAT 7E Probability and Statistics Spring 6 Instructor : Class Meets : Office Hours : Textbook : İlker Bayram EEB 3 ibayram@itu.edu.tr 3.3 6.3, Wednesday EEB 6.., Monday D. B. Bertsekas, J. N. Tsitsiklis,

More information

Pulse characterization with Wavelet transforms combined with classification using binary arrays

Pulse characterization with Wavelet transforms combined with classification using binary arrays Pulse characterization with Wavelet transforms combined with classification using binary arrays Overview Wavelet Transformation Creating binary arrays out of and how to deal with them An estimator for

More information

Logic and Boolean algebra

Logic and Boolean algebra Computer Mathematics Week 7 Logic and Boolean algebra College of Information Science and Engineering Ritsumeikan University last week coding theory channel coding information theory concept Hamming distance

More information

Integrated Math II Performance Level Descriptors

Integrated Math II Performance Level Descriptors Limited Integrated Math II Performance Level Descriptors A student performing at the Limited Level demonstrates a minimal command of Ohio s Learning Standards for Integrated Math II. A student at this

More information

CSCI 250: Intro to Robotics. Spring Term 2017 Prof. Levy. Computer Vision: A Brief Survey

CSCI 250: Intro to Robotics. Spring Term 2017 Prof. Levy. Computer Vision: A Brief Survey CSCI 25: Intro to Robotics Spring Term 27 Prof. Levy Computer Vision: A Brief Survey What Is Computer Vision? Higher-order tasks Face recognition Object recognition (Deep Learning) What Is Computer Vision?

More information

Prediction by conditional simulation

Prediction by conditional simulation Prediction by conditional simulation C. Lantuéjoul MinesParisTech christian.lantuejoul@mines-paristech.fr Introductive example Problem: A submarine cable has to be laid on the see floor between points

More information

Lecture 2 Review on Digital Logic (Part 1)

Lecture 2 Review on Digital Logic (Part 1) Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%

More information

2016 Canadian Senior Mathematics Contest

2016 Canadian Senior Mathematics Contest The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca 2016 Canadian Senior Mathematics Contest Wednesday, November 23, 2016 (in North America and South America) Thursday, November 24,

More information

CONDITIONAL MORPHOLOGY FOR IMAGE RESTORATION

CONDITIONAL MORPHOLOGY FOR IMAGE RESTORATION CONDTONAL MORPHOLOGY FOR MAGE RESTORATON C.S. Regauoni, E. Stringa, C. Valpreda Department of Biophysical and Electronic Engineering University of Genoa - Via all opera Pia 11 A, Genova taly 16 145 ABSTRACT

More information

OSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE

OSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE OSCILLATION OF THE MEASUREMENT ACCURACY OF THE CENTER LOCATION OF AN ELLIPSE ON A DIGITAL IMAGE R. Matsuoka a, b a Research and Development Division, Kokusai Kogyo Co., Ltd., -4-1 Harumi-cho, Fuchu, Tokyo

More information

2005 Pascal Contest (Grade 9)

2005 Pascal Contest (Grade 9) Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario 005 Pascal Contest (Grade 9) Wednesday, February 3, 005

More information

Lecture 3: Linear Filters

Lecture 3: Linear Filters Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)

More information

Master of Intelligent Systems - French-Czech Double Diploma. Hough transform

Master of Intelligent Systems - French-Czech Double Diploma. Hough transform Hough transform I- Introduction The Hough transform is used to isolate features of a particular shape within an image. Because it requires that the desired features be specified in some parametric form,

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

Operations on Sets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, 2012

Operations on Sets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, 2012 on Sets Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) on Sets Gazihan Alankuş (Based on original slides

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

Statistical Inference

Statistical Inference Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory

More information

CHAPTER 2 BOOLEAN ALGEBRA

CHAPTER 2 BOOLEAN ALGEBRA CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,

More information

Theory of Computation

Theory of Computation Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation / Lecture 3: Overview Decidability of Logical Theories Presburger arithmetic Decidability of Presburger Arithmetic Dr.

More information

Lesson 04. KAZE, Non-linear diffusion filtering, ORB, MSER. Ing. Marek Hrúz, Ph.D.

Lesson 04. KAZE, Non-linear diffusion filtering, ORB, MSER. Ing. Marek Hrúz, Ph.D. Lesson 04 KAZE, Non-linear diffusion filtering, ORB, MSER Ing. Marek Hrúz, Ph.D. Katedra Kybernetiky Fakulta aplikovaných věd Západočeská univerzita v Plzni Lesson 04 KAZE ORB: an efficient alternative

More information

Boolean Algebra, Gates and Circuits

Boolean Algebra, Gates and Circuits Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von

More information

Unit 1 Day 1. Set Operations & Venn Diagrams

Unit 1 Day 1. Set Operations & Venn Diagrams Unit 1 Day 1 Set Operations & Venn Diagrams Honors ICM Get out your signed syllabus form Get out paper and a pencil for notes! Has everyone accessed the website? Math Riddles Mr. Smith has 4 daughters.

More information

Lecture 3: Linear Filters

Lecture 3: Linear Filters Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)

More information

Combining Like Terms in Polynomials

Combining Like Terms in Polynomials Section 1 6: Combining Like Terms in Polynomials Polynomials A polynomial is an expression that has two or more terms each separated by a + or sign. If the expression has only one term it is called a monomial.

More information

Scale Space Smoothing, Image Feature Extraction and Bessel Filters

Scale Space Smoothing, Image Feature Extraction and Bessel Filters Scale Space Smoothing, Image Feature Extraction and Bessel Filters Sasan Mahmoodi and Steve Gunn School of Electronics and Computer Science, Building 1, Southampton University, Southampton, SO17 1BJ, UK

More information

Finite State Transducers

Finite State Transducers Finite State Transducers Eric Gribkoff May 29, 2013 Original Slides by Thomas Hanneforth (Universitat Potsdam) Outline 1 Definition of Finite State Transducer 2 Examples of FSTs 3 Definition of Regular

More information

Flux Invariants for Shape

Flux Invariants for Shape Flux Invariants for Shape avel Dimitrov James N. Damon Kaleem Siddiqi School of Computer Science Department of Mathematics McGill University University of North Carolina, Chapel Hill Montreal, Canada Chapel

More information

What is Image Deblurring?

What is Image Deblurring? What is Image Deblurring? When we use a camera, we want the recorded image to be a faithful representation of the scene that we see but every image is more or less blurry, depending on the circumstances.

More information

Image Segmentation: Definition Importance. Digital Image Processing, 2nd ed. Chapter 10 Image Segmentation.

Image Segmentation: Definition Importance. Digital Image Processing, 2nd ed. Chapter 10 Image Segmentation. : Definition Importance Detection of Discontinuities: 9 R = wi z i= 1 i Point Detection: 1. A Mask 2. Thresholding R T Line Detection: A Suitable Mask in desired direction Thresholding Line i : R R, j

More information

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings.

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and

More information

Foundations of Mathematics

Foundations of Mathematics Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object

More information

Today s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions

Today s Topics. Methods of proof Relationships to logical equivalences. Important definitions Relationships to sets, relations Special functions Today s Topics Set identities Methods of proof Relationships to logical equivalences Functions Important definitions Relationships to sets, relations Special functions Set identities help us manipulate

More information

Introductory Mathematics

Introductory Mathematics Introductory Mathematics 1998 2003 1.01 Identify subsets of the real number system. 1.02 Estimate and compute with rational Grade 7: 1.02 numbers. 1.03 Compare, order, and convert among Grade 6: 1.03 fractions,

More information

Computational Photography

Computational Photography Computational Photography Si Lu Spring 208 http://web.cecs.pdx.edu/~lusi/cs50/cs50_computati onal_photography.htm 04/0/208 Last Time o Digital Camera History of Camera Controlling Camera o Photography

More information