This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Generic Scheme for Progressive Point Cloud Coding
March/April 2008 (vol. 14 no. 2)
pp. 440-453
ASCII Text
x 
 
Yan Huang, Jingliang Peng, C.-C. Jay Kuo, M. Gopi, "A Generic Scheme for Progressive Point Cloud Coding," IEEE Transactions on Visualization and Computer Graphics, vol. 14, no. 2, pp. 440-453, March/April, 2008.
 
 
BibTex
x
 
@article{ 10.1109/TVCG.2007.70441,
author = {Yan Huang and Jingliang Peng and C.-C. Jay Kuo and M. Gopi},
title = {A Generic Scheme for Progressive Point Cloud Coding},
journal ={IEEE Transactions on Visualization and Computer Graphics},
volume = {14},
number = {2},
issn = {1077-2626},
year = {2008},
pages = {440-453},
doi = {http://doi.ieeecomputersociety.org/10.1109/TVCG.2007.70441},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Visualization and Computer Graphics
TI - A Generic Scheme for Progressive Point Cloud Coding
IS - 2
SN - 1077-2626
SP440
EP453
EPD - 440-453
A1 - Yan Huang,
A1 - Jingliang Peng,
A1 - C.-C. Jay Kuo,
A1 - M. Gopi,
PY - 2008
KW - Data compaction and compression
KW - Indexing methods
KW - Object hierarchies
VL - 14
JA - IEEE Transactions on Visualization and Computer Graphics
ER -
 
In this paper, we propose a generic point cloud encoder that provides a unified framework for compressing different attributes of point samples corresponding to 3D objects with arbitrary topology. In the proposed scheme, the coding process is led by an iterative octree cell subdivision of the object space. At each level of subdivision, positions of point samples are approximated by the geometry centers of all tree-front cells while normals and colors are approximated by their statistical average within each of tree-front cells. With this framework, we employ attribute-dependent encoding techniques to exploit different characteristics of various attributes. All of these have led to significant improvement in the rate-distortion (R-D) performance and a computational advantage over the state of the art. Furthermore, given sufficient levels of octree expansion, normal space partitioning and resolution of color quantization, the proposed point cloud encoder can be potentially used for lossless coding of 3D point clouds.

[1] J. Peng, C.-S. Kim, and C.-C.J. Kuo, “Technologies for 3D Mesh Compression: A Survey,” J. Visual Comm. and Image Representation, vol. 16, no. 6, pp. 688-733, 2005.
[2] G. Taubin and J. Rossignac, “Geometric Compression through Topological Surgery,” ACM Trans. Graphics, vol. 17, no. 2, pp. 84-115, 1998.
[3] C.L. Bajaj, V. Pascucci, and G. Zhuang, “Single Resolution Compression of Arbitrary Triangular Meshes with Properties,” Computational Geometry: Theory and Applications, vol. 14, pp. 167-186, 1999.
[4] C. Touma and C. Gotsman, “Triangle Mesh Compression,” Proc. Graphics Interface Conf. (GI '98), pp. 26-34, 1998.
[5] P. Alliez and M. Desbrun, “Valence-Driven Connectivity Encoding for 3D Meshes,” Proc. Eurographics '01, pp. 480-489, 2001.
[6] S. Gumhold and W. Straßer, “Real Time Compression of Triangle Mesh Connectivity,” Proc. ACM SIGGRAPH '98, pp. 133-140, 1998.
[7] J. Rossignac, “Edgebreaker: Connectivity Compression for Triangle Meshes,” IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 1, pp. 47-61, Jan.-Mar. 1999.
[8] H. Hoppe, “Progressive Meshes,” Proc. ACM SIGGRAPH '96, pp. 99-108, 1996.
[9] D. Cohen-Or, D. Levin, and O. Remez, “Progressive Compression of Arbitrary Triangular Meshes,” Proc. IEEE Visualization Conf. (VIS '99), pp. 67-72, 1999.
[10] P. Alliez and M. Desbrun, “Progressive Encoding for Lossless Transmission of Triangle Meshes,” Proc. ACM SIGGRAPH '01, pp. 198-205, 2001.
[11] J. Li and C.-C.J. Kuo, “Progressive Coding of 3-D Graphic Models,” Proc. IEEE, vol. 86, no. 6, pp. 1052-1063, June 1998.
[12] C. Bajaj, V. Pascucci, and G. Zhuang, “Progressive Compression and Transmission of Arbitrary Triangular Meshes,” Proc. IEEE Visualization Conf. (VIS '99), pp. 307-316, 1999.
[13] P.M. Gandoin and O. Devillers, “Progressive Lossless Compression of Arbitrary Simplicial Complexes,” ACM Trans. Graphics, vol. 21, no. 3, pp. 372-379, 2002.
[14] J. Peng and C.-C.J. Kuo, “Progressive Geometry Encoder Using Octree-Based Space Partitioning,” Proc. IEEE Int'l Conf. Multimedia and Expo (ICME '04), pp. 1-4, 2004.
[15] J. Peng and C.-C.J. Kuo, “Geometry-Guided Progressive Lossless 3D Mesh Coding with Octree (OT) Decomposition,” Proc. ACM SIGGRAPH '05, pp. 609-616, 2005.
[16] Z. Karni and C. Gotsman, “Spectral Compression of Mesh Geometry,” Proc. ACM SIGGRAPH '00, pp. 279-286, 2000.
[17] A. Khodakovsky, P. Schröder, and W. Sweldens, “Progressive Geometry Compression,” Proc. ACM SIGGRAPH '00, pp. 271-278, 2000.
[18] A. Khodakovsky and I. Guskov, “Compression of Normal Meshes,” Geometric Modeling for Scientific Visualization, G. Brunnett, B. Hamann, H. Müller, and L. Linsen, eds., pp. 189-206, Springer, 2002.
[19] S. Gumhold, Z. Karni, M. Isenburg, and H.-P. Seidel, “Predictive Point-Cloud Compression,” SIGGRAPH Sketches, 2005.
[20] S. Rusinkiewicz and M. Levoy, “QSplat: A Multiresolution Point Rendering System for Large Meshes,” Proc. ACM SIGGRAPH '00, pp.343-352, 2000.
[21] S. Fleishman, D. Cohen-Or, M. Alexa, and C.T. Silva, “Progressive Point Set Surfaces,” ACM Trans. Graphics, vol. 22, no. 4, pp. 997-1011, 2003.
[22] T. Ochotta and D. Saupe, “Compression of Point-Based 3D Models by Shape-Adaptive Wavelet Coding of Multi-Height Fields,” Proc. IEEE/Eurographics Symp. Point-Based Graphics (PBG '04), pp. 103-112, 2004.
[23] J. Wu, Z. Zhang, and L. Kobbelt, “Progressive Splatting,” Proc. IEEE/Eurographics Symp. Point-Based Graphics (PBG '05), pp. 25-32, 2005.
[24] A. Kalaiah and A. Varshney, “Statistical Geometry Representation for Efficient Transmission and Rendering,” ACM Trans. Graphics, vol. 24, no. 2, pp. 348-373, 2005.
[25] M. Waschbüsch, M. Gross, F. Eberhard, E. Lamboray, and S. Würmlin, “Progressive Compression of Point-Sampled Models,” Proc. IEEE/Eurographics Symp. Point-Based Graphics (PBG '04), 2004.
[26] M. Botsch, A. Wiratanaya, and L. Kobbelt, “Efficient High Quality Rendering of Point Sampled Geometry,” Proc. 13th Eurographics Workshop Rendering (EGWR '02), pp. 53-64, 2002.
[27] R. Schnabel and R. Klein, “Octree-Based Point Cloud Compression,” Proc. IEEE/Eurographics Symp. Point-Based Graphics (PBG '06), pp. 111-120, 2006.
[28] Y. Huang, J. Peng, C.-C.J. Kuo, and M. Gopi, “Octree-Based Progressive Geometry Coding of Point Clouds,” Proc. IEEE/Eurographics Symp. Point-Based Graphics (PBG '06), pp. 103-110, 2006.
[29] J. Krüger, J. Schneider, and R. Westermann, “Duodecim—A Structure for Point Scan Compression and Rendering,” Proc. IEEE/Eurographics Symp. Point-Based Graphics (PBG '05), pp. 99-107, 2005.
[30] M. Gopi, S. Krishnan, and C. Silva, “Surface Reconstruction Using Lower Dimensional Localized Delaunay Triangulation,” Proc. Eurographics '00, vol. 19, no. 3 pp. 467-478, 2000.
[31] M.D. Berg, M.V. Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications. Springer, 1998.
[32] G. Taubin, W. Horn, F. Lazarus, and J. Rossignac, “Geometry Coding and VRML,” Proc. IEEE, vol. 96, no. 6, pp. 1228-1243, June 1998.
[33] M. Gervautz and W. Purgathofer, “A Simple Method for Color Quantization: Octree Quantization,” Graphics Gems I, pp. 287-293, 1990.
[34] Y. Linde, A. Buzo, and R.M. Gray, “An Algorithm for Vector Quantizer Design,” IEEE Trans. Comm., vol. 28, no. 1, pp. 84-95, 1980.
[35] S. Theodoridis and K. Koutroumbas, Pattern Recognition. Academic Press, 1999.
[36] L. Lovasz and M.D. Plummer, Matching Theory. Elsevier Science, 1986.
[37] M. Pauly, M. Gross, and L. Kobbelt, “Efficient Simplification of Point-Sampled Surfaces,” Proc. IEEE Visualization Conf. (VIS '02), pp. 163-170, 2002.

Index Terms:
Data compaction and compression, Indexing methods, Object hierarchies
Citation:
Yan Huang, Jingliang Peng, C.-C. Jay Kuo, M. Gopi, "A Generic Scheme for Progressive Point Cloud Coding," IEEE Transactions on Visualization and Computer Graphics, vol. 14, no. 2, pp. 440-453, March-April 2008, doi:10.1109/TVCG.2007.70441
Usage of this product signifies your acceptance of the Terms of Use.