A New Steganographic Method For Grayscale Image Using Graph Coloring Problem

Douiri, Sidi Mohamed; Medeni, M. B. Ould; Elbernoussi, Souad; Souidi, El Mamoun

doi:10.12785/amis/070213

Cited by 11 publications

(8 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Image blocking takes place in both the special domain and the transform domain. In this paper, two steganography methods are selected, one of which is in the special domain [1], and the other in the transform domain [12], and the initial parameters are determined according to the bargain game model.…”

Section: Block Embeddingmentioning

confidence: 99%

“…Douiri and et.al proposed a new algorithm for embedding information by graph coloring method on black and grayscale images [1]. This method has two major problems:…”

Section: Special Domain Casementioning

confidence: 99%

“…In addition to increasing steganography 1 methods, various methods have been presented for steganalysis. Also, for more security and resistance to steganalysis methods, when comparing stego-images with cover-images, such as RS and χ 2 analysis, the graph coloring technique is used to block the image [1]. In order to improve all the methods of block-based steganography, the bargaining model can be used in game theory.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Adaptive Steganography Based on bargain Game

Keshavarzi¹,

Navidi²,

Asghari³

et al. 2021

Preprint

View full text Add to dashboard Cite

The capacity and security of the confidential message on the channel are two important challenges in steganography. In this paper, a new block steganography model is presented using the bargain method so that a competitive model is introduced. In this game, the blocks are the same players. The bargain is provided with the aim of embedding information without reducing capacity as well as increasing security. The proposed model shows that it can be used both of the special domain and the transform domain, which are two important methods of steganography. For this purpose, an example of a special domain model is introduced in which, In the first step, the image is divided into n × n blocks, and in the second step using the graph coloring algorithm, pixels are considered to embed confidential information in each block. In the third step, regarding the bargaining method in game theory, each block plays the role of a player, that the competition between players is based on the defined goal function, and in the best blocks in terms of two criteria of capacity and security, which here means each block has a higher security-to-capacity ratio, so it has a higher priority, which is determined based on the bargaining model. Also, information embedded in LSB two bits. An example of a conversion domain method is also shows that security increases without decreasing in capacity. The conclusion is evaluated by three criteria: PSNR, histogram, and − secure also, 2000 standard images were evaluated and observed that the proposed method improves the block methods of embedding information.

show abstract

Section: Block Embeddingmentioning

confidence: 99%

“…Douiri and et.al proposed a new algorithm for embedding information by graph coloring method on black and grayscale images [1]. This method has two major problems:…”

Section: Special Domain Casementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive Steganography Based on bargain Game

Keshavarzi¹,

Navidi²,

Asghari³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…If the graph can be colored with k colors, the variables can be stored into k registers. There are a number of applications to other domains such as air traffic flow management, pattern matching of images, and an analysis of biological and archeological data [18,19,20].…”

Section: B Speaker-tts Voice Mappingmentioning

confidence: 99%

Speaker-TTS voice mapping towards natural and characteristic robot storytelling

Min

Kim

et al. 2013

2013 Ieee Ro-Man

View full text Add to dashboard Cite

Abstract² Robot storytelling has the potential for its practical use in various domains such as entertainment, education, and rehabilitation. However, relying on human-recorded voices for natural storytelling is costly, and automation with text-to-speech systems is not readily applicable due to the difficulty of reflecting the full nature of stories in TTS systems. In this paper, we address the problem of automating robot storytelling with a particular focus on two issues: speaker identification and speaker-TTS voice mapping. We first conduct text analysis with rich linguistic clues to identify speakers from a given textual story. We then consider the task of speaker-TTS voice mapping as the graph coloring problem and propose effective algorithms for assigning voices to speakers given a limited number of TTS voices. Finally, we perform a user experiment on validating the usefulness of our method. The results demonstrate that our system significantly outperforms baseline systems and is also more acceptable to users.

show abstract

“…For heuristics and metaheuristics for MKPs and their variants, see recent works of [2,5,6,8,18,20,24,25,28,29,33,35,[47][48][49][50], and references therein. For graph theory applications, such as graph coloring, weighted maximum clique, and shortest path problems see [9,16,37,38]. Choi and Choi [7] proposed a redundancy identification method that is based on surrogate constraints.…”

Section: Introductionmentioning

confidence: 99%

On a New Constraint Reduction Heuristic Using Improved Bisection Method for Mixed Integer Linear Programming

Akdemir

2021

ijaa

View full text Add to dashboard Cite

In this study, we develop a surrogate relaxation-based procedure to reduce mixed-integer linear programming (MILP) problem sizes. This technique starts with one surrogate constraint which is a nonnegative linear combination of multiple constraints of the problem. At this initial step, we calculate optimal Lagrangian multipliers from LP relaxation of the problem and use them as initial surrogate multipliers. We incorporate the improved bisection method (IBM) (B. Gavish, F. Glover, and H. Pirkul, Surrogate Constraints in Integer Programming, J. Inform. Optim. Sci. 12(2) (1991), 219-228.) into our algorithm. This simple heuristic algorithm is designed to iteratively generate a new surrogate cut that is to guarantee to satisfy the most violated two constraints of the corresponding iteration. The performance of the heuristic is tested using both some problems from the OR libraries and randomly generated ones.

show abstract

A New Steganographic Method For Grayscale Image Using Graph Coloring Problem

Cited by 11 publications

References 18 publications

Adaptive Steganography Based on bargain Game

Adaptive Steganography Based on bargain Game

Speaker-TTS voice mapping towards natural and characteristic robot storytelling

On a New Constraint Reduction Heuristic Using Improved Bisection Method for Mixed Integer Linear Programming

Contact Info

Product

Resources

About