Lossless compression of point-based data for 3D graphics rendering

Jae Young Sim, Chang-Su Kim, Sang Uk Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

A lossless compression algorithm of 3D point data is proposed in this work. QSplat is one of the efficient rendering methods for 3D point data. In QSplat, each point is assigned a sphere, and the geometry and normal data are stored in the hierarchical structure of bounding spheres. To compress QSplat data, child spheres are sorted based on their limit radii to constrain the indices for the geometry data. Then, the radii and the positions of spheres are encoded separately using the reduced index sets. Also, each normal is encoded using the parent normal context, and the normal indices are reduced by the normal cone information. Simulation results show that the proposed algorithm achieves a high compression ratio by combining the reduced index sets with the context-based entropy coding.

Original languageEnglish
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsS. Panchanathan, B. Vasudev
Pages1031-1042
Number of pages12
Volume5308
EditionPART 2
DOIs
Publication statusPublished - 2004
Externally publishedYes
EventVisual Communications and Image Processing 2004 - San Jose, CA, United States
Duration: 2004 Jan 202004 Jan 22

Other

OtherVisual Communications and Image Processing 2004
CountryUnited States
CitySan Jose, CA
Period04/1/2004/1/22

Fingerprint

radii
Geometry
compression ratio
geometry
Cones
cones
coding
Entropy
entropy
simulation

Keywords

  • 3D point data
  • Lossless compression
  • QSplat representation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Sim, J. Y., Kim, C-S., & Lee, S. U. (2004). Lossless compression of point-based data for 3D graphics rendering. In S. Panchanathan, & B. Vasudev (Eds.), Proceedings of SPIE - The International Society for Optical Engineering (PART 2 ed., Vol. 5308, pp. 1031-1042) https://doi.org/10.1117/12.532302

Lossless compression of point-based data for 3D graphics rendering. / Sim, Jae Young; Kim, Chang-Su; Lee, Sang Uk.

Proceedings of SPIE - The International Society for Optical Engineering. ed. / S. Panchanathan; B. Vasudev. Vol. 5308 PART 2. ed. 2004. p. 1031-1042.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sim, JY, Kim, C-S & Lee, SU 2004, Lossless compression of point-based data for 3D graphics rendering. in S Panchanathan & B Vasudev (eds), Proceedings of SPIE - The International Society for Optical Engineering. PART 2 edn, vol. 5308, pp. 1031-1042, Visual Communications and Image Processing 2004, San Jose, CA, United States, 04/1/20. https://doi.org/10.1117/12.532302
Sim JY, Kim C-S, Lee SU. Lossless compression of point-based data for 3D graphics rendering. In Panchanathan S, Vasudev B, editors, Proceedings of SPIE - The International Society for Optical Engineering. PART 2 ed. Vol. 5308. 2004. p. 1031-1042 https://doi.org/10.1117/12.532302
Sim, Jae Young ; Kim, Chang-Su ; Lee, Sang Uk. / Lossless compression of point-based data for 3D graphics rendering. Proceedings of SPIE - The International Society for Optical Engineering. editor / S. Panchanathan ; B. Vasudev. Vol. 5308 PART 2. ed. 2004. pp. 1031-1042
@inproceedings{212f34735aa94e1cbbcfab9ef8900475,
title = "Lossless compression of point-based data for 3D graphics rendering",
abstract = "A lossless compression algorithm of 3D point data is proposed in this work. QSplat is one of the efficient rendering methods for 3D point data. In QSplat, each point is assigned a sphere, and the geometry and normal data are stored in the hierarchical structure of bounding spheres. To compress QSplat data, child spheres are sorted based on their limit radii to constrain the indices for the geometry data. Then, the radii and the positions of spheres are encoded separately using the reduced index sets. Also, each normal is encoded using the parent normal context, and the normal indices are reduced by the normal cone information. Simulation results show that the proposed algorithm achieves a high compression ratio by combining the reduced index sets with the context-based entropy coding.",
keywords = "3D point data, Lossless compression, QSplat representation",
author = "Sim, {Jae Young} and Chang-Su Kim and Lee, {Sang Uk}",
year = "2004",
doi = "10.1117/12.532302",
language = "English",
volume = "5308",
pages = "1031--1042",
editor = "S. Panchanathan and B. Vasudev",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",
edition = "PART 2",

}

TY - GEN

T1 - Lossless compression of point-based data for 3D graphics rendering

AU - Sim, Jae Young

AU - Kim, Chang-Su

AU - Lee, Sang Uk

PY - 2004

Y1 - 2004

N2 - A lossless compression algorithm of 3D point data is proposed in this work. QSplat is one of the efficient rendering methods for 3D point data. In QSplat, each point is assigned a sphere, and the geometry and normal data are stored in the hierarchical structure of bounding spheres. To compress QSplat data, child spheres are sorted based on their limit radii to constrain the indices for the geometry data. Then, the radii and the positions of spheres are encoded separately using the reduced index sets. Also, each normal is encoded using the parent normal context, and the normal indices are reduced by the normal cone information. Simulation results show that the proposed algorithm achieves a high compression ratio by combining the reduced index sets with the context-based entropy coding.

AB - A lossless compression algorithm of 3D point data is proposed in this work. QSplat is one of the efficient rendering methods for 3D point data. In QSplat, each point is assigned a sphere, and the geometry and normal data are stored in the hierarchical structure of bounding spheres. To compress QSplat data, child spheres are sorted based on their limit radii to constrain the indices for the geometry data. Then, the radii and the positions of spheres are encoded separately using the reduced index sets. Also, each normal is encoded using the parent normal context, and the normal indices are reduced by the normal cone information. Simulation results show that the proposed algorithm achieves a high compression ratio by combining the reduced index sets with the context-based entropy coding.

KW - 3D point data

KW - Lossless compression

KW - QSplat representation

UR - http://www.scopus.com/inward/record.url?scp=10444242506&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10444242506&partnerID=8YFLogxK

U2 - 10.1117/12.532302

DO - 10.1117/12.532302

M3 - Conference contribution

VL - 5308

SP - 1031

EP - 1042

BT - Proceedings of SPIE - The International Society for Optical Engineering

A2 - Panchanathan, S.

A2 - Vasudev, B.

ER -