【摘要】：拓?fù)湫畔⑹枪こ藽AD圖的核心,其完整性直接影響著工程設(shè)計(jì)的效率和質(zhì)量.針對(duì)二維異構(gòu)工程CAD圖的拓?fù)渫暾哉J(rèn)證問題,提出一種基于半脆弱數(shù)字水印技術(shù)的通用拓?fù)湫ｒ?yàn)算法.首先根據(jù)對(duì)象間的連接關(guān)系構(gòu)造拓?fù)鋱D,并對(duì)各對(duì)象進(jìn)行統(tǒng)一編碼,實(shí)現(xiàn)異構(gòu)圖紙拓?fù)潢P(guān)系的統(tǒng)一描述;然后根據(jù)拓?fù)鋱D建立對(duì)應(yīng)的拉普拉斯矩陣,利用拉普拉斯譜計(jì)算各對(duì)象的拓?fù)涮卣髦?最后將拓?fù)涮卣髦登度氲礁鲗?duì)象的幾何不變量中.該算法通過比較提取的特征值序列與對(duì)象當(dāng)前的拓?fù)涮卣髦祦眚?yàn)證其拓?fù)渫暾?理論分析和實(shí)驗(yàn)結(jié)果表明,文中算法對(duì)于全局和局部相似性變換、拷貝、鏡像和文件格式轉(zhuǎn)換等非惡意操作具有較強(qiáng)的魯棒性,同時(shí)對(duì)于各種惡意拓?fù)涔艟哂芯_的定位能力,可以廣泛應(yīng)用于各種工程CAD領(lǐng)域.
[Abstract]:Topology information is the core of engineering CAD diagram, and its integrity directly affects the efficiency and quality of engineering design. Aiming at the problem of attestation of topological integrity of two-dimensional heterogeneous engineering CAD diagrams, a general topology verification algorithm based on semi-fragile digital watermarking is proposed. First, the topology graph is constructed according to the connection relation between objects, and each object is coded uniformly to realize the unified description of the topological relation of the heterogeneous drawing, and then the corresponding Laplace matrix is established according to the topology graph. The topological eigenvalues of each object are calculated by Laplace spectrum, and the topological eigenvalues are embedded into the geometric invariants of each object. The algorithm verifies its topological integrity by comparing the extracted sequence of eigenvalues with the current topological eigenvalues of the object. Theoretical analysis and experimental results show that the proposed algorithm is robust to non-malicious operations such as global and local similarity transformation, copying, mirroring and file format conversion. At the same time, it has accurate location ability for various malicious topology attacks, and can be widely used in various engineering CAD fields.
【作者單位】： 南京財(cái)經(jīng)大學(xué)信息工程學(xué)院;南京理工大學(xué)自動(dòng)化學(xué)院;中國(guó)科學(xué)院計(jì)算技術(shù)研究所;
【基金】：國(guó)家自然科學(xué)基金(61300160)
【分類號(hào)】：TP391.72

【相似文獻(xiàn)】

相關(guān)期刊論文 前5條

1 穆安民;ISBN和ISSN號(hào)的計(jì)算機(jī)校驗(yàn)位的一種簡(jiǎn)捷算法[J];現(xiàn)代圖書情報(bào)技術(shù);1992年03期

2 張睿;;日期格式校驗(yàn)算法[J];計(jì)算機(jī)光盤軟件與應(yīng)用;2014年10期

3 花的神明;;為文件校驗(yàn)找個(gè)“大總管”[J];網(wǎng)友世界;2011年22期

4 郝志峰,鄒波濤,郝志峰,許勇,馮良貴;求解最小碼覆蓋問題的實(shí)驗(yàn)算法[J];計(jì)算機(jī)工程與應(yīng)用;2001年01期

5 ;[J];;年期

相關(guān)碩士學(xué)位論文 前1條

1 顧浩;基于暗元先驗(yàn)去霧中的視覺優(yōu)化技術(shù)[D];南京航空航天大學(xué);2016年

，

本文編號(hào)：2248761