Probability distribution of index distances in normal index array for normal vector compression

Deok-Soo Kim, Youngsong Cho, Donguk Kim, Hyun Kim

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Shape models are in these days frequently transmitted over Internet and the research of their compression has been started. Considering the large portion of shape model can be normal vectors, a new scheme was recently presented to compress normal vectors using clustering and mixed indexing scheme. Presented in this paper is a mathematical investigation of the scheme to analyze the probability distribution of normal index distances in Normal Index array which is critical for the compression. The probability distribution is formulated so that the values can be easily calculated once the relative probabilities of C, R, E, S, and L op-codes in Edgebreaker are known. It can be shown that the distribution of index distances can be easily transformed into a few measures for the compression performance of the proposed algorithm.

Original languageEnglish
Pages (from-to)887-896
Number of pages10
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2657
StatePublished - 2003 Dec 1

Fingerprint

Normal vector
Probability distributions
Probability Distribution
Compression
Internet
Indexing
Clustering
Model

Cite this

@article{fa611685f30d421ab8d0e3910f687b21,
title = "Probability distribution of index distances in normal index array for normal vector compression",
abstract = "Shape models are in these days frequently transmitted over Internet and the research of their compression has been started. Considering the large portion of shape model can be normal vectors, a new scheme was recently presented to compress normal vectors using clustering and mixed indexing scheme. Presented in this paper is a mathematical investigation of the scheme to analyze the probability distribution of normal index distances in Normal Index array which is critical for the compression. The probability distribution is formulated so that the values can be easily calculated once the relative probabilities of C, R, E, S, and L op-codes in Edgebreaker are known. It can be shown that the distribution of index distances can be easily transformed into a few measures for the compression performance of the proposed algorithm.",
author = "Deok-Soo Kim and Youngsong Cho and Donguk Kim and Hyun Kim",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2657",
pages = "887--896",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",

}

TY - JOUR

T1 - Probability distribution of index distances in normal index array for normal vector compression

AU - Kim, Deok-Soo

AU - Cho, Youngsong

AU - Kim, Donguk

AU - Kim, Hyun

PY - 2003/12/1

Y1 - 2003/12/1

N2 - Shape models are in these days frequently transmitted over Internet and the research of their compression has been started. Considering the large portion of shape model can be normal vectors, a new scheme was recently presented to compress normal vectors using clustering and mixed indexing scheme. Presented in this paper is a mathematical investigation of the scheme to analyze the probability distribution of normal index distances in Normal Index array which is critical for the compression. The probability distribution is formulated so that the values can be easily calculated once the relative probabilities of C, R, E, S, and L op-codes in Edgebreaker are known. It can be shown that the distribution of index distances can be easily transformed into a few measures for the compression performance of the proposed algorithm.

AB - Shape models are in these days frequently transmitted over Internet and the research of their compression has been started. Considering the large portion of shape model can be normal vectors, a new scheme was recently presented to compress normal vectors using clustering and mixed indexing scheme. Presented in this paper is a mathematical investigation of the scheme to analyze the probability distribution of normal index distances in Normal Index array which is critical for the compression. The probability distribution is formulated so that the values can be easily calculated once the relative probabilities of C, R, E, S, and L op-codes in Edgebreaker are known. It can be shown that the distribution of index distances can be easily transformed into a few measures for the compression performance of the proposed algorithm.

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

M3 - Article

AN - SCOPUS:33645337192

VL - 2657

SP - 887

EP - 896

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -