The upper and lower bounds of the information-hiding capacity of digital images

2008 ◽  
Vol 178 (14) ◽  
pp. 2950-2959 ◽  
Author(s):  
Fan Zhang ◽  
Zhigeng Pan ◽  
Kui Cao ◽  
Fengbin Zheng ◽  
Fangming Wu
Keyword(s):  
Lower Bounds ◽  
Information Hiding ◽  
Digital Images ◽  
Upper And Lower Bounds ◽  
Hiding Capacity ◽  
Information Hiding Capacity

Study on the Technology of Information Hiding Based on HTML Tags

2013 ◽  
Vol 798-799 ◽  
pp. 423-426
Author(s):  
Xiao Feng Wang
Keyword(s):  
Information Hiding ◽  
Hiding Capacity ◽  
Comprehensive Utilization ◽  
New Methods ◽  
Text Information ◽  
Information Hiding Capacity

Through the analysis of the hypertext markup, proposed and implemented several new methods of text information hiding. The concealment of these methods is better, Comprehensive utilization of these methods can obtain large information hiding capacity, better concealed. And they have better robustness for traditional attack.

scholarly journals Computing upper and lower bounds of rotation angles from digital images

2009 ◽  
Vol 42 (8) ◽  
pp. 1708-1717 ◽  
Author(s):  
Yohan Thibault ◽  
Yukiko Kenmochi ◽  
Akihiro Sugimoto
Keyword(s):  
Lower Bounds ◽  
Digital Images ◽  
Upper And Lower Bounds

New Proposals for Data Hiding in Paper Media

2013 ◽  
pp. 258-285
Author(s):  
Kitahiro Kaneda ◽  
Keiichi Iwamura
Keyword(s):  
Data Hiding ◽  
Information Hiding ◽  
Extraction Rate ◽  
New Techniques ◽  
Hiding Capacity ◽  
Still Images ◽  
Additional Information ◽  
The Media ◽  
Digital Watermarks ◽  
Information Hiding Capacity

Digital watermarks provide the capability to insert additional information onto various media such as still images, movies, and audios, by utilizing features of the media content. Several techniques that use content features such as text or images have already been proposed for printed documents. The authors propose two new techniques using a single dot pattern and an Artificial Fiber (AF) pattern in order to address the disadvantages of conventional information hiding technologies for paper media. In this chapter, the authors describe each scheme’s characteristics, and how to improve its robustness. As a result, they have attained greater than 80% extraction rate with an information hiding capacity of 91 Kbits in the case of the single dot pattern, and a 100% extraction rate with color characters as the foreground in the case of using artificial fiber patterns.

Enhancing Information Hiding Capacity in Image Interpolation Based Steganography Scheme

2020 ◽  
Vol 104 (sp1) ◽  
Author(s):  
Zheng Ma ◽  
Yan Ma ◽  
Xiaohong Huang ◽  
Manjun Zhang ◽  
Yanxiao Liu ◽  
...  
Keyword(s):  
Information Hiding ◽  
Image Interpolation ◽  
Hiding Capacity ◽  
Information Hiding Capacity

Research on Information Hiding Based on XML Document

2013 ◽  
Vol 850-851 ◽  
pp. 483-486
Author(s):  
Xiao Feng Wang
Keyword(s):  
Information Hiding ◽  
Experimental Results ◽  
Hiding Capacity ◽  
Xml Document ◽  
Information Hiding Capacity

This paper designs and implements an information hiding algorithms by using the equivalent characteristics of attributes and sub-elements in the XML document. Experimental results show that the algorithm has large information hiding capacity, better hiding features and robustness.

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

scholarly journals Hadamard k-fractional inequalities of Fejér type for GA-s-convex mappings and applications

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du
Keyword(s):  
Lower Bounds ◽  
Hypergeometric Functions ◽  
Upper And Lower Bounds ◽  
Weighted Inequalities ◽  
Convex Mappings ◽  
Special Means

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.

Sign in / Sign up

Export Citation Format

Share Document