We describe a novel graph matching optimization technique, which we refer to

as dual decomposition (DD), and demonstrate on a variety of examples that this

method outperforms existing graph matching algorithms-We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms