This paper presents a method for graph matching based on domain knowledge by quantifying representative graph features. Our method searches and extracts the most relevant cues in different graphs. Once these cues are extracted and quantified, a new energy function is used to match the different graphs based on the obtained features values. This approach has been successfully applied for deformable template matching. As a result the error of matching is reduced, as well as the computational cost by efficiently selecting and grouping representative features.
CitationAmato, Ariel; Al, Murad; Lladós, Josep; Gonzàlez, Jordi. "Computationally efficient graph matching via energy vector extraction". A: 2007 International Workshop on Advances in Pattern Recognition (IWARP), Plymouth, Gran Bretanya, 2007. Springer, 2007, p. 1-7.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com