{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:47:04Z","timestamp":1750308424901,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61872329, 61722204, 61732007, and 61572451"],"award-info":[{"award-number":["61872329, 61722204, 61732007, and 61572451"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2019,8,31]]},"abstract":"<jats:p>Distance metric learning has been widely studied in multifarious research fields. The mainstream approaches learn a Mahalanobis metric or learn a linear transformation. Recent related works propose learning a linear combination of base vectors to approximate the metric. In this way, fewer variables need to be determined, which is efficient when facing high-dimensional data. Nevertheless, such works obtain base vectors using additional data from related domains or randomly generate base vectors. However, obtaining base vectors from related domains requires extra time and additional data, and random vectors introduce randomness into the learning process, which requires sufficient random vectors to ensure the stability of the algorithm. Moreover, the random vectors cannot capture the rich information of the training data, leading to a degradation in performance. Considering these drawbacks, we propose a novel distance metric learning approach by introducing base vectors explicitly learned from training data. Given a specific task, we can make a sparse approximation of its objective function using the top eigenvalues and corresponding eigenvectors of a predefined integral operator on the reproducing kernel Hilbert space. Because the process of generating eigenvectors simply refers to the training data of the considered task, our proposed method does not require additional data and can reflect the intrinsic information of the input features. Furthermore, the explicitly learned eigenvectors do not result in randomness, and we can extend our method to any kernel space without changing the objective function. We only need to learn the coefficients of these eigenvectors, and the only hyperparameter that we need to determine is the number of eigenvectors that we utilize. Additionally, an optimization algorithm is proposed to efficiently solve this problem. Extensive experiments conducted on several datasets demonstrate the effectiveness of our proposed method.<\/jats:p>","DOI":"10.1145\/3340262","type":"journal-article","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T19:51:56Z","timestamp":1566330716000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Eigenvector-Based Distance Metric Learning for Image Classification and Retrieval"],"prefix":"10.1145","volume":"15","author":[{"given":"Zhangcheng","family":"Wang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Ya","family":"Li","sequence":"additional","affiliation":[{"name":"IFLYTEK Research, Hefei, China"}]},{"given":"Richang","family":"Hong","sequence":"additional","affiliation":[{"name":"Hefei University of Technology, Hefei, China"}]},{"given":"Xinmei","family":"Tian","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"21st International Joint Conference on Artificial Intelligence. 1217--1222","author":"Baghshah Mahdieh Soleymani","year":"2009","unstructured":"Mahdieh Soleymani Baghshah and Saeed Bagheri Shouraki . 2009 . Semi-supervised metric learning using pairwise constraints . In 21st International Joint Conference on Artificial Intelligence. 1217--1222 . Mahdieh Soleymani Baghshah and Saeed Bagheri Shouraki. 2009. Semi-supervised metric learning using pairwise constraints. In 21st International Joint Conference on Artificial Intelligence. 1217--1222."},{"key":"e_1_2_1_2_1","volume-title":"21st International Joint Conference on Artificial Intelligence.","author":"Baghshah Mahdieh Soleymani","year":"2009","unstructured":"Mahdieh Soleymani Baghshah and Saeed Bagheri Shouraki . 2009 . Semi-supervised metric learning using pairwise constraints . In 21st International Joint Conference on Artificial Intelligence. Mahdieh Soleymani Baghshah and Saeed Bagheri Shouraki. 2009. Semi-supervised metric learning using pairwise constraints. In 21st International Joint Conference on Artificial Intelligence."},{"key":"e_1_2_1_3_1","first-page":"937","article-title":"Learning a mahalanobis metric from equivalence constraints","author":"Bar-Hillel Aharon","year":"2005","unstructured":"Aharon Bar-Hillel , Tomer Hertz , Noam Shental , and Daphna Weinshall . 2005 . Learning a mahalanobis metric from equivalence constraints . J. Mach. Learn. Res. 6 , June (2005), 937 -- 965 . Aharon Bar-Hillel, Tomer Hertz, Noam Shental, and Daphna Weinshall. 2005. Learning a mahalanobis metric from equivalence constraints. J. Mach. Learn. Res. 6, June (2005), 937--965.","journal-title":"J. Mach. Learn. Res. 6"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.458"},{"key":"e_1_2_1_5_1","volume-title":"European Conference on Computer Vision. Springer, 160--172","author":"Bhattarai Binod","year":"2014","unstructured":"Binod Bhattarai , Gaurav Sharma , Fr\u00e9d\u00e9ric Jurie , and Patrick P\u00e9rez . 2014 . Some faces are more equal than others: Hierarchical organization for accurate and efficient large-scale identity-based face retrieval . In European Conference on Computer Vision. Springer, 160--172 . Binod Bhattarai, Gaurav Sharma, Fr\u00e9d\u00e9ric Jurie, and Patrick P\u00e9rez. 2014. Some faces are more equal than others: Hierarchical organization for accurate and efficient large-scale identity-based face retrieval. In European Conference on Computer Vision. Springer, 160--172."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273523"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3234929"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"R Fisher. {n.d.}. The use of multiple measures in taxonomic problems. Ann. Eugenics. v7 ({n.\u00a0d.}) 179--188.  R Fisher. {n.d.}. The use of multiple measures in taxonomic problems. Ann. Eugenics. v7 ({n.\u00a0d.}) 179--188.","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"e_1_2_1_10_1","volume-title":"Van Loan","author":"Golub Gene H.","year":"1996","unstructured":"Gene H. Golub and Charles F . Van Loan . 1996 . Matrix computations.Johns Hopkins University Press , Baltimore, MD, 374--426. Gene H. Golub and Charles F. Van Loan. 1996. Matrix computations.Johns Hopkins University Press, Baltimore, MD, 374--426."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2011.07.005"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1823746.1823752"},{"key":"e_1_2_1_14_1","unstructured":"Rong Jin Shijun Wang and Yang Zhou. 2009. Regularized distance metric learning: Theory and algorithm. In Advances in Neural Information Processing Systems. 862--870.   Rong Jin Shijun Wang and Yang Zhou. 2009. Regularized distance metric learning: Theory and algorithm. In Advances in Neural Information Processing Systems. 862--870."},{"volume-title":"Principal Component Analysis","author":"Jolliffe Ian","key":"e_1_2_1_15_1","unstructured":"Ian Jolliffe . 2002. Principal Component Analysis . Wiley Online Library . Ian Jolliffe. 2002. Principal Component Analysis. Wiley Online Library."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.527"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0129"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298832"},{"volume-title":"Constrained metric learning via distance gap maximization","author":"Liu Wei","key":"e_1_2_1_19_1","unstructured":"Wei Liu , Xinmei Tian , Dacheng Tao , and Jianzhuang Liu . 2010. Constrained metric learning via distance gap maximization . In Association for the Advancement of Artificial Intelligence. Wei Liu, Xinmei Tian, Dacheng Tao, and Jianzhuang Liu. 2010. Constrained metric learning via distance gap maximization. In Association for the Advancement of Artificial Intelligence."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2332398"},{"key":"e_1_2_1_21_1","volume-title":"Transfer metric learning: Algorithms, applications and outlooks. arXiv preprint arXiv:1810.03944","author":"Luo Yong","year":"2018","unstructured":"Yong Luo , Yonggang Wen , Lingyu Duan , and Dacheng Tao . 2018. Transfer metric learning: Algorithms, applications and outlooks. arXiv preprint arXiv:1810.03944 ( 2018 ). Yong Luo, Yonggang Wen, Lingyu Duan, and Dacheng Tao. 2018. Transfer metric learning: Algorithms, applications and outlooks. arXiv preprint arXiv:1810.03944 (2018)."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2824309"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.523"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/2354409.2354975"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.29.139"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2014.7025068"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.426"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244304322972667"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298682"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015376"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209666"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2240136.2240139"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70087-8_61"},{"key":"e_1_2_1_35_1","first-page":"207","article-title":"Distance metric learning for large margin nearest neighbor classification","author":"Weinberger Kilian Q.","year":"2009","unstructured":"Kilian Q. Weinberger and Lawrence K. Saul . 2009 . Distance metric learning for large margin nearest neighbor classification . J. Mach. Learn. Res. 10 , Feb. (2009), 207 -- 244 . Kilian Q. Weinberger and Lawrence K. Saul. 2009. Distance metric learning for large margin nearest neighbor classification. J. Mach. Learn. Res. 10, Feb. (2009), 207--244.","journal-title":"J. Mach. Learn. Res. 10"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3089249"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2307862"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.01.025"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2012.2207395"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2016.2591583"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.139"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.135"},{"key":"e_1_2_1_43_1","unstructured":"Laurent Zwald Gilles Blanchard Pascal Massart and R\u00e9gis Vert. 2005. Kernel projection machine: A new tool for pattern recognition. In Advances in Neural Information Processing Systems. 1649--1656.   Laurent Zwald Gilles Blanchard Pascal Massart and R\u00e9gis Vert. 2005. Kernel projection machine: A new tool for pattern recognition. In Advances in Neural Information Processing Systems. 1649--1656."}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340262","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:32Z","timestamp":1750268972000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,20]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,8,31]]}},"alternative-id":["10.1145\/3340262"],"URL":"https:\/\/doi.org\/10.1145\/3340262","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2019,8,20]]},"assertion":[{"value":"2019-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}