Decomposition-Based Transfer Distance Metric Learning for Image Classification

Distance metric learning (DML) is a critical factor for image analysis and pattern recognition. To learn a robust distance metric for a target task, we need abundant side information (i.e., the similarity/dissimilarity pairwise constraints over the labeled data), which is usually unavailable in prac...

Full description

Bibliographic Details
Published in:IEEE Transactions on Image Processing
Main Authors: Luo, Yong, Liu, Tongliang, Tao, Dacheng, Xu, Chao
Other Authors: Luo, Y (reprint author), Peking Univ, Key Lab Machine Percept, Minist Educ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China., Peking Univ, Key Lab Machine Percept, Minist Educ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China., Univ Technol, Fac Engn & Informat Technol, Ctr Quantum Computat & Intelligent Syst, Ultimo, NSW 2007, Australia.
Format: Journal/Newspaper
Language:English
Published: ieee transactions on image processing 2014
Subjects:
Online Access:https://hdl.handle.net/20.500.11897/152026
https://doi.org/10.1109/TIP.2014.2332398
Description
Summary:Distance metric learning (DML) is a critical factor for image analysis and pattern recognition. To learn a robust distance metric for a target task, we need abundant side information (i.e., the similarity/dissimilarity pairwise constraints over the labeled data), which is usually unavailable in practice due to the high labeling cost. This paper considers the transfer learning setting by exploiting the large quantity of side information from certain related, but different source tasks to help with target metric learning (with only a little side information). The state-of-the-art metric learning algorithms usually fail in this setting because the data distributions of the source task and target task are often quite different. We address this problem by assuming that the target distance metric lies in the space spanned by the eigenvectors of the source metrics (or other randomly generated bases). The target metric is represented as a combination of the base metrics, which are computed using the decomposed components of the source metrics (or simply a set of random bases); we call the proposed method, decomposition-based transfer DML (DTDML). In particular, DTDML learns a sparse combination of the base metrics to construct the target metric by forcing the target metric to be close to an integration of the source metrics. The main advantage of the proposed method compared with existing transfer metric learning approaches is that we directly learn the base metric coefficients instead of the target metric. To this end, far fewer variables need to be learned. We therefore obtain more reliable solutions given the limited side information and the optimization tends to be faster. Experiments on the popular handwritten image (digit, letter) classification and challenge natural image annotation tasks demonstrate the effectiveness of the proposed method. http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000348366100004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 Computer Science, Artificial Intelligence Engineering, Electrical & Electronic SCI(E) 16 ARTICLE yluo180@gmail.com; tliang.liu@gmail.com; dacheng.tao@uts.edu.au; xuchao@cis.pku.edu.cn 9 3789-3801 23