Efficient hierarchical graph matching

Paul Morrison, Ju Jia Zou

    Research output: Chapter in Book / Conference PaperConference Paperpeer-review

    Abstract

    ![CDATA[Graph matching algorithms have proven to be useful in many applications, such as character recognition, shape analysis and image analysis. As the graph matching problem is one of exponential computational complexity, various heuristics and estimations have been proposed. While many of these algorithms succeed in improving the time taken to perform a match, most do not guarantee that an optimal solution will be found. It is the aim of the proposed algorithm to reduce the complexity of the graph matching process, while still producing an optimal solution for a known application. This is achieved by removing a graph edit operation from the matching process, and compensating for the lost robustness by introducing a hierarchical matching process that is centered around an application-specific criterion that operates on the subgraph scale. Results show that the proposed algorithm is faster than two previous methods that are based on graph edit operations.]]
    Original languageEnglish
    Title of host publicationProceedings of the 2009 IEEE International Conference on Image Processing (ICIP 2009): November 7-12, 2009, Cairo, Egypt
    PublisherIEEE
    Pages445-448
    Number of pages4
    ISBN (Print)9781424456543
    DOIs
    Publication statusPublished - 2009
    EventInternational Conference on Image Processing -
    Duration: 15 Sept 2013 → …

    Publication series

    Name
    ISSN (Print)1522-4880

    Conference

    ConferenceInternational Conference on Image Processing
    Period15/09/13 → …

    Fingerprint

    Dive into the research topics of 'Efficient hierarchical graph matching'. Together they form a unique fingerprint.

    Cite this