检索结果-内蒙古大学图书馆

Efficient reversible data hiding in encrypted images using block complexity and most significant bit inversion strategy

引用

Multimedia Tools and Applications 2024年 1-26页

作者： Yang, Cheng-Hsing Weng, Chi-Yao Hung, Chia-Ling WANG, Shiuh-Jeng Department of Computer Science and Artificial Intelligence National Pingtung University Pingtung900 Taiwan Department of Computer Science and Information Engineering National Chiayi University Chiayi600 Taiwan Department of Information Management Central Police University Taoyuan City333 Taiwan

Reversible data hiding in the encrypted images (RDHEI) has attracted more attention because RDHEI can be used for both information protection and image encryption. Many researches based on RDHEI have been proposed by using the Most Significant Bit (MSB) inversion to embed confidential information, but they might subject to errors when extracting the hidden information. This paper improves the approach based on MSB inversion and proposes a new RDHEI technique. Our approach hides the block’s position of the block in the image, which would cause misinterpretation in the original image, and then encrypts the image. The MSB inversion strategy is applied to embed the secret messages in the encrypted image. Since the location information of the error block is pre-hidden in the image, this information ensures that the secret message is correctly extracted and the image is fully recovered. We also created a multi-regular block complexity formula to determine the secret bits hidden in a block and recover the original block. In addition, we extended the design of four methods to cover various segmentation strategies and complexity calculation methods. According to the experimental results, our method can successfully extract the secret message and recover the original image intact after the encrypted image is embedded with the secret message. Generally, in using different image size, we averagely achieve the PSNR and embedding capacity of 39 experimental images at 40.633 dB and 46,298.46 bits, respectively. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： block complexity Image Encryption MSB inversion Reversible Data Hiding

来源：评论

学校读者我要写书评

暂无评论

A novel data hiding by image interpolation using edge quad-tree block complexity

引用

VISUAL COMPUTER 2023年第1期39卷 59-72页

作者： RoselinKiruba, R. Sharmila, T. Sree Sri Sivasubramaniya Nadar Coll Engn Dept Informat Technol Chennai Tamil Nadu India

Data hiding method embed secret data inside a cover medium. Image quality and capacity plays a significant role in the performance of data hiding. The motivation of this paper is to improve the interpolation technique and bit plane data hiding method using edge quad-tree block complexity. Edges in the cover image are identified using edge detector and are further partitioned using quad-tree. The edges are smooth regions divided into smaller blocks in order to obtain good embedding capacity, whereas the rough regions involve those regions other than the edges and are kept as larger blocks to avoid distortion. Each quad-tree block is implemented with up-sampling interpolation based on edges and every pixel is divided into two-bit plane namely high and low bit plane. In each bit plane, two different data are embedded based on their hiding capacity. The hiding capacity of the high bit plane is calculated by two prediction levels namely Pixel Value Differencing and block complexity. In low bit plane, Least Significant Bit method is used for hiding the data. Experimental results demonstrate that the proposed method significantly improved the embedding performance, capacity and also resist to attacks when compared to other state-of-the-art methods.

关键词： block complexity Data hiding Edge Quad-tree

来源：评论

学校读者我要写书评

暂无评论

Adaptive steganography based on block complexity and matrix embedding

引用

MULTIMEDIA SYSTEMS 2014年第2期20卷 227-238页

作者： Liu, Guangjie Liu, Weiwei Dai, Yuewei Lian, Shiguo Nanjing Univ Sci & Technol Sch Automat Nanjing Jiangsu Peoples R China Huawei Technol Cent Res Inst Beijing Peoples R China

In this paper, an adaptive steganography algorithm based on block complexity and matrix embedding is proposed. The matrix embedding constructed by [8,3], [8,4] [8,5] [8,6] and [8,7] linear codes is taken as the basic embedding strategy. Each block with 2 x 4 pixels is used as a cover unit and its block complexity is computed by neighboring pixel difference. The embedding strategy sets are defined for seven kinds of blocks with different complexity. The corresponding embedding strategies are determined by resolving the embedding risk minimization problem. The adaption manners guarantee that message bits are mainly embedded into the regions with higher complexity values. Experiments are performed and the results show that the proposed method can provide a moderate capacity with lower distortion and have higher resistance ability against the chosen steganalytic algorithms.

关键词： Adaptive steganography block complexity Matrix embedding Information hiding

来源：评论

学校读者我要写书评

暂无评论

Strong approximations of shifts and the characteristic measures problem

引用

MATHEMATISCHE ZEITSCHRIFT 2025年第1期309卷 1-28页

作者： Cyr, Van Kra, Bryna Petite, Samuel Bucknell Univ Lewisburg PA 17837 USA Northwestern Univ Evanston IL 60208 USA Univ Picardie Jules Verne F-80039 Amiens France

Every symbolic system supports a Borel measure that is invariant under the shift, but it is not known if every such systems supports a measure that is invariant under all of its automorphisms, known as a characteristic measure. We give sufficient conditions to find a characteristic measure, additionally showing when it can be taken to be a measure of maximal entropy. The class of systems to which these sufficient conditions apply is large, containing a dense G delta\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G_{\delta }$$\end{document} set in the space of all shifts on a given alphabet, and is also large in the sense that it is closed under taking factors. We also investigate natural systems to which these sufficient conditions apply.

关键词： Subshift block complexity Automorphism Invariant measure

来源：评论

学校读者我要写书评

暂无评论

Characteristic measures for language stable subshifts

引用

MONATSHEFTE FUR MATHEMATIK 2023年第3期201卷 659-701页

作者： Cyr, Van Kra, Bryna Bucknell Univ Lewisburg PA 17837 USA Northwestern Univ Evanston IL 60208 USA

We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on finitely many symbols, and more generally any mixing subshift of finite type, supports such a measure. Frisch and Tamuz recently dubbed such measures characteristic, and further showed that every zero entropy subshift has a characteristic measure. While it remains open if every subshift over a finite alphabet has a characteristic measure, we define a new class of shifts, which we call language stable subshifts, and show that these shifts have characteristic measures. This is a large class that is generic in several senses and contains numerous positive entropy examples.

关键词： Subshift block complexity

来源：评论

学校读者我要写书评

暂无评论

Bin Reservation Based on IVPO Reversible Data Hiding Using Smoothness Mode Selection Strategy 17th

Bin Reservation Based on IVPO Reversible Data Hiding Using S...

引用

17th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP) / 14th International Conference on Frontiers of Information Technology, Applications and Tools (FITAT)

作者： Lee, Chin-Feng Shen, Jau-Ji Lin, Zong-Ye Chaoyang Univ Technol Dept Informat Management Taichung 41349 Taiwan Natl Chung Hsing Univ Dept Management Informat Syst Taichung 40277 Taiwan

ISBN: (纸本)9789811910531;9789811910524

Pixel value ordering (PVO) is a popular reversible data hiding (RDH) technology. The embedding strategy of the PVO method is to divide the image into blocks of the same size, sort the pixel values in each blocks, and embed the secret data to the maximum and minimum pixel values when embeddable conditions are satisfied. The embedding capacity of the PVO method will change due to the complexity of the block. If the pixels in the block is too different from each other, the embedding capacity of the PVO method will be limited. Therefore, in view of this limitation of the PVO method, this research proposes the smoothness mode selection (SMS) strategy. The SMS strategy determines the image shape according to the complexity of the pixels within image blocks, and then uses the bin reservation based on improved PVO RDH method to embed the secret data in the picture. The embedding strategy of this method enables each block of four pixels to carry at most four bits, so it has a significant higher embedding capacity. The experimental results show that the embedding capacity of our proposed method is higher than other PVO-based RDH schemes, and it also maintains a certain good image quality.

关键词： block complexity Improved pixel value ordering Pixel value ordering Reversible data hiding

来源：评论

学校读者我要写书评

暂无评论

The automorphism group of a shift of slow growth is amenable

引用

ERGODIC THEORY AND DYNAMICAL SYSTEMS 2020年第7期40卷 1788-1804页

作者： Cyr, Van Kra, Bryna Bucknell Univ Lewisburg PA 17837 USA Northwestern Univ Evanston IL 60208 USA

Suppose. (X, sigma) is a subshift, P-X(n) is the word complexity function of X, and Aut(X) is the group of automorphisms of X. We show that if P-X(n) = o(n(2)/log(2) n), then Aut(X) is amenable (as a countable, discrete group). We further show that if P-X(n) = D o(n(2)), then Aut(X) can never contain a non-abelian free monoid (and, in particular, can never contain a non-abelian free subgroup). This is in contrast to recent examples, due to Salo and Schraudner, of subshifts with quadratic complexity that do contain such a monoid.

关键词： subshift automorphism block complexity amenable

来源：评论

学校读者我要写书评

暂无评论

High-fidelity reversible data hiding by Quadtree-based pixel value ordering

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第6期78卷 7125-7141页

作者： Di, Fuqiang Zhang, Minqing Liao, Xin Liu, Jia Engn Univ Chinese Peoples Armed Police Dept Elect Technol Xian 710086 Shaanxi Peoples R China Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China Hunan Police Acad Key Lab Network Crime Invest Hunan Prov Coll Changsha 410138 Hunan Peoples R China

Recently, the pixel value ordering (PVO) method has received a great deal of attention in the field of high-fidelity reversible data hiding. To improve the embedding performance of the PVO-based method, a quadtree-based pixel value ordering (QPVO) method based on dynamic quadtree partition is proposed in this paper. Instead of using equal-sized blocks, blocks in various sizes are adaptively generated based on the quadtree partitioning and block complexity. Smooth regions are divided into smaller blocks to obtain high embedding capacity, while rough regions are divided into larger blocks to avoid distortion. The decoder can recover the original image as well as the original quadtree structure by the block complexity. Extensive experiments demonstrate that the proposed QPVO method could significantly improve the embedding performance of these PVO-based methods, especially for a relatively small embedding payload.

关键词： Reversible data hiding Pixel value ordering Quadtree partition block complexity

来源：评论

学校读者我要写书评

暂无评论

Counting generic measures for a subshift of linear growth

引用

JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY 2019年第2期21卷 355-380页

作者： Cyr, Van Kra, Bryna Bucknell Univ Lewisburg PA 17837 USA Northwestern Univ Evanston IL 60208 USA

In 1984 Boshernitzan proved an upper bound on the number of ergodic measures for a minimal subshift of linear block growth and asked if it could be lowered without further assumptions on the shift. We answer this question, showing that Boshernitzan's bound is sharp. We further prove that the same bound holds for the, a priori, larger set of nonatomic generic measures, and that this bound remains valid even if one drops the assumption of minimality. Applying these results to interval exchange transformations, we give an upper bound on the number of nonatomic generic measures of a minimal IET, answering a question recently posed by Chaika and Masur.

关键词： Subshift automorphism block complexity interval exchange transformation

来源：评论

学校读者我要写书评

暂无评论

Resource-Bounded Kolmogorov complexity Provides an Obstacle to Soficness of Multidimensional Shifts 36

Resource-Bounded Kolmogorov Complexity Provides an Obstacle ...

引用

36th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Destombes, Julien Romashchenko, Andrei Univ Montpellier LIRMM Montpellier France Univ Montpellier CNRS LIRMM Montpellier France

ISBN: (纸本)9783959771009

We suggest necessary conditions of soficness of multidimensional shifts formulated in terms of resource-bounded Kolmogorov complexity. Using this technique we provide examples of effective and non-sofic shifts on Z(2) with very low block complexity: the number of globally admissible patterns of size n x n grows only as a polynomial in n.

关键词： Sofic shifts block complexity Kolmogorov complexity

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：