Lossless Compression of 3-D Point Data in QSplat Representation

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

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We propose a lossless compression algorithm for three-dimensional point data in graphics applications. In typical point representation, each point is treated as a sphere and its geometrical and normal data are stored in the hierarchical structure of bounding spheres. The proposed algorithm sorts child spheres according to their positions to achieve a higher coding gain for geometrical data. Also, the proposed algorithm compactly encodes normal data by exploiting high correlation between parent and child normals. Simulation results show that the proposed algorithm saves up to 60% of storage space.

Original languageEnglish
Pages (from-to)1191-1195
Number of pages5
JournalIEEE Transactions on Multimedia
Volume7
Issue number6
DOIs
Publication statusPublished - 2005 Dec 1

Keywords

  • 3-D point data
  • Lossless compression
  • QSplat

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems
  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Lossless Compression of 3-D Point Data in QSplat Representation. / Sim, Jae Young; Kim, Chang-Su; Lee, Sang Uk.

In: IEEE Transactions on Multimedia, Vol. 7, No. 6, 01.12.2005, p. 1191-1195.

Research output: Contribution to journalArticle

Sim, Jae Young ; Kim, Chang-Su ; Lee, Sang Uk. / Lossless Compression of 3-D Point Data in QSplat Representation. In: IEEE Transactions on Multimedia. 2005 ; Vol. 7, No. 6. pp. 1191-1195.
@article{60ed81a4612f40c3b18f51be162577bc,
title = "Lossless Compression of 3-D Point Data in QSplat Representation",
abstract = "We propose a lossless compression algorithm for three-dimensional point data in graphics applications. In typical point representation, each point is treated as a sphere and its geometrical and normal data are stored in the hierarchical structure of bounding spheres. The proposed algorithm sorts child spheres according to their positions to achieve a higher coding gain for geometrical data. Also, the proposed algorithm compactly encodes normal data by exploiting high correlation between parent and child normals. Simulation results show that the proposed algorithm saves up to 60{\%} of storage space.",
keywords = "3-D point data, Lossless compression, QSplat",
author = "Sim, {Jae Young} and Chang-Su Kim and Lee, {Sang Uk}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/TMM.2005.858410",
language = "English",
volume = "7",
pages = "1191--1195",
journal = "IEEE Transactions on Multimedia",
issn = "1520-9210",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Lossless Compression of 3-D Point Data in QSplat Representation

AU - Sim, Jae Young

AU - Kim, Chang-Su

AU - Lee, Sang Uk

PY - 2005/12/1

Y1 - 2005/12/1

N2 - We propose a lossless compression algorithm for three-dimensional point data in graphics applications. In typical point representation, each point is treated as a sphere and its geometrical and normal data are stored in the hierarchical structure of bounding spheres. The proposed algorithm sorts child spheres according to their positions to achieve a higher coding gain for geometrical data. Also, the proposed algorithm compactly encodes normal data by exploiting high correlation between parent and child normals. Simulation results show that the proposed algorithm saves up to 60% of storage space.

AB - We propose a lossless compression algorithm for three-dimensional point data in graphics applications. In typical point representation, each point is treated as a sphere and its geometrical and normal data are stored in the hierarchical structure of bounding spheres. The proposed algorithm sorts child spheres according to their positions to achieve a higher coding gain for geometrical data. Also, the proposed algorithm compactly encodes normal data by exploiting high correlation between parent and child normals. Simulation results show that the proposed algorithm saves up to 60% of storage space.

KW - 3-D point data

KW - Lossless compression

KW - QSplat

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

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

U2 - 10.1109/TMM.2005.858410

DO - 10.1109/TMM.2005.858410

M3 - Article

AN - SCOPUS:29044439197

VL - 7

SP - 1191

EP - 1195

JO - IEEE Transactions on Multimedia

JF - IEEE Transactions on Multimedia

SN - 1520-9210

IS - 6

ER -