{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:49:09Z","timestamp":1725896949122},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370663"},{"type":"electronic","value":"9783642370670"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37067-0_30","type":"book-chapter","created":{"date-parts":[[2013,3,16]],"date-time":"2013-03-16T09:52:31Z","timestamp":1363427551000},"page":"347-359","source":"Crossref","is-referenced-by-count":0,"title":["Concurrency Relations between Digital Planes"],"prefix":"10.1007","author":[{"given":"Peter","family":"Veelaert","sequence":"first","affiliation":[]},{"given":"Maarten","family":"Slembrouck","sequence":"additional","affiliation":[]},{"given":"Dirk","family":"Van Haerenborgh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"He, P., Edalat, A.: Visual hull from imprecise polyhedral scene. In: Goesele, M., Matsushita, Y., Sagawa, R., Yang, R. (eds.) 3DIMPVT, pp. 164\u2013171. IEEE (2011)","DOI":"10.1109\/3DIMPVT.2011.28"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/34.273735","volume":"16","author":"A. Laurentini","year":"1994","unstructured":"Laurentini, A.: The visual hull concept for silhouette-based image understanding. IEEE Trans. Pattern Anal. Mach. Intell.\u00a016(2), 150\u2013162 (1994)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S0218195998000229","volume":"8","author":"S. Petitjean","year":"1998","unstructured":"Petitjean, S.: A computational geometric approach to visual hulls. Int. J. Comput. Geometry Appl.\u00a08(4), 407\u2013436 (1998)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Labatut, P., Pons, J.P., Keriven, R.: Efficient multi-view reconstruction of large-scale scenes using interest points, delaunay triangulation and graph cuts. In: ICCV, pp. 1\u20138. IEEE (2007)","DOI":"10.1109\/ICCV.2007.4408892"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-540-76386-4_72","volume-title":"Computer Vision \u2013 ACCV 2007","author":"H. Kim","year":"2007","unstructured":"Kim, H., Sakamoto, R., Kitahara, I., Toriyama, T., Kogure, K.: Robust Foreground Extraction Technique Using Gaussian Family Model and Multiple Thresholds. In: Yagi, Y., Kang, S.B., Kweon, I.S., Zha, H. (eds.) ACCV 2007, Part I. LNCS, vol.\u00a04843, pp. 758\u2013768. Springer, Heidelberg (2007)"},{"issue":"7","key":"30_CR6","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.patrec.2005.11.005","volume":"27","author":"Z. Zivkovic","year":"2006","unstructured":"Zivkovic, Z., van der Heijden, F.: Efficient adaptive density estimation per image pixel for the task of background subtraction. Pattern Recognition Letters\u00a027(7), 773\u2013780 (2006)","journal-title":"Pattern Recognition Letters"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/TPAMI.1984.4767578","volume":"6","author":"C.E. Kim","year":"1984","unstructured":"Kim, C.E.: Three-dimensional digital planes. IEEE Trans. Pattern Anal. Machine Intell.\u00a06, 639\u2013645 (1984)","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"issue":"5","key":"30_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/gmip.1997.0427","volume":"59","author":"E. Andres","year":"1997","unstructured":"Andres, E., Acharya, R., Sibata, C.: Discrete analytical hyperplanes. Graphical Models and Image Processing\u00a059(5), 302\u2013309 (1997)","journal-title":"Graphical Models and Image Processing"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.dam.2008.05.027","volume":"157","author":"D. Jamet","year":"2009","unstructured":"Jamet, D., Toutant, J.L.: Minimal arithmetic thickness connecting discrete planes. Discrete Applied Mathematics\u00a0157(3), 500\u2013509 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-21073-0_18","volume-title":"Combinatorial Image Analysis","author":"P. Veelaert","year":"2011","unstructured":"Veelaert, P., Heyvaert, M.: Reconstruction of Concurrent Lines from Leaning Points. In: Aggarwal, J.K., Barneva, R.P., Brimkov, V.E., Koroutchev, K.N., Korutcheva, E.R. (eds.) IWCIA 2011. LNCS, vol.\u00a06636, pp. 182\u2013193. Springer, Heidelberg (2011)"},{"issue":"1-3","key":"30_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.dam.2005.02.022","volume":"151","author":"D. Coeurjolly","year":"2005","unstructured":"Coeurjolly, D., Sivignon, I., Dupont, F., Feschet, F., Chassery, J.M.: On digital plane preimage structure. Discrete Applied Mathematics\u00a0151(1-3), 78\u201392 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Veelaert, P.: Algorithms that measure parallelism and concurrency of lines in digital images. In: Proc. of SPIE\u2019s Conference on Vision Geometry VIII, Denver. SPIE, pp. 69\u201379 (1999)","DOI":"10.1117\/12.364114"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-45986-3_26","volume-title":"Discrete Geometry for Computer Imagery","author":"P. Veelaert","year":"2002","unstructured":"Veelaert, P.: Concurrency of Line Segments in Uncertain Geometry. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol.\u00a02301, pp. 289\u2013300. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37067-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T16:11:36Z","timestamp":1557591096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37067-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370663","9783642370670"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37067-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}