BROWSE
Detail
Conference Paper
Probability Distribution of Index Distances in Normal Index Array for Normal Vector Compression
Cited 3 time in 
Share 
Share
- Authors
- Deok Soo Kim, Young Song Cho, Dong Uk Kim, Hyun Kim
- Issue Date
- 2003-06
- Citation
- International Conference on Computational Science (ICCS) 2003 (LNCS 2657), v.2657, pp.887-896
- Publisher
- Springer
- Language
- English
- Type
- Conference Paper
- 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. © Springer-Verlag Berlin Heidelberg 2003.
- KSP Keywords
- Compression performance, Indexing scheme, Probability distribution, Shape model, Vector compression, normal vector