Fast vector quantization for efficient rendering of compressed point-clouds

Rusinkiewicz S, Levoy M. Qsplat: a multiresolution point rendering system for large meshes. In: SIGGRAPH ’00: proceedings of the 27th annual conference on computer graphics and interactive techniques, New York, NY, USA: ACM Press/Addison-Wesley Publishing Co.; 2000. p. 343–52. Botsch M, Wiratanaya A, Kobbelt L. Efficient high quality rendering of point sampled geometry. In: EGRW ’02: proceedings of the 13th eurographics workshop on rendering, Eurographics Association, Aire-la-Ville, Switzerland, Switzerland, 2002. p. 53–64. Kalaiah, 2005, Statistical geometry representation for efficient transmission and rendering, ACM Transactions on Graphics, 24, 348, 10.1145/1061347.1061356 Krüger J, Schneider J, Westermann R. Duodecim—a structure for point scan compression and rendering. In: Proceedings of the symposium on point-based graphics 2005, 2005. Hubo E, Mertens T, Haber T, Bekaert P. The quantized kd-tree: efficient ray tracing of compressed point clouds. In: IEEE symposium on interactive ray tracing, 2006. p. 105–13. Hubo E, Mertens T, Haber T, Bekaert P. Self-similarity-based compression of point clouds, with application to ray tracing. In: Eurographics symposium on point-based graphics, Eurographics Association, 2007. p. 129–37. Ochotta T, Saupe D. Compression of point-based 3d models by shape-adaptive wavelet coding of multi-height fields. In: Proceedings of the eurographics symposium on point-Based graphics, 2004. p. 103–12. Huang Y, Peng J, Kuo C-CJ, Gopi M. Octree-based progressive geometry coding of point clouds. In: Botsch M, Chen B, editors. Symposium on point-based graphics 2006, eurographics, 2006. Schnabel R, Klein R. Octree-based point-cloud compression. In: Botsch M, Chen B, editors. Symposium on point-based graphics 2006, eurographics, 2006. Waschbüsch M, Gross M, Eberhard F, Lamboray E, Würmlin S. Progressive compression of point-sampled models. In: Proceedings of the eurographics symposium on point-based graphics, 2004. p. 95–102. Pauly M, Gross M. Spectral processing of point-sampled geometry. In: SIGGRAPH ’01: proceedings of the 28th annual conference on computer graphics and interactive techniques. New York, NY, USA: ACM Press; 2001. p. 379–86. Boubekeur, 2006, Volume-surface trees, Computer Graphics Forum (Proceedings of EUROGRAPHICS 2006), 25, 399, 10.1111/j.1467-8659.2006.00959.x Ivanov, 2001, Spatial patches—a primitive for 3d model representation, Computer Graphics Forum, 20, 511 Ochotta T, Hiller S. Hardware rendering of 3d geometry with elevation maps. In: SMI ’06: proceedings of the IEEE international conference on shape modeling and applications 2006 (SMI’06), Washington, DC, USA: IEEE Computer Society; 2001. p. 10. Schnabel, 2007, Efficient ransac for point-cloud shape detection, Computer Graphics Forum, 26, 214, 10.1111/j.1467-8659.2007.01016.x Adamson A, Alexa M. Ray tracing point set surfaces. In: SMI ’03: proceedings of the shape modeling international 2003, Washington, DC, USA: IEEE Computer Society; 2001. p. 272. Adelson, 1981, Image data compression with the Laplacian pyramid, 218 Cohen, 1992, Biorthogonal bases for compactly supported wavelets, Communications in Pure and Applied Mathematics, 45, 485, 10.1002/cpa.3160450502 Gersho, 1992 Beers AC, Agrawala M, Chaddha N. Rendering from compressed textures. In: SIGGRAPH ’96: proceedings of the 23rd annual conference on computer graphics and interactive techniques. New York, NY, USA: ACM Press; 1996. p. 373–8. Levoy M, Hanrahan P. Light field rendering. In: SIGGRAPH ’96: proceedings of the 23rd annual conference on computer graphics and interactive techniques. New York, NY, USA: ACM Press; 1996. p. 31–42. Schneider J, Westermann R. Compression domain volume rendering. In: VIS ’03: proceedings of the 14th IEEE visualization 2003 (VIS’03). Washington, DC, USA: IEEE Computer Society; 2003. p. 39. Hang, 1988, Interpolative vector quantization of color images, IEEE Transactions on Communications, 36, 465, 10.1109/26.2771 Linde, 1980, An algorithm for vector quantizer design, IEEE Transactions on Communications COM-28, 1, 84, 10.1109/TCOM.1980.1094577 Kanungo, 2002, An efficient k-means clustering algorithm: analysis and implementation, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24, 881, 10.1109/TPAMI.2002.1017616 Alsabti K, Ranka S, Singh V, An efficient space-partitioning based algorithm for the K-means clustering. Lecture notes in computer science, vol. 1574: 1999. p. 355–9. Pelleg D, Moore AW. Accelerating exact k-means algorithms with geometric reasoning. In: KDD, 1999. p. 277–81. Kim, 1993, A fast mean-distance-ordered partial codebook search algorithm for image vector quantization. Circuits and systems II: analog and digital signal processing, IEEE Transactions on [see also Circuits and Systems II: Express Briefs, IEEE Transactions on], 40, 576 Pan, 1998, A new vector quantization image coding algorithm based on the extension of the bound for minkowski metric, Pattern Recognition, 31, 1757, 10.1016/S0031-3203(98)00044-2 Bei, 1985, An improvement of the minimum distortion encoding algorithm for vector quantization, IEEE Transactions on Communications, 33, 1132, 10.1109/TCOM.1985.1096214 Elkan, 2003, Using the triangle inequality to accelerate k-means, 147 Kollios, 2003, Efficient biased sampling for approximate clustering and outlier detection in large data sets, IEEE Transactions on Knowledge in Data Engineering, 15, 1170, 10.1109/TKDE.2003.1232271 Fahling G, Sohler C. A fast k-means implementation using coresets. In: COMPGEOM: annual ACM symposium on computational geometry; 2006. Zhang T, Ramakrishnan R, Livny M. Birch: an efficient data clustering method for very large databases. In: SIGMOD ’96: proceedings of the 1996 ACM SIGMOD international conference on Management of data. New York, NY, USA: ACM; 1996. p. 103–14. Bradley, 1998, Scaling clustering algorithms to large databases, 9 Guha, Rastogi, Shim, CURE: an efficient clustering algorithm for large databases. SIGMODREC: ACM SIGMOD Record 27. Orlandic, 2005, Clustering high-dimensional data using an efficient and effective data space reduction, 201 Beyer K, Goldstein J, Ramakrishnan R, Shaft U. When is “nearest neighbor” meaningful? Lecture notes in computer science, vol. 1540, 1999. p. 217–35. Aggarwal CC, Hinneburg A, Keim DA. On the surprising behavior of distance metrics in high dimensional space, Lecture notes in computer science, vol. 1973: 2001. p. 420–34. Mattson, 2004 Youssef A. Parallel algorithms for entropy-coding techniques. NISTIR (NISTIR 6113). Rissanen, 1979, Arithmetic coding, IBM Journal of Research and Development, 23, 149, 10.1147/rd.232.0149 Witten, 1987, Arithmetic coding for data compression, Communications of the ACM, 30, 520, 10.1145/214762.214771 Zwicker M, Pfister H, van Baar J, Gross M. Surface splatting. In: SIGGRAPH ’01: proceedings of the 28th annual conference on computer graphics and interactive techniques. New York, NY, USA: ACM Press; 2001. p. 371–8. Botsch M, Kobbelt L. High-quality point-based rendering on modern gpus. In: PG ’03: proceedings of the 11th pacific conference on computer graphics and applications. Washington, DC, USA: IEEE Computer Society; 2003. p. 335. Grossman, 1998, Point sample rendering, 181 Kawata, 2005, Direct point rendering on GPU, 587 Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W. Surface reconstruction from unorganized points. In: SIGGRAPH ’92: proceedings of the 19th annual conference on computer graphics and interactive techniques. New York, NY, USA: ACM Press; 1992. p. 71–8.