Efficient many-to-many feature matching under the l(1) norm

Abstract

Matching configurations of image features, represented as attributed graphs, to configurations of model features is an important component in many object recognition algorithms. Noisy segmentation of images and imprecise feature detection may lead to graphs that represent visually similar configurations that do not admit an injective matching. In previous work, we presented a framework which computed an explicit many-to-many vertex correspondence between attributed graphs of features configurations. The framework utilized a low distortion embedding function to map the nodes of the graphs into point sets in a vector space. The Earth Movers Distance (EMD) algorithm was then used to match the resulting points, with the computed flows specifying the many-to-many vertex correspondences between the input graphs. In this paper, we will present a distortion-free embedding, which represents input graphs as metric trees and then embeds them isometrically in the geometric space under the I, norm. This not only improves the representational power of graphs in the geometric space, it also reduces the complexity of the previous work using recent developments in computing EMD under l. Empirical evaluation of the algorithm on a set of recognition trials, including a comparison with previous approaches, demonstrates the effectiveness and robustness of the proposed framework. (C) 2011 Elsevier Inc. All rights reserved.