Study on a high-level processing for large size image using a effective geometrical graphic data structure

利用有效的几何图形数据结构对大尺寸图像进行高级处理的研究

• 批准号: 61460233
• 负责人: OHSAWA Yutaka
• 金额: $ 3.58万
• 依托单位: University of Tokyo
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for General Scientific Research (B)
• 财政年份: 1986
• 资助国家: 日本
• 起止时间: 1986 至 1987
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-61460233/
• 关键词: Image Processing; Graphical data structure; Drawing Processor; Pattern Database BD tree; カラー画像の限定色表示; コンピューターグラフィックス; 画像認識・理解; 画像処理; パターンデータ構造; 図面処理

A new type of software-based image processing technique is proposed and investigated in this paper, which can realize very high efficiency and intelligence especially for large size (or large volume)image data such as various types of drawings and color images.In the first stage of the project, an efficient general purpose data structure suitable for 2 of 3 dimensional graphical primitives (lines, areas, volumes etc.),named the BD tree(graphic),has been introduced by devised extension of a multi-dimensional data structure BD tree which was proposed uniquely by this research group in 1983. Effectiveness of this graphical data structure has been revealed from the viewpoint of memory usage and retrieval efficiency through many computer simulations using a various types of real map data.In the next stage, a general framework for software-based large image processing has been proposed and evaluated. Large image data, typically 8000 by 6000 pixels coded by run-length method, are first conver … More ted into appropriate graphical primitives such as contour vectors by our unique method, which are then inserted bynamically to the BD tree(graphics) as preparation for hereafter processing. All the required image processing functions can be performed by a efficient and intelligent geometric operations on the graphical primitives representing the original image. Abstraction level for original graphical primitives are gradually enhanced through core vector level, higher graphical primitive level such as circle, and finally semantically recognized level. A drawing processor, the AI-MUDAMS is implemented using portable language C as a concrete embodiment of this general frame-work.In final, a new color selection technique using a similar framework using the extended threedimensional BD tree has been also proposed. Many experiments, including 16-color 256-dolor selection from 16 million color images in the Japanese Academic standard image database, SIDBA, reveals the superiority of the proposed method to other existing methods. Less

本文提出并研究了一种新型的基于软件的图像处理技术，该技术可以实现非常高的效率和智能化，特别是对于各种类型的图纸和彩色图像等大尺寸（或大体积）的图像数据。在项目的第一阶段，通过对本课题组于1983年独特提出的多维数据结构BD树的设计扩展，引入了一种适用于三维图形基元（线、面积、体积等）的高效通用数据结构，称为BD树（图形）。通过对各种类型的真实地图数据进行计算机模拟，从内存使用和检索效率的角度揭示了这种图形数据结构的有效性。在第二阶段，提出并评估了基于软件的大图像处理的总体框架。采用游程法编码的大图像数据通常为8000 × 6000像素，首先通过我们独特的方法将其转换成合适的图形原语，如轮廓向量，然后动态插入到BD树（图形）中，为后续处理做准备。通过对表示原始图像的图形基元进行高效、智能的几何运算，可以完成所有所需的图像处理功能。原始图形原语的抽象层次通过核心向量层、圆等更高的图形原语层，最后是语义识别层，逐步提升。作为一个绘图处理器，AI-MUDAMS是使用可移植的C语言作为这个通用框架的具体体现来实现的。最后，本文还提出了一种新的颜色选择技术，该技术使用了类似的框架，即扩展的三维BD树。许多实验，包括从日本学术标准图像数据库SIDBA的1600万张彩色图像中选择16色256色图像，都显示了所提出方法相对于其他现有方法的优越性。少

项目成果

Y.Ohsawa;Masao SAKAUCHI: Proc.ICPR'86. 729-731 (1986)

Y.Ohsawa；Masao SAKAUCHI：Proc.ICPR86。

Masao,Sakauchi and Yutaka,Ohsawa: Shokodo pub. company. Image database, 198 (1987)

坂内正男和大泽丰：松古堂酒吧。

坂内正夫: 情報処理. 27巻,10号. 1153-1161 (1986)

坂内正夫：信息处理，第 27 卷，第 10 期。1153-1161 (1986)

曽根光男: 電子情報通信学会論文誌. J71-D. 102-109 (1988)

Mitsuo Sone：电子、信息和通信工程师协会学报 J71-D 102-109 (1988)。

大沢裕,坂内正夫: 電子通信学会論文誌D. J69-D.No.5. 724-732 (1986)

Yutaka Osawa、Masao Sakauchi：电子与通信工程师学会汇刊 D. J69-D.No.5 (1986)。