High-Order Local Spatial Context Modeling by Spatialized Random Forest

被引:10
|
作者
Ni, Bingbing [1 ]
Yan, Shuicheng [2 ]
Wang, Meng [3 ]
Kassim, Ashraf A. [2 ]
Tian, Qi [4 ]
机构
[1] Adv Digital Sci Ctr, Singapore 138632, Singapore
[2] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore 117576, Singapore
[3] Hefei Univ Technol, Hefei 230009, Peoples R China
[4] Univ Texas San Antonio, Dept Comp Sci, San Antonio, TX 78249 USA
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Object classification; random forest; spatial context; visual codebook; TEXTURE CLASSIFICATION; RECOGNITION; SCALE; FEATURES;
D O I
10.1109/TIP.2012.2222895
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a novel method for spatial context modeling toward boosting visual discriminating power. We are particularly interested in how to model high-order local spatial contexts instead of the intensively studied second-order spatial contexts, i.e., co-occurrence relations. Motivated by the recent success of random forest in learning discriminative visual codebook, we present a spatialized random forest (SRF) approach, which can encode an unlimited length of high-order local spatial contexts. By spatially random neighbor selection and random histogram-bin partition during the tree construction, the SRF can explore much more complicated and informative local spatial patterns in a randomized manner. Owing to the discriminative capability test for the random partition in each tree node's split process, a set of informative high-order local spatial patterns are derived, and new images are then encoded by counting the occurrences of such discriminative local spatial patterns. Extensive comparison experiments on face recognition and object/scene classification clearly demonstrate the superiority of the proposed spatial context modeling method over other state-of-the-art approaches for this purpose.
引用
收藏
页码:739 / 751
页数:13
相关论文
共 50 条
  • [21] Multiple breakup of high-order spatial solitons
    Katz, Ori
    Lahini, Yoav
    Silberberg, Yaron
    OPTICS LETTERS, 2008, 33 (23) : 2830 - 2832
  • [22] A high-order generalized local maximum principle
    Ledzewicz, U
    Schättler, H
    SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2000, 38 (03) : 823 - 854
  • [23] A NEW LOCAL HIGH-ORDER LAMINATE THEORY
    WU, CP
    HSU, CS
    COMPOSITE STRUCTURES, 1993, 25 (1-4) : 439 - 448
  • [24] Local High-order Regularization on Data Manifolds
    Kim, Kwang In
    Tompkin, James
    Pfister, Hanspeter
    Theobalt, Christian
    2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, : 5473 - 5481
  • [25] The size of the giant high-order component in random hypergraphs
    Cooley, Oliver
    Kang, Mihyun
    Koch, Christoph
    RANDOM STRUCTURES & ALGORITHMS, 2018, 53 (02) : 238 - 288
  • [26] Improving Deep Forest by Exploiting High-order Interactions
    Chen, Yi-He
    Lyu, Shen-Huan
    Jiang, Yuan
    2021 21ST IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2021), 2021, : 1030 - 1035
  • [27] Modeling Instance Interactions for Joint Information Extraction with Neural High-Order Conditional Random Field
    Jia, Zixia
    Yan, Zhaohui
    Han, Wenjuan
    Zheng, Zilong
    Tu, Kewei
    PROCEEDINGS OF THE 61ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2023): LONG PAPERS, VOL 1, 2023, : 13695 - 13710
  • [28] Subcritical random hypergraphs, high-order components, and hypertrees
    Cooley, Oliver
    Fang, Wenjie
    Del Giudice, Nicola
    Kang, Mihyun
    2019 PROCEEDINGS OF THE MEETING ON ANALYTIC ALGORITHMICS AND COMBINATORICS, ANALCO, 2019, : 111 - 118
  • [29] High-Order Random Walks and Generalized Laplacians on Hypergraphs
    Lu, Linyuan
    Peng, Xing
    INTERNET MATHEMATICS, 2013, 9 (01) : 3 - 32
  • [30] SUBCRITICAL RANDOM HYPERGRAPHS, HIGH-ORDER COMPONENTS, AND HYPERTREES
    Cooley, Oliver
    Fang, Wenjie
    Del Giudice, Nicola
    Kang, Mihyun
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (04) : 2033 - 2062