Isabelle Bloch, Olivier Colliot, and Roberto M. Cesar, Jr. IEEE Trans. Syst., Man, Cybern. B, Cybern., Vol. 36, No. 2, April 2006 Presented by Drew Buck.

Slides:



Advertisements
Similar presentations
Chapter 4 Partition I. Covering and Dominating.
Advertisements

Fuzzy Sets and Fuzzy Logic
Fuzzy Set and Opertion. Outline Fuzzy Set and Crisp Set Expanding concepts Standard operation of fuzzy set Fuzzy relations Operations on fuzzy relations.
Table of Contents 9.5 Some Basic Morphological Algorithm
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. 1 Section 6.7 Dot Product.
Automatic Histogram Threshold Using Fuzzy Measures 呂惠琪.
Chapter 9: Morphological Image Processing
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Each pixel is 0 or 1, background or foreground Image processing to
Morphological Image Processing Md. Rokanujjaman Assistant Professor Dept of Computer Science and Engineering Rajshahi University.
Chapter 5 FUZZY NUMBER Chi-Yuan Yeh.
Segmentation (2): edge detection
Provides mathematical tools for shape analysis in both binary and grayscale images Chapter 13 – Mathematical Morphology Usages: (i)Image pre-processing.
Chapter 9 Morphological Image Processing. Preview Morphology: denotes a branch of biology that deals with the form and structure of animals and planets.
Hidden Line Removal Adopted from U Strathclyde’s course page.
Local Symmetry - 2D Ribbons, SATs and Smoothed Local Symmetries Asaf Yaffe Image Processing Seminar, Haifa University, March 2005.
12 April 2013Lecture 2: Intervals, Interval Arithmetic and Interval Functions1 Intervals, Interval Arithmetic and Interval Functions Jorge Cruz DI/FCT/UNL.
Clustering Color/Intensity
Visual Querying By Color Perceptive Regions Alberto del Bimbo, M. Mugnaini, P. Pala, and F. Turco University of Florence, Italy Pattern Recognition, 1998.
August 12, 2003II. BASICS: Math Clinic Fall II. BASICS – Lecture 2 OBJECTIVES 1. To define the basic ideas and entities in fuzzy set theory 2. To.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
Morphological Image Processing
24. Dot Product of Vectors. What you’ll learn about  How to find the Dot Product  How to find the Angle Between Vectors  Projecting One Vector onto.
6.4 Vectors and Dot Products The Definition of the Dot Product of Two Vectors The dot product of u = and v = is Ex.’s Find each dot product.
Geometry CSC 2141 Introduction to Computer Graphics.
Relative Location of a Point with Respect to a Straight Line (0,0) 5 5 (2, 2) (4, 5) (0, 5) (6, 3) -3x + 2y +2 = 0 s = A x t + B y t + C s < 0 s > 0.
Fuzzy Logic. Lecture Outline Fuzzy Systems Fuzzy Sets Membership Functions Fuzzy Operators Fuzzy Set Characteristics Fuzziness and Probability.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
MATHEMATICAL MORPHOLOGY I.INTRODUCTION II.BINARY MORPHOLOGY III.GREY-LEVEL MORPHOLOGY.
Mathematical Morphology Lecture 14 Course book reading: GW Lucia Ballerini Digital Image Processing.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
Mathematics for Graphics. 1 Objectives Introduce the elements of geometry  Scalars  Vectors  Points Develop mathematical operations among them in a.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
3. Rough set extensions  In the rough set literature, several extensions have been developed that attempt to handle better the uncertainty present in.
TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES An Algorithm for the Computation of the Metric.
Chapter 36 Image Formation.
Vectors and the Geometry of Space 11 Copyright © Cengage Learning. All rights reserved.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Morphological Image Processing การทำงานกับรูปภาพด้วยวิธีมอร์โฟโลจิคัล
CS654: Digital Image Analysis
References Books: Chapter 11, Image Processing, Analysis, and Machine Vision, Sonka et al Chapter 9, Digital Image Processing, Gonzalez & Woods.
图像处理技术讲座(11) Digital Image Processing (11) 灰度的数学形态学(3) Mathematical morphology in gray scale (3) 顾 力栩 上海交通大学 计算机系
CS654: Digital Image Analysis
Nottingham Image Analysis School, 23 – 25 June NITS Image Segmentation Guoping Qiu School of Computer Science, University of Nottingham
EE 4780 Morphological Image Processing. Bahadir K. Gunturk2 Example Two semiconductor wafer images are given. You are supposed to determine the defects.
1 Mathematic Morphology used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction.
Morphological Image Processing Robotics. 2/22/2016Introduction to Machine Vision Remember from Lecture 12: GRAY LEVEL THRESHOLDING Objects Set threshold.
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
Linear Programming Chap 2. The Geometry of LP  In the text, polyhedron is defined as P = { x  R n : Ax  b }. So some of our earlier results should.
May 2003 SUT Color image segmentation – an innovative approach Amin Fazel May 2003 Sharif University of Technology Course Presentation base on a paper.
Vectors and Dot Products OBJECTIVES: Find the dot product of two vectors and use the properties of the dot product. Find the angle between two vectors.
Digital Image Processing Lecture 15: Morphological Algorithms April 27, 2005 Prof. Charlene Tsai.
CHAPTER 3 SETS, BOOLEAN ALGEBRA & LOGIC CIRCUITS
Set, Combinatorics, Probability & Number Theory
Introduction to Polygons
II. BASICS: Math Clinic Fall 2003
Financial Informatics –IX: Fuzzy Sets
CS Digital Image Processing Lecture 5
Morphological Image Processing
Digital Image Processing Lecture 15: Morphological Algorithms
I.4 Polyhedral Theory (NW)
I.4 Polyhedral Theory.
Vectors and Dot Products
CS654: Digital Image Analysis
CHAPTER 3 VECTORS NHAA/IMK/UNIMAP.
Chapter 3: Multivalued Dependencies
FUZZY SETS AND CRISP SETS PPTS
Presentation transcript:

Isabelle Bloch, Olivier Colliot, and Roberto M. Cesar, Jr. IEEE Trans. Syst., Man, Cybern. B, Cybern., Vol. 36, No. 2, April 2006 Presented by Drew Buck February 22, 2011

 We are interested in answering two questions:  What is the region of space located between two objects A 1 and A 2 ?  To what degree is B between A 1 and A 2 ?

 Existing Definitions  Convex Hull  Morphological Dilations  Visibility  Satisfaction Measure  Properties  Examples

 Merriam-Webster Dictionary defines between as “In the time, space, or interval that separates.”  Some crisp approaches:  A point is between two objects if it belongs to a segment with endpoints in each of the objects. A1A1 A2A2 P

 Another crisp approach:  Using bounding spheres, B is between A 1 and A 2 if it intersects the line between the centroids of A 1 and A 2.

 Fuzzy approaches:  For all calculate the angle θ at b between the segments [b, a 1 ] and [b, a 2 ]. Define a function μ between (θ) to measure the degree to which b is between a 1 and a 2. [12] R. Krishnapuram, J. M. Keller, and Y. Ma, “Quantitative Analysis of Properties and Spatial Relations of Fuzzy Image Regions,” IEEE-Trans. Fuzzy Syst., vol. 1, no.3, pp , Feb

 Using the histograms of forces:  The spatial relationship between two objects can be modeled with force histograms, which give a degree of support for the statement, “A is in direction θ from B.”

From P. Matsakis and S. Andréfouët, “The Fuzzy Line Between Among and Surround,” in Proc. IEEE FUZZ, 2002, pp

 Limitations of this approach:  Considers the union of objects, rather than their individual areas.

 For any set X, its complement X C, and its convex hull CH(X), we define the region of space between objects A 1 and A 2 as β(A 1,A 2 ).

 Components of β(A 1,A 2 ) which are not adjacent to both A 1 and A 2 should be suppressed.  However, this leads to a continuity problem:

 Extension to the fuzzy case:  Recommended to chose a t-norm that satisfies the law of excluded middle, such as Lukasiewicz’ t-norm

 If A 1 can be decomposed into connected components we can define the region between A 1 and A 2 as and similarly if both objects are non-connected.  This is better than using CH(A 1,A 2 ) directly

 Definition based on Dilation and Separation:  Find a “seed” for β(A 1,A 2 ) by dilating both objects until they meet and dilating the resulting intersection. where D n denotes a dilation by a disk of radius n.

Where from which connected components of the convex hull not adjacent to both sets are suppressed.  Using watersheds and SKIZ (skeleton by influence zones):  Reconstruction of β(A 1,A 2 ) by geodesic dilation.

 Removing non-visible cavities  We could use the convex hulls of A 1 and A 2 independently, but this approach cannot handle imbricated objects.

 Fuzzy Directional Dilations:  Compute the main direction α between A 1 and A 2 as the average or maximum value of the histogram of angles.  Let D α denote a dilation in direction α using a fuzzy structuring element, v.

 Given a fuzzy structuring element in the main direction from A 1 to A 2, we can define the area between A 1 and A 2 as  We can consider multiple values for the main direction by defining β as

 Or use the histogram of angles directly as the fuzzy structuring element.

 Alternate definition which removes concavities which are not facing each other

 Admissible segments:  A segment [x 1, x 2 ] with x 1 in A 1 and x 2 in A 2 is admissible if it is contained in.  is defined as the union of all admissible segments.

 Fuzzy visibility:  Consider a point P and the segments [a 1, P] and [P, a 2 ] where a 1 and a 2 come from A 1 and A 2 respectively.  For each P, find the angle closest to π between any two admissible segments included in where [a 1, P] and [P, a 2 ] are semi- admissible segments where f :[0, π] → [0,1] is a decreasing function

 Extension to fuzzy objects:  Compute the fuzzy inclusion of each segment and intersect with the best angle as before.

 Objects with different spatial extensions:  If A 2 has infinite or near-infinite size with respect to A 1, approximate A 2 by a segment u and dilate A 1 in a direction orthogonal to u, limited to the closest half plane.

 Adding a visibility constraint  Conjunctively combine projection with admissible segments. Optionally consider only segments orthogonal to u.

 Once β(A 1,A 2 ) has been determined, we want to know the overlap between β and B.  Normalized Intersection:  Other possible measures:

 Degree of Inclusion:  Degree of Intersection:  Length of this interval gives information on the ambiguity of the relation.

 If B is extended, we might want to know if B passes through β.  Let  R will have two connected components, R 1 and R 2.  Degree to which B passes through β should be high if B goes at least from a point in R 1 to a point in R 2.

 Anatomical descriptions of brain structures

 Possible to represent the complex spatial relationship, “between,” using mathematical morphology and visibility.  Many definitions exist, each with individual strengths and weaknesses.  Pick the representation most appropriate for the application.