Anytime Graph Matching

This work was part of my Ph.D dissertation. In the dissertation, we propose and explain the use of anytime algorithms in graph matching (GM).

HTML5 Icon

The concept of anytime algorithms was first reported in [1]. Anytime algorithms have a trade-off between quality and execution time. They can find the first best-so-far solution after some setup time at the beginning of the execution. From the figure above one can see that the quality of the solution improves with increasing execution time. Users have the choice of stopping the algorithm at anytime and thus getting an answer that is satisfactory, or they can run their algorithm until its completion when it is important to find the optimal solution.

A detailed pseudo-code of the proposed anytime method is provided here.

Videos of the anytime concept can be found here.


    [1] Zilberstein, S., 1996. Using anytime algorithms in intelligent systems. AI Magazine 17, 73-83.