• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

A Study of Efficient Coding Methods of Three Dimensional Shapes

Research Project

Project/Area Number 01550260
Research Category

Grant-in-Aid for General Scientific Research (C)

Allocation TypeSingle-year Grants
Research Field 電子通信系統工学
Research InstitutionNagaoka University of Technology

Principal Investigator

OHTAKE Kohhei  Nagaoka University of Technology, Faculty of Engineering, Professor, 工学部, 教授 (30203813)

Co-Investigator(Kenkyū-buntansha) 荻原 春生  長岡技術科学大学, 工学部, 助教授 (30185532)
Project Period (FY) 1989 – 1990
Project Status Completed (Fiscal Year 1991)
Budget Amount *help
¥1,800,000 (Direct Cost: ¥1,800,000)
Fiscal Year 1990: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 1989: ¥1,000,000 (Direct Cost: ¥1,000,000)
KeywordsThree Dimensional Shape / Tangential Coordinates / Curvature / Power spectrum / Spherical harmonics / Spherical Fourier Transform / Sampling Theorem / Vector Quantization / ガウス曲率 / 支持関数 / 変換符号化 / ガウス像 / 形状のスペクトル
Research Abstract

In order to investigate an effective coding method of smooth three dimensional convex shapes, techniques of efficient shape representation, sampling-reconstruction and quantization are studied theoretically and by computer simulation. The research results are summarized as follows.
1. An efficient shape representation method by tangential plane coordinates is proposed, which is based on shape curvature. Using the representation, a power spectrum of a shape is introduced and it is shown that the spectrum is invariable to parallel displacement and rotation of the shape and has low pass characteristics.
2. From the above properties, band width of the shape is defined as an invariable independent to coordinates in the space. It is shown such a sampling theorem that the band limited shape is reconstructed completely from a finite number of sample values of the representation function.
3. For the band unlimited shape, the reconstructed shape from a finite number of sample values has some distor … More tion. The optimum sampling points selection method for minimizing the shape distortion power is shown.
4. Since the power spectrum of the shape by this tangential polar coordinates is narrowed than that by conventional polar coordinates, it is shown from S/N characteristics for the shape distortion and computer simulation that the shape is efficiently sampled and reconstructed with the smaller number of sampling points selected by the method.
5. Three kinds of quantization schemes are proposed ; scalar quantization of sample values of the representation function, scalar quantization and gain-shape vector quantization of the spectrum of the shape. Quantization errors are theoretically analyzed for these three schemes and it is shown that the shape spectrum scalar quantization scheme is most effective from evaluation of quantization rate vs. S/N characteristics for the reconstructed shape and quantizer realizability. This result is assured by computer simulation of a sampling-quantization-reconstruction system of convex shapes. Less

Report

(3 results)
  • 1991 Final Research Report Summary
  • 1990 Annual Research Report
  • 1989 Annual Research Report
  • Research Products

    (4 results)

All Other

All Publications (4 results)

  • [Publications] 大竹 孝平: "滑らかな3次元凸形状の標本化ー再生法" 電子情報通信学会論文誌. J74ーA. 1796-1807 (1991)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1991 Final Research Report Summary
  • [Publications] Ohtake, Kohhei: "Sampling and Reconstruction of Smooth Three Dimensional Convex Shapes" The transactions of the Institute of Electronics, Information and Communication Engineers. J74-A. 1796-1807 (1991)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1991 Final Research Report Summary
  • [Publications] 大竹 孝平: "滑らかな三次元凸形状の標本化ー再生法" 電子情報通信学会論文誌.

    • Related Report
      1990 Annual Research Report
  • [Publications] 大竹孝平: "三次元凸形状の標本化" 電子情報通信学会論文誌発表予定.

    • Related Report
      1989 Annual Research Report

URL: 

Published: 1989-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi