Applying sum and max product algorithms of belief propagation to 3D shape matching and registration

Pengdong Xiao*, Nick Barnes, Paulette Lieby, Tiberio Caetano

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    1 Citation (Scopus)

    Abstract

    3D shape matching based on meshed surfaces can be formulated as an energy function minimisation problem under a Markov random field (MRF) framework. However, to solve such a global optimisation problem is NP-hard. So research mainly focuses on approximation algorithms. One of the best known is belief propagation (BP), which has shown success in early vision and many other practical applications. In this paper, we investigate the application of both sum and max product algorithms of belief propagation to 3D shape matching. We also apply the 3D shape matching results to a 3D registration problem.

    Original languageEnglish
    Title of host publicationDICTA 2009 - Digital Image Computing
    Subtitle of host publicationTechniques and Applications
    Pages387-394
    Number of pages8
    DOIs
    Publication statusPublished - 2009
    EventDigital Image Computing: Techniques and Applications, DICTA 2009 - Melbourne, VIC, Australia
    Duration: 1 Dec 20093 Dec 2009

    Publication series

    NameDICTA 2009 - Digital Image Computing: Techniques and Applications

    Conference

    ConferenceDigital Image Computing: Techniques and Applications, DICTA 2009
    Country/TerritoryAustralia
    CityMelbourne, VIC
    Period1/12/093/12/09

    Fingerprint

    Dive into the research topics of 'Applying sum and max product algorithms of belief propagation to 3D shape matching and registration'. Together they form a unique fingerprint.

    Cite this