scholarly journals The Embedding Performance of StegSVM Model in Image Steganography

2018 ◽  
Vol 12 (1) ◽  
pp. 233
Author(s):  
Hanizan Shaker Hussain ◽  
Roshidi Din ◽  
Mohd Hanif Ali ◽  
Nor Balqis
Keyword(s):  
Human Visual System ◽  
Information Hiding ◽  
Image Steganography ◽  
The Other ◽  
Image Domain ◽  
Embedding Technique ◽  
Expected Performance ◽  
Technique Evaluation ◽  
Embedding Performance ◽  
Intelligent Methods

This paper focuses on one of the areas of information hiding which is image steganography. It proposes the StegSVM model as an embedding technique in steganography that has exploited human visual system through Shifted LSB that shows an expected performance. The performance of this technique evaluation is based on imperceptibility and robustness of the technique compared to the other previous models in image steganography doamin. Thus, the result shows that the proposed StegSVM model is promising. For further work, it is suggested that the other image domain through other intelligent methods should be investigated.

Adaptive Image Steganography Based on Structural Similarity Metric

2011 ◽  
pp. 454-471 ◽  
Author(s):  
Guangjie Liu ◽  
Shiguo Lian ◽  
Yuewei Dai ◽  
Zhiquan Wang
Keyword(s):  
Dynamic Programming ◽  
Information Hiding ◽  
Structural Similarity ◽  
Image Steganography ◽  
The Other ◽  
Trade Off ◽  
Similarity Metric ◽  
Adaptive Quantization ◽  
The Future ◽  
Distortion Index

Image steganography is a common form of information hiding which embeds as many message bits into images and keep the introduced distortion imperceptible. How to balance the trade-off between the capacity and imperceptibility has become a very important issue in the researches of steganography. In this chapter, we discuss one kind of the solution for disposing the trade-off, named adaptive image steganography. After a brief review, we present two methods based on structural similarity metric. The first one is based on the generalized LSB, in which the substitution depth vector is obtained via the dynamic programming under the constraint of an allowable distortion. The second method is proposed to use adaptive quantization-embedder to carry message bits. Different from the first method, the distortion index is constructed by contrast-correlation distortion. The other difference is that the parameters of the adaptive quantization embedder are embedded into the image containing message bits by the reversible da a hiding method. Beside that, we also bring forward some attractive directions worthy of being studied in the future. Furthermore, we find that the existing methods do not have a good way to control the amount of information and the distortion as an extract manner, and most schemes are designed just according to the experiences and experiments.

scholarly journals Knight Tour for Image Steganography Technique

2019 ◽  
Vol 9 (1) ◽  
pp. 1610-1613
Keyword(s):  
Growth Rate ◽  
Data Hiding ◽  
Information Hiding ◽  
High Capacity ◽  
Image Steganography ◽  
Cover Image ◽  
The Internet ◽  
Sensitive Information ◽  
Image File ◽  
Ascii Code

The growth rate of the Internet is exceeding that of any previous technology. As the Internet has become the major medium for transferring sensitive information, the security of the transferred message has now become the utmost priority. To ensure the security of the transmitted data, Image steganography has emerged out as an eminent tool of information hiding. The frequency of availability of image file is high and provides high capacity. In this paper, a method of secure data hiding in image is proposed that uses knight tour positions and further 8-queen positions in 8*8 pixel blocks.The cover image is divided into 8*8 pixel blocks and pixels are selected from each block corresponding to the positions of Knight in 8*8 chessboard starting from different pixel positions. 8-pixel values are selected from alternate knight position. Selected pixels values converted to 8-bit ASCII code and result in 8* 8 bit matrix. 8-Queen’s solution on 8*8 chessboard is applied on 8*8 bit matrix. The bits selected from 8-Queens positions and compared with 8-bit ASCII code of message characters. The proposed algorithm changes the LSB of only some of the pixels based on the above comparison. Based on parameters like PSNR and MSE the efficiency of the method is checked after implementation. Then the comparison done with some already proposed techniques. This is how, image steganography showed interesting and promising results when compared with other techniques.

Part VII Discharge and Breach, 24 Breach

2021 ◽  
Author(s):  
Andrews Neil
Keyword(s):  
The Other ◽  
Fundamental Feature ◽  
Expected Performance ◽  
English Law

This is a fundamental feature of contract doctrine. In English law breach justifies a party in terminating the contract by reason of the other’s default if: there has been a renunciation; or a serious breach of a repudiatory nature; if a term classified as a condition has been breached; if a term not so classified has been breached so that the result of the default is extremely serious. Breach can occur before the date of expected performance. Anticipatory cancellation does not automatically end the contract. Instead the other party, if able to perform without the other’s cooperation, might decide to keep the contract in operation (that topic is also examined, in the context of debt claims, at [27.36] to [27.49]). The process of terminating and the consequences of termination is also carefully explained in the present chapter.

Providing a human user artificial ability to control their eyes independently with various eye movement patterns

2012 ◽  
Vol 25 (0) ◽  
pp. 171-172
Author(s):  
Fumio Mizuno ◽  
Tomoaki Hayasaka ◽  
Takami Yamaguchi
Keyword(s):  
Eye Movements ◽  
Visual Perception ◽  
Control Systems ◽  
Eye Movement ◽  
Binocular Rivalry ◽  
Human Visual System ◽  
Visual Stimulation ◽  
The Other ◽  
Flexible Adaptation ◽  
Left And Right

Humans have the capability to flexibly adapt to visual stimulation, such as spatial inversion in which a person wears glasses that display images upside down for long periods of time (Ewert, 1930; Snyder and Pronko, 1952; Stratton, 1887). To investigate feasibility of extension of vision and the flexible adaptation of the human visual system with binocular rivalry, we developed a system that provides a human user with the artificial oculomotor ability to control their eyes independently for arbitrary directions, and we named the system Virtual Chameleon having to do with Chameleons (Mizuno et al., 2010, 2011). The successful users of the system were able to actively control visual axes by manipulating 3D sensors held by their both hands, to watch independent fields of view presented to the left and right eyes, and to look around as chameleons do. Although it was thought that those independent fields of view provided to the user were formed by eye movements control corresponding to pursuit movements on human, the system did not have control systems to perform saccadic movements and compensatory movements as numerous animals including human do. Fluctuations in dominance and suppression with binocular rivalry are irregular, but it is possible to bias these fluctuations by boosting the strength of one rival image over the other (Blake and Logothetis, 2002). It was assumed that visual stimuli induced by various eye movements affect predominance. Therefore, in this research, we focused on influenced of patterns of eye movements on visual perception with binocular rivalry, and implemented functions to produce saccadic movements in Virtual Chameleon.

Secure Information Hiding System in Image Steganography

2019 ◽  
Vol 8 (7) ◽  
pp. 226-230
Author(s):  
Zo Nun Khuma ◽  
Dr. Khaing Myat Mon ◽  
Dr. Cho Cho Myint
Keyword(s):  
Information Hiding ◽  
Image Steganography ◽  
Secure Information

scholarly journals Safe Policy Improvement with Baseline Bootstrapping in Factored Environments

2019 ◽  
Vol 33 ◽  
pp. 4967-4974 ◽  
Author(s):  
Thiago D. Simão ◽  
Matthijs T. J. Spaan
Keyword(s):  
Reinforcement Learning ◽  
Confidence Level ◽  
Learning Algorithm ◽  
The Other ◽  
Sample Complexity ◽  
Policy Improvement ◽  
Expected Performance ◽  
Order Of Magnitude ◽  
Past Experiences ◽  
The Empirical Analysis

We present a novel safe reinforcement learning algorithm that exploits the factored dynamics of the environment to become less conservative. We focus on problem settings in which a policy is already running and the interaction with the environment is limited. In order to safely deploy an updated policy, it is necessary to provide a confidence level regarding its expected performance. However, algorithms for safe policy improvement might require a large number of past experiences to become confident enough to change the agent’s behavior. Factored reinforcement learning, on the other hand, is known to make good use of the data provided. It can achieve a better sample complexity by exploiting independence between features of the environment, but it lacks a confidence level. We study how to improve the sample efficiency of the safe policy improvement with baseline bootstrapping algorithm by exploiting the factored structure of the environment. Our main result is a theoretical bound that is linear in the number of parameters of the factored representation instead of the number of states. The empirical analysis shows that our method can improve the policy using a number of samples potentially one order of magnitude smaller than the flat algorithm.

scholarly journals Binary  Image  Steganography  based  on  Permutation

2021 ◽  
Author(s):  
Juvet Karnel Sadié ◽  
Stéphane Gael Raymond Ekodeck ◽  
Rene Ndoundam
Keyword(s):  
Binary Image ◽  
Image Steganography ◽  
Image Block ◽  
Hiding Capacity ◽  
Binary Images ◽  
Embedding Technique

Abstract We propose a steganographic scheme based on permutations, which improves the capacity of embedding information in a series of p host binary images. Given a host binary image block of size m x n bits and any embedding technique T, where T can hide Q(m, n) bits of data in the image; given p images, T can hide p x Q(m, n) bits of data in these images. Our scheme improves the capacity of embedding information in p images such that, instead of p x Q(m, n) bits, it can hide p x log2(p) + p x Q(m, n)bits. The results which have been obtained by experiments, show that our model performs a better hiding process in terms of hiding capacity.

scholarly journals Coverless image steganography based on DenseNet feature mapping

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Qiang Liu ◽  
Xuyu Xiang ◽  
Jiaohua Qin ◽  
Yun Tan ◽  
Yao Qiu
Keyword(s):  
Information Hiding ◽  
Binary Tree ◽  
State Of The Art ◽  
Image Steganography ◽  
High Dimensional ◽  
Feature Mapping ◽  
Hidden Information ◽  
Geometric Attacks ◽  
Coverless Information Hiding ◽  
Cis Methods

Abstract Since the concept of coverless information hiding was proposed, it has been greatly developed due to its effectiveness of resisting the steganographic tools. Most existing coverless image steganography (CIS) methods achieve excellent robustness under non-geometric attacks. However, they do not perform well under some geometric attacks. Towards this goal, a CIS algorithm based on DenseNet feature mapping is proposed. Deep learning is introduced to extract high-dimensional CNN features which are mapped into hash sequences. For the sender, a binary tree hash index is built to accelerate index speed of searching hidden information and DenseNet hash sequence, and then, all matched images are sent. For the receiver, the secret information can be recovered successfully by calculating the DenseNet hash sequence of the cover image. During the whole steganography process, the cover images remain unchanged. Experimental results and analysis show that the proposed scheme has better robust compared with the state-of-the-art methods under geometric attacks.

scholarly journals Coding of navigational affordances in the human visual system

2017 ◽  
Vol 114 (18) ◽  
pp. 4793-4798 ◽  
Author(s):  
Michael F. Bonner ◽  
Russell A. Epstein
Keyword(s):  
Visual System ◽  
Human Visual System ◽  
Spatial Navigation ◽  
The Other ◽  
Visual Features ◽  
Central Component ◽  
Natural Scenes ◽  
Unknown Mechanism ◽  
Population Codes

A central component of spatial navigation is determining where one can and cannot go in the immediate environment. We used fMRI to test the hypothesis that the human visual system solves this problem by automatically identifying the navigational affordances of the local scene. Multivoxel pattern analyses showed that a scene-selective region of dorsal occipitoparietal cortex, known as the occipital place area, represents pathways for movement in scenes in a manner that is tolerant to variability in other visual features. These effects were found in two experiments: One using tightly controlled artificial environments as stimuli, the other using a diverse set of complex, natural scenes. A reconstruction analysis demonstrated that the population codes of the occipital place area could be used to predict the affordances of novel scenes. Taken together, these results reveal a previously unknown mechanism for perceiving the affordance structure of navigable space.

Sign in / Sign up

Export Citation Format

Share Document