Illustra(ons
Romain Raveaux
Structural Descrip(ons and Inexact Matching
LINDA G. SHAPIRO, SENIOR MEMBER, IEEE, AND ROBERT M.
HARALICK, SENIOR MEMBER, IEEE
Node matching problems
• Ideas from
– Chris(ne Solnon
– LIRIS, UMR 5205 CNRS / Universit ´e Lyon 1
Node Matching
• G1=(V1,E1) and G2=(V2,E2)
• A rela(on :
• So (v1,v2) m à v1 matches v2 -‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐-‐
Bijec(ve matching : Cardinality (1,1) Injec(ve matching : Cardinality (1,0..1)
Univalent matching : Cardinality (0..1,0..1)
m⊆V1×V2
∈
SoY and hard constraints
• Matching must sa(sfies hard and soY constraints.
– Edge Constraints
• Hard : mandatory matching
• SoY : wished matching à to be op(mized
– Label constraints
• Hard : iden(cal labels between matched nodes
• SoY : to maximized the similarity between labels of matched nodes