scholarly journals Minimal Embedding Dimensions of Rectangle k-Visibility Graphs

2021 ◽  
Vol 25 (1) ◽  
pp. 59-96
Author(s):  
Espen Slettnes
Keyword(s):  
Visibility Graphs ◽  
Minimal Embedding

Using adapted visibility graphs for network planning

2008 ◽  
Author(s):  
Branka Lakic ◽  
Marek Hajduczenia ◽  
Henrique J. A. da Silva ◽  
Paulo P. Monteiro
Keyword(s):  
Network Planning ◽  
Visibility Graphs

Path planning for mobile robots based on visibility graphs and A* algorithm

2015 ◽  
Author(s):  
Juan D. Contreras ◽  
Fernando Martínez S. ◽  
Fredy H. Martínez S.
Keyword(s):  
Path Planning ◽  
Mobile Robots ◽  
A Algorithm ◽  
Visibility Graphs

scholarly journals Analytic degree distributions of horizontal visibility graphs mapped from unrelated random series and multifractal binomial measures

2017 ◽  
Vol 119 (4) ◽  
pp. 48008 ◽  
Author(s):  
Wen-Jie Xie ◽  
Rui-Qi Han ◽  
Zhi-Qiang Jiang ◽  
Lijian Wei ◽  
Wei-Xing Zhou
Keyword(s):  
Random Series ◽  
Horizontal Visibility ◽  
Visibility Graphs

scholarly journals Planar segment visibility graphs

2000 ◽  
Vol 16 (4) ◽  
pp. 235-243 ◽  
Author(s):  
H. Everett ◽  
C.T. Hoàng ◽  
K. Kilakos ◽  
M. Noy
Keyword(s):  
Visibility Graphs

Entropy and Renormalization in Chaotic Visibility Graphs

2016 ◽  
pp. 1-39 ◽  
Author(s):  
Bartolo Luque ◽  
Fernando Jesús Ballesteros ◽  
Alberto Robledo ◽  
Lucas Lacasa
Keyword(s):  
Visibility Graphs

scholarly journals Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness

2006 ◽  
pp. 73-82 ◽  
Author(s):  
Alice M. Dean ◽  
William Evans ◽  
Ellen Gethner ◽  
Joshua D. Laison ◽  
Mohammad Ali Safari ◽  
...  
Keyword(s):  
Chromatic Number ◽  
Visibility Graphs

scholarly journals Block-Based Steganography Method Using Optimal Selection to Reach High Efficiency and Capacity for Palette Images

2020 ◽  
Vol 10 (21) ◽  
pp. 7820
Author(s):  
Han-Yan Wu ◽  
Ling-Hwei Chen ◽  
Yu-Tai Ching
Keyword(s):  
High Efficiency ◽  
Optimal Selection ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Embedding Efficiency ◽  
Block Based ◽  
Location Map ◽  
Embedding Distortion ◽  
Minimal Embedding

The primary goal of steganographic methods is to develop statically undetectable methods with high steganographic capacity. The embedding efficiency is one kind of measure for undetectability. Block-based steganography methods have been proposed for achieving higher embedding efficiency under limited embedding capacity. However, in these methods, some blocks with larger embedding distortions are skipped, and a location map is usually incorporated into these methods to record the embedding status of each block. This reduces the embedding capacity for secret messages. In this study, we proposed a block-based steganography method without a location map for palette images. In this method, multiple secret bits can be embedded in a block by modifying at most one pixel with minimal embedding distortion; this enables each block to be used for data embedding; thus, our method provides higher embedding capacity. Furthermore, under the same capacity, the estimated and experimental embedding efficiencies of the proposed method are compared with those of Imaizumi et al. and Aryal et al.’s methods; the comparisons indicate that the proposed method has higher embedding efficiency than Imaizumi et al. and Aryal et al.’s methods.

Sign in / Sign up

Export Citation Format

Share Document