Elaborazione delle Immagini Informazione multimediale - Immagini. Raffaella Lanzarotti

Similar documents
Mathematical Morphology and Distance Transforms. Robin Strand

Introduction. Computer Vision & Digital Image Processing. Preview. Basic Concepts from Set Theory

Morphological Image Processing

Morphological Image Processing

Morphological Image Processing

Morphological Image Processing

Biomedical Image Analysis. Mathematical Morphology

Morphological Image Processing

What will we learn? What is mathematical morphology? What is mathematical morphology? Fundamental concepts and operations

Topic 6 Representation and Description

Image Analysis. Morphological Image Analysis

C E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S. Image Operations II

Finger Print Analysis and Matching Daniel Novák

Morphological track 1

Lecture 7: Morphological Image Processing

11/10/2011 small set, B, to probe the image under study for each SE, define origo & pixels in SE

09/11/2017. Morphological image processing. Morphological image processing. Morphological image processing. Morphological image processing (binary)

EECS490: Digital Image Processing. Lecture #17

Filters. Advanced and Special Topics: Filters. Filters

EE 584 MACHINE VISION

Topological structure of images

Morphological Image Processing

Digital Image Processing Fundamentals

Binary Shape Characterization using Morphological Boundary Class Distribution Functions

Bioimage Informatics

Elaborazione delle Immagini Informazione Multimediale. Raffaella Lanzarotti

Morphology-form and structure. Who am I? structuring element (SE) Today s lecture. Morphological Transformation. Mathematical Morphology

morphology on binary images

Morphological Image Processing

Morphological Image Algorithms

CoE4TN4 Image Processing

COMPUTER AND ROBOT VISION

ECEN 447 Digital Image Processing

Albert M. Vossepoel. Center for Image Processing

International Journal of Advance Engineering and Research Development. Applications of Set Theory in Digital Image Processing

EE795: Computer Vision and Intelligent Systems

Chapter 11 Representation & Description

Introduction to Medical Imaging (5XSA0)

From Pixels to Blobs

Processing of binary images

Chapter 9 Morphological Image Processing

Lecture: Segmentation I FMAN30: Medical Image Analysis. Anders Heyden

Chapter IX : SKIZ and Watershed

Morphological Compound Operations-Opening and CLosing

[ ] Review. Edges and Binary Images. Edge detection. Derivative of Gaussian filter. Image gradient. Tuesday, Sept 16

Some material taken from: Yuri Boykov, Western Ontario

Mathematical morphology for grey-scale and hyperspectral images

Final Exam Schedule. Final exam has been scheduled. 12:30 pm 3:00 pm, May 7. Location: INNOVA It will cover all the topics discussed in class

11. Gray-Scale Morphology. Computer Engineering, i Sejong University. Dongil Han

Lecture 18 Representation and description I. 2. Boundary descriptors

Mathematical Morphology a non exhaustive overview. Adrien Bousseau

Chapter 3. Image Processing Methods. (c) 2008 Prof. Dr. Michael M. Richter, Universität Kaiserslautern

UNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences

Digital Image Processing Lecture 7. Segmentation and labeling of objects. Methods for segmentation. Labeling, 2 different algorithms

VC 10/11 T9 Region-Based Segmentation

Detection of Edges Using Mathematical Morphological Operators

Machine vision. Summary # 5: Morphological operations

SECTION 5 IMAGE PROCESSING 2

Digital image processing

Lecture 3: Basic Morphological Image Processing

Image Processing. Bilkent University. CS554 Computer Vision Pinar Duygulu

Robot vision review. Martin Jagersand

EECS490: Digital Image Processing. Lecture #20

Mathematical morphology in polar(-logarithmic) coordinates for the analysis of round-objects. Shape analysis and segmentation.

Approximation Algorithms for Geometric Intersection Graphs

EECS490: Digital Image Processing. Lecture #23

ECG782: Multidimensional Digital Signal Processing

ECG782: Multidimensional Digital Signal Processing

Binary Image Processing. Introduction to Computer Vision CSE 152 Lecture 5

Morphological Image Processing GUI using MATLAB

PPKE-ITK. Lecture

1. INTRODUCTION. AMS Subject Classification. 68U10 Image Processing

Image segmentation. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

Character Recognition of High Security Number Plates Using Morphological Operator

Extraction of feature lines on triangulated surfaces using morphological operators

Development of an Automated Fingerprint Verification System

Robust and Efficient Skeletal Graphs

Edge Detection Using Morphological Method and Corner Detection Using Chain Code Algorithm

Divided-and-Conquer for Voronoi Diagrams Revisited. Supervisor: Ben Galehouse Presenter: Xiaoqi Cao

Boundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking

Lecture 6: Multimedia Information Retrieval Dr. Jian Zhang

Image Processing (IP) Through Erosion and Dilation Methods

Research Article Image Segmentation Using Gray-Scale Morphology and Marker-Controlled Watershed Transformation

Erosion, dilation and related operators

Edges and Binary Images

Digital Image Processing Chapter 11: Image Description and Representation

Babu Madhav Institute of Information Technology Years Integrated M.Sc.(IT)(Semester - 7)

Edge and local feature detection - 2. Importance of edge detection in computer vision

Basic relations between pixels (Chapter 2)

A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING

Comparative Study of ROI Extraction of Palmprint

Keywords: Thresholding, Morphological operations, Image filtering, Adaptive histogram equalization, Ceramic tile.

Partition definition. Partition coding. Texture coding

( x 1) 2 + ( y 3) 2 = 25

Laboratory of Applied Robotics

CHAPTER-4 LOCALIZATION AND CONTOUR DETECTION OF OPTIC DISK

CS443: Digital Imaging and Multimedia Binary Image Analysis. Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University

Edge detection. Stefano Ferrari. Università degli Studi di Milano Elaborazione delle immagini (Image processing I)

RESEARCH ON OPTIMIZATION OF IMAGE USING SKELETONIZATION TECHNIQUE WITH ADVANCED ALGORITHM

IN5520 Digital Image Analysis. Two old exams. Practical information for any written exam Exam 4300/9305, Fritz Albregtsen

Transcription:

Elaborazione delle Immagini Informazione multimediale - Immagini Raffaella Lanzarotti

MATHEMATICAL MORPHOLOGY 2

Definitions Morphology: branch of biology studying shape and structure of plants and animals Matematical morphology: Technique to represent and describe region shape (e.g. boundary, skeleton, connected surface). Pre e post-processing (morphological filtering, thinning, pruning) 3

Morphological operators erosion and dilation are the basic operators in the mathematical morphology other operators can be defined combining erosion and dilation 4

Structural elements (S.E.) Def: (small) set of pixel in given positions, correlated by a point of application, called origin Elaborazione delle Immagini I 5

Erosion X B = {z (B) z X} X B = {z (B) z \ X c =?} 6

Erosion Set of all points z s.t. B translated in z is completely in X Effect: delete small regions and filaments Reduce systematically the region dimensions 7

Dilation X B = {z ( ˆB) z \ X 6=?} 8

Dilation Set of all z s.t. B(reflex) intersect with X in at least one element Effect: close small holes and small inlet Augment systematically the region dimensions 9

Example original image and its erosion with circular S.E. with radius 11, 15, 45 Elaborazione delle Immagini I 10

Opening A B =(A B) B = [{(B) z (B) z A} Effect: Contours more homogeneous delete filaments or small regions Maintain the region original dimensions 11

Closing A B =(A B) B = [{w (B) z \ A 6=?, 8w (B) z } Effect: Contours more homogeneous Delete small holes Join small regions together Maintain the region original dimensions 12

Hit-or-Miss Objective: find the position of specific shapes (e.g. D) Observation: it is necessary to define the «local background» (W-D) 13

Step of the Hit-or-Miss Erosion of A with the element D we are looking for: Result: elements of D 14

Steps of Hit-or-Miss Erosion of A C with the local background W-D Result: elements of D 15

Steps ofhit-or-miss Intersection between the two erosions find the elements = D C A( ) B = ( AΘ D) A Θ( W D) & $% #!" 16

Boundary extraction β ( A) = A ( AΘB) 17

Example (S.E. = B) 18

Fill in empty regions Given a set of points A 8-connected corresponding to the boundary of a close region given a point p within this region We determine all the points within the region: X k =(X k 1 B) \ A c, k =1, 2, 3,... where X0=p Stop when Xk=Xk-1 19

Fill in empty regions X k =(X k 1 B) \ A c, k =1, 2, 3,... The region is the union between A and the last X k 20

Example Sv: it requires to know the seed position p 21

Skeleton Why: images of objects with linea structure complex shapes and ramifications for the shape representations use the skeleton 22

MAT: Median Axis Transformation Explanation via MAT: Think to set fire to a field (simultaneously from all the boundary points ) Boundary rectangular boundary fire line filre line median axis of the skeleton median axis of the skeleton In case of rectangular fields, we have points reached by the fire line simultaneously horizontally and vertically, and placed at the minima equidistance from at least two boundary points The set of points with this characteristic constitute the median axis of the skeleton 23

More precisely A point p of an object belong to the median axis ( skeleton ) if, called d the minimum distance between p and the figure boundary, they exist at least two points in the boundary placed at distance d from p. The MAT is defined is defined in the points belonging to the median axis, and tis value is given by the minimum distance from the point to the boundary. 24

Examples 25

Computing the MAT measure of the distance d(p,c) of each point P from the boundary points C. The distances d are local maxima (skeleton) if d(p,c) d(q,c) for each pixel Q in the neighborhood of P. The distance value is computed working on a window 3 3. Positioning the window in each pixel of the binary image of the image f(p). The distance g(p) of the central pixel is worked out adding to the value of the current pixel f(p) the minimum value of its four neighbors (sono i pixel Nord, Sud, Est, Ovest) g 0 (i,j) = f(i,j) g k (i,j) = g 0 (i,j)+min[g k-1 (u,v)] k=1,2... Elaborazione delle Immagini I 26

Example DT: distance from the boundary, Skeleton: points with local maximal distance; MAT: values of DT in such points 27

Example 28

Example NB: detect noise/blemish: 29

morphological skeleton 30

morphological skeleton Skeleton of A S(A): points z s.t. If z is in S(A) and (D) z is the largest disk centered on z and contained in A the disk (D) z touch the boundary of A in at least two points 31

morphological skeleton Skeleton: sequence of erosion and opening: Where B is the structural element and k indicates a sequence of k erosion of A 32

morphological skeleton K is the last iteration before the skeleton becomes empty We can demonstrate that A can be reconstructed from S(A): 33

Example 34