Search

Steganography methods are considered to be one of the most common technologies for the protection of any digital data when transmitted over open communication channels at a given time. The solution of the problem of digital data protection using steganography methods is used not only by government services, but also by terrorist organizations. Therefore, the need for research, development and continuous improvement of steganoanalytical methods is becoming extremely important. The steganoanalytical algorithm based on the study of the singular decomposition of digital image matrix blocks is proposed in the paper. The main purpose of this paper is to increase the efficiency of digital image steganoanalysis, in the absence of a container, by developing a new steganoanalytical algorithm based on the study of the singular decomposition of digital image matrix blocks. As a result of a detailed study of the steganography algorithm using the singular decomposition of digital image matrix blocks, the statistical characteristics of the singular values of image matrix blocks are established. Based on the defined characteristics, the paper presents the main steps of the stegananoanalytical algorithm. As a criterion for assessing the effectiveness of the developed steganoanalytical algorithm, the probability of detecting additional information was used. Errors of the first and second type are considered. To compare the results of the developed steganoanalytical algorithm with existing algorithms in open access, the following applications are selected: XSteg; StegSpy. The software product "StegoAnalysis" has been implemented for the automated solution of the stegananalytical problem for digital image. [ABSTRACT FROM AUTHOR]

Video analysis is a very important tool in video surveillance systems with one or more cameras. Among the most promising features are tracking the movement of objects - tracking. The current state of development in the field of tracking is considered in the work. There are several types of trekking. Pixel Tracking is the tracking of the movement of a specific point (pixel) or group of points on the original video sequence. The result of this process is the trajectory of the pixel, corresponding to the movement of an object in the frame. Matchmoving is a complex process that allows you to create a three-dimensional scene with a digital camera based on the available video sequence, which exactly repeats the movement of a real camera. Motion Capture is a technology designed to determine the position and orientation of a real object in a virtual environment, determining the position and orientation of a real object in space is carried out using special sensors and markers. Each of these types of tracking can be used on its own or as part of more complex processes. The paper develops a modification of the camera motion detection algorithm, which works in the field of Pixel Tracking. The description of the main approaches to motion estimation is given, namely recursive raster algorithms, frequency domain algorithms, optical flow algorithms and block matching methods. The urgency of the work, its purpose and objectives are given. The paper describes a method of arranging blocks in a video sequence frame, which are used to calculate the movement of the camera. Similarity metrics are used to estimate the similarity of the blocks, namely the correlation coefficient. The paper describes the steps of the developed modification of the camera motion detection algorithm. The results of the modification of the camera motion detection algorithm are presented. The result of this work is an indicator of the visual quality of tracking in the form of a 2D image of the camera motion vector. [ABSTRACT FROM AUTHOR]

The paper proposes a modification of the steganographic method of embedding a digital watermark into Wavelet transform domain of a digital image. The proposed method embeds a watermark in the high-frequency detail coefficients of a three-level Wavelet transform using the Dobeshi-43 wavelet, which ensures the high quality of the resulting stego. Stego is a result of embedding of digital watermark into container and is saved in a losses format that is caused by wide dissemination of such images due to their small size. Discrete cosine transform is applied to a digital watermark, thereby increasing the efficiency of detecting the presence of a watermark in a stego. In work the analysis of efficiency of detecting of the digital watermark depending on the threshold values defining the choice of the detailing coefficients used for embedding is carried out. A result of this analysis is establishment the fact that increase in thresholds without application of Discrete cosine transformation to the watermark leads to considerable deterioration in accuracy of detecting. Conversely, the proposed method with the threshold values Т1=80 and Т2=90 of the choice of detailing coefficients in conjunction with the Discrete Cosine Transformation of the watermark matrix increased the percentage of correctly identified stegos. The results of the experiments showed the resistance of embedding a digital watermark to compression attacks (even with image quality QF=5), imposing noise, sharpening, shifting, for which the detection accuracy averages 97%. Also, the method is resistant to scaling provided QF>50. This paper compares the resistance of the original method of embedding a digital watermark and different variations of the proposed modification of the steganographic method to complex attacks (compression in combination with other types of digital image processing). [ABSTRACT FROM AUTHOR]

Due to the growth of computer crime, an important and urgent problem is the development of methods for detecting the integrity violations of a digital image. In particular, the detection of different types of the image post-processing after their possible forgery is a grey area of information security, and the detection of processing by the Sharpen Filter is an issue practically not covered in open scientific literature. The artificial sharpening of a digital image is the reverse procedure to the blurring. Previously, the authors of the paper developed the method for detecting blur of a digital image based on an analysis of the growth rate of singular values. When blurring, the growth rate of singular values is an order of magnitude smaller than before the blurring, which makes it possible to reveal a threshold value for detecting blurred images. The singular values increase accordingly to the artificially sharpening. But it is not possible to reveal the threshold value in this case. The aim of this paper is to identify the parameters of the digital image matrix, which indicate an artificial sharpening, and to develop a method for detecting sharpness as a digital image post-processing. If the contour is considered as a change in the brightness function of a digital image, then the change in the brightness function will be faster when the contours are sharpened. If two adjacent pixels had the close sharpness values before sharpening, then applying this filter will increase the difference between them. In this paper, the investigation of the close color pairs of an image is carried out when the Sharpness Filter was applied to it. It is revealed that the number of close color pairs during processing decreases. The threshold value which allows separating the processed image from the raw one is empirically established. The method of detecting sharpness as a digital image postprocessing is developed based on the results obtained. [ABSTRACT FROM AUTHOR]

The protection of electronic information by cryptographic and steganographic methods, as well as their combination, is in great demand today. However, the new type of steganography - hash-steganography, fundamentally differs from classical steganography in that there is no need to embed messages in a container, no need to worry about the amount of information that can be transmitted in one container without compromising the visual stability of the image. A certain sequence of ordinary digital images is a message. The purpose of this work is to increase the efficiency of transmitting a secret message by modifying the hash-method of steganography. Previously, algorithms for obtaining hash functions of digital images have not been used to transmit messages, but they have found their application in hash-steganography. This paper compares two algorithms for obtaining hash codes and suggests a method of their application for transforming a text message into a sequence of digital images. It is a certain order of files transferred that is decisive in the decryption of a message. The symbols of the message are put in correspondence with the part of the hash code of the digital image. Thus, the necessary combination of files is formed, the number of which is equal to the number of symbols in the message. A comparative analysis of the two algorithms of the method has been performed. The results obtained have confirmed the effectiveness of the hash code algorithm based on the analysis of digital image DCT coefficients. This algorithm makes the method resistant to attack by compression, changing brightness and contrast, magnification and rotation. [ABSTRACT FROM AUTHOR]

In this paper we study the effect of perturbing influences aimed at the spatial domain of digital images on the change of color triplets in the matrix of unique colors of a digital image. In the course of computational experiments established that the modification of only blue color matrix of the image, the quantity of Blue-triads (which indicate the blue color component of the image) in the matrix of unique colors of the digital image significantly exceeds the quantity of Red- and Green-triads that will allow for the examination of images clearly establish the fact of modifying the blue color component. The identified feature is typical for most containers in a lossy format which is associated with the digital image's formation technologies and compression algorithms therefore despite the low sensitivity of the human eye to blue color it is not recommended to use the blue color component for spatial transformations of the image, in particular, for steganographic transformations. During the experiments the most suitable for spatial transformations green and red color components revealed, since their modifications lead to the appearance of a smaller quantity of Green- and Red-triads (which indicate the green and red color components of the image, respectively) and to obtain a comparable quantity of all types of triads of triplets in a matrix of unique colors which will complicate the correct examination of a digital image from the point of view of unambiguously identifying a modified color component. The obtained results are substantiated from the standpoint of color perception by the human eye, which underlies the formation of colors by digital cameras, and the image compression features of the JPEG standard. Criteria for determining the color component of a digital image providing less disturbance in the quantity of sequential triads in a matrix of unique colors and the basic steps for determining for a particular image the most and least suitable for steganographic transformation color components in terms of changes in color triplets in a matrix of unique colors are given. [ABSTRACT FROM AUTHOR]

The use of the digital images in modern society is very common, making it difficult to name an industry where digital images are not used. However, in certain situations, the digital images may be direct or indirect digital evidence, such as in court cases. Tampering or violating the integrity of the digital images is one of the important issues in the information protection. The issue of the digital signal authentication by cybersecurity experts is a pressing issue in the present days. Therefore, the development of methods and algorithms for detecting the integrity of digital signals in general, and digital images in particular, is a very crucial task. Among all the possible variations in the integrity violation of digital images can be distinguished a separate group, in which the digital images are processed by various filters editors, such as blurring, sharpening, etc. The blurring is often applied to images not only when they are tampered, but also as a steganographic attack. Blur detection indicates the inability to use a digital image as the evidence of anything. One of the most effective blur detection methods known from the open sources is a method based on the analysis of singular values of blocks of a digital image matrix. The aim of this paper is to increase the efficiency of the blur detection in a digital image by modifying an algorithm based on the analysis of singular values. Computational experiments are performed to determine the number of parameters to be verified. The results obtained allow modifying the algorithm of the method of the blur detection in a digital image. The modification makes it possible to detect tampered access to a digital image. The modified algorithm is no less effective than the original algorithm, and allows analyzing fewer parameters in a shorter time. The computational complexity of the algorithm is determined by the second order polynomial that is acceptable in terms of the practical application. [ABSTRACT FROM AUTHOR]

Modern information protection issues are changing with the development of information technology. Every year, the level of cybercrime is getting higher everywhere. Often cybercriminals are exposed to digital files of various formats. One of the main tasks of modern information security is the detection of violations of the integrity of digital signals, in particular, digital imaging. Detection of digital image processing is currently a topical task due to the increased incidence of integrity of important documents. Digital images are almost always processed by the filters of graphic editors. One of the popular filters is the sharpening. In the open edition, a single algorithm for detecting artificial sharpening was found. The existing algorithm is based on the analysis of close pairs of colors of a digital image in relation to the total number of pairs of colors of the matrix of a digital image. Threshold value is detected, considering what certain ratio of these indicators indicates presence or absence of sharpening. However, his main disadvantage is a large number of errors of the first and second kind. In this paper, the influence of the partition of the image matrix on square blocks of different sizes on the effectiveness of detecting sharpening is investigated. As a sharpening filter, Adobe Photoshop's Intelligent Sharpness tool is chosen because of its wide-ranging popularity. On the basis of the conducted research modification of the algorithm was performed. This modification made it possible to reduce the number of errors of the 1st kind by 12%, and the 2 genera by 4%, which results in 40% of errors of the second kind and 14% of errors of the 1st genus. Also, possible further variants of development and improvement of the process of detection of the indicated processing, namely, the study of the influence of the modification of the formula of close pairs of colors on the efficiency of the algorithm, are proposed in the work. [ABSTRACT FROM AUTHOR]

In this paper the new method for digital image processing is proposed. Application of this method leads to decrease the conditioning number of the majority of matrix blocks obtained by standard partitioning as a result of preconditioning of the corresponding matrices. The proposed method preserves the reliability of the perception of the distorted image, which in the work is quantitatively estimated using the peak signal-to-noise ratio. The application of the proposed method as pre-processing of the cover image before steganography transformation makes it possible to extend the application domain of the steganography algorithm based on the sign-insensitivity of the singular vectors of blocks of the digital image matrix developed by one of the authors earlier. The preconditioning of the block matrix occurred after its precoding. The result of precoding is a symmetric positive-definite sparse matrix, which is mapped to the image block. The positive definiteness and sparsification of obtained matrix make it possible to use as its preconditioner the incomplete Cholesky factorization. The results of the computational experiment are presented. [ABSTRACT FROM AUTHOR]

Photos are an integral and certainly an important part of our lives. Often we are faced with a need to increase the clarity of digital image, for example, solving pattern recognition problems, or for other reasons. Methods of increasing the clarity of digital images are very diverse, each has its own range of applicability. However, there may be often artifacts by processing of digital image. The aim of this paper is to increase clarity of digital image with the possibility of avoiding artifacts. To achieve this aim the researchers used digital image processing algorithms, based on using different convolution matrix types. There are shown in typical images with increasing clarity of digital image what advantages is the use of combinations of these algorithms in a specific sequence. A comparative analysis of the impact of different filters to increase the clarity of digital images was conducted and gives recommendations by using them. [ABSTRACT FROM AUTHOR]

In this paper it is proposed basics of a new approach to identify cloning results, conducted in digital images, in additional disturbing influences conditions in a digital image after cloning, that may be considered as lossy compression, add noise, blur, etc. The approach is based on identifying the comparability of the surface parts, which is put into correspondence the analyzed image appropriate clones and its preimage. The surface is determined by the graph of the interpolation spline, approaching the function of the image, and the elements of the image are regarded as the interpolation nodes. It is proved that as the main quantitative characteristics of such comparability is advisable to use the volume of a cylindrical body with generator parallel to the axis OZ, bounded from above corresponding part of the interpolation function graph, bounded below - plane XOY. [ABSTRACT FROM AUTHOR]