Graph matching vs mutual information maximization for object detection

Citation
Lb. Shams et al., Graph matching vs mutual information maximization for object detection, NEURAL NETW, 14(3), 2001, pp. 345-354
Citations number
45
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
NEURAL NETWORKS
ISSN journal
08936080 → ACNP
Volume
14
Issue
3
Year of publication
2001
Pages
345 - 354
Database
ISI
SICI code
0893-6080(200104)14:3<345:GMVMIM>2.0.ZU;2-4
Abstract
Labeled Graph Matching (LGM) has been shown successful in numerous object v ision tasks. This method is the basis for arguably the best face recognitio n system in the world. We present an algorithm for visual pattern recogniti on that is an extension of LGM ('LGM(+)'). We compare the performance of LG M and LGM(+) algorithms with a state of the art statistical method based on Mutual Information Maximization (MIM). We present an adaptation of the MIM method for multi-dimensional Gabor wavelet features. The three pattern rec ognition methods were evaluated on an object detection task, using a set of stimuli on which none of the methods had been tested previously. The resul ts indicate that while the performance of the MIM method operating upon Gab or wavelets is superior to the same method operating on pixels and to LGM, it is surpassed by LGM(+). LGM(+) offers a significant improvement in perfo rmance over LGM without losing LGM's virtues of simplicity, biological plau sibility, and a computational cost that is 2-3 orders of magnitude lower th an that of the MIM algorithm. (C) 2001 Elsevier Science Ltd. All rights res erved.