Publication Type

Conference Proceeding Article

Publication Date

8-2004

Abstract

Given two or more images, we can define different but related problems on pattern matching such as image registration, pattern detection and localization, and common pattern discovery. These problems have different levels of purpose and difficulties, as a result, often associate with different solutions. In this paper, we propose a novel approach to solve these problems under a unified framework based on graph matching. We first split the images into small blocks and represent each block as a node in a bipartite graph. A maximum weighted bipartite graph matching algorithm is then employed in an iterative way to find the best transformation set. Experimental results show that our approach can handle rotation, scaling and translation, as well as distortion and occlusion. Another virtue of our approach is its efficiency

Discipline

Computer Sciences | Graphics and Human Computer Interfaces

Research Areas

Intelligent Systems and Optimization

Publication

Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, 2004 August 23-26

Volume

3

First Page

658

Last Page

661

ISBN

0769521282

Identifier

10.1109/ICPR.2004.1334615

Publisher

IEEE

City or Country

Cambridge

Download

Share

COinS