{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T07:02:44Z","timestamp":1725606164414},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642228186"},{"type":"electronic","value":"9783642228193"}],"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-22819-3_9","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T07:05:32Z","timestamp":1315638332000},"page":"82-91","source":"Crossref","is-referenced-by-count":0,"title":["Shortest Path Based Planar Graph Cuts for Bi-layer Segmentation of Binocular Stereo Video"],"prefix":"10.1007","author":[{"given":"Xiangsheng","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lujin","family":"Gong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: Proc. 15th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 531\u2013540 (2004)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1103963.1103966","volume":"1","author":"S. Alstrup","year":"2005","unstructured":"Alstrup, S., Holm, J., De Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms\u00a01(2), 243\u2013264 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Baker, S., Szeliski, R., Anandan, P.: A layered approach to stereo reconstruction. In: Proc. CVPR, Santa Barbara, pp. 434\u2013441 (1998)","DOI":"10.1109\/CVPR.1998.698642"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Jolly, M.-P.: Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In: Proc. Int. Conf. on Computer Vision (2001)","DOI":"10.1109\/ICCV.2001.937505"},{"issue":"9","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"26","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., Kolmogorov, V.: An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE PAMI\u00a026(9), 1124\u20131137 (2004)","journal-title":"IEEE PAMI"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on PAMI\u00a023(11) (2001)","DOI":"10.1109\/34.969114"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Criminisi, A., Shotton, J., Blake, A., Torr, P.H.S.: Gaze manipulation for one to one teleconferencing. In: Proc. ICCV (2003)","DOI":"10.1109\/ICCV.2003.1238340"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Erickson, J.: Maximum flows and parametric shortest paths in planar graphs. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (2010)","DOI":"10.1137\/1.9781611973075.65"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01679683","volume":"14","author":"D. Geiger","year":"1995","unstructured":"Geiger, D., Ladendorf, B., Yuille, A.: Occlusions and binocular stereo. Int. J. Computer Vision\u00a014, 211\u2013226 (1995)","journal-title":"Int. J. Computer Vision"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Jojic, N., Frey, B.: Learning flexible sprites in video layers. In: Proc. CVPR, Hawaii (2001)","DOI":"10.1109\/CVPR.2001.990476"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Criminisi, A., Blake, A., Cross, G., Rother, C.: Probabilistic fusion of stereo with color and contrast for bilayer segmentation. PAMI\u00a028(8) (2006)","DOI":"10.1109\/TPAMI.2006.193"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Kolmogorov, V., Zabih, R.: Multi-camera scene reconstruction via graph cuts. In: Proc. ECCV, Copenhagen, Denmark (2002)","DOI":"10.1007\/3-540-47977-5_6"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Mortensen, E.N., Barrett, W.A.: Intelligent Scissors for Image Composition. In: Computer Graphics (SIGGRAPH 1995), Los Angeles, California, pp. 191\u2013198 (1995)","DOI":"10.1145\/218380.218442"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Rother, C., Kolmogorov, V., Blake, A.: GrabCut\u2013Interactive foreground extraction using iterated graph cuts. In: Proc. ACM Siggraph (2004)","DOI":"10.1145\/1186562.1015720"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0262-8856(96)01103-1","volume":"14","author":"S.M. Rowe","year":"1996","unstructured":"Rowe, S.M., Blake, A.: Statistical mosaics for tracking. J. Image and Vision Computing\u00a014, 549\u2013564 (1996)","journal-title":"J. Image and Vision Computing"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: JCSS, pp. 362\u2013391 (1981)","DOI":"10.1145\/800076.802464"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Stauffer, C., Grimson, W.E.L.: Adaptive background mixture models for real-time tracking. In: Proc. CVPR, pp. 246\u2013252 (1999)","DOI":"10.1109\/CVPR.1999.784637"},{"key":"9_CR18","unstructured":"Tarjan, R.E., Werneck, R.F.: Self-adjusting top trees. In: Proc. 16th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 813\u2013822 (2005)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Torr, P.H.S., Szeliski, R., Anandan, P.: An integrated Baysesian approach to layer extraction from image sequences. PAMI (2001)","DOI":"10.1109\/34.910882"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2010 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22819-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T07:51:42Z","timestamp":1560585102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22819-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642228186","9783642228193"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22819-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}