Skip to main content

3D Video Encoding

  • Chapter

Abstract

Over the past decade the progress in computing and telecommunication technologies have made storage and transmission of visual information media even more ubiquitous. Nowadays it is usual to stream in real-time huge amount of data on-line, e.g. over a LAN or the Internet. The benefits of data compression is worldwide renowned and can be observed in everyday life activity. Hence, it becomes crucial to design an efficient compression scheme for any data model to be transmitted through a network, especially when large bandwidth is required. This chapter presents a method we developed for 3D video encoding that transforms a 3D video stream into a 2D video stream. 3D video data can therefore be easily stored and transmitted by taking advantage of any mature 2D image encoding technology (such as Windows Media, Quicktime, MPEG-4, etc.). Thus, we believe 3D video could become a visual media considered as standard as 2D video in the near future.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The kernel of a polygon P is defined as a region in P where for ∀ point pair (a,b)∈P×P, the line segment [a,b] lies entirely within P.

  2. 2.

    With scaling any volume size can be represented.

  3. 3.

    A shape-preserving parameterization on a disk [9].

  4. 4.

    Geodesic distances can be calculated using Dijkstra’s shortest path algorithm since surfaces are approximated by 2-manifold meshes.

  5. 5.

    A path on a surface is a set of points joined two-by-two by a line.

References

  1. Blum, H.: A Transformation for Extracting New Descriptors of Shape. Models for the Perception of Speech and Visual Form (1967)

    Google Scholar 

  2. Briceno, H., Sandler, P., McMillian, L., Gortler, S., Hoppe, H.: Geometry videos: a new representation for 3D animations. In: Eurographics/SIGGRAPH Symposium on Computer Animation, pp. 136–146 (2003)

    Google Scholar 

  3. Bronstein, A.M., Bronstein, M.M., Kimmel, R.: Calculus of non-rigid surfaces for geometry and texture manipulation. IEEE Trans. Vis. Comput. Graph., 902–913 (2007)

    Google Scholar 

  4. Cagniart, C., Boyer, E., Ilic, S.: Probabilistic deformable surface tracking from multiple videos. In: Proc. of European Conference on Computer Vision (2010)

    Google Scholar 

  5. Carr, N., Hoberock, J., Crane, K., Hart, J.: Rectangular multi-chart geometry images. In: Proc. fourth Eurographics Symposium on Geometry Processing (SGP), pp. 181–190 (2006)

    Google Scholar 

  6. CGAL: Computational Geometry Algorithms Library. http://www.cgal.org

  7. Cornea, N., Silver, D., Yuan, X., Balasubramanian, R.: Computing hierarchical curveskeletons of 3D objects. Vis. Comput. 21(11), 945–955 (2005)

    Article  Google Scholar 

  8. Erickson, J., Har-Peled, S.: Optimally cutting a surface into a disk. CoRR cs.CG/0207004 (2002)

  9. Floater, M.: Parametrization and smooth approximation of surface triangulations. Comput. Aided Geom. Des. 14(3), 231–250 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gu, X., Gortler, S., Hoppe, H.: Geometry images. In: Proc. of ACM SIGGRAPH, pp. 355–361 (2002)

    Google Scholar 

  11. Habe, H., Katsura, Y., Matsuyama, T.: Skin-off: Representation and compression scheme for 3D video. In: Picture Coding Symposium (2004)

    Google Scholar 

  12. Habe, H., Yamazawa, I., Nomura, T., Katsura, Y., Matsuyama, T.: Compression method for omni-directional video using polyhedral representations. J. Inst. Electron. Inf. Commun. Eng. J88-A(9), 1074–1084 (2005) (in Japanese)

    Google Scholar 

  13. Hilaga, M., Shinagawa, Y., Kohmura, T., Kunii, T.L.: Topology matching for fully automatic similarity estimation of 3D shapes. In: Proc. of ACM SIGGRAPH, pp. 203–212 (2001)

    Google Scholar 

  14. Hoppe, H.: Progressive meshes. In: Proc. of ACM SIGGRAPH, pp. 99–108 (1996)

    Google Scholar 

  15. Locasso, F., Hoppe, H., Schaefer, S., Warren, J.: Smooth geometry images. In: Eurographics Symposium on Geometry Processing, pp. 138–145 (2003)

    Google Scholar 

  16. Lowe, D.G.: Object recognition from local scale-invariant features. In: Proc. of International Conference on Computer Vision, vol. 2, pp. 1150–1157 (1999)

    Chapter  Google Scholar 

  17. Morse, M.: The Calculus of Variations in the Large. American Mathematical Society Colloquium Publication, vol. 18. AMS, New York (1934)

    MATH  Google Scholar 

  18. Cignoni, P., Rocchini, C., Scopigno, R.: Metro: measuring error on simplified surfaces. Comput. Graph. Forum 17(2), 167–174 (1998)

    Article  Google Scholar 

  19. Pascucci, V., Scorzelli, G., Bremer, P.T., Mascarenhas, A.: Robust on-line computation of Reeb graphs: Simplicity and speed. ACM Trans. Graph. 26(3), 58 (2007)

    Article  Google Scholar 

  20. Praun, E., Hoppe, H.: Spherical parametrization and remeshing. In: Proc. of ACM SIGGRAPH, pp. 340–349 (2003)

    Google Scholar 

  21. Sander, P., Gortler, S., Snyder, J., Hoppe, H.: Signal-specialized parametrization. Microsoft Research MSR-TR-2002-27 (2002)

    Google Scholar 

  22. Sander, P., Wood, Z., Gortler, S., Snyder, J., Hoppe, H.: Multi-chart geometry images. In: Eurographics Symposium on Geometry Processing, pp. 146–155 (2003)

    Google Scholar 

  23. Starck, J., Hilton, A.: Surface capture for performance-based animation. IEEE Comput. Graph. Appl. (2007)

    Google Scholar 

  24. Sullivan, G., Topiwala, P., Luthra, A.: The h.264/AVC advanced video coding standard: Overview and introduction to the fidelity range extensions. In: Proc. SPIE conference on Applications of Digital Image Processing, vol. XXVII, pp. 454–474 (2004)

    Google Scholar 

  25. Taubin, G., Rossignac, J.: Geometric compression through topological surgery. ACM Trans. Graph. 17(2), 84–115 (1998)

    Article  Google Scholar 

  26. Tung, T., Nobuhara, S., Matsuyama, T.: Simultaneous super-resolution and 3D video using graph-cuts. In: Proc. of IEEE Conference on Computer Vision and Pattern Recognition (2008)

    Google Scholar 

  27. Tung, T., Nobuhara, S., Matsuyama, T.: Complete multi-view reconstruction of dynamic scenes from probabilistic fusion of narrow and wide baseline stereo. In: Proc. of International Conference on Computer Vision (2009)

    Google Scholar 

  28. Tung, T., Schmitt, F.: The augmented multiresolution Reeb graph approach for content-based retrieval of 3D shapes. Int. J. Shape Model. 11(1), 91–120 (2005)

    Article  Google Scholar 

  29. Varanasi, K., Zaharescu, A., Boyer, E., Horaud, R.P.: Temporal surface tracking using mesh evolution. In: Proc. of European Conference on Computer Vision (2008)

    Google Scholar 

  30. Vlasic, D., Baran, I., Matusik, W., Popovic, J.: Articulated mesh animation from multi-view silhouettes. ACM Trans. Graph. 27(3) (2008)

    Google Scholar 

  31. Zaharescu, A., Boyer, E., Varanasi, K., Horaud, R.P.: Surface feature detection and description with applications to mesh matching. In: Proc. of IEEE Conference on Computer Vision and Pattern Recognition (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag London

About this chapter

Cite this chapter

Matsuyama, T., Nobuhara, S., Takai, T., Tung, T. (2012). 3D Video Encoding. In: 3D Video and Its Applications. Springer, London. https://doi.org/10.1007/978-1-4471-4120-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-4120-4_10

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-4119-8

  • Online ISBN: 978-1-4471-4120-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics