{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:26:27Z","timestamp":1725578787392},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642193149"},{"type":"electronic","value":"9783642193156"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19315-6_10","type":"book-chapter","created":{"date-parts":[[2011,3,2]],"date-time":"2011-03-02T23:52:17Z","timestamp":1299109937000},"page":"121-134","source":"Crossref","is-referenced-by-count":3,"title":["Solving MRFs with Higher-Order Smoothness Priors Using Hierarchical Gradient Nodes"],"prefix":"10.1007","author":[{"given":"Dongjin","family":"Kwon","sequence":"first","affiliation":[]},{"given":"Kyong Joon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Il Dong","family":"Yun","sequence":"additional","affiliation":[]},{"given":"Sang Uk","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1109\/18.910585","volume":"47","author":"Y. Weiss","year":"2001","unstructured":"Weiss, Y., Freeman, W.T.: On the Optimality of Solutions of the Max-Product Belief-Propagation Algorithm in Arbitrary Graphs. IEEE Trans. Inf. Theory\u00a047, 736\u2013744 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"2282","DOI":"10.1109\/TIT.2005.850085","volume":"51","author":"J.S. Yedidia","year":"2005","unstructured":"Yedidia, J.S., Freeman, W.T., Weiss, Y.: Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms. IEEE Trans. Inf. Theory\u00a051, 2282\u20132312 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR3","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.\u00a023, 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR4","unstructured":"Boykov, Y., Jolly, M.P.: Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images. In: ICCV (2001)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Glocker, B., Komodakis, N., Paragios, N., Tziritas, G., Navab, N.: Inter and Intra-modal Deformable Registration: Continuous Deformations Meet Efficient Optimal Linear Programming. In: IPMI (2007)","DOI":"10.1007\/978-3-540-73273-0_34"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-540-88682-2_29","volume-title":"Computer Vision \u2013 ECCV 2008","author":"D. Kwon","year":"2008","unstructured":"Kwon, D., Lee, K.J., Yun, I.D., Lee, S.U.: Nonrigid Image Registration Using Dynamic Higher-Order MRF Model. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part I. LNCS, vol.\u00a05302, pp. 373\u2013386. Springer, Heidelberg (2008)"},{"key":"10_CR7","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. Int. J. Comput. Vision\u00a082, 205\u2013229 (2009)","journal-title":"Int. J. Comput. Vision"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1109\/TPAMI.2008.99","volume":"31","author":"Q. Yang","year":"2009","unstructured":"Yang, Q., Wang, L., Yang, R., Stew\u00e9nius, H., Nist\u00e9r, D.: Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling. IEEE Trans. Pattern Anal. Mach. Intell.\u00a031, 492\u2013504 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kohli, P., Kumar, M.P., Torr, P.H.S.: P3 & Beyond: Solving Energies with Higher Order Cliques. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383204"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Kohli, P., Ladick\u00fd, L., Torr, P.H.S.: Robust Higher Order Potentials for Enforcing Label Consistency. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587417"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Rother, C., Kohli, P., Feng, W., Jia, J.: Minimizing Sparse Higher Order Energy Functions of Discrete Variables. In: CVPR (2009)","DOI":"10.1109\/CVPR.2009.5206739"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Ishikawa, H.: Higher-Order Clique Reduction in Binary Graph Cut. In: CVPR (2009)","DOI":"10.1109\/CVPR.2009.5206689"},{"key":"10_CR13","unstructured":"Liao, L., Fox, D., Kautz, H.: Location-based Activity Recognition. In: NIPS (2005)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Potetz, B.: Efficient Belief Propagation for Vision Using Linear Constraint Nodes. In: CVPR (2007)","DOI":"10.1109\/CVPR.2007.383094"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N.: Beyond Pairwise Energies: Efficient Optimization for Higher-order MRFs. In: CVPR (2009)","DOI":"10.1109\/CVPR.2009.5206846"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Paragios, N., Tziritas, G.: MRF Optimization via Dual Decomposition: Message-Passing Revisited. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4408890"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1109\/18.910572","volume":"47","author":"F.R. Kschischang","year":"2001","unstructured":"Kschischang, F.R., Frey, B.J., Loeliger, H.A.: Factor Graphs and the Sum-Product Algorithm. IEEE Trans. Inf. Theory\u00a047, 498\u2013519 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1109\/TIT.2005.856938","volume":"51","author":"M.J. Wainwright","year":"2005","unstructured":"Wainwright, M.J., Jaakkola, T., Willsky, A.S.: MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming. IEEE Trans. Inf. Theory\u00a051, 3697\u20133717 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR19","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. IEEE Trans. Pattern Anal. Mach. Intell.\u00a028, 1568\u20131583 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11744047_2","volume-title":"Computer Vision \u2013 ECCV 2006","author":"R. Szeliski","year":"2006","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., Rother, C.: A Comparative Study of Energy Minimization Methods for Markov Random Fields. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006. LNCS, vol.\u00a03952, pp. 16\u201329. Springer, Heidelberg (2006)"},{"key":"10_CR21","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. IEEE Trans. Pattern Anal. Mach. Intell.\u00a020, 401\u2013406 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10_CR22","unstructured":"Middlebury stereo datasets, http:\/\/vision.middlebury.edu\/stereo\/data"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19315-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T13:21:54Z","timestamp":1685971314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19315-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642193149","9783642193156"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19315-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}