摘要:
描述了一種基于數(shù)字位置信息的信息隱藏方法,給出了一個(gè)單位增廣矩陣,并在此基礎(chǔ)上給出了具體算法.該方法若用單個(gè)數(shù)位信息,在n=2m-1時(shí),嵌入效率可達(dá)到m,有較高的數(shù)據(jù)嵌入效率;若用多個(gè)數(shù)位組合信息,可在保持嵌入效率不變的條件下,數(shù)據(jù)嵌入率近似等于1(n較大時(shí)),在相同比特?cái)?shù)的宿主信息中,可嵌入較多的隱藏信息,可用于流媒體等信息量較大信息的隱藏.文中所述的方法,計(jì)算復(fù)雜度不高,易于硬件實(shí)現(xiàn),已用微型計(jì)算機(jī)在局域網(wǎng)上進(jìn)行了模擬實(shí)驗(yàn),獲得了較好的實(shí)驗(yàn)結(jié)果.
Abstract:
This paper presents a method of information hiding based on the digital-position information, bringing forward an augmented identity matrix and a definite arithmetic upon it. In this method, if the single digital-position information is used, embedding efficiency can achieve m when n = 2m -1. And if the multi-digital-position information is used, data embedding rate can almost reach 1 when n is big enough, with the condition of an unchanged embedding efficiency. So more information can be hided in the host information with same bits and it can be used in stream multimedia, hidings with great information, etc. The proposed method with low computing complexity can be realized easily. Satisfying experimental results are gained on PC and LAN
下載:
