3次元モデルを対象とした電子透かし・検索・圧縮技術に関する研究

3D模型数字水印、搜索和压缩技术研究

• 批准号: 12680342
• 负责人: OHBUCHI Ryutarou
• 金额: $ 2.11万
• 依托单位: Yamanashi University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2000
• 资助国家: 日本
• 起止时间: 2000 至 2001
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-12680342/
• 关键词: geometrical modeling; information security; three-dimensional graphics; digital watermarking; data compression; shape similarity search; ポリゴンメッシュ

During this last fiscal year, we foctised our effort on tlie study of digital watermarking and shape similarity search of 3D models.1. Digital Watermarking : In the last fiscal year, we developed a new digital watermarking algorithm for 3D polygonal meshes that employs the mesh spectral analysis technique (We published the results in the IPSJ Journal and at the Graphics Interface 2001). Watermarks embedded by using this method are resilient -against additive random noise, mesh smoothing, and other interferences. At the same time, the method has a high information payload (i.e., information bits embedded per number of vertices). However, the method has a pair of weakness, that are, the watermarks are destroyed if connectivity of the mesh is disturbed (e.g., by mesh simplification), and that the computational cost of mesh spectral analysis is quite high, taking hours to watermark a mesh having a few thousands of vertices. In this fiscal year, we refined the algorithm quite a bit to overc … More ome these two weaknesses. Namely, we improved in three areas ; (1) by employing an efficient eigen-decomposition algorithm, and (2) by per-patch alignment of meshes after geometrical transformations, and (3) by recovering the original mesh connectivity through remeshing. We implemented and evaluated the improved algorithm. (The results of the new algorithm will be presented at EUROGRAPHICS '2002 in September 2002.)Separately, we have improved our digital watermarking algorithm for vector digital maps in order to give it a resiliency against cropping.2. Compression We have not worked on compression in this fiscal year.3. Shape Similarity Search : We studied various shape features and methods to compare the features. Shape similarity search algorithms have two common difficulties : (1) Alignment of models is necessary for proper comparison of similarity, and (2) a similarity computed mechanically often misses the result based on human perception. In this fiscal year we developed a new shape similarity search method by combining a shape feature due to Osada, et al. and a learning classifier called Support Vector Machine. Our preliminary results show that the method reflects human perception/cognition and is quite robust against irregularities in the model such as topological error and geometrical degeneracies. Less

在上一个财政年度，我们专注于数字水印和3D模型形状相似性搜索的研究。数字水印：在上一个财政年度，我们开发了一种新的数字水印算法的三维多边形网格，采用网格频谱分析技术（我们发表在IPSJ杂志和图形接口2001年的结果）。使用这种方法嵌入的水印是有弹性的-对加性随机噪声，网格平滑，和其他干扰。同时，该方法具有高信息有效载荷（即，每个顶点数嵌入的信息比特）。然而，该方法有一对弱点，即，如果网格的连通性受到干扰（例如，通过网格简化），并且网格谱分析的计算成本相当高，花费数小时来对具有几千个顶点的网格加水印。在本财政年度，我们对算法进行了相当大的改进， ...更多信息 这两个弱点。也就是说，我们在三个方面进行了改进：（1）通过采用一种有效的特征分解算法，（2）通过几何变换后的网格的每片对齐，（3）通过重新网格化恢复原始网格连接。我们实现并评估了改进的算法。(The新算法的结果将在2002年9月举行的EUROGRAPHICS '2002上公布。另外，我们还对矢量地图的数字水印算法进行了改进，使其具有抗裁剪的能力.压缩我们在本财政年度没有进行压缩工作。形状相似性搜索：我们研究了各种形状特征和比较特征的方法。形状相似性搜索算法有两个共同的困难：（1）对齐的模型是必要的适当的相似性比较，和（2）机械计算的相似性往往错过了基于人类感知的结果。在本财年，我们将Osada等人的形状特征与称为支持向量机的学习分类器相结合，开发了一种新的形状相似性搜索方法。我们的初步结果表明，该方法反映了人类的感知/认知，是非常强大的不规则性的模型，如拓扑错误和几何退化。少

项目成果

Ryutarou Ohbuchi, Yoshiyuki Kokojima, Shigeo Takahashi: "Blending Shapes by Using Subdivision Surfaces"Computers and Graphics. 25(2001). 41-58 (2001)

Ryutarou Ohbuchi、Yoshiyuki Kokojima、Shigeo Takahashi：“使用细分曲面混合形状”计算机和图形。

S.Takahashi, Y.Kokojima, R.Ohbuchi: "Explicit Control of Topological Transitions in Morphing Shapes of 3D Meshes"Proc.Pacific Graphics 2001(フルペーパーで査読)IEEE Computer Science Press.. ISBNo-7695-1227-5. 70-79 (2001)

S.Takahashi、Y.Kokojima、R.Ohbuchi：“3D 网格变形中的拓扑过渡的显式控制”Proc.Pacific Graphics 2001（全文经过同行评审）IEEE 计算机科学出版社.. ISBNo-7695-1227-5 70-79（2001）

大渕 竜太郎, 高橋 成雄, 宮澤 貴彦, 向山 明夫: "スペクトル分解を用いた3次元メッシュへの電子透かしの埋め込み"情報処理学会論文誌. 第42巻第5号. 1103-1114 (2001)

Ryutaro Ohbuchi、Shigeo Takahashi、Takahiko Miyazawa、Akio Mukaiyama：“使用光谱分解将数字水印嵌入到三维网格中”，日本信息处理学会会刊，第 42 卷，第 5 期。1103-1114 (2001)。

爰島 快行, 高橋 成雄, 大渕 竜太郎: "3次元メッシュモーフィングにおける位相変化の明示的制御"画像電子学会/情報処理学会共催.Visual ComputingグラフィクスとCAD合同シンポジウム 2001(査読つき). 133-138 (2001)

Yoshiyuki Kajima、Shigeo Takahashi、Ryutaro Obuchi：“3D 网格变形中相变的显式控制”由日本图像电子工程师学会/日本信息处理学会视觉计算图形和 CAD 联合研讨会 2001 联合主办。审查）133-138（2001）。

R.Ohbuchi, S.Takahashi, T.Miyazawa, A.Mukaiyama: "Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain"Proc. Graphics Interface 2001 (フルペーパーで査読). ISBN0-96888898-0-0. 9-17 (2001)

R.Ohbuchi、S.Takahashi、T.Miyazawa、A.Mukaiyama：“网格光谱域中的水印 3D 多边形网格”Proc. 2001（同行评审全文）。 -17 (2001)