Fast 3D Mesh Compression Using Shared Vertex Analysis

Citations

WEB OF SCIENCE

5
Citations

SCOPUS

7

초록

A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertax and face order However; this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.

키워드

3D mesh compressionprefix codereal-time encoding and decodingAlgorithmsComputational complexityDecodingEncoding (symbols)Motion Picture Experts Group standardsReal time systems3-D mesh compression3D mesh codingCodec designDifferential codingEntropy codingFirst-orderLow complexityPrefix codesReal-time encodingThree dimensional
제목
Fast 3D Mesh Compression Using Shared Vertex Analysis
저자
Jang, Euee SeonLee, SeungwookKoo, BonkiKim, DaiyongSon, Kyoungsoo
DOI
10.4218/etrij.10.0209.0357
발행일
2010-02
유형
Article
저널명
ETRI Journal
32
1
페이지
163 ~ 165