基于图像复杂度的隐写方法研究*

为了提供较大的隐写容量和保持良好的载密图像质量,依据人眼对纹理、边界和黑暗区域变化敏感性弱的视觉特点,结合小波变换提出了一种图像复杂度描述方法,将图像小块分为纹理、边界、黑暗和平滑四个不同类别,利用模函数设计隐写算法,在不同区域嵌入不同量的信息。实验结果表明,新的复杂度描述方法能准确区分不同类型的小块,隐写算法在提高嵌入容量的同时保持了较好的视觉质量。     

基于二阶差分Markov特征的LSB匹配隐写检测

针对安全性较高的最不重要位(LSB)匹配隐写算法,通过计算待检测图像像素水平和垂直方向的二阶差分,得到二阶差分矩阵并将其作为敏感特征提取源,提取差分矩阵的二阶Markov转移概率矩阵作为特征,提出了一种隐写检测算法。实验结果表明：与基于一阶差分Markov转移概率矩阵的算法相比,该算法在保证检测较高正确率的情况下,在很大程度上提高了算法的检测速度,增强了算法的性能和实用性。     

一种关于LSB matching的隐写分析方法的改进

LSB matching是一种广泛使用的数字图像隐写方法,但关于其隐写分析的工作目前还不多。详细讨论了最近提出的一种基于图像直方图局部极值点的关于LSB matching的隐写分析方法,指出了该方法的不足,并结合图像采样技术给出了一种新的用于LSB matching的检测子。实验表明,提出的检测子实现简单并且具有更好的检测效率。     

Current status and key issues in image steganography: A survey

Steganography and steganalysis are the prominent research fields in information hiding paradigm. Steganography is the science of invisible communication while steganalysis is the detection of steganography. Steganography means “covered writing” that hides the existence of the message itself. Digital steganography provides potential for private and secure communication that has become the necessity of most of the applications in today’s world. Various multimedia carriers such as audio, text, video, image can act as cover media to carry secret information. In this paper, we have focused only on image steganography. This article provides a review of fundamental concepts, evaluation measures and security aspects of steganography system, various spatial and transform domain embedding schemes. In addition, image quality metrics that can be used for evaluation of stego images and cover selection measures that provide additional security to embedding scheme are also highlighted. Current research trends and directions to improve on existing methods are suggested.     

基于纹理复杂度和差分的抗盲检测图像隐写算法

通过分析纹理复杂度对图像隐写分析的影响,提出一种基于纹理复杂度和像素差分的隐写算法。首先,将图像划分为大小相同的分块,通过分块中起点位置的不同计算分块中不同小块的纹理复杂度,选择复杂度最高的图像小块;然后,计算小块的相邻像素差分值,并根据秘密消息的长度和不同方向上的差分值分布确定嵌入阈值,在大于该阈值的差分值中嵌入秘密消息。对多种嵌入算法在不同图像库上做通用盲检测实验,实验结果表明,该算法在抵抗小波高阶统计量分析等盲检测算法能力方面,优于LSB匹配、图像边缘自适应嵌入等隐写算法。     

基于马尔可夫模型和特征融合的图像隐写分析

提出一种针对JPEG图像隐写的通用隐写分析方法.根据量化后分块DCT系数绝对值构造水平、垂直和zigzag方向的差分数组,利用三向差分数组马尔可夫模型挖掘量化后分块DCT块内邻近系数相关性,提取转移概率矩阵的特征.对三向特征加权融合后进行隐写分析,以提高分类性能.对安全性较高的JPEG隐写OutGuess和F5,在不同嵌入率下进行隐写分析.实验结果显示,引入特征融合后隐写分析的检出率明显提高.     

GIF图像的EzStego隐藏算法及其分析

随着信息隐藏技术的发展,信息检测技术也越来越被人关注,其中检测分析的也变得更加重要.通过对GIF图像的信息隐藏嵌入方法中典型的EzStego算法做了分析,并根据其工作原理,实现了一种利用GIF图像中相邻像素之间平滑度的统计特征进行分析的方法.实验结果表明,该方法能有效地检测EzStego算法隐藏的信息.同时,对该方法的适用范围进行了分析.     

On the complexity of nested-object matching

Query languages for object-oriented data models involvematching ofnested-objects or nested-terms. Nested-objects are extended first-order terms: with sets and tuples as the only constructors (no function symbols). This paper studies the complexity of nested-term matching. The main result is the following complete characterization. Letset-nesting index (tuples-nesting index) denote the level of set nesting (tuple nesting) of a nested-term; letS _i,j denote the set of all nested-terms with set-indexi and tuple-indexj. Then,the matching problem for a given class S _i,j is NP-Complete if either i2,or i>0and j>0;otherwise, the complexity of the matching problem for S _i,j is in PTIME. We compare our work with the related work on set-matching, and show that our results yield an alternative proof, using fewer interpreted symbols, for the NP-completeness of the set-matching problem.     

Steganalysis of LSB matching based on statistical modeling of pixel difference distributions

This paper presents a least significant bit (LSB) matching steganography detection method based on statistical modeling of pixel difference distributions. Previous research indicates that natural images are highly correlated in a local neighborhood and that the value zero appears most frequently in intensity differences between adjacent pixels. The statistical model of the distribution of pixel difference can be established using the Laplace distribution. LSB matching steganography randomly increases or decreases the pixel value by 1 when the message is embedded; thus, the frequency of occurrence of the value zero in pixel differences changes most dramatically during message embedding. Based on the Laplacian model of pixel difference distributions, this paper proposes a method to estimate the number of the zero difference value using the number of non-zero difference values from stego-images and uses the relative estimation error between the estimated and actual values of the number of the zero difference value as the classification feature. Experimental results indicate that the proposed algorithm is effective in detecting LSB matching steganography and can achieve better detection performance than the local extreme method under most circumstances.     

Feature mining and pattern classification for steganalysis of LSB matching steganography in grayscale images

In this paper, we present a scheme based on feature mining and pattern classification to detect LSB matching steganography in grayscale images, which is a very challenging problem in steganalysis. Five types of features are proposed. In comparison with other well-known feature sets, the set of proposed features performs the best. We compare different learning classifiers and deal with the issue of feature selection that is rarely mentioned in steganalysis. In our experiments, the combination of a dynamic evolving neural fuzzy inference system (DENFIS) with a feature selection of support vector machine recursive feature elimination (SVMRFE) achieves the best detection performance. Results also show that image complexity is an important reference to evaluation of steganalysis performance.     

深度学习在图像隐写术与隐写分析领域中的研究进展

隐写术与隐写分析是信息安全领域的热门研究方向,近年来得到了广泛的研究与快速的发展。随着深度学习新技术的兴起,深度学习也被引入到隐写术与隐写分析领域,并在方法和性能上取得了一系列突破性的研究成果。为推进基于深度学习的隐写术与隐写分析的研究,本文对目前的主要方法和代表性工作进行了归纳与探讨。对于图像隐写术与隐写分析这两个领域,本文分别各自比较了传统方法和与相关深度学习方法的异同,详细介绍了目前主要的基于深度学习的图像隐写术与隐写分析的基本原理和方法,最后讨论了基于深度学习的图像隐写术与隐写分析仍需要解决的问题及未来的研究趋势。     

基于直方图特性的LSB匹配隐写分析研究

为了提高对高精度原始图像LSB匹配数字隐写的检测能力,提出了基于直方图特性的LSB匹配隐写分析方法.根据高精度原始图像在LSB匹配数字隐写过程前后灰度直方图、差分直方图以及小波分解后的子带系数直方图的特性差异,提取了23维的特征向量,并使用支持向量机对其进行训练,建立区分载体图像与载密图像的分类器达到检测秘密信息的目的.实验结果表明,该方法在性能上要优于文献[5]的局部极值法.     

On the OBDD complexity of the most significant bit of integer multiplication

Integer multiplication as one of the basic arithmetic functions has been in the focus of several complexity theoretical investigations. Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for boolean functions. Among the many areas of application are verification, model checking, computer-aided design, relational algebra, and symbolic graph algorithms. In this paper it is shown that the OBDD complexity of the most significant bit of integer multiplication is exponential answering an open question posed by Wegener (2000) [18].     

Similarity measures for image matching despite occlusions in stereo vision

In the context of computer vision, matching can be done with similarity measures. This paper presents the classification of these measures into five families. In addition, 18 measures based on robust statistics, previously proposed in order to deal with the problem of occlusions, are studied and compared to the state of the art. A new evaluation protocol and new analyses are proposed and the results highlight the most efficient measures, first, near occlusions, the smooth median powered deviation, and second, near discontinuities, a non-parametric transform-based measure, CENSUS.     

On the advice complexity of online bipartite matching and online stable marriage

In this paper, we study the advice complexity of the online bipartite matching problem and the online stable marriage problem. We show that for both problems, $\lceil {\log }_2(n!)\rceil$ bits of advice are necessary and sufficient for a deterministic online algorithm to be optimal, where n denotes the number of vertices in one bipartition in the former problem, and the number of men in the latter.     

人体手背静脉血管图像增强与特征匹配

为提高手背静脉血管图像识别的准确性和改善图像采集的灵活性,提出了一种新的手背静脉图像识别算法.使用自适应直方图均衡法增强背景和静脉纹理图像的总体对比度和局部细节,使用分水岭算法得到静脉纹理图像的单像素级图像,最后采用纹理相似性原理进行特征匹配和识别.试验结果证明,该算法在图像采集位置灵活变动情况下的错误接受率为0%,错误拒绝率4.6%,利用此算法进行手背静脉血管图像识别是可行的,具有良好的应用前景.     

Time complexity analysis of an evolutionary algorithm for finding nearly maximum cardinality matching

Most of works on the time complexity analysis of evolutionary algorithms have always focused on some artificial binary problems. The time complexity of the algorithms for combinatorial optimisation has not been well understood. This paper considers the time complexity of an evolutionary algorithm for a classical combinatorial optimisation problem, to find the maximum cardinality matching in a graph. It is shown that the evolutionary algorithm can produce a matching with nearly maximum cardinality in average polynomial time.     

位平面和SIFT相结合的图像匹配方法

针对传统的相关匹配算法计算量大,对图像旋转敏感等问题,提出了一种位平面和尺度不变特征变换（SIFT）相结合的图像匹配算法。将待拼接的两幅图像[A、][B]各自分解为8个位平面,对两幅图像都选择前4个具有视觉信息的位平面[A1A2A3A4]和[B1B2B3B4];对[A1A2、][A2A3、][A3A4]图像进行异或运算,得到3幅图像。由于异或后的图像[A1A2]具有足够的细节部分,轮廓却不清晰,图像[A3A4]轮廓清晰,但是丢失了太多细节,而图像[A2A3]具有清晰的轮廓,又具有足够的细节信息,所以采用图像[A2A3],然后与原图像[A]进行异或得到[A],同时采用同样的方法得到图像[B],再次采用SIFT算法进行点对匹配,利用欧氏距离进行图像匹配,最后利用RANSAC进行图像容错处理,得到一幅匹配图像。实验结果表明,该算法有效地提高了匹配速度,对图像明暗变化、尺度旋转等具有较强的健壮性。     

On data mining,compression, and Kolmogorov complexity

Will we ever have a theory of data mining analogous to the relational algebra in databases? Why do we have so many clearly different clustering algorithms? Could data mining be automated? We show that the answer to all these questions is negative, because data mining is closely related to compression and Kolmogorov complexity; and the latter is undecidable. Therefore, data mining will always be an art, where our goal will be to find better models (patterns) that fit our datasets as best as possible.     

A note on the complexity of matching patterns with variables

A word matches a pattern with variables (i.e., a string that contains terminal symbols and variable symbols) if and only if it can be obtained from the pattern by substituting the variables by terminal words. To decide for a given word whether or not it matches a pattern with variables is an NP-complete problem, which has been independently discovered and investigated in different areas of theoretical computer science and which has applications in various contexts. In this work, we show that the problem of matching patterns with variables remains NP-complete even if every variable has at most two occurrences. In addition to this, we show that if patterns can be represented as special kinds of planar graphs, then they can be matched in polynomial time.