Graph matching based on mean field theory

Author

Wang, Shijun ; Petrick, Nicholas ; Van Uitert, Robert L. ; Periaswamy, Senthil ; Summers, Ronald M.

Author_Institution

Imaging Biomarkers & Comput.-Aided Diagnosis Lab., Nat. Institutes of Health Clinical Center, Bethesda, MD, USA

fYear

2010

fDate

26-29 Sept. 2010

Firstpage

1893

Lastpage

1896

Abstract

In this paper, we propose a new graph matching algorithm based on mean field theory. We first convert the original graph matching problem which is a quadratic integer programming problem to a spin model with quadratic interaction by dropping the matching constraints. Then the matching constraints are added to the system iteratively after each round of mean field calculation. Prominent matching pairs found in previous iterations will guide the mean field calculation in the next round. Experiments on the CMU house dataset and a CTC dataset show promising matching results.

Keywords

graph theory; image matching; integer programming; iterative methods; quadratic programming; CMU house dataset; CTC dataset; graph matching; iterations; matching constraints; mean field theory; quadratic integer programming; quadratic interaction; spin model; Cancer; Colon; Colonography; Data models; Pattern matching; Probabilistic logic; Shape; Computed tomographic colonography; graph matching; mean field theory; spin model;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing (ICIP), 2010 17th IEEE International Conference on

Conference_Location

Hong Kong

ISSN

1522-4880

Print_ISBN

978-1-4244-7992-4

Electronic_ISBN

1522-4880

Type

conf

DOI

10.1109/ICIP.2010.5652432

Filename

5652432