Graph matching vs mutual information maximization for object detection

被引:15
|
作者
Shams, LB
Brady, MJ
Schaal, S
机构
[1] CALTECH, Div Biol, Pasadena, CA 91125 USA
[2] 3M Co, Corp Res Labs, 3M Ctr, St Paul, MN 55144 USA
[3] Univ So Calif, HNB 103, Los Angeles, CA 90089 USA
[4] JST, ERATO, Kawato Dynam Brain Project, Seika, Kyoto 61902, Japan
关键词
pattern recognition; object recognition; graph matching; mutual information maximization; object detection; lateral excitation; image entropy; Gabor wavelets;
D O I
10.1016/S0893-6080(00)00099-X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Labeled Graph Matching (LGM) has been shown successful in numerous object vision tasks. This method is the basis for arguably the best face recognition system in the world. We present an algorithm for visual pattern recognition that is an extension of LGM ('LGM(+)'). We compare the performance of LGM 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 recognition methods were evaluated on an object detection task, using a set of stimuli on which none of the methods had been tested previously. The results indicate that while the performance of the MIM method operating upon Gabor wavelets is superior to the same method operating on pixels and to LGM, it is surpassed by LGM(+). LGM(+) offers a significant improvement in performance over LGM without losing LGM's virtues of simplicity, biological plausibility, and a computational cost that is 2-3 orders of magnitude lower than that of the MIM algorithm. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:345 / 354
页数:10
相关论文
共 50 条
  • [31] Statistical mechanics of mutual information maximization
    Urbanczik, R
    EUROPHYSICS LETTERS, 2000, 49 (05): : 685 - 691
  • [32] On feature extraction by mutual information maximization
    Torkkola, K
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 821 - 824
  • [33] Context formation by mutual information maximization
    Liu, Z
    Karam, LJ
    2002 INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOL III, PROCEEDINGS, 2002, : 89 - 92
  • [34] Competitive learning by mutual information maximization
    Kamimura, R
    Kamimura, T
    IJCNN'01: INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, VOLS 1-4, PROCEEDINGS, 2001, : 926 - 931
  • [35] Learning curves for mutual information maximization
    Urbanczik, R
    PHYSICAL REVIEW E, 2003, 68 (01): : 161061 - 161066
  • [36] Fingerprint registration by maximization of mutual information
    Liu, LF
    Jiang, TZ
    Yang, JW
    Zhu, CZ
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (05) : 1100 - 1110
  • [37] A global correspondence for scale invariant matching using mutual information and the graph search
    Jeon, Hyun-Ho
    Basso, Andrea
    Driessen, Peter F.
    2006 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO - ICME 2006, VOLS 1-5, PROCEEDINGS, 2006, : 1745 - +
  • [38] Improving Graph Matching via Density Maximization
    Wang, Chao
    Wang, Lei
    Liu, Lingqiao
    2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, : 3424 - 3431
  • [39] ProtoInfoMax: Prototypical Networks with Mutual Information Maximization for Out-of-Domain Detection
    Ni'mah, Iftitahu
    Fang, Meng
    Menkovski, Vlado
    Pechenizkiy, Mykola
    FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2021, 2021, : 1606 - 1617
  • [40] Hypothesis Disparity Regularized Mutual Information Maximization
    Lao, Qicheng
    Jiang, Xiang
    Havaei, Mohammad
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 8243 - 8251