Regularized Diffusion Process on Bidirectional Context for Object Retrieval

被引:59
作者
Bai, Song [1 ]
Bai, Xiang [1 ]
Tian, Qi [2 ]
Latecki, Longin Jan [3 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Elect Informat & Commun, Wuhan 430074, Hubei, Peoples R China
[2] Univ Texas San Antonio, Dept Comp Sci, San Antonio, TX 78249 USA
[3] Temple Univ, Dept Comp & Informat Sci, 1925 N 12th St, Philadelphia, PA 19122 USA
关键词
Image retrieval; 3D shape retrieval; cross-modal retrieval; affinity learning; re-ranking; diffusion process; IMAGE RE-RANKING; SIMILARITY; REPRESENTATION; RECOGNITION; CONSISTENCY; SPACES; MODEL;
D O I
10.1109/TPAMI.2018.2828815
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Diffusion process has advanced object retrieval greatly as it can capture the underlying manifold structure. Recent studies have experimentally demonstrated that tensor product diffusion can better reveal the intrinsic relationship between objects than other variants. However, the principle remains unclear, i.e., what kind of manifold structure is captured. In this paper, we propose a new affinity learning algorithm called Regularized Diffusion Process (RDP). By deeply exploring the properties of RDP our first yet basic contribution is providing a manifold-based explanation for tensor product diffusion. A novel criterion measuring the smoothness of the manifold is defined, which simultaneously regularizes four vertices in the affinity graph. Inspired by this observation, we further contribute two variants towards two specific goals. While ARDP can learn similarities across heterogeneous domains, HRDP performs affinity learning on tensor product hypergraph, considering the relationships between objects are generally more complex than pairwise. Consequently, RDP, ARDP and HRDP constitute a generic tool for object retrieval in most commonly-used settings, no matter the input relationships between objects are derived from the same domain or not, and in pairwise formulation or not. Comprehensive experiments on 10 retrieval benchmarks, especially on large scale data, validate the effectiveness and generalization of our work.
引用
收藏
页码:1213 / 1226
页数:14
相关论文
共 78 条
[1]  
[Anonymous], P EUR WORKSH 3D OBJ, DOI DOI 10.2312/3DOR/3DOR08/009-016
[2]  
[Anonymous], 2014, P BRIT MACH VIS C 20
[3]  
[Anonymous], 2006, NIPS
[4]  
[Anonymous], 2017, ARXIV170306935
[5]   Neural Codes for Image Retrieval [J].
Babenko, Artem ;
Slesarev, Anton ;
Chigorin, Alexandr ;
Lempitsky, Victor .
COMPUTER VISION - ECCV 2014, PT I, 2014, 8689 :584-599
[6]  
Bai S, 2017, AAAI CONF ARTIF INTE, P3967
[7]   GIFT: Towards Scalable 3D Shape Retrieval [J].
Bai, Song ;
Bai, Xiang ;
Zhou, Zhichao ;
Zhang, Zhaoxiang ;
Tian, Qi ;
Latecki, Longin Jan .
IEEE TRANSACTIONS ON MULTIMEDIA, 2017, 19 (06) :1257-1271
[8]   GIFT: A Real-time and Scalable 3D Shape Search Engine [J].
Bai, Song ;
Bai, Xiang ;
Zhou, Zhichao ;
Zhang, Zhaoxiang ;
Latecki, Longin Jan .
2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2016, :5023-5032
[9]   Sparse Contextual Activation for Efficient Visual Re-Ranking [J].
Bai, Song ;
Bai, Xiang .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2016, 25 (03) :1056-1069
[10]   Neural shape codes for 3D model retrieval [J].
Bai, Song ;
Bai, Xiang ;
Liu, Wenyu ;
Roli, Fabio .
PATTERN RECOGNITION LETTERS, 2015, 65 :15-21