A Novel Biologically Inspired Structural Model for Feature Correspondence

被引:1
作者
Lu, Yan-Feng [1 ,2 ]
Yang, Xu [1 ,2 ]
Li, Yi [3 ]
Yu, Qian [2 ]
Liu, Zhi-Yong [1 ,2 ]
Qiao, Hong [1 ,2 ]
机构
[1] Chinese Acad Sci, Inst Automat, Natl Key Lab Multimodal Artificial Intelligence Sy, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing 100049, Peoples R China
[3] Nanchang Univ, Sch Informat Engn, Nanchang 330031, Peoples R China
基金
北京市自然科学基金; 中国国家自然科学基金;
关键词
Visualization; Biological system modeling; Biology; Brain modeling; Biological information theory; Task analysis; Strain; Appearance feature descriptor; biologically inspired model; feature correspondence; feature representation; graph matching (GM); graph structure; OBJECT RECOGNITION;
D O I
10.1109/TCDS.2022.3188333
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Feature correspondence is an essential issue in computer science, which could be well formulated by graph matching (GM). However, traditional GM is susceptible to outliers, thus limiting the applications. To address the issue, we present a biologically inspired feature descriptor (BIFD) corresponding to the simple and complex cell layers in primary visual cortex, which shows robust performance against deformations. Furthermore, we propose a novel biologically inspired structural model (BISM) for feature correspondence by fusing the graph structural information and appearance information described by BIFD in the images. The proposed BIFD imitates the cortical pooling operation across multiscale and multiangle cell layers, which makes BISM robust to outliers and distortions. To demonstrate the validity of the proposed method, we evaluate it in feature correspondence tasks on the public databases. The experimental results on synthetic data prove the validity of the proposed method.
引用
收藏
页码:844 / 854
页数:11
相关论文
共 52 条
[1]  
[Anonymous], 2007, Advances in Neural Information Processing Systems, DOI [DOI 10.7551/MITPRESS/7503.003.0044, 10.7551/mitpress/7503.003.0044]
[2]   Speeded-Up Robust Features (SURF) [J].
Bay, Herbert ;
Ess, Andreas ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2008, 110 (03) :346-359
[3]   Learning Graph Matching [J].
Caetano, Tiberio S. ;
McAuley, Julian J. ;
Cheng, Li ;
Le, Quoc V. ;
Smola, Alex J. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (06) :1048-1058
[4]   Learning Graphs to Match [J].
Cho, Minsu ;
Alahari, Karteek ;
Ponce, Jean .
2013 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2013, :25-32
[5]  
Cho M, 2010, LECT NOTES COMPUT SC, V6315, P492
[6]   Thirty years of graph matching in pattern recognition [J].
Conte, D ;
Foggia, P ;
Sansone, C ;
Vento, M .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2004, 18 (03) :265-298
[7]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[8]   A Tensor-Based Algorithm for High-Order Graph Matching [J].
Duchenne, Olivier ;
Bach, Francis ;
Kweon, In-So ;
Ponce, Jean .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (12) :2383-2395
[9]   A Probabilistic Approach to Spectral Graph Matching [J].
Egozi, Amir ;
Keller, Yosi ;
Guterman, Hugo .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (01) :18-27
[10]   The PASCAL Visual Object Classes Challenge: A Retrospective [J].
Everingham, Mark ;
Eslami, S. M. Ali ;
Van Gool, Luc ;
Williams, Christopher K. I. ;
Winn, John ;
Zisserman, Andrew .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2015, 111 (01) :98-136