3-D Object Retrieval With Hausdorff Distance Learning

被引:168
作者
Gao, Yue [1 ,2 ]
Wang, Meng [3 ]
Ji, Rongrong [4 ]
Wu, Xindong [3 ,5 ]
Dai, Qionghai [1 ]
机构
[1] Tsinghua Univ, Dept Automat, Tsinghua Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
[2] Natl Univ Singapore, Singapore 119615, Singapore
[3] Hefei Univ Technol, Sch Comp Sci & Informat Engn, Hefei 230009, Peoples R China
[4] Xiamen Univ, Dept Cognit Sci, Sch Informat Sci & Technol, Xiamen 361005, Peoples R China
[5] Univ Vermont, Dept Comp Sci, Burlington, VT 05405 USA
基金
中国国家自然科学基金;
关键词
Distance metric learning; Hausdorff distance; object search; view pair selection; 3D MODEL; ROBUST; SEARCH; RECOGNITION; IMAGES;
D O I
10.1109/TIE.2013.2262760
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In view-based 3-D object retrieval, each object is described by a set of views. Group matching thus plays an important role. Previous research efforts have shown the effectiveness of Hausdorff distance in group matching. In this paper, we propose a 3-D object retrieval scheme with Hausdorff distance learning. In our approach, relevance feedback information is employed to select positive and negative view pairs with a probabilistic strategy, and a view-level Mahalanobis distance metric is learned. This Mahalanobis distance metric is adopted in estimating the Hausdorff distances between objects, based on which the objects in the 3-D database are ranked. We conduct experiments on three testing data sets, and the results demonstrate that the proposed Hausdorff learning approach can improve 3-D object retrieval performance.
引用
收藏
页码:2088 / 2098
页数:11
相关论文
共 66 条
[1]   A Comparative Study of Three Feedback Devices for Residential Real-Time Energy Monitoring [J].
Alahmad, Mahmoud A. ;
Wheeler, Patrick G. ;
Schwer, Avery ;
Eiden, Joshua ;
Brumbaugh, Adam .
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2012, 59 (04) :2002-2013
[2]  
Alipanahi B., 2008, PROC 23 NAT C ARTIF, P598
[3]  
[Anonymous], ACM T MULTIMEDIA COM
[4]  
[Anonymous], 2006, P ADV NEUR INF PROC
[5]  
[Anonymous], P SAMT WORKSH SEM 3
[6]  
[Anonymous], P ACM INT C IM VID R
[7]  
[Anonymous], 1999, MPEG98M2819 ISOMPEGJ
[8]  
[Anonymous], THESIS U LEIPZIG LEI
[9]   A Bayesian 3-D search engine using adaptive views clustering [J].
Ansary, Tarik Filali ;
Daoudi, Mohamed ;
Vandeborre, Jean-Philippe .
IEEE TRANSACTIONS ON MULTIMEDIA, 2007, 9 (01) :78-88
[10]   A LINEAR TIME ALGORITHM FOR THE HAUSDORFF DISTANCE BETWEEN CONVEX POLYGONS [J].
ATALLAH, MJ .
INFORMATION PROCESSING LETTERS, 1983, 17 (04) :207-209