Image Processing Based on Spline Representation

基于样条表示的图像处理

• 批准号: 07650075
• 负责人: SUGIHARA Kokichi
• 金额: $ 1.6万
• 依托单位: University of Tokyo
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 1995
• 资助国家: 日本
• 起止时间: 1995 至 1996
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-07650075/
• 关键词: Image processing; Computational geometry; Distance transformation; Voronoi diagram; Minkowski sum; Spline curve; Robust computation; Triangulation; スプライン曲面; ディジタル画像; ミンコフスキー演算; 多角形ボロノイ図; 位相優先法; 記号摂動法

The purpose of this research was to apply our method for robust geometric computation to image processing. Conventionally image processing techniques are based on the pixel structure of the digital images, and consequently require huge space of memory and huge time of computation. This research aims at replacing these techniques by spline-based techniques and thus saving space and time.In this research period, we obtained the following results. First, a method was constructed for representing digital color images by spline surfaces ; because of the flexibility of spline surfaces, we can expand and shrink image data in any scales. Secondly, the Minkowski algebra was extended to a larger algebra in which any element has its inverse. This extension guarantees the stability of the Minkowski addition and substraction, and therefore we can manipulate figures without worrying about flase elements. Thirdly, robust geometric algorithms were constructed and implemented for Voronoi diagram on the plane, Voronoi diagram on the sphere, Voronoi diagram in the three-dimensional space, Voronoi diagrams for general figures, etc. Fourthly, several efficient methods were found for judging the sign of a large integer by modular arithmetic.Those results altogether enable us to represent and manipulate image and figure information efficiently from both time and space points of view.

本研究的目的是应用我们的方法，鲁棒几何计算的图像处理。传统的图像处理技术是基于数字图像的像素结构，因此需要巨大的存储空间和巨大的计算时间。本研究的目的是以样条技术取代这些技术，以节省空间与时间。首先，构造了一种用样条曲面表示数字彩色图像的方法，由于样条曲面的灵活性，我们可以在任意尺度上扩展和收缩图像数据。其次，将Minkowski代数推广到任意元素都有其逆元的更大代数。这种扩展保证了闵可夫斯基加法和减法的稳定性，因此我们可以操纵图形而不必担心flase元素。第三，构造并实现了平面上的Voronoi图、球面上的Voronoi图、三维空间中的Voronoi图、一般图形的Voronoi图等的鲁棒几何算法。利用模运算的方法，找到了判断大整数符号的几种有效方法，这些结果使我们能够从时间和空间两个方面有效地表示和处理图像和图形信息。空间的观点。

项目成果

K.Sugihara: "Construction of impossibIe objects---Application of picture-interpretation theory to illusory toys." Proceedings of the 2nd Asian Conference on Computer Vision. 3. 151-155 (1995)

K.Sugihara：“不可能物体的构造——图像解释理论在虚幻玩具中的应用。”

K.Sugihara and H.Inagaki: "Why is the 3d Delaunay triangulation dificult to construct?" Information Processing Letters. vol. 54. 275-280 (1995)

K.Sugihara 和 H.Inagaki：“为什么 3d Delaunay 三角剖分很难构建？”

今井敏行: "組合せ構造を優先した多角形Voronoi図の構成法" 情報処理学会研究報告(アルゴリズム研究会). 95-AL-45-3. 17-24 (1995)

Toshiyuki Imai：“优先组合结构的多边形Voronoi图的构造方法”日本信息处理学会研究报告（算法研究组）95-AL-45-3（1995）。

Y.Okabe and T.Ootsuka: "Application of the theory of KM_2O-Langevin equations to the non-linear prediction problem for the one-dimensional strictly stationary time series" Journal of the Mathematical Society of Japan. vol. 47. 349-367 (1995)

Y.Okabe 和 T.Ootsuka：“KM_2O-Langevin 方程理论在一维严格平稳时间序列的非线性预测问题中的应用”日本数学会杂志。

宮野博義,杉原厚吉: "ドロネ-四面体メッシュの品質改良のための一手法" 電子情報通信学会コンピュテーション研究会. (1997)

Hiroyoshi Miyano、Atsuyoshi Sugihara：“提高 Delaunay 四面体网格质量的方法”IEICE 计算研究组 (1997)。