2012年學者Hong與Chen提出了一個高隱藏資訊量的資料隱藏技術,稱為合適像素配對法(Adaptive Pixel Pair Matching,APPM),在遮蔽圖像物件中每一對鄰近像素藏入任意一個k進制數字(k>=1)。APPM方法運用一對鄰近像素值對應於二維空間之參考座標,並根據欲嵌入的秘密資訊數字,在鄰近區域集附近內尋找到一個座標來進行置換。此方法不僅實現了高隱藏資料量,而且對一些已知的隱藏攻擊技術具有很好的抵抗力。APPM方法是在二維度空間中搜尋最佳資料隱藏的解決方案,然而其搜尋空間的約束也限制了這些解決方案的效能。本篇論文提出一個運用座標映射對應方法之資料隱藏的通式,將遮蔽圖像中每n個像素組成一組圖像區塊,來對應於 維度空間之參考座標,並以最小平方誤差映射隱藏函數從鄰近區域集搜尋最佳隱藏區塊解。本論文中並實現了以每一組圖像區塊為3個像素(n=3)之資料隱藏實例,且經實驗數據證明,確實較APPM方法的資料隱藏方法,具有更佳的資料隱藏能力。
In 2012 Hong and Chen proposed a novel data embedding method using adaptive pixel pair matching (APPM), in which a k-ary(k>=1) number is embedded in each pair of pixels of the cover image. It uses a pixel pair as a reference coordinate in two-dimensional space, and searches for a nearby coordinate in the neighborhood set to replace the pixel pair according to a given message digit. The method not only achieves a high hiding-payload, but also has good resistibility against the attacks of some well-known steganalysis techniques. APPM searches for the best embedding solution in 2D space in which the constraint for the searching space limits the performance of the scheme. In this paper a general form of data embedding using conceptualized coordinate mapping method is proposed. It processes n pixel values of an image block as a reference coordinate in n-dimensional space, and searches for the neighborhood set with least square error to constructs the embedding function. The construction of the proposed scheme with three-pixel block (n=3) under various message bases are illustrated in the paper. Experimental results show that the proposed scheme has higher embedding efficiency than that of the APPM.