Graph Homomorphism and Gradually Varied Functions Li CHEN DIMACS Visitor Department of Computer Science and Information Technology Affiliated Member of.

Slides:



Advertisements
Similar presentations
Goal: a graph representation of the topology of a gray scale image. The graph represents the hierarchy of the lower and upper level sets of the gray level.
Advertisements

Chapter 8 Topics in Graph Theory
CSE115/ENGR160 Discrete Mathematics 04/26/12 Ming-Hsuan Yang UC Merced 1.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Graph-02.
Introduction This chapter explores graphs and their applications in computer science This chapter explores graphs and their applications in computer science.
Edited by Malak Abdullah Jordan University of Science and Technology Data Structures Using C++ 2E Chapter 12 Graphs.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.
Representing Relations Using Matrices
Convexity of Point Set Sandip Das Indian Statistical Institute.
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
Chapter 7 Relations : the second time around
Applied Discrete Mathematics Week 12: Trees
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 II SIZE FUNCTIONS:
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 IV COMPUTING SIZE.
Discrete Structures Chapter 7B Graphs Nurul Amelina Nasharuddin Multimedia Department.
Discrete Structures Chapter 7A Graphs Nurul Amelina Nasharuddin Multimedia Department.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
Problem: Induced Planar Graphs Tim Hayes Mentor: Dr. Fiorini.
KNURE, Software department, Ph , N.V. Bilous Faculty of computer sciences Software department, KNURE Discrete.
Applied Discrete Mathematics Week 10: Equivalence Relations
GRAPH Learning Outcomes Students should be able to:
Error-Correction Coding Using Combinatorial Representation Matrices
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
1 CS104 : Discrete Structures Chapter V Graph Theory.
Based on slides by Y. Peng University of Maryland
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (2)
Indian Institute of Technology Kharagpur PALLAB DASGUPTA Graph Theory: Introduction Pallab Dasgupta, Professor, Dept. of Computer Sc. and Engineering,
8.3 Representing Relations Directed Graphs –Vertex –Arc (directed edge) –Initial vertex –Terminal vertex.
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
Graphs What are Graphs? General meaning in everyday math: A plot or chart of numerical data using a coordinate system. Technical meaning in discrete.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
ICS 253: Discrete Structures I Induction and Recursion King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Week 1 – Introduction to Graph Theory I Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
2.1 Functions.
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
Graphs Basic properties.
Introduction to Graph Theory By: Arun Kumar (Asst. Professor) (Asst. Professor)
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Relationship between pixels Neighbors of a pixel – 4-neighbors (N,S,W,E pixels) == N 4 (p). A pixel p at coordinates (x,y) has four horizontal and vertical.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Week 10 - Wednesday.  What did we talk about last time?  Counting practice  Pigeonhole principle.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 10.
Chapter 4 Fuzzy Graph and Relation Graph and Fuzzy Graph Graph G  (V, E) V : Set of vertices(node or element) E : Set of edges An edge is pair.
Fundamental Graph Theory (Lecture 1) Lectured by Hung-Lin Fu 傅 恆 霖 Department of Applied Mathematics National Chiao Tung University.
Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation is a relation on.
Representing Relations Using Digraphs
Chapter 5 Relations and Operations
Discrete Mathematics Graph: Planar Graph Yuan Luo
Applied Discrete Mathematics Week 14: Trees
Chapter 9 (Part 2): Graphs
Geographical Information Systems
Graph Theory and Algorithm 01
Discrete Math (2) Haiming Chen Associate Professor, PhD
Neutrosophic Mathematical Morphology for Medical Image
Graph Theory By Amy C. and John M..
Discrete Surfaces and Manifolds: A Potential tool to Image Processing
Discrete Mathematics Lecture 6: Set and Function
2.1 Functions.
Neutrosophic approach for mathematical morphology.
2.1 Functions.
Graph Theory: Cuts and Connectivity
Applied Discrete Mathematics Week 13: Graphs
Presentation transcript:

Graph Homomorphism and Gradually Varied Functions Li CHEN DIMACS Visitor Department of Computer Science and Information Technology Affiliated Member of Water Resource Research Institute University of the District of Columbia 4200 Connecticut Avenue, N.W. Washington, DC Office Tel: (202) DIMACS Mixer II, Oct. 21,2008

Definition of Graph Homomorphism Graph homomorphism maps adjacent vertices to adjacent vertices between two graphs.

Seminaralgorithms3 Gradually varied function The gradually varied function in discrete space preserves that the value change of neighborhood is limited respect to the center point

Seminaralgorithms4 How??? How theses two topics are highly related ?

Seminaralgorithms5 Absolute retracts vs. gradually varied extension We will first introduce absolute retracts in graph homomorphism and P. Hell and Rival’s theorem for reflexive graphs (1987). Then we discuss why gradually varied functions are important to digital spaces, and the necessary and sufficient condition of the existence of gradually varied extension (Chen, 1989). At the last, we discuss the generalization of related concepts to discrete surface immersion and graph homomorphic extension (Agnarsson and Chen, 2006).

Seminaralgorithms6 Retract and absolute retract A retract is a homomorphism or edge-proving map “f” from a graph G to its sub-graph H such that f(h)=h for all h in H. H is called an absolute retract if any G, that G contains H and d(x,y) in H is equal d(x,y) in G, can retract to H.

Seminaralgorithms7 Hell&Rival’s Result Theorem (Hell&Rival 1987): Let H be a (reflexive) graph. H is an absolute retract if only if H has no m-holes for m>=3. A hole of the graph H is a pair (K, \delta), where K is a nonempty set of vertices and \delta is a function from K to the nonnegative integers such that no h \in V(H) has d_{H}(h,k)<=\delta(k) for all k\in K. A (K,\delta ) hole is called an m-hole if |K|=m.

Seminaralgorithms8 The Gradually Varied Function:  Gradual variation: let f: D  {1, 2, …,n}, if a and b are adjacent in D implies |f(a)- f(b)|  1, point (a,f(a)) and (b,f(b)) are said to be gradually varied.  A 2D function (surface) is said to be gradually varied if every adjacent pair are gradually varied.

Seminaralgorithms9 The Gradually Varied Surface (Continue) Remarks:  This concept was called ``discretely continuous'' by Rosenfeld (1986) and ``roughly continuous'' by Pawlak (1995).  A gradually varied function can be represented by lambda-connectedness introduced by Chen (1985).

Seminaralgorithms10 Real Problems: Image Segmentation  (Gray scale) image segmentation is to find all gradually varied components in an image. (Strong requirement, use split-and- merge technique)  (Gray scale) image segmentation is to find all connected components in which for any pair of points, there is a gradually varied path to link them. (Weak requirement, use breadth-first-search technique) Example

Seminaralgorithms11 Example: lambda-connected Segmentation

Seminaralgorithms12 Real Problems: Discrete Surface Fitting  Given J  D, and f: J  {1,2, … n} decide if there is a F: D  {1,2, …,n} such that F is gradually varied where f(x)=F(x), x in J.  Theorem (Chen, 1989) the necessary and sufficient condition for the existence of a gradually varied extension F is: for all x,y in J, d(x,y)  |f(x)-f(y)|, where d is the distance between x and y in D.

Seminaralgorithms13 Example: GVS fitting

Seminaralgorithms14 Graph Immersion Li Chen, Gradually varied surfaces and gradually varied functions, in Chinese Li Chen, Discrete Surfaces and Manifolds, SPC, Chapter 8

Seminaralgorithms15 Not Every Pair of D, D ’ have GV Extension

Seminaralgorithms16 Normally Immersion/GV Mapping

Seminaralgorithms17 The Main Results of GVF

Seminaralgorithms18 GVF and Graph Homomorphism GV mapping is similar to Homomorphic Mapping to reflexive graphs (every node has a loop) Helly Property : Let X1,...,Xn be n subsets with respect to a Universal set. Helly means that if Xi  Xj   for all i,j then  {i=1} ^{n} Xi is not empty A graph has the Helly Property means that for each node i: Xi^{k} means a k-ball centered at node i. For N1,...,Nm are any elements in  {Xi^{k} | for all i, k}, {N1,...,Nm} has Helly, we will say that the graph has Helly.

Seminaralgorithms19 Helly “If you have a collection N_{r_1}(x_1), N_{r_2}(x_2),...,N_{r_k}(x_k) of such balls/neighborhoods. In the graph G, that are pairwise nonempty (that is, N_{r_i}(x_i)\cap N_{r_j}(x_j) is nonempty for every pair i,j from {1,2,...,k}), then their total intersection \Cap_{i=1}^k N_{r_i}(x_i) is also nonempty. This is the Helly-condition.”

Seminaralgorithms20 Main Results Theorem For a graph G the following are equivalent: 1. G can be the range-graph of any normal immersion. (G has the Extension Property (reflexive) ). 2. G is an absolute retract (reflexive). 3. G has the Helly property (reflexive). *G. Agnarsson and L. Chen, On the extension of vertex maps to graph homomorphisms, Discrete Mathematics, Vol 306, No 17, 2006.

Seminaralgorithms21 Easy understanding Main Theorem: For a reflexive graph G the following are equivalent: 1. G has the Extension Property 2. G is an absolute retract. 3. G has the Helly property. The alternate representation of the theorem: For a discrete manifold M the following are equivalent: 1. Any discrete manifold can normally immerse to M 2. Reflexivized M is an absolute retract. 3. M has the Helly property.

Seminaralgorithms22 Differences of Immersion and Retract  Absolute retract must be defined on reflexive graph to suit graph homomorphism — edge preserving  Absolute retract has better connection to classical graph theory  Immersion allows shrinking an edge to a vertex.  Immersion has better meaning in graph/shape deformation  Gradually varied surface is a type of discrete surfaces  Discrete and digital surfaces are hot topics in computer vision and computer graphics.

Seminaralgorithms23 Problems  Gradually varied segmentation using divide-and-conquer (split- and-merge) vs. Typical statistical method, how to deal with noise in gradually varied segmentation.  Gradually connected segmentation using breadth-first-search is similar to typical region-growing method.  Fast gradually varied fitting algorithm development in the case of Jordan-separable-domain.  Gradually varied fitting vs. numerical fitting: We are working on Ground Water project supported by USGS and UDC WRRI.  Gradually varied fitting is not unique. How do we select a best one for different application? Random surface model?

Seminaralgorithms24 References G. Agnarsson and L. Chen, On the extension of vertex maps to graph homomorphisms, Discrete Mathematics, Vol 306, No 17, pp , Sept L. Chen, The necessary and sufficient condition and the efficient algorithms for gradually varied fill, Chinese Sci. Bull. 35 (10) (1990) 870^873. L. Chen, Random gradually varied surface fitting, Chinese Sci. Bull. 37 (16) (1992) 1325^1329. L. Chen, Discrete surfaces and manifolds, Scientific and Practical Computing, Rockville, Maryland, 2004 P. Hell, I. Rival, Absolute retracts and varieties of reflexive graphs, Canad. J. Math. 39 (3) (1987) 544^567. P. Hell, J. Ne^etril, Graphs and homomorphisms, Oxford Lecture Series in Mathematics and its Applications, vol. 28, Oxford University Press, Oxford, 2004.

Seminaralgorithms25 Acknowledgements  Many thanks to DIMACS and Professor Feng Lu for providing me the opportunity to visit the center.  Please contact me at if you are interested in related