Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results

Transcription

1 Mathematical Morphology on Hypergraphs: Preliminary Definitions and Results Isabelle Bloch, Alain Bretto DGCI 2011 I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

2 Motivation a d b a b c c Dilation / erosion of an hypergraph? Are these two hypergraphs similar?... I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

3 Hypergraphs Underlying space: H = (V, E) with V the set of vertices and E the set of hyperedges. Hypergraph: H = (V, E) with V V and E E, E = ((e i ) i I ) (e i V ). Dual hypergraph: H = (V E, E (H(x)) x V ) with H(x) = star = {e x e}. I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

4 Partial ordering and lattice On vertices: (P(V), ). On hyperedges: (P(E), ). On H: T + partial ordering V V H = (V, E) T E E {x V e E, x e} V Inclusion-based ordering: { (H 1, H 2 ) T 2 V1 V, H 1 = (V 1, E 1 ), H 2 = (V 2, E 2 ), H 1 H 2 2 E 2 E 2 (T, ) = complete lattice i H i = ( i V i, i E i), i H i = ( i V i, i E i) Smallest element: H = (, ), largest element: H = (V, E). I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

5 Ordering from induced sub-hypergraph: { (H 1, H 2 ) T 2 V1 V, H 1 i H 2 2 E 1 = {V (e) V 1 e E 2 } i.e. H 1 is the sub-hypergraph induced by H 2 for V 1. { (H 1, H 2 ) T 2, H 1 V1 V ih 2 2 E 1 {V (e) V 1 e E 2 } (T, i ) = complete lattice. H 1 i H 2 = (V 1 V 2, {V (e 1 ) V 2, V (e 2 ) V 1 e 1 E 1, e 2 E 2 } E}), H 1 i H 2 = (V 1 V 2, E 1 E 2 ). Smallest element: H = (, ), largest element: H = (V, E). I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

6 Ordering from partial hypergraph: { V1 = V H 1 p H 2 2 E 1 E 2 Ordering from sub-hypergraph: { H 1 s ( V1 V s)h 2 2 E 1 = ( ){e e E 2 and V (e) V 1 } I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

7 Algebraic dilation and erosion (T, ) and (T, ) complete lattices. Supremum /, infimum /. Dilation: δ : T T such that Erosion: ε : T T such that (x i ) T, δ( i x i ) = iδ(x i ) (x i ) T, ε( ix i ) = i ε(x i ) All classical properties of mathematical morphology on complete lattices. I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

8 Morphological operations using structuring elements Structuring element: binary relation between two elements. B x = δ({x}) In (P(E), ): E = e E {e}, and δ B (E) = e E B e = e E δ({e}). Example: e E, B e = δ({e}) = {e E V (e) V (e ) } δ : T = (P(E), ) T = (P(V), ) Example: e E, B e = δ({e}) = {x V e E, x e and V (e) V (e ) } = {V (e ) V (e ) V (e) } I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

9 I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

10 T = ({H = (V, E)}, ) Canonical decomposition (sup-generated lattice): Example: H = ( e E (V (e), {e})) ( x V\E ({x}, )) x V \E, δ({x}, ) = ({x}, ) (for isolated vertices) e E, δ(v (e), {e}) = ( {V (e ) V (e ) V (e) }, {e E V (e ) V (e) }) (for elementary hypergraphs associated with hyperdeges) Attributed hypergraphs: dilation based on similarity between attribute values. I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

11 Dualities Links between dilations and duality concepts on hypergraphs. H = (V, E) hypergraph with V, E, H = (V, E ) its dual Mapping δ : V P(V ) δ (x) = {y V ; x δ(y)} δ (x) = {y V ; x δ (y)} Theorem: a) for all X P(V ), δ (X ) = x X δ (x) = {y V, X δ(y) } (resp. δ(x ) = x X δ(x) = {y V, X δ (y) }) iff δ is a dilation (resp. δ is a dilation); b) for all X P(V ), if x X δ (x) = V (resp. x X δ(x) = V ) then X X δ (y) δ (y) (resp. X X δ(y) δ(y)); c) δ = δ on V ; d) if δ and δ are dilations then δ = δ. I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

12 H δ = (V, (δ(x)) x V ) x V, δ(x) = {e E; x e} Theorem: For H = (V, E) without isolated vertex and without repeated hyperedge, H H δ H H δ. Theorem: P = (p i ) i {1,2,...,t} discrete probability distribution on V, taking rational values dilation. δ dilation on V discrete probability distribution on V. Corollary: Discrete probability distribution on V rough space on E (upper approximation = dilation, lower approximation = erosion). Rough space on E discrete probability distribution on V. Links between morphological operators, derived rough sets, and probability distributions. I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

13 Similarity from dilation Introducing flexibility in hypergraph comparison, w.r.t isomorphisms. H 1 = (V, E 1 ) and H 2 = (V, E 2 ) without empty hyperedge. δ E 1 and δ E 2 extensive dilations on E 1 and E 2. Example: A P(E), δ(a) = {e E; V (A) V (e) }. (A, B) P(E 1 ) P(E 2 ) \ (, ), similarity: s(a, B) = δ E 1(A) δ E 2(B) δ E 1(A) δ E 2(B) Proposition: a) (e i, e j ) E 1 E 2, s((e i, e j )) = 0 E 1 E 2 = ; b) (e i, e j ) E 1 E 2, s((e i, e j )) = 1 = E 1 = E 2, c) s is symmetrical. I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

14 Left (E 1 ): δ(e 1 ) = {e 1, e 2, e 3, e 4 }, δ(e 2 ) = {e 1, e 2, e 3 }... Right (E 2 ): δ(e i ) = {e 1, e 2, e 3 }, for i = 1, 2, 3 s(e 1, e i ) = 3 4 s(e 2, e i ) = 3 3 s({e 1, e 2 }; B) = 3 4, for B E 2, B I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15

15 Conclusion New contribution: mathematical morphology on hypergraphs, based on complete lattice structures. Links with duality concepts. Links with rough sets and probability distributions. Future work: More properties based on morphological operators. Exploring similarity concepts. Applications in clustering, pattern recognition... I. Bloch, A. Bretto (Paris, Caen - France) Mathematical Morphology on Hypergraphs DGCI / 15