{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:53:38Z","timestamp":1743083618383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031773914"},{"type":"electronic","value":"9783031773921"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-77392-1_22","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T18:25:42Z","timestamp":1737483942000},"page":"287-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CLAP: Concave Linear APproximation for\u00a0Quadratic Graph Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7282-0476","authenticated-orcid":false,"given":"Yongqing","family":"Liang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1360-4886","authenticated-orcid":false,"given":"Huijun","family":"Han","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0144-9489","authenticated-orcid":false,"given":"Xin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"22_CR1","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 26 (2013)"},{"key":"22_CR2","unstructured":"Ding, C., Zhou, D., He, X., Zha, H.: R 1-PCA: rotational invariant l 1-norm principal component analysis for robust subspace factorization. In: ICML (2006)"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s11263-009-0275-4","volume":"88","author":"M Everingham","year":"2010","unstructured":"Everingham, M., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The pascal visual object classes (VOC) challenge. IJCV 88(2), 303\u2013338 (2010)","journal-title":"IJCV"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Gao, Q., Wang, F., Xue, N., Yu, J., Xia, G.: Deep graph matching under quadratic constraint. In: CVPR, pp. 5067\u20135074 (2021)","DOI":"10.1109\/CVPR46437.2021.00503"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"He, J., Huang, Z., Wang, N., Zhang, Z.: Learnable graph matching: incorporating graph partitioning with deep feature learning for multiple object tracking. In: CVPR, pp. 5299\u20135309 (2021)","DOI":"10.1109\/CVPR46437.2021.00526"},{"key":"22_CR6","unstructured":"Jaggi, M., Lacoste-Julien, S.: On the global linear convergence of Frank-Wolfe optimization variants. In: NeurIPS, vol. 28 (2015)"},{"key":"22_CR7","unstructured":"Jiang, B., Sun, P., Tang, J., Luo, B.: Glmnet: graph learning-matching networks for feature matching. arXiv preprint arXiv:1911.07681 (2019)"},{"key":"22_CR8","unstructured":"Johnson, D.S., Garey, M.R.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman, New York (1979)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica: J. Econometr. Soc. (1957)","DOI":"10.2307\/1907742"},{"issue":"9","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1109\/TPAMI.2008.114","volume":"30","author":"N Kwak","year":"2008","unstructured":"Kwak, N.: Principal component analysis based on l1-norm maximization. IEEE T-PAMI 30(9), 1672\u20131680 (2008)","journal-title":"IEEE T-PAMI"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: The quadratic assignment problem. Manag. Sci. 9(4) (1963)","DOI":"10.1287\/mnsc.9.4.586"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Liao, X., Xu, Y., Ling, H.: Hypergraph neural networks for hypergraph matching. In: ICCV, pp. 1266\u20131275 (2021)","DOI":"10.1109\/ICCV48922.2021.00130"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Lin, Y., Yang, M., Yu, J., Hu, P., Zhang, C., Peng, X.: Graph matching with bi-level noisy correspondence. In: ICCV, pp. 23362\u201323371 (2023)","DOI":"10.1109\/ICCV51070.2023.02135"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola, E.M., de Abreu, N.M.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.patcog.2016.07.015","volume":"60","author":"Y Lu","year":"2016","unstructured":"Lu, Y., Huang, K., Liu, C.L.: A fast projected fixed-point algorithm for large graph matching. Pattern Recogn. 60, 971\u2013982 (2016)","journal-title":"Pattern Recogn."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Peyr\u00e9, G., Cuturi, M., et\u00a0al.: Computational optimal transport: with applications to data science. Found. Trends Mach. Learn. 11(5\u20136) (2019)","DOI":"10.1561\/2200000073"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-030-58604-1_32","volume-title":"Computer Vision \u2013 ECCV 2020","author":"G Puy","year":"2020","unstructured":"Puy, G., Boulch, A., Marlet, R.: FLOT: scene flow on point clouds guided by optimal transport. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12373, pp. 527\u2013544. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58604-1_32"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Sarlin, P.E., DeTone, D., Malisiewicz, T., Rabinovich, A.: Superglue: learning feature matching with graph neural networks. In: CVPR, pp. 4938\u20134947 (2020)","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Sun, J., Shen, Z., Wang, Y., Bao, H., Zhou, X.: Loftr: detector-free local feature matching with transformers. In: CVPR, pp. 8922\u20138931 (2021)","DOI":"10.1109\/CVPR46437.2021.00881"},{"issue":"5","key":"22_CR20","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE T-PAMI 10(5), 695\u2013703 (1988)","journal-title":"IEEE T-PAMI"},{"key":"22_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17798-9","volume-title":"Ger\u0161gorin and His Circles","author":"RS Varga","year":"2010","unstructured":"Varga, R.S.: Ger\u0161gorin and His Circles. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17798-9"},{"issue":"11","key":"22_CR22","first-page":"2737","volume":"42","author":"FD Wang","year":"2020","unstructured":"Wang, F.D., Xue, N., Zhang, Y., Xia, G.S., Pelillo, M.: A functional representation for graph matching. IEEE T-PAMI 42(11), 2737\u20132754 (2020)","journal-title":"IEEE T-PAMI"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Wang, R., Guo, Z., Jiang, S., Yang, X., Yan, J.: Deep learning of partial graph matching via differentiable top-k. In: CVPR, pp. 6272\u20136281 (2023)","DOI":"10.1109\/CVPR52729.2023.00607"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Wang, R., Yan, J., Yang, X.: Learning combinatorial embedding networks for deep graph matching. In: ICCV, pp. 3056\u20133065 (2019)","DOI":"10.1109\/ICCV.2019.00315"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Wang, R., Yan, J., Yang, X.: Combinatorial learning of robust deep graph matching: an embedding based approach. IEEE T-PAMI (2020)","DOI":"10.1109\/ICCV.2019.00315"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Wang, R., Yan, J., Yang, X.: Neural graph matching network: learning Lawler\u2019s quadratic assignment problem with extension to hypergraph and multiple-graph matching. IEEE T-PAMI (2021)","DOI":"10.1109\/TPAMI.2021.3078053"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Wang, T., Liu, H., Li, Y., Jin, Y., Hou, X., Ling, H.: Learning combinatorial solver for graph matching. In: CVPR, pp. 7568\u20137577 (2020)","DOI":"10.1109\/CVPR42600.2020.00759"},{"key":"22_CR28","unstructured":"Yu, T., Wang, R., Yan, J., Li, B.: Learning deep graph matching with channel-independent embedding and Hungarian attention. In: ICLR (2019)"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Zanfir, A., Sminchisescu, C.: Deep learning of graph matching. In: CVPR, pp. 2684\u20132693 (2018)","DOI":"10.1109\/CVPR.2018.00284"},{"issue":"12","key":"22_CR30","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2008","unstructured":"Zaslavskiy, M., Bach, F., Vert, J.P.: A path following algorithm for the graph matching problem. IEEE T-PAMI 31(12), 2227\u20132242 (2008)","journal-title":"IEEE T-PAMI"},{"key":"22_CR31","unstructured":"Zhang, Z., Xiang, Y., Wu, L., Xue, B., Nehorai, A.: KerGM: kernelized graph matching. In: NeurIPS, vol. 32, 3335\u20133346 (2019)"},{"issue":"4","key":"22_CR32","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1109\/TNNLS.2013.2281428","volume":"25","author":"W Zheng","year":"2013","unstructured":"Zheng, W., Lin, Z., Wang, H.: L1-norm kernel discriminant analysis via Bayes error bound optimization for robust feature extraction. IEEE Trans. Neural Netw. Learn. Syst. 25(4), 793\u2013805 (2013)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Zhou, F., De\u00a0la Torre, F.: Factorized graph matching. In: CVPR. IEEE (2012)","DOI":"10.1109\/CVPR.2013.376"}],"container-title":["Lecture Notes in Computer Science","Advances in Visual Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77392-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T18:25:54Z","timestamp":1737483954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77392-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031773914","9783031773921"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77392-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISVC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Visual Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lake Tahoe, NV","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isvc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isvc.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}