{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T05:36:20Z","timestamp":1736573780618,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540444121"},{"type":"electronic","value":"9783540444145"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11861898_68","type":"book-chapter","created":{"date-parts":[[2006,9,16]],"date-time":"2006-09-16T10:37:43Z","timestamp":1158403063000},"page":"677-687","source":"Crossref","is-referenced-by-count":1,"title":["A Multiple Graph Cut Based Approach for Stereo Analysis"],"prefix":"10.1007","author":[{"given":"Ulas","family":"Vural","sequence":"first","affiliation":[]},{"given":"Yusuf Sinan","family":"Akgul","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","unstructured":"Akgul, Y., Kambhamettu, C., Stone, M.: A task-specific contour tracker for ultrasound. In: IEEE Workshop on Mathematical Methods in Biomedical Image Analysis (2000)"},{"key":"68_CR2","doi-asserted-by":"crossref","unstructured":"Akgul, Y.S., Kambhamettu, C.: Recovery and tracking of continuous 3D surfaces from stereo data using a deformable dual-mesh. In: International Conference on Computer Vision, pp. 765\u2013772 (1999)","DOI":"10.1109\/ICCV.1999.790299"},{"issue":"3","key":"68_CR3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.isprsjprs.2005.02.008","volume":"59","author":"M. Bleyer","year":"2005","unstructured":"Bleyer, M., Gelautz, M.: A layered stereo matching algorithm using image segmentation and global visibility constraints. ISPRS Journal of Photogrammetry and Remote Sensing\u00a059(3), 128\u2013150 (2005)","journal-title":"ISPRS Journal of Photogrammetry and Remote Sensing"},{"key":"68_CR4","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. In: EMMCVPR 2002, p. 359 (2002)","DOI":"10.1007\/3-540-44745-8_24"},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Markov random fields with efficient approximations. In: IEEE Computer Vision and Pattern Recognition or CVPR, pp. 648\u2013655 (1998)","DOI":"10.1109\/CVPR.1998.698673"},{"issue":"11","key":"68_CR6","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 Transactions on Pattern Analysis and Machine Intelligence\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Freedman, D., Drineas, P.: Energy minimization via graph cuts: settling what is possible. In: IEEE Computer Vision and Pattern Recognition, pp. II:939\u2013II:946 (2004)","DOI":"10.1109\/CVPR.2005.143"},{"issue":"2","key":"68_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"D. Greig","year":"1989","unstructured":"Greig, D., Porteous, B., Seheult, A.: Exact maximum a posterori estimation for binary images. Journal Royal Statistical Society\u00a0B 51(2), 271\u2013279 (1989)","journal-title":"Journal Royal Statistical Society"},{"key":"68_CR9","volume-title":"Robot Vision","author":"B.K.P. Horn","year":"1986","unstructured":"Horn, B.K.P.: Robot Vision. MIT Press, Cambridge (1986)"},{"issue":"10","key":"68_CR10","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. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a025(10), 1333\u20131336 (2003)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"68_CR11","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Computing visual correspondence with occlusions via graph cuts. In: International Conference on Computer Vision, pp. II:508\u2013II:515 (2001)","DOI":"10.1109\/ICCV.2001.937668"},{"key":"68_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-47977-5_6","volume-title":"Computer Vision - ECCV 2002","author":"V. Kolmogorov","year":"2002","unstructured":"Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds.) ECCV 2002. LNCS, vol.\u00a02352, pp. 82\u201396. Springer, Heidelberg (2002)"},{"issue":"2","key":"68_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., Zabih, R.: What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a026(2), 147\u2013159 (2004)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1-3","key":"68_CR14","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. International Journal of Computer Vision\u00a047(1-3), 7\u201342 (2002)","journal-title":"International Journal of Computer Vision"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11861898_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T21:49:33Z","timestamp":1736545773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11861898_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540444121","9783540444145"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11861898_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}