Many-to-Many Matching under the l1 Norm
The problem of object recognition can be formulated as matching feature sets of different objects. Segmentation errors and scale difference result in many-to-many matching of feature sets, rather than one-to-one. This paper extends a previous algorithm on many-to-many graph matching. The proposed work represents graphs, which correspond to objects, isometrically in the geometric space under the l 1 norm. Empirical evaluation of the algorithm on a set of recognition trails, including a comparison with the previous approach, demonstrates the efficacy of the overall framework.
Keywordsgraph embedding Earth Mover’s Distance graph matching object recognition
- 11.Horaud, R., Skordas, T.: Structural matching for stereo vision. In: Nineth International Conference on Pattern Recognition, Rome, Italy, pp. 439–445 (1988)Google Scholar
- 16.Wang, Y.K., Fan, K.C., Horng, J.T.: Genetic-based search for error-correcting graph isomorphism. IEEETSMC: IEEE Transactions on Systems, Man, and Cybernetics 27 (1997)Google Scholar