Compact encoding of 3-D voxel surfaces based on pattern code representation

Chang-Su Kim, Sang Uk Lee

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this paper, we propose a lossless compression algorithm for three-dimensional (3-D) binary voxel surfaces, based on the pattern code representation (PCR). In PCR, a voxel surface is represented by a series of pattern codes. The pattern of a voxel v is defined as the 3 × 3 × 3 array of voxels, centered on v. Therefore, the pattern code for v informs of the local shape of the voxel surface around v. The proposed algorithm can achieve the coding gain, since the patterns of adjacent voxels are highly correlated to each other. The performance of the proposed algorithm is evaluated using various voxel surfaces, which are scan-converted from triangular mesh models. It is shown that the proposed algorithm requires only 0.5∼1 bits per black voxel (bpbv) to store or transmit the voxel surfaces.

Original languageEnglish
Pages (from-to)932-943
Number of pages12
JournalIEEE Transactions on Image Processing
Volume11
Issue number8
DOIs
Publication statusPublished - 2002 Aug 1
Externally publishedYes

Fingerprint

Voxel
3D
Encoding
Coding Gain
Lossless Compression
Triangular Mesh
Adjacent
Binary
Three-dimensional
Series

Keywords

  • 3-D coding
  • Pattern code representation
  • Voxel surface

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Software
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition

Cite this

Compact encoding of 3-D voxel surfaces based on pattern code representation. / Kim, Chang-Su; Lee, Sang Uk.

In: IEEE Transactions on Image Processing, Vol. 11, No. 8, 01.08.2002, p. 932-943.

Research output: Contribution to journalArticle

@article{5b2e53b3416144ebb75cafec33d6588c,
title = "Compact encoding of 3-D voxel surfaces based on pattern code representation",
abstract = "In this paper, we propose a lossless compression algorithm for three-dimensional (3-D) binary voxel surfaces, based on the pattern code representation (PCR). In PCR, a voxel surface is represented by a series of pattern codes. The pattern of a voxel v is defined as the 3 × 3 × 3 array of voxels, centered on v. Therefore, the pattern code for v informs of the local shape of the voxel surface around v. The proposed algorithm can achieve the coding gain, since the patterns of adjacent voxels are highly correlated to each other. The performance of the proposed algorithm is evaluated using various voxel surfaces, which are scan-converted from triangular mesh models. It is shown that the proposed algorithm requires only 0.5∼1 bits per black voxel (bpbv) to store or transmit the voxel surfaces.",
keywords = "3-D coding, Pattern code representation, Voxel surface",
author = "Chang-Su Kim and Lee, {Sang Uk}",
year = "2002",
month = "8",
day = "1",
doi = "10.1109/TIP.2002.800891",
language = "English",
volume = "11",
pages = "932--943",
journal = "IEEE Transactions on Image Processing",
issn = "1057-7149",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "8",

}

TY - JOUR

T1 - Compact encoding of 3-D voxel surfaces based on pattern code representation

AU - Kim, Chang-Su

AU - Lee, Sang Uk

PY - 2002/8/1

Y1 - 2002/8/1

N2 - In this paper, we propose a lossless compression algorithm for three-dimensional (3-D) binary voxel surfaces, based on the pattern code representation (PCR). In PCR, a voxel surface is represented by a series of pattern codes. The pattern of a voxel v is defined as the 3 × 3 × 3 array of voxels, centered on v. Therefore, the pattern code for v informs of the local shape of the voxel surface around v. The proposed algorithm can achieve the coding gain, since the patterns of adjacent voxels are highly correlated to each other. The performance of the proposed algorithm is evaluated using various voxel surfaces, which are scan-converted from triangular mesh models. It is shown that the proposed algorithm requires only 0.5∼1 bits per black voxel (bpbv) to store or transmit the voxel surfaces.

AB - In this paper, we propose a lossless compression algorithm for three-dimensional (3-D) binary voxel surfaces, based on the pattern code representation (PCR). In PCR, a voxel surface is represented by a series of pattern codes. The pattern of a voxel v is defined as the 3 × 3 × 3 array of voxels, centered on v. Therefore, the pattern code for v informs of the local shape of the voxel surface around v. The proposed algorithm can achieve the coding gain, since the patterns of adjacent voxels are highly correlated to each other. The performance of the proposed algorithm is evaluated using various voxel surfaces, which are scan-converted from triangular mesh models. It is shown that the proposed algorithm requires only 0.5∼1 bits per black voxel (bpbv) to store or transmit the voxel surfaces.

KW - 3-D coding

KW - Pattern code representation

KW - Voxel surface

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

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

U2 - 10.1109/TIP.2002.800891

DO - 10.1109/TIP.2002.800891

M3 - Article

C2 - 18244687

AN - SCOPUS:0036691903

VL - 11

SP - 932

EP - 943

JO - IEEE Transactions on Image Processing

JF - IEEE Transactions on Image Processing

SN - 1057-7149

IS - 8

ER -