BROWSE

Related Researcher

Author's Photo

Sim, Jae-Young
Visual Information Processing Lab (VIP Lab)
Research Interests
  • Image processing, computer vision, 3D visual processing, signal processing

ITEM VIEW & DOWNLOAD

Compression of 3-D point visual data using vector quantization and rate-distortion optimization

Cited 2 times inthomson ciCited 4 times inthomson ci
Title
Compression of 3-D point visual data using vector quantization and rate-distortion optimization
Author
Sim, Jae-YoungLee, Sang-Uk
Issue Date
2008-04
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE TRANSACTIONS ON MULTIMEDIA, v.10, no.3, pp.305 - 315
Abstract
In this paper, we propose adaptive and flexible quantization and compression algorithms for 3-D point data using vector quantization (VQ) and rate-distortion (R-D) optimization. The point data are composed of the position and the radius of sphere based on QSplat representation. The positions of child spheres are first transformed to the local coordinate system, which is determined by the parentchildren relationship. The local coordinate transform makes the positions more compactly distributed in 3-D space, facilitating an effective application of VQ. We also develop a constrained encoding method for the radius data, which can provide a hole-free surface rendering at the decoder side. Furthermore, R-D optimized compression algorithm is proposed in order to allocate an optimal bitrate to each sphere. Experimental results show that the proposed algorithm can effectively compress the original 3-D point geometry at various bitrates.
URI
https://scholarworks.unist.ac.kr/handle/201301/7889
URL
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=41549150445
DOI
10.1109/TMM.2008.917349
ISSN
1520-9210
Appears in Collections:
AI_Journal Papers
Files in This Item:
There are no files associated with this item.

find_unist can give you direct access to the published full text of this article. (UNISTARs only)

Show full item record

qrcode

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

MENU