Improvement of the embedding efficiency of LSB matching by sum and difference covering set

This paper analyzes random bits and scanned documents, two forms of secret data. The secret data were pre-processed by halftone, quadtree, and S-Box transformations, and the size of the scanned document was reduced by 8.11 times. A novel LSB matching algorithm with low distortion was proposed for the embedding step. The golden ratio was firstly applied to find the optimal embedding position and was used to design the matching function. Both theory and experiment have demonstrated that our study presented a good trade-off between high capacity and low distortion and is superior to other related schemes.

Download Full-text

Detection of LSB Matching Revisited Using Pixel Difference Feature

KSII Transactions on Internet and Information Systems ◽

10.3837/tiis.2013.10.011 ◽

2013 ◽

Vol 7 (10) ◽

pp. 2514-2526 ◽

Cited By ~ 2

Keyword(s):

Lsb Matching

Download Full-text

Steganalysis Based on Difference Statistics for LSB Matching Steganography

Information Technology Journal ◽

10.3923/itj.2009.1281.1286 ◽

2009 ◽

Vol 8 (8) ◽

pp. 1281-1286 ◽

Cited By ~ 23

Author(s):

Jiaohua Qin ◽

Xingming Sun ◽

Xuyu Xiang ◽

Zhihua Xia

Keyword(s):

Lsb Matching

Download Full-text

Detection of LSB Matching Steganography using Neighborhood Node Degree Characteristics

Information Technology Journal ◽

10.3923/itj.2011.1601.1607 ◽

2011 ◽

Vol 10 (8) ◽

pp. 1601-1607 ◽

Cited By ~ 2

Author(s):

Bin Xia ◽

Xingming Sun ◽

Lingyun Xiang ◽

Haijun Luo ◽

Hengfu Yang

Keyword(s):

Node Degree ◽

Lsb Matching

Download Full-text

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

Applied Sciences ◽

10.3390/app10217820 ◽

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.

Download Full-text

Average covering number for some graphs

RAIRO - Operations Research ◽

10.1051/ro/2018044 ◽

2019 ◽

Vol 53 (1) ◽

pp. 261-268

Author(s):

D. Doğan Durgun ◽

Ali Bagatarhan

Keyword(s):

Interconnection Networks ◽

Undirected Graph ◽

Cartesian Product ◽

Covering Number ◽

Minimum Cardinality ◽

Covering Numbers ◽

Covering Set ◽

Local Covering

The interconnection networks are modeled by means of graphs to determine the reliability and vulnerability. There are lots of parameters that are used to determine vulnerability. The average covering number is one of them which is denoted by $ \overline{\beta }(G)$, where G is simple, connected and undirected graph of order n ≥ 2. In a graph G = (V(G), E(G)) a subset $ {S}_v\subseteq V(G)$ of vertices is called a cover set of G with respect to v or a local covering set of vertex v, if each edge of the graph is incident to at least one vertex of Sv. The local covering number with respect to v is the minimum cardinality of among the Sv sets and denoted by βv. The average covering number of a graph G is defined as β̅(G) = 1/|v(G)| ∑ν∈v(G)βν In this paper, the average covering numbers of kth power of a cycle $ {C}_n^k$ and Pn □ Pm, Pn □ Cm, cartesian product of Pn and Pm, cartesian product of Pn and Cm are given, respectively.

Download Full-text

A REMARK ON PRIMALITY TESTING AND DECIMAL EXPANSIONS

Journal of the Australian Mathematical Society ◽

10.1017/s1446788712000043 ◽

2011 ◽

Vol 91 (3) ◽

pp. 405-413 ◽

Cited By ~ 7

Author(s):

TERENCE TAO

Keyword(s):

Upper Bound ◽

Primality Testing ◽

Positive Proportion ◽

Fixed Base ◽

Covering Set ◽

Selberg Sieve

AbstractWe show that for any fixed base a, a positive proportion of primes become composite after any one of their digits in the base a expansion is altered; the case where a=2 has already been established by Cohen and Selfridge [‘Not every number is the sum or difference of two prime powers’, Math. Comput.29 (1975), 79–81] and Sun [‘On integers not of the form ±pa±qb’, Proc. Amer. Math. Soc.128 (2000), 997–1002], using some covering congruence ideas of Erdős. Our method is slightly different, using a partially covering set of congruences followed by an application of the Selberg sieve upper bound. As a consequence, it is not always possible to test whether a number is prime from its base a expansion without reading all of its digits. We also present some slight generalisations of these results.

Download Full-text