PROGRESSIVE CODING OF TEXTURED 3D MODELS

  • Nagatomo Kyoko
    School of Integrated Design Engineering, Science and Technology, Keio University
  • Okuda Masahiro
    Faculty of Environmental Engineering, The University of Kitakyushu
  • Ikehara Masaaki
    School of Integrated Design Engineering, Science and Technology, Keio University
  • Takahashi Shin-ichi
    Faculty of Environmental Engineering, The University of Kitakyushu

Bibliographic Information

Other Title
  • テクスチャ上でのリメッシュによる3次元モデルのプログレッシブ符号化(画像の表現ならびに一般(グラフィックス/アニメ, コンテンツ配信, 認識/理解, 色空間, 信号処理など))
  • テクスチャ上でのリメッシュによる3次元モデルのプログレッシブ符号化
  • テクスチャ ジョウ デ ノ リメッシュ ニ ヨル 3ジゲン モデル ノ プログレッシブ フゴウカ

Search this article

Abstract

Due to the rapid development of computer and information technology, 3D modeling and rendering capabilities are becoming increasingly important in many applications, including industrial design, architecture, CAD/CAM, video games, and medical imaging. Since 3D mesh models often have the huge amount of the data, it is time-consuming to retrieve from a storage device or to download from the network. There exist some works on 3D model coding [l]-[7]. Most 3D viewing applications need to obtain the entire file of a 3D model in order to display the model, even when the user is interested only in a low-resolution version of the model. Therefore, progressive coding that enables multiresolution transmission of 3D models is desired. In this paper, we propose the progressive coding scheme of 3D meshes with texture, in which we convert irregular meshes to semi-regular using texture coordinates, map them on planes, and apply 2D image coding algorithm to mesh compression. As our method uses the wavelet transform, the encoded bitstream has a progressive nature. We gain high compression rate with the same visual quality as original models.

Journal

  • ITE Technical Report

    ITE Technical Report 26.54 (0), 1-4, 2002

    The Institute of Image Information and Television Engineers

References(8)*help

See more

Details 詳細情報について

Report a problem

Back to top