Fast Affine Template Matching over Galois Field

Chao Zhang and Takuya Akashi

Abstract

In this paper, we address the problem of template matching under affine transformations with general images. Our approach is to search an approximate affine transformation over a binary Galois field. The benefit is that we can avoid matching with huge amount of potential transformations, because they are discretely sampled. However, a Galois field of affine transformation can still be impractical for exhaustive searching. To approach the optimum solution efficiently, we introduce a level-wise adaptive sampling (LAS) method under genetic algorithm framework. In LAS, individuals converge to the global optimum depending on a level-wise selection and crossover while the population number is decreased by a population bounding scheme. In the experiment section, we analyse our method systematically and compare it against the state-of-the-art method on an evaluation data set. The results show that our method has a higher accuracy performance with fewer matching tests.

Session

Poster 2

Files

PDF iconExtended Abstract (PDF, 279K)
PDF iconPaper (PDF, 1683K)

DOI

10.5244/C.29.121
https://dx.doi.org/10.5244/C.29.121

Citation

Chao Zhang and Takuya Akashi. Fast Affine Template Matching over Galois Field. In Xianghua Xie, Mark W. Jones, and Gary K. L. Tam, editors, Proceedings of the British Machine Vision Conference (BMVC), pages 121.1-121.11. BMVA Press, September 2015.

Bibtex

@inproceedings{BMVC2015_121,
	title={Fast Affine Template Matching over Galois Field},
	author={Chao Zhang and Takuya Akashi},
	year={2015},
	month={September},
	pages={121.1-121.11},
	articleno={121},
	numpages={11},
	booktitle={Proceedings of the British Machine Vision Conference (BMVC)},
	publisher={BMVA Press},
	editor={Xianghua Xie, Mark W. Jones, and Gary K. L. Tam},
	doi={10.5244/C.29.121},
	isbn={1-901725-53-7},
	url={https://dx.doi.org/10.5244/C.29.121}
}