{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:19:32Z","timestamp":1778084372185,"version":"3.51.4"},"publisher-location":"Cham","reference-count":69,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031200496","type":"print"},{"value":"9783031200502","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20050-2_37","type":"book-chapter","created":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T22:09:58Z","timestamp":1666908598000},"page":"636-653","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A Comparative Study of\u00a0Graph Matching Algorithms in\u00a0Computer Vision"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0855-8549","authenticated-orcid":false,"given":"Stefan","family":"Haller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenz","family":"Feineis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Hutschenreiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Bernard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Rother","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9830-2415","authenticated-orcid":false,"given":"Dagmar","family":"Kainm\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4065-8758","authenticated-orcid":false,"given":"Paul","family":"Swoboda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdan","family":"Savchynskyy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,28]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Adams, W.P., Johnson, T.A.: Improved linear programming-based lower bounds for the quadratic assignment problem. Discrete Math. Theor. Comput. Sci. 16, 43\u201377 (1994)","DOI":"10.1090\/dimacs\/016\/02"},{"key":"37_CR2","volume-title":"Network Flows: Theory","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory. Prentice Hall, Algorithms and Applications (1993)"},{"key":"37_CR3","unstructured":"Alhaija, H.A., Sellent, A., Kondermann, D., Rother, C.: GraphFlow - 6D large displacement scene flow via graph matching. In: Proceedings of the DAGM German Conference on Pattern Recognition (2015)"},{"key":"37_CR4","unstructured":"Alhaija, H.A., Sellent, A., Kondermann, D., Rother, C.: Graph Matching Problems for GraphFlow - 6D Large Displacement Scene Flow Problem Instances (2018), https:\/\/research-explorer.app.ist.ac.at\/record\/5573"},{"key":"37_CR5","unstructured":"Alhaija, H.A., Sellent, A., Kondermann, D., Rother, C.: Project GraphFlow - 6D Large Displacement Scene Flow Images (2018). https:\/\/hci.iwr.uni-heidelberg.de\/vislearn\/research\/image-matching\/graphflow\/"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Beiranvand, V., Hare, W., Lucet, Y.: Best practices for comparing optimization algorithms. Optimization and Engineering (2017)","DOI":"10.1007\/s11081-017-9366-1"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Bernard, F., Thunberg, J., Gemmar, P., Hertel, F., Husch, A., Goncalves, J.: A solution for multi-alignment by transformation synchronisation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2015)","DOI":"10.1109\/CVPR.2015.7298828"},{"key":"37_CR8","unstructured":"Bertsekas, D.P.: A distributed algorithm for the assignment problem. Lab. for Information and Decision Systems Working Paper, MIT (1979)"},{"key":"37_CR9","unstructured":"Bertsekas, D.P.: Nonlinear programming, second edition. Athena scientific (1999)"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. SIAM (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Burkard, R., Karisch, S., Rendl, F.: QAPLIB - a quadratic assignment problem library. J. Global Optim. 10, 391\u2013403 (1997)","DOI":"10.1023\/A:1008293323270"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-13111-5_13","volume-title":"Location Science","author":"Z Drezner","year":"2015","unstructured":"Drezner, Z.: The quadratic assignment problem. In: Laporte, G., Nickel, S., da Gama, F.S. (eds.) Location Science, pp. 345\u2013363. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-13111-5_13"},{"key":"37_CR13","unstructured":"Caetano, T.: Data for Learning Graph Matching (2011). https:\/\/www.tiberiocaetano.com\/data\/"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell. 31, 1048\u20131058 (2009)","DOI":"10.1109\/TPAMI.2009.28"},{"key":"37_CR15","unstructured":"Cela, E.: The Quadratic Assignment Problem: Theory and Algorithms, vol. 1. Springer Science & Business Media (2013)"},{"key":"37_CR16","unstructured":"Cho, M., Jungmin, L., Kyoung, M.L.: Reweighted Random Walks for Graph Matching: Project Page (2010). https:\/\/cv.snu.ac.kr\/research\/~RRWM\/"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-15555-0_36","volume-title":"Computer Vision \u2013 ECCV 2010","author":"M Cho","year":"2010","unstructured":"Cho, M., Lee, J., Lee, K.M.: Reweighted random walks for graph matching. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6315, pp. 492\u2013505. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15555-0_36"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Cho, M., Sun, J., Duchenne, O., Ponce, J.: Finding matches in a haystack: a max-pooling strategy for graph matching in the presence of outliers. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2014)","DOI":"10.1109\/CVPR.2014.268"},{"key":"37_CR19","unstructured":"Cho, M., Sun, J., Duchenne, O., Ponce, J.: Finding matches in a haystack source code (2014). https:\/\/www.di.ens.fr\/willow\/research\/maxpoolingmatching\/"},{"key":"37_CR20","unstructured":"Cour, T.: Graph Matching Toolbox in MATLAB (2010). http:\/\/www.timotheecour.com\/software\/graph_matching\/graph_matching.html"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Cour, T., Srinivasan, P., Shi, J.: Balanced graph matching. In: Advances in Neural Information Processing Systems (2007)","DOI":"10.7551\/mitpress\/7503.003.0044"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Mathematical Programming (2002)","DOI":"10.1007\/s101070100263"},{"key":"37_CR23","unstructured":"Everingham, M., Van Gool, L., Williams, C.K., Winn, J., Zisserman, A.: The PASCAL visual object classes challenge 2007 results (2007). http:\/\/www.pascal-network.org\/challenges\/VOC\/voc2007\/workshop\/index.html"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recogn. Artif. Intelli. 28, 1450001 (2014)","DOI":"10.1142\/S0218001414500013"},{"key":"37_CR25","doi-asserted-by":"crossref","unstructured":"Frank, M., Wolfe, P., et al.: An Algorithm for Quadratic Programming. Naval Research Logistics Quarterly (1956)","DOI":"10.1002\/nav.3800030109"},{"key":"37_CR26","unstructured":"Globerson, A., Jaakkola, T.S.: Fixing max-product: convergent message passing algorithms for MAP LP-relaxations. In: Advances in Neural Information Processing Systems (2008)"},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 28, 1450001 (1996)","DOI":"10.1109\/CVPR.1996.517080"},{"key":"37_CR28","doi-asserted-by":"crossref","unstructured":"Guignard, M., Kim, S.: Lagrangean decomposition: a model yielding stronger lagrangean bounds. Mathematical Programming (1987)","DOI":"10.1007\/BF02592954"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"Heimann, T., Meinzer, H.P.: Statistical shape models for 3D medical image segmentation: a review. Med. Image Anal. 13, 543\u2013563 (2009)","DOI":"10.1016\/j.media.2009.05.004"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press (2012)","DOI":"10.1017\/CBO9781139020411"},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"Hutschenreiter, L., Haller, S., Feineis, L., Rother, C., Kainm\u00fcller, D., Savchynskyy, B.: Fusion moves for graph matching. In: Proceedings of the IEEE International Conference on Computer Vision (2021)","DOI":"10.1109\/ICCV48922.2021.00621"},{"key":"37_CR32","doi-asserted-by":"crossref","unstructured":"Hutschenreiter, L., Haller, S., Feineis, L., Rother, C., Kainm\u00fcller, D., Savchynskyy, B.: Fusion moves for graph matching website (2021). https:\/\/vislearn.github.io\/libmpopt\/iccv2021\/","DOI":"10.1109\/ICCV48922.2021.00621"},{"key":"37_CR33","doi-asserted-by":"crossref","unstructured":"Jiang, B., Tang, J., Ding, C., Luo, B.: A local sparse model for matching problem. In: Proceedings of the AAAI Conference on Artificial Intelligence (2015)","DOI":"10.1609\/aaai.v29i1.9785"},{"key":"37_CR34","doi-asserted-by":"crossref","unstructured":"Kainmueller, D., Jug, F., Rother, C., Myers, G.: Active graph matching for automatic joint segmentation and annotation of C. elegans. In: Proceedings of the International Conference on Medical Image Computing and Computer Assisted Intervention (2014)","DOI":"10.1007\/978-3-319-10404-1_11"},{"key":"37_CR35","doi-asserted-by":"publisher","unstructured":"Kainmueller, D., Jug, F., Rother, C., Myers, G.: Graph matching problems for annotating C. elegans (2017). https:\/\/doi.org\/10.15479\/AT:ISTA:57","DOI":"10.15479\/AT:ISTA:57"},{"key":"37_CR36","doi-asserted-by":"crossref","unstructured":"Kappes, J.H., et al.: A comparative study of modern inference techniques for structured discrete energy minimization problems. Int. J. Comput. Vis. 115, 155\u2013184 (2015)","DOI":"10.1007\/s11263-015-0809-x"},{"key":"37_CR37","unstructured":"Kappes, J.H., et al.: OpenGM Benchmark (2015). http:\/\/hciweb2.iwr.uni-heidelberg.de\/opengm\/index.php?l0=benchmark"},{"key":"37_CR38","unstructured":"Kolmogorov, V.: Feature Correspondence via Graph Matching Source Code (2015). https:\/\/pub.ist.ac.at\/~vnk\/software.html#GRAPH-MATCHING"},{"key":"37_CR39","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N.: Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles. In: Proceedings of the European Conference on Computer Vision (2008)","DOI":"10.1007\/978-3-540-88690-7_60"},{"key":"37_CR40","doi-asserted-by":"crossref","unstructured":"Kosowsky, J., Yuille, A.: The invisible hand algorithm: solving the assignment problem with statistical physics. Neural Networks (1994)","DOI":"10.1016\/0893-6080(94)90081-7"},{"key":"37_CR41","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly (1955)","DOI":"10.1002\/nav.3800020109"},{"key":"37_CR42","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: The quadratic assignment problem. Manage. Sci. 9, 586\u2013599 (1963)","DOI":"10.1287\/mnsc.9.4.586"},{"key":"37_CR43","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Hebert, M.: A Spectral Technique for Correspondence Problems Using Pairwise Constraints. In: Proceedings of the IEEE International Conference on Computer Vision (2005)","DOI":"10.1109\/ICCV.2005.20"},{"key":"37_CR44","unstructured":"Leordeanu, M.: Efficient methods for graph matching and MAP inference (2013). https:\/\/sites.google.com\/site\/graphmatchingmethods\/"},{"key":"37_CR45","unstructured":"Leordeanu, M., Hebert, M.: Cars and Motor Models. https:\/\/datasets.d2.mpi-inf.mpg.de\/discrete_cv_problems\/car_motor_graph_matching.zip"},{"key":"37_CR46","unstructured":"Leordeanu, M., Hebert, M., Sukthankar, R.: An Integer projected fixed point method for graph matching and MAP inference. In: Advances in Neural Information Processing Systems (2009)"},{"key":"37_CR47","doi-asserted-by":"crossref","unstructured":"Leordeanu, M., Sukthankar, R., Hebert, M.: Unsupervised Learning for Graph Matching. International Journal of Computer Vision (2012)","DOI":"10.1007\/s11263-011-0442-2"},{"key":"37_CR48","doi-asserted-by":"crossref","unstructured":"Loiola, E.M., Maia de Abreu, N.M., Boaventura-Netto, P.O., Hahn, P., Querido, T.: An analytical survey for the quadratic assignment problem. Eur. J. Oper. Res. (2007)","DOI":"10.1016\/j.ejor.2005.09.032"},{"key":"37_CR49","doi-asserted-by":"crossref","unstructured":"Ma, J., Jiang, X., Fan, A., Jiang, J., Yan, J.: Image matching from handcrafted to deep features: a survey. Int. J. Comput. Vis. 129, 23\u201379 (2021)","DOI":"10.1007\/s11263-020-01359-2"},{"key":"37_CR50","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Rendl, F., Wolkowicz, H.: The Quadratic Assignment Problem - A Survey and Recent Developments. Quadratic Assignment and Related Problems (1993)","DOI":"10.1090\/dimacs\/016\/01"},{"key":"37_CR51","doi-asserted-by":"crossref","unstructured":"Rol\u00ednek, M., Swoboda, P., Zietlow, D., Paulus, A., Musil, V., Martius, G.: Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers. In: Proceedings of the European Conference on Computer Vision (2020)","DOI":"10.1007\/978-3-030-58604-1_25"},{"key":"37_CR52","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Lempitsky, V.S., Szummer, M.: Optimizing binary MRFs via extended roof duality. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2007)","DOI":"10.1109\/CVPR.2007.383203"},{"key":"37_CR53","doi-asserted-by":"crossref","unstructured":"Sahni, S.: Computationally related problems. SIAM J. Comput. 3, 262\u2013279 (1974)","DOI":"10.1137\/0203021"},{"key":"37_CR54","doi-asserted-by":"crossref","unstructured":"Savchynskyy, B.: Discrete graphical models - an optimization perspective. In: Foundations and Trends in Computer Graphics and Vision (2019)","DOI":"10.1561\/9781680836394"},{"key":"37_CR55","doi-asserted-by":"crossref","unstructured":"Sun, H., Zhou, W., Fei, M.: A survey on graph matching in computer vision. In: International Congress on Image and Signal Processing. BioMedical Engineering and Informatics (2020)","DOI":"10.1109\/CISP-BMEI51763.2020.9263681"},{"key":"37_CR56","unstructured":"Swoboda, P.: LPMP Source Code (2021). https:\/\/github.com\/LPMP\/LPMP"},{"key":"37_CR57","doi-asserted-by":"crossref","unstructured":"Swoboda, P., Rother, C., Abu Alhaija, H., Kainmuller, D., Savchynskyy, B.: A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2017)","DOI":"10.1109\/CVPR.2017.747"},{"key":"37_CR58","unstructured":"Torresani, L., Kolmogorov, V., Rother, C.: Hotel and House-sparse Models. https:\/\/datasets.d2.mpi-inf.mpg.de\/discrete_cv_problems\/graph_matching_hotel_house.zip"},{"key":"37_CR59","doi-asserted-by":"crossref","unstructured":"Torresani, L., Kolmogorov, V., Rother, C.: A dual decomposition approach to feature correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 35, 259\u2013271 (2013)","DOI":"10.1109\/TPAMI.2012.105"},{"key":"37_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-030-01225-0_16","volume-title":"Computer Vision \u2013 ECCV 2018","author":"S Tourani","year":"2018","unstructured":"Tourani, S., Shekhovtsov, A., Rother, C., Savchynskyy, B.: MPLP++: fast, parallel dual block-coordinate ascent for dense graphical models. In: Ferrari, V., Hebert, M., Sminchisescu, C., Weiss, Y. (eds.) ECCV 2018. LNCS, vol. 11208, pp. 264\u2013281. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01225-0_16"},{"key":"37_CR61","unstructured":"Tourani, S., Shekhovtsov, A., Rother, C., Savchynskyy, B.: Taxonomy of dual block-coordinate ascent methods for discrete energy minimization. In: Proceedings of the Conference on Artifical Intelligence and Statistics (2020)"},{"key":"37_CR62","doi-asserted-by":"crossref","unstructured":"Vogelstein, J.T., et al.: Fast approximate quadratic programming for graph matching. PLOS ONE (2015)","DOI":"10.1371\/journal.pone.0121002"},{"key":"37_CR63","doi-asserted-by":"crossref","unstructured":"Yan, J., Yin, X.C., Lin, W., Deng, C., Zha, H., Yang, X.: A short survey of recent advances in graph matching. In: Proceedings of the ACM International Conference on Multimedia Retrieval (2016)","DOI":"10.1145\/2911996.2912035"},{"key":"37_CR64","doi-asserted-by":"crossref","unstructured":"Yilmaz, A., Javed, O., Shah, M.: Object tracking: a survey. ACM Comput. 38, 13-es (2006)","DOI":"10.1145\/1177352.1177355"},{"key":"37_CR65","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2008)","DOI":"10.1109\/CVPR.2008.4587500"},{"key":"37_CR66","doi-asserted-by":"crossref","unstructured":"Zhang, Z.: HungarianBP: pairwise matching through max-weight bipartite belief propagation source code (2016). https:\/\/github.com\/zzhang1987\/HungarianBP","DOI":"10.1109\/CVPR.2016.135"},{"key":"37_CR67","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Shi, Q., McAuley, J., Wei, W., Zhang, Y., van den Hengel, A.: Pairwise matching through max-weight bipartite belief propagation. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2016)","DOI":"10.1109\/CVPR.2016.135"},{"key":"37_CR68","unstructured":"Zhou, F.: Implementation of Factorized Graph Matching (2018). https:\/\/github.com\/zhfe99\/fgm"},{"key":"37_CR69","doi-asserted-by":"crossref","unstructured":"Zhou, F., la Torre, F.D.: Factorized graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 38, 1774\u20131789 (2016)","DOI":"10.1109\/TPAMI.2015.2501802"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20050-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T18:05:55Z","timestamp":1701281155000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20050-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031200496","9783031200502"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20050-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tel Aviv","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2022.ecva.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5804","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1645","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.21","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.91","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}