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...
Published in: | IEEE Transactions on Image Processing |
---|---|
Main Authors: | , , , |
Other Authors: | , , |
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 |
_version_ | 1821499401983492096 |
---|---|
author | Luo, Yong Liu, Tongliang Tao, Dacheng Xu, Chao |
author2 | 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. |
author_facet | Luo, Yong Liu, Tongliang Tao, Dacheng Xu, Chao |
author_sort | Luo, Yong |
collection | Peking University Institutional Repository (PKU IR) |
container_issue | 9 |
container_start_page | 3789 |
container_title | IEEE Transactions on Image Processing |
container_volume | 23 |
description | 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 |
format | Journal/Newspaper |
genre | DML |
genre_facet | DML |
id | ftpekinguniv:oai:localhost:20.500.11897/152026 |
institution | Open Polar |
language | English |
op_collection_id | ftpekinguniv |
op_container_end_page | 3801 |
op_doi | https://doi.org/20.500.11897/152026 https://doi.org/10.1109/TIP.2014.2332398 |
op_relation | IEEE TRANSACTIONS ON IMAGE PROCESSING.2014,23,(9),3789-3801. 765941 1057-7149 http://hdl.handle.net/20.500.11897/152026 1941-0042 doi:10.1109/TIP.2014.2332398 WOS:000348366100004 |
op_source | SCI |
publishDate | 2014 |
publisher | ieee transactions on image processing |
record_format | openpolar |
spelling | ftpekinguniv:oai:localhost:20.500.11897/152026 2025-01-16T21:38:55+00:00 Decomposition-Based Transfer Distance Metric Learning for Image Classification Luo, Yong Liu, Tongliang Tao, Dacheng Xu, Chao 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. 2014 https://hdl.handle.net/20.500.11897/152026 https://doi.org/10.1109/TIP.2014.2332398 en eng ieee transactions on image processing IEEE TRANSACTIONS ON IMAGE PROCESSING.2014,23,(9),3789-3801. 765941 1057-7149 http://hdl.handle.net/20.500.11897/152026 1941-0042 doi:10.1109/TIP.2014.2332398 WOS:000348366100004 SCI Distance metric learning transfer learning decomposition base metric image classification REGULARIZATION PARAMETER Journal 2014 ftpekinguniv https://doi.org/20.500.11897/152026 https://doi.org/10.1109/TIP.2014.2332398 2021-08-01T08:00:37Z 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 Journal/Newspaper DML Peking University Institutional Repository (PKU IR) IEEE Transactions on Image Processing 23 9 3789 3801 |
spellingShingle | Distance metric learning transfer learning decomposition base metric image classification REGULARIZATION PARAMETER Luo, Yong Liu, Tongliang Tao, Dacheng Xu, Chao Decomposition-Based Transfer Distance Metric Learning for Image Classification |
title | Decomposition-Based Transfer Distance Metric Learning for Image Classification |
title_full | Decomposition-Based Transfer Distance Metric Learning for Image Classification |
title_fullStr | Decomposition-Based Transfer Distance Metric Learning for Image Classification |
title_full_unstemmed | Decomposition-Based Transfer Distance Metric Learning for Image Classification |
title_short | Decomposition-Based Transfer Distance Metric Learning for Image Classification |
title_sort | decomposition-based transfer distance metric learning for image classification |
topic | Distance metric learning transfer learning decomposition base metric image classification REGULARIZATION PARAMETER |
topic_facet | Distance metric learning transfer learning decomposition base metric image classification REGULARIZATION PARAMETER |
url | https://hdl.handle.net/20.500.11897/152026 https://doi.org/10.1109/TIP.2014.2332398 |