A graph matching method based on probes assignments
- il y a 16 ans
Site: http://romain.raveaux.free.fr
A graph matching method and a distane between attributed graphs are defined. Both approaches are based on graph probes. Probes can be seen as features exctracted from a given graph. They represent a local information. According two graphs G1,G2, the univalent mapping can be expresssed as the minimum-weight probe matching between G1 and G2 with respect to a cost function c.
A graph matching method and a distane between attributed graphs are defined. Both approaches are based on graph probes. Probes can be seen as features exctracted from a given graph. They represent a local information. According two graphs G1,G2, the univalent mapping can be expresssed as the minimum-weight probe matching between G1 and G2 with respect to a cost function c.