Lecture Notes in Computer Science, 2001, Volume 2059/2001, 51-66, DOI: 10.1007/3-540-45129-3_5

On Matching Algorithms for the Recognition of Objects in Cluttered Background

Josef Kittler and Alireza Ahmadyfard

View Related Documents

Abstract

An experimental comparative study of three matching methods for the recognition of 3D objects from a 2D view is carried out. The methods include graph matching, geometric hashing and the alignment technique. The same source of information is made available to each method to ensure that the comparison is meaningful. The experiments are designed to measure the performance of the methods in different imaging conditions. We show that matching by geometric hashing and alignment is very sensitive to clutter and measurement errors. Thus in realistic scenarios graph matching is superior to the other methods in terms of both recognition accuracy and computational complexity.

Fulltext Preview

Image of the first page of the fulltext document