{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T17:01:48Z","timestamp":1777654908701,"version":"3.51.4"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030695347","type":"print"},{"value":"9783030695354","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69535-4_32","type":"book-chapter","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T15:13:11Z","timestamp":1614179591000},"page":"523-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast and Differentiable Message Passing on Pairwise Markov Random Fields"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8283-6095","authenticated-orcid":false,"given":"Zhiwei","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6431-0775","authenticated-orcid":false,"given":"Thalaiyasingam","family":"Ajanthan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5005-0191","authenticated-orcid":false,"given":"Richard","family":"Hartley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,25]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/TPAMI.2007.1166","volume":"30","author":"H Hirschmuller","year":"2008","unstructured":"Hirschmuller, H.: Stereo processing by semiglobal matching and mutual information. TPAMI 30, 328\u2013341 (2008)","journal-title":"TPAMI"},{"key":"32_CR2","unstructured":"Boykov, Y., Jolly, M.: Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In: ICCV (2011)"},{"key":"32_CR3","unstructured":"Hassner, M., Sklansky, J.: The use of Markov random fields as models of texture. Comput. Graph. Image Process. 12(4), 357\u2013370 (1980)"},{"key":"32_CR4","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, 1068\u20131080 (2008)","journal-title":"TPAMI"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Zheng, S., et al.: Conditional random fields as recurrent neural networks. In: CVPR (2015)","DOI":"10.1109\/ICCV.2015.179"},{"key":"32_CR6","unstructured":"Kr\u00e4henb\u00fchl, P., Koltunz, V.: Efficient inference in fully connected CRFs with Gaussian edge potentials. In: NeurIPS (2011)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Seki, A., Pollefeys, M.: SGM-Nets: semi-global matching with neural networks. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.703"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Drory, A., Haubold, C., Avidan, S., Hamprecht, F.A.: Semi-global matching: a principled derivation in terms of message passing. In: Proceedings of German Conference on Pattern Recognition (GCPR) (2014)","DOI":"10.1007\/978-3-319-11752-2_4"},{"key":"32_CR9","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. TPAMI 28, 1568\u20131583 (2006)","journal-title":"TPAMI"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Ajanthan, T., Hartley, R., Salzmann, M.: Memory efficient max-flow for multi-label submodular MRFs. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.632"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Ajanthan, T., Hartley, R., Salzmann, M., Li, H.: Iteratively reweighted graph cut for multi-label MRFs with non-convex priors. In: CVPR (2015)","DOI":"10.1109\/CVPR.2015.7299150"},{"key":"32_CR12","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. TPAMI 23, 1222\u20131239 (2001)","journal-title":"TPAMI"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Carr, P., Hartley, R.: Solving multilabel graph cut problems with multilabel swap. In: DICTA (2009)","DOI":"10.1109\/DICTA.2009.90"},{"key":"32_CR14","unstructured":"Hartley, R., Ajanthan, T.: Generalized range moves. arXiv:1811.09171 (2018)"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11263-011-0491-6","volume":"98","author":"O Veksler","year":"2012","unstructured":"Veksler, O.: Multi-label moves for MRFs with truncated convex priors. IJCV 98, 1\u201314 (2012). https:\/\/doi.org\/10.1007\/s11263-011-0491-6","journal-title":"IJCV"},{"key":"32_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5014-9","volume-title":"Learning in Graphical Models","author":"M Jordan","year":"1998","unstructured":"Jordan, M.: Learning in Graphical Models. MIT Press, Cambridge (1998)"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-19315-6_10","volume-title":"Computer Vision \u2013 ACCV 2010","author":"D Kwon","year":"2011","unstructured":"Kwon, D., Lee, K.J., Yun, I.D., Lee, S.U.: Solving MRFs with higher-order smoothness priors using hierarchical gradient nodes. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010. LNCS, vol. 6492, pp. 121\u2013134. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19315-6_10"},{"key":"32_CR18","unstructured":"Murphy, K., Weiss, Y., Jordan, M.: Loopy belief propagation for approximate inference: an empirical study. In: UAI (1999)"},{"key":"32_CR19","volume-title":"Probabilistic Reasoning in Intelligent Systems","author":"J Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Burlington (1988)"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000001","volume":"1","author":"MJ Wainwright","year":"2008","unstructured":"Wainwright, M.J., Jordan, M.I.: Graphical models, exponential families, and variational inference. Found. Trends Mach. Learn. 1, 1\u2013305 (2008)","journal-title":"Found. Trends Mach. Learn."},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-319-16817-3_19","volume-title":"Computer Vision \u2013 ACCV 2014","author":"Z Wang","year":"2015","unstructured":"Wang, Z., Zhang, Z., Geng, N.: A message passing algorithm for MRF inference with unknown graphs and its applications. In: Cremers, D., Reid, I., Saito, H., Yang, M.-H. (eds.) ACCV 2014. LNCS, vol. 9006, pp. 288\u2013302. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16817-3_19"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Kappes, J., et al.: A comparative study of modern inference techniques for discrete energy minimization problems. In: CVPR (2013)","DOI":"10.1109\/CVPR.2013.175"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"2454","DOI":"10.1109\/TPAMI.2013.31","volume":"35","author":"J Domke","year":"2013","unstructured":"Domke, J.: Learning graphical model parameters with approximate marginal inference. TPAMI 35, 2454\u20132467 (2013)","journal-title":"TPAMI"},{"key":"32_CR24","volume-title":"Max-Margin Markov Networks","author":"B Taskar","year":"2003","unstructured":"Taskar, B., Guestrin, C., Koller, D.: Max-Margin Markov Networks. MIT Press, Cambridge (2003)"},{"key":"32_CR25","first-page":"1453","volume":"6","author":"I Tsochantaridis","year":"2005","unstructured":"Tsochantaridis, I., Joachims, T., Hofmann, T., Altun, Y.: Large margin methods for structured and interdependent output variables. JMLR 6, 1453\u20131484 (2005)","journal-title":"JMLR"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Liu, Z., Li, X., Luo, P., Loy, C.C., Tang, X.: Semantic image segmentation via deep parsing network. In: ICCV (2015)","DOI":"10.1109\/ICCV.2015.162"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Lin, G., Shen, C., Hengel, A., Reid, I.: Efficient piecewise training of deep structured models for semantic segmentation. In: CVPR (2016)","DOI":"10.1109\/CVPR.2016.348"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, F., Prisacariu, V., Yang, R., Torr, P.H.: GA-Net: guided aggregation net for end-to-end stereo matching. In: CVPR (2019)","DOI":"10.1109\/CVPR.2019.00027"},{"key":"32_CR29","doi-asserted-by":"crossref","unstructured":"Knobelreiter, P., Reinbacher, C., Shekhovtsov, A., Pock, T.: End-to-end training of hybrid CNN-CRF models for stereo. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.159"},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Facciolo, G., Franchis, C., Meinhardt, E.: MGM: a significantly more global matching for stereo vision. In: BMVC (2015)","DOI":"10.5244\/C.29.90"},{"key":"32_CR31","doi-asserted-by":"crossref","unstructured":"Hernandez-Juare, D., Chacon, A., Espinosa, A., Vazquez, D., Moure, J., Lopez, A.M.L.: Embedded real-time stereo estimation via semi-global matching on the GPU. In: International Conference on Computational Sciences (2016)","DOI":"10.1016\/j.procs.2016.05.305"},{"key":"32_CR32","unstructured":"Wainwright, M., Jaakkola, T., Willsky, A.: MAP estimation via agreement on (hyper) trees: message-passing and linear-programming approaches. Trans. Inf. Theory 51(11), 3697\u20133717 (2005)"},{"key":"32_CR33","first-page":"46","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry standard API for shared-memory programming. Comput. Sci. Eng. 5, 46\u201355 (1998)","journal-title":"Comput. Sci. Eng."},{"key":"32_CR34","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. Int. J. Comput. Vis. 47, 7\u201342 (2002). https:\/\/doi.org\/10.1023\/A:1014573219977","journal-title":"Int. J. Comput. Vis."},{"key":"32_CR35","unstructured":"Scharstein, D., Szeliski, R.: High-accuracy stereo depth maps using structured light. In: CVPR (2003)"},{"key":"32_CR36","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.isprsjprs.2017.09.013","volume":"140","author":"M Menze","year":"2018","unstructured":"Menze, M., Heipke, C., Geiger, A.: Object scene flow. ISPRS J. Photogram. Remote Sens. 140, 60\u201376 (2018)","journal-title":"ISPRS J. Photogram. Remote Sens."},{"key":"32_CR37","doi-asserted-by":"crossref","unstructured":"Menze, M., Heipke, C., Geiger, A.: Joint 3D estimation of vehicles and scene flow. In: ISPRS Workshop on Image Sequence Analysis (2015)","DOI":"10.5194\/isprsannals-II-3-W5-427-2015"},{"key":"32_CR38","doi-asserted-by":"crossref","unstructured":"Schops, T., et al.: A multi-view stereo benchmark with high-resolution images and multi-camera videos. In: CVPR (2017)","DOI":"10.1109\/CVPR.2017.272"},{"key":"32_CR39","volume-title":"Multiple View Geometry in Computer Vision","author":"R Hartley","year":"2003","unstructured":"Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2003)"},{"key":"32_CR40","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"},{"key":"32_CR41","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/s11263-014-0733-5","volume":"111","author":"M Everingham","year":"2015","unstructured":"Everingham, M., Eslami, S., Gool, L., Williams, C., Winn, J., Zisserman, A.: The pascal visual object classes challenge a retrospective. Int. J. Comput. Vis. 111, 98\u2013136 (2015). https:\/\/doi.org\/10.1007\/s11263-014-0733-5","journal-title":"Int. J. Comput. Vis."},{"key":"32_CR42","doi-asserted-by":"crossref","unstructured":"Hariharan, B., Arbelaez, P., Bourdev, L., Maji, S., Malik, J.: Semantic contours from inverse detectors. In: ICCV (2011)","DOI":"10.1109\/ICCV.2011.6126343"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69535-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T16:02:13Z","timestamp":1614182533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69535-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030695347","9783030695354"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69535-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"accv2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/accv2020.kyoto\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"768","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":"254","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":"33% - 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":"3","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.","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)"}}]}}