Abstract
An algorithm based on binocular stereo vision is proposed to generate 3D (three-dimensional) dense points cloud model of the human face. A two-step matching strategy from sparse to dense is developed. Firstly, an improved seeds-growing algorithm is utilized to acquire sparse matching of high confidence. Secondly, based on the control points method and piecewise dynamic programming, the dense matching is completed. Experimental results show that the proposed algorithm can produce smooth and dense 3D points cloud model of the human face.
Similar content being viewed by others
References
Scharstein D., Szeliski R.: A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Comput. Vis. 47, 7–42 (2002)
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–1178. Elsevier, Amsterdam (2002)
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–1082 (2005)
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–181 (2004)
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–1268 (2004)
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–512 (1992)
Bobick A.F., Intille S.S.: Large occlusion stereo. Int. J. Comput. Vis. 33, 181–200 (1999)
Lhuillier M., Quan L.: A quasi-dense approach to surface reconstruction from uncalibrated images. IEEE Trans. Pattern Anal. Mach. Intell. 27, 418–433 (2005)
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–8 (2007)
Gong M.L., Yang Y.H.: Fast unambiguous stereo matching using reliability-based dynamic programming. IEEE Trans. Pattern Anal. Mach. Intell. 27, 998–1003 (2005)
Sara, R.: Finding the largest unambiguous component of stereo matching. In: Proceedings of the European Conference on Computer Vision, pp. 900–914. Springer, London (2002)
Sara, R.: Robust Correspondence Recognition for Computer Vision. Invited Session on Image Analysis. Roma, Italy (2006)
Zhang Z.Y.: A flexible new technique for camera calibration. IEEE Trans. Pattern Anal. Mach. Intell. 20, 1330–1334 (2000)
Fusiello A., Trucco E., Verri A.: A compact algorithm for rectification of stereo pairs. Mach. Vis. Appl. 12, 16–22 (2000)
Da F.P., Gai S.Y.: Flexible three-dimensional measurement technique based on a digital light processing projector. Appl. Opt. 47, 377–385 (2008)
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–422 (2008)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Da, F., Sui, Y. 3D reconstruction of human face based on an improved seeds-growing algorithm. Machine Vision and Applications 22, 879–887 (2011). https://doi.org/10.1007/s00138-010-0278-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00138-010-0278-8