{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:38:43Z","timestamp":1757313523590,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,6,18]],"date-time":"2010-06-18T00:00:00Z","timestamp":1276819200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Machine Vision and Applications"],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s00138-010-0278-8","type":"journal-article","created":{"date-parts":[[2010,6,17]],"date-time":"2010-06-17T00:26:57Z","timestamp":1276734417000},"page":"879-887","source":"Crossref","is-referenced-by-count":9,"title":["3D reconstruction of human face based on an improved seeds-growing algorithm"],"prefix":"10.1007","volume":"22","author":[{"given":"Feipeng","family":"Da","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yihuan","family":"Sui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,6,18]]},"reference":[{"key":"278_CR1","doi-asserted-by":"crossref","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)","journal-title":"Int. J. Comput. Vis."},{"key":"278_CR2","first-page":"1169","volume-title":"Image dense matching based on region growth with adaptive window. Pattern Recognition Letters, vol. 23","author":"T. Li","year":"2002","unstructured":"Li T., Wu C.K., Chen Z.Z.: Image dense matching based on region growth with adaptive window. Pattern Recognition Letters, vol. 23, pp. 1169\u20131178. Elsevier, Amsterdam (2002)"},{"key":"278_CR3","doi-asserted-by":"crossref","unstructured":"Kim, J.C., Lee, K.M.: A dense stereo matching using two-pass dynamic programming with generalized ground control points. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, vol. 2, pp. 1075\u20131082 (2005)","DOI":"10.1109\/CVPR.2005.22"},{"key":"278_CR4","unstructured":"Hong, L., Chen, G.: Segment-based stereo matching using graph cuts. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, vol. 1, pp. 174\u2013181 (2004)"},{"key":"278_CR5","doi-asserted-by":"crossref","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient belief propagation for early vision. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, vol. 1, pp. 1261\u20131268 (2004)","DOI":"10.1109\/CVPR.2004.1315041"},{"key":"278_CR6","doi-asserted-by":"crossref","unstructured":"Belhumeur, P.N., Mumford, D.: A Bayesian treatment of the stereo correspondence problem using half-occluded regions. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR, pp. 506\u2013512 (1992)","DOI":"10.1109\/CVPR.1992.223143"},{"key":"278_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1023\/A:1008150329890","volume":"33","author":"A.F. Bobick","year":"1999","unstructured":"Bobick A.F., Intille S.S.: Large occlusion stereo. Int. J. Comput. Vis. 33, 181\u2013200 (1999)","journal-title":"Int. J. Comput. Vis."},{"key":"278_CR8","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TPAMI.2005.44","volume":"27","author":"M. Lhuillier","year":"2005","unstructured":"Lhuillier M., Quan L.: A quasi-dense approach to surface reconstruction from uncalibrated images. IEEE Trans. Pattern Anal. Mach. Intell. 27, 418\u2013433 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"278_CR9","doi-asserted-by":"crossref","unstructured":"Cech, J., Sara, R.: Efficient sampling of disparity space for fast and accurate matching. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR, pp. 1\u20138 (2007)","DOI":"10.1109\/CVPR.2007.383355"},{"key":"278_CR10","doi-asserted-by":"crossref","first-page":"998","DOI":"10.1109\/TPAMI.2005.120","volume":"27","author":"M.L. Gong","year":"2005","unstructured":"Gong M.L., Yang Y.H.: Fast unambiguous stereo matching using reliability-based dynamic programming. IEEE Trans. Pattern Anal. Mach. Intell. 27, 998\u20131003 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"278_CR11","doi-asserted-by":"crossref","unstructured":"Sara, R.: Finding the largest unambiguous component of stereo matching. In: Proceedings of the European Conference on Computer Vision, pp. 900\u2013914. Springer, London (2002)","DOI":"10.1007\/3-540-47977-5_59"},{"key":"278_CR12","unstructured":"Sara, R.: Robust Correspondence Recognition for Computer Vision. Invited Session on Image Analysis. Roma, Italy (2006)"},{"key":"278_CR13","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1109\/34.888718","volume":"20","author":"Z.Y. Zhang","year":"2000","unstructured":"Zhang Z.Y.: A flexible new technique for camera calibration. IEEE Trans. Pattern Anal. Mach. Intell. 20, 1330\u20131334 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"278_CR14","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s001380050120","volume":"12","author":"A. Fusiello","year":"2000","unstructured":"Fusiello A., Trucco E., Verri A.: A compact algorithm for rectification of stereo pairs. Mach. Vis. Appl. 12, 16\u201322 (2000)","journal-title":"Mach. Vis. Appl."},{"key":"278_CR15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1364\/AO.47.000377","volume":"47","author":"F.P. Da","year":"2008","unstructured":"Da F.P., Gai S.Y.: Flexible three-dimensional measurement technique based on a digital light processing projector. Appl. Opt. 47, 377\u2013385 (2008)","journal-title":"Appl. Opt."},{"key":"278_CR16","doi-asserted-by":"crossref","unstructured":"Bleyer, M., Gelautz, M.: Simple but effective tree structures for dynamic programming-based stereo matching. In: Proceeding of International Conference on Computer Vision Theory and Applications, vol. 2, pp. 415\u2013422 (2008)","DOI":"10.5220\/0001072904150422"}],"container-title":["Machine Vision and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-010-0278-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00138-010-0278-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00138-010-0278-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T01:16:36Z","timestamp":1740186996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00138-010-0278-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,18]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["278"],"URL":"https:\/\/doi.org\/10.1007\/s00138-010-0278-8","relation":{},"ISSN":["0932-8092","1432-1769"],"issn-type":[{"type":"print","value":"0932-8092"},{"type":"electronic","value":"1432-1769"}],"subject":[],"published":{"date-parts":[[2010,6,18]]}}}