{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:18:41Z","timestamp":1742955521362,"version":"3.40.3"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030585648"},{"type":"electronic","value":"9783030585655"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-58565-5_16","type":"book-chapter","created":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T12:03:19Z","timestamp":1605096199000},"page":"257-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Inference Algorithm for Multi-label MRF-MAP Problems with Clique Size 100"],"prefix":"10.1007","author":[{"given":"Ishant","family":"Shanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siddhant","family":"Bharti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chetan","family":"Arora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. N.","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,12]]},"reference":[{"issue":"11","key":"16_CR1","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1109\/TPAMI.2012.120","volume":"34","author":"R Achanta","year":"2012","unstructured":"Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., S\u00fcsstrunk, S.: SLIC superpixels compared to state-of-the-art superpixel methods. PAMI 34(11), 2274\u20132282 (2012)","journal-title":"PAMI"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Arora, C., Maheshwari, S.: Multi label generic cuts: optimal inference in multi label multi clique MRF-MAP problems. In: CVPR, pp. 1346\u20131353 (2014)","DOI":"10.1109\/CVPR.2014.175"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/34.677269","volume":"20","author":"S Birchfield","year":"1998","unstructured":"Birchfield, S., Tomasi, C.: A pixel dissimilarity measure that is insensitive to image sampling. PAMI 20(4), 401\u2013406 (1998)","journal-title":"PAMI"},{"issue":"11","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell. 23(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR5","unstructured":"Chakrabarty, D., Jain, P., Kothari, P.: Provable submodular minimization using Wolfe\u2019s algorithm. In: NIPS, pp. 802\u2013809 (2014)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/978-3-030-01234-2_49","volume-title":"Computer Vision \u2013 ECCV 2018","author":"L-C Chen","year":"2018","unstructured":"Chen, L.-C., Zhu, Y., Papandreou, G., Schroff, F., Adam, H.: Encoder-decoder with atrous separable convolution for semantic image segmentation. In: Ferrari, V., Hebert, M., Sminchisescu, C., Weiss, Y. (eds.) ECCV 2018. LNCS, vol. 11211, pp. 833\u2013851. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01234-2_49"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11263-011-0437-z","volume":"96","author":"A Delong","year":"2012","unstructured":"Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast approximate energy minimization with label costs. Int. J. Comput. Vis. 96(1), 1\u201327 (2012). https:\/\/doi.org\/10.1007\/s11263-011-0437-z","journal-title":"Int. J. Comput. Vis."},{"key":"16_CR8","unstructured":"Everingham, M., Van Gool, L., Williams, C.K.I., Winn, J., Zisserman, A.: The PASCAL Visual Object Classes Challenge 2012 (VOC2012) Results. http:\/\/www.pascal-network.org\/challenges\/VOC\/voc2012\/workshop\/index.html"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11263-006-7899-4","volume":"70","author":"PF Felzenszwalb","year":"2006","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. Int. J. Comput. Vis. 70(1), 41\u201354 (2006). https:\/\/doi.org\/10.1007\/s11263-006-7899-4","journal-title":"Int. J. Comput. Vis."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Fix, A., Gruber, A., Boros, E., Zabih, R.: A graph cut algorithm for higher-order Markov random fields. In: ICCV, pp. 1020\u20131027 (2011)","DOI":"10.1109\/ICCV.2011.6126347"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Fix, A., Wang, C., Zabih, R.: A primal-dual algorithm for higher-order multilabel Markov random fields. In: CVPR, pp. 1138\u20131145 (2014)","DOI":"10.1109\/CVPR.2014.149"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Freedman, D., Drineas, P.: Energy minimization via graph cuts: settling what is possible. In: CVPR, pp. 939\u2013946 (2005)","DOI":"10.1109\/CVPR.2005.143"},{"key":"16_CR13","unstructured":"Fujishige, S., Hayashi, T., Isotani, S.: The minimum-norm-point algorithm applied to submodular function minimization and linear programming (2006)"},{"key":"16_CR14","first-page":"3","volume":"7","author":"S Fujishige","year":"2011","unstructured":"Fujishige, S., Isotani, S.: A submodular function minimization algorithm based on the minimum-norm base. Pac. J. Optim. 7, 3\u201317 (2011)","journal-title":"Pac. J. Optim."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Gallagher, A.C., Batra, D., Parikh, D.: Inference for order reduction in Markov random fields. In: CVPR, pp. 1857\u20131864 (2011)","DOI":"10.1109\/CVPR.2011.5995452"},{"key":"16_CR16","unstructured":"Globerson, A., Jaakkola, T.S.: Fixing max-product: convergent message passing algorithms for map LP-relaxations. In: NIPS, pp. 553\u2013560 (2008)"},{"issue":"Dec","key":"16_CR17","first-page":"3533","volume":"13","author":"S Gould","year":"2012","unstructured":"Gould, S.: Darwin: a framework for machine learning and computer vision research and development. JMLR 13(Dec), 3533\u20133537 (2012)","journal-title":"JMLR"},{"issue":"12","key":"16_CR18","doi-asserted-by":"publisher","first-page":"6294","DOI":"10.1109\/TIT.2010.2079014","volume":"56","author":"T Hazan","year":"2010","unstructured":"Hazan, T., Shashua, A.: Norm-product belief propagation: primal-dual message-passing for approximate inference. Inf. Theory 56(12), 6294\u20136316 (2010)","journal-title":"Inf. Theory"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Ishikawa, H.: Higher-order clique reduction without auxiliary variables. In: CVPR, pp. 1362\u20131369 (2014)","DOI":"10.1109\/CVPR.2014.177"},{"issue":"10","key":"16_CR20","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TPAMI.2003.1233908","volume":"25","author":"H Ishikawa","year":"2003","unstructured":"Ishikawa, H.: Exact optimization for Markov random fields with convex priors. PAMI 25(10), 1333\u20131336 (2003)","journal-title":"PAMI"},{"issue":"6","key":"16_CR21","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1109\/TPAMI.2010.91","volume":"33","author":"H Ishikawa","year":"2011","unstructured":"Ishikawa, H.: Transformation of general binary MRF minimization to the first-order case. TPAMI 33(6), 1234\u20131249 (2011)","journal-title":"TPAMI"},{"issue":"4","key":"16_CR22","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. JACM 48(4), 761\u2013777 (2001)","journal-title":"JACM"},{"key":"16_CR23","unstructured":"Jegelka, S., Bach, F., Sra, S.: Reflection methods for user-friendly submodular optimization. In: NIPS, pp. 1313\u20131321 (2013)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Kahl, F., Strandmark, P.: Generalized roof duality for pseudo-Boolean optimization. In: ICCV, pp. 255\u2013262 (2011)","DOI":"10.1109\/ICCV.2011.6126250"},{"issue":"2","key":"16_CR25","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11263-015-0809-x","volume":"115","author":"JH Kappes","year":"2015","unstructured":"Kappes, J.H., et al.: A comparative study of modern inference techniques for structured discrete energy minimization problems. IJCV 115(2), 155\u2013184 (2015). https:\/\/doi.org\/10.1007\/s11263-015-0809-x","journal-title":"IJCV"},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s11263-008-0202-0","volume":"82","author":"P Kohli","year":"2009","unstructured":"Kohli, P., Torr, P.H., et al.: Robust higher order potentials for enforcing label consistency. IJCV 82(3), 302\u2013324 (2009). https:\/\/doi.org\/10.1007\/s11263-008-0202-0","journal-title":"IJCV"},{"key":"16_CR27","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D Koller","year":"2009","unstructured":"Koller, D., Friedman, N., Bach, F.: Probabilistic Graphical Models: Principles and Techniques. MIT Press, Cambridge (2009)"},{"issue":"10","key":"16_CR28","doi-asserted-by":"publisher","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V Kolmogorov","year":"2006","unstructured":"Kolmogorov, V.: Convergent tree-reweighted message passing for energy minimization. PAMI 28(10), 1568\u20131583 (2006)","journal-title":"PAMI"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-22993-0_37","volume-title":"Mathematical Foundations of Computer Science 2011","author":"V Kolmogorov","year":"2011","unstructured":"Kolmogorov, V.: Submodularity on a tree: unifying $$L^\\natural $$-convex and bisubmodular functions. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 400\u2013411. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_37"},{"issue":"15","key":"16_CR30","doi-asserted-by":"publisher","first-page":"2246","DOI":"10.1016\/j.dam.2012.05.025","volume":"160","author":"V Kolmogorov","year":"2012","unstructured":"Kolmogorov, V.: Minimizing a sum of submodular functions. Discrete Appl. Math. 160(15), 2246\u20132258 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"16_CR31","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1109\/TPAMI.2014.2363465","volume":"37","author":"V Kolmogorov","year":"2015","unstructured":"Kolmogorov, V.: A new look at reweighted message passing. TPAMI 37(5), 919\u2013930 (2015)","journal-title":"TPAMI"},{"issue":"2","key":"16_CR32","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabin, R.: What energy functions can be minimized via graph cuts? TPAMI 26(2), 147\u2013159 (2004)","journal-title":"TPAMI"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N.: Beyond pairwise energies: efficient optimization for higher-order MRFs. In: 2009 IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2009, pp. 2985\u20132992. IEEE (2009)","DOI":"10.1109\/CVPR.2009.5206846"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"McCormick, S.T.: Submodular function minimization (2005)","DOI":"10.1016\/S0927-0507(05)12007-6"},{"issue":"3","key":"16_CR35","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1137\/S1052623402419005","volume":"14","author":"K Murota","year":"2004","unstructured":"Murota, K.: On steepest descent algorithms for discrete convex functions. SIAM J. Optim. 14(3), 699\u2013707 (2004)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"16_CR36","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-007-0189-2","volume":"118","author":"JB Orlin","year":"2009","unstructured":"Orlin, J.B.: A faster strongly polynomial time algorithm for submodular function minimization. Math. Program. 118(2), 237\u2013251 (2009). https:\/\/doi.org\/10.1007\/s10107-007-0189-2","journal-title":"Math. Program."},{"key":"16_CR37","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J Pearl","year":"2014","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Burlington (2014)"},{"issue":"1","key":"16_CR38","first-page":"39","volume":"112","author":"B Potetz","year":"2008","unstructured":"Potetz, B., Lee, T.S.: Efficient belief propagation for higher-order cliques using linear constraint nodes. CVIU 112(1), 39\u201354 (2008)","journal-title":"CVIU"},{"key":"16_CR39","unstructured":"Ramalingam, S., Russell, C., Ladicky, L., Torr, P.H.: Efficient minimization of higher order submodular functions using monotonic Boolean functions. arXiv preprint arXiv:1109.2304 (2011)"},{"issue":"2","key":"16_CR40","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s11263-008-0197-6","volume":"82","author":"S Roth","year":"2009","unstructured":"Roth, S., Black, M.J.: Fields of experts. IJCV 82(2), 205\u2013229 (2009). https:\/\/doi.org\/10.1007\/s11263-008-0197-6","journal-title":"IJCV"},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing sparse higher order energy functions of discrete variables. In: CVPR, pp. 1382\u20131389 (2009)","DOI":"10.1109\/CVPR.2009.5206739"},{"issue":"1\u20133","key":"16_CR42","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1014573219977","volume":"47","author":"D Scharstein","year":"2002","unstructured":"Scharstein, D., Szeliski, R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV 47(1\u20133), 7\u201342 (2002). https:\/\/doi.org\/10.1023\/A:1014573219977","journal-title":"IJCV"},{"issue":"2","key":"16_CR43","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"80","author":"A Schrijver","year":"2000","unstructured":"Schrijver, A.: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Comb. Theory Ser. B 80(2), 346\u2013355 (2000)","journal-title":"J. Comb. Theory Ser. B"},{"key":"16_CR44","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Heidelberg (2003)"},{"key":"16_CR45","doi-asserted-by":"crossref","unstructured":"Shanu, I., Arora, C., Maheshwari, S.: Inference in higher order MRF-map problems with small and large cliques. In: CVPR, pp. 7883\u20137891 (2018)","DOI":"10.1109\/CVPR.2018.00822"},{"key":"16_CR46","doi-asserted-by":"crossref","unstructured":"Shanu, I., Arora, C., Singla, P.: Min norm point algorithm for higher order MRF-MAP inference. In: CVPR, pp. 5365\u20135374 (2016)","DOI":"10.1109\/CVPR.2016.579"},{"key":"16_CR47","first-page":"219","volume":"1","author":"D Sontag","year":"2011","unstructured":"Sontag, D., Globerson, A., Jaakkola, T.: Introduction to dual decomposition for inference. Optim. Mach. Learn. 1, 219\u2013254 (2011)","journal-title":"Optim. Mach. Learn."},{"issue":"6","key":"16_CR48","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R Szeliski","year":"2008","unstructured":"Szeliski, R., et al.: A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. TPAMI 30(6), 1068\u20131080 (2008)","journal-title":"TPAMI"},{"key":"16_CR49","unstructured":"Tarlow, D., Givoni, I.E., Zemel, R.S.: HOP-MAP: efficient message passing with high order potentials. In: AISTATS (2010)"},{"key":"16_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-642-33783-3_29","volume-title":"Computer Vision \u2013 ECCV 2012","author":"T Windheuser","year":"2012","unstructured":"Windheuser, T., Ishikawa, H., Cremers, D.: Generalized roof duality for multi-label optimization: optimal lower bounds and persistency. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7577, pp. 400\u2013413. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33783-3_29"},{"key":"16_CR51","doi-asserted-by":"crossref","unstructured":"Woodford, O., Torr, P., Reid, I., Fitzgibbon, A.: Global stereo reconstruction under second order smoothness priors. In: CVPR, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587672"},{"key":"16_CR52","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Generalized belief propagation. In: Advances in Neural Information Processing Systems, pp. 689\u2013695 (2001)"},{"key":"16_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, J., Djolonga, J., Krause, A.: Higher-order inference for multi-class log-supermodular models. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 1859\u20131867 (2015)","DOI":"10.1109\/ICCV.2015.216"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58565-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T00:05:58Z","timestamp":1731283558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58565-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030585648","9783030585655"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58565-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"12 November 2020","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":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eccv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eccv2020.eu\/","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":"OpenReview","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5025","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":"1360","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":"27% - 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","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":"7","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}