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.
This paper proposes a novel image authentication scheme based on absolute moment block truncation coding (AMBTC). In the proposed scheme, for each compressed image block we use the parity of the bitmap (BM) to generate the authentication code. For image authentication, data hiding is adopted to embed the authentication code to quantization levels of each image block compressed by absolute moment block...
With the purpose of improving the visual quality of an original block truncation coding (BTC) compressed image, an optimal modified BTC scheme (OMBTC) is proposed. The binary search tree (BST) technique is utilized to determine the optimal quantization of each image block. The proposed scheme is compared with several existing modification BTC schemes, the experimental results demonstrate that the...
Protecting data transmitted over the Internet has become a critical issue driven by the progress in data digitalization and communications networking over the past decade. The content being transmitted can be in the form of images, text and voice. To ensure that transmitted data are secure and cannot be tampered with or noticed by malicious attackers, several approaches have been proposed. Steganography...
In 2007, Wang et al. proposed two visual secret sharing schemes based on Boolean operations. One is a probabilistic (2, n) secret sharing (SS) scheme, called (2, n) ProbVSS scheme, for binary images and the other is a deterministic (n, n) SS scheme for grayscale images. Their schemes can solve the problems of computational complexity and pixel expansion at the same time. To provide a (2, n) ProbVSS...
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.