The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Multi-bit minimum error replacement (MER) is a method that can embed multi-bit logo/secret data into k least-significant bits (LSBs) of cover data only introduces minimum embedding error (MEE). However, k-LSBs MER suffers from weak anti-forensics. Moreover, it is unfortunate because no literature discusses the formulations and the properties of multi-bit MEE up to this day. Therefore, this work proposes...
This paper presents the novel multi-bit watermarking using adaptive embedding algorithms with minimum error. These embedding algorithms can embed multi-bit (k-bit, k>=1 ) logo data into cover data only introduce minimum embedding errors which are restricted to-(2^(k-1)-1) *2^(k-i)~+-(2^(k-1)-1) *2^(k-i) according to the embedding location i. To achieve the goal of minimum embedding error, we introduced...
This paper presents the novel multi-bit bitwise adaptive embedding algorithms for data hiding. These embedding algorithms can embed multi-bit (k-bit, k ≥ 1 ) secret data into cover data only introduce minimum embedding error smaller than (2k-1-1)2i-k according to the embedding location i. To achieve such a goal, the proposed embedding algorithm adaptively evaluates the most similar value to replace...
This paper presents an novel bitwise minimum error replacement (MER) technique for data hiding. Such a bitwise MER can embed k-bit (k ≥ 1) secret data into cover data only introduce minimum embedding error smaller than (2k-1 - 1)2i-k according to the embedding location i. To achieve the goal of MER, we develop novel multi-bit bitwise 3-step MER algorithms to adaptively evaluate the most similar value...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.