CAPAIAN PEMBELAJARAN Memahami Operasi Morfologi :

Slides:

Advertisements

Similar presentations

Autocorrelation and Heteroskedasticity

Advertisements

Signals and Circuits 2 Time responses The nature of the time response at the electrical system is the same as at the mechanical system. As example in the.

Chapter 3 Brute Force Brute force is a straightforward approach to solving a problem, usually directly based on the problem’s statement and definitions.

Decision Maths 1 Sorting Algorithms Bubble Sort A V Ali : 1.Start at the beginning of the data set. 2.Compare the first two elements,

Markov Decision Process

8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.

Sesi 13 Aplikasi SPSS Untuk Analisis Statistik.

Morfologi citra.

A Level Computing#BristolMet Session Objectives#U2 S8 MUST identify the difference between a procedure and a function SHOULD explain the need for parameters.

Histogram Specification

Chapter 9: Morphological Image Processing

Some Basic Morphological Algorithm

Image Thinning Aria Rajasa Masna – Charles Gunawan – Rama Pandugita – Suluh Legowo –

Morphological Image Processing Md. Rokanujjaman Assistant Professor Dept of Computer Science and Engineering Rajshahi University.

Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 9 Morphological Image Processing Chapter 9 Morphological.

Chapter 9 Morphological Image Processing. Preview Morphology: denotes a branch of biology that deals with the form and structure of animals and planets.

Special Matrices and Gauss-Siedel

4. Ad-hoc I: Hierarchical clustering

Special Matrices and Gauss-Siedel

Morphological Image Processing

Learning HMM parameters Sushmita Roy BMI/CS 576 Oct 21 st, 2014.

Introduction to Longitudinal Phase Space Tomography Duncan Scott.

Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.

Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,

Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. by Lale Yurttas, Texas A&M University Chapter 111.

Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 11.

Clustering Methods K- means. K-means Algorithm Assume that K=3 and initially the points are assigned to clusters as follows. C 1 ={x 1,x 2,x 3 }, C 2.

Morphological Image Processing

Procedures for managing workflow components Workflow components: A workflow can usually be described using formal or informal flow diagramming techniques,

1 STRESS STATE 2- D. 2 It is convenient to resolve the stresses at a point into normal and shear components. The stresses used to describe the state of.

Algorithms 2005 Ramesh Hariharan. Algebraic Methods.

Time Parallel Simulations I Problem-Specific Approach to Create Massively Parallel Simulations.

Digital Image Processing CSC331 Morphological image processing 1.

1 CS 552/652 Speech Recognition with Hidden Markov Models Winter 2011 Oregon Health & Science University Center for Spoken Language Understanding John-Paul.

1 CSE 552/652 Hidden Markov Models for Speech Recognition Spring, 2006 Oregon Health & Science University OGI School of Science & Engineering John-Paul.

 Mathematical morphology is a tool for extracting image components that are useful in the representation and description of region shape, such as boundaries,

Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.

Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.

Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.

Morphological Image Processing (Chapter 9) CSC 446 Lecturer: Nada ALZaben.

On the Ability of Graph Coloring Heuristics to Find Substructures in Social Networks David Chalupa By, Tejaswini Nallagatla.

Lecture z Chapter 10: Image Segmentation. Segmentation approaches 1) Gradient based: How different are pixels? 2) Thresholding: Converts grey-level images.

Sort Algorithm.

7.1 Morfologi untuk Pengolahan Citra : Thickening, Skeleton

Digital Image Processing Lecture 15: Morphological Algorithms April 27, 2005 Prof. Charlene Tsai.

Digital Image Processing CP-7008 Lecture # 09 Morphological Image Processing Fall 2011.

STRESS STATE 2- D.

Dijkstra’s shortest path Algorithm

Numerical Analysis Lecture12.

Binary Image Processing

Creating fuzzy rules from numerical data using a neural network

CS Digital Image Processing Lecture 5

Lecture 3 / 4 Algorithm Analysis

Binary Image processing بهمن 92

EET 503 Power System Protection (Instrument transformer )

Morphological Image Processing

Digital Image Processing Lecture 15: Morphological Algorithms

3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.

ECE 692 – Advanced Topics in Computer Vision

Materi 06 Pengolahan Citra Digital

3.8: Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.

The structure of programming

Chapter 11 Chapter 11.

CS654: Digital Image Analysis

Thinking procedurally

Numerical Analysis Lecture11.

Presentation transcript:

6.2 Morfologi untuk Pengolahan Citra : Extraction of Connected Component, Thinning,

CAPAIAN PEMBELAJARAN Memahami Operasi Morfologi : Extraction of Connected Component Thinning

Extraction of Connected Components Procedure: Assume that a point p of Y ( a connected component in A) is known. Following iterative expression yields all the elements of Y. Xk = (Xk-1  B)  A k = 1,2,3….. Where X0 =p and B is symmetric structure element Terminates if Xk = Xk-1

Extraction of Connected Components Find a starting point p in connected components Run where X0=p  Known when Xk=Xk-1 the algorithm has converged. k=1,2,3,…

Extraction of Connected Components k=1,2,3,…

Extraction of Connected Components B

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Extraction of Connected Components

Thinning Thinning -Define in terms of the hit-or-miss transform, denote by:

Thinning S B

Thinning B

Thinning -Define in terms of many structuring elements, denote by Bi is a rotation version of Bi-1 -The entire process is repeated until no further changes occur Usually use 8 direction structure elements.

Thinning Wrong in figure 9.21

Thinning S S1:1 S1:3 S1:2

Thinning S1:3 S1:4 S1:6 S1:5

Thinning S1:6 S1:7 S2:1 S1:8

Thinning S2:1 S2:2,3,4,5 m connection S2:6,7,8

Thinning S m connection

Daftar Pustaka Kadir, Abdul, Susanto,A., “Pengolahan Citra, Teori Dan Aplikasi”, Andi, Yogyakarta, 2013.