Binary Linear Programming Formulation

This work has been done during my Ph.D. It was a collaborative work with Dr. Romain Raveaux (my Ph.D co-director) and 3 research members at the LITIS laboratory in Rouen.

In the below videos we see visual comparisons between our proposed formulation F2 [1] and BP [2] on CMU House [3] and VOC [4] databases, respectively.

Visual comparison between F2 [1] and BP [2] on CMU House database [3]:

References

• [1] Julien Lerouge, Zeina Abu-Aisheh, Romain Raveaux, Pierre Héroux and Sébastien Adam, Graph Edit Distance : A New Binary Linear Programming Formulation. Pattern Recognition 72 : 254-265 (2017). Download
• [2] Kaspar Riesen, Horst Bunke: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput. 27(7): 950-959 (2009)
• [3] CMU houses and hotels, http://vasc.ri.cmu.edu/idb/html/motion.
• [4] Voc cars database, http://host.robots.ox.ac.uk/pascal/VOC/