Asymmetric Distortion Function for JPEG Steganography Using Block Artifact Compensation

2019 ◽  
Vol 11 (1) ◽  
pp. 90-99 ◽  
Author(s):  
Zichi Wang ◽  
Zhaoxia Yin ◽  
Xinpeng Zhang

This article describes how the existing distortion functions for JPEG steganography allot same cost for ±1 embedding changes. Because of the correlation of natural image, however, changes with different polarities make different influences on image. Therefore, the embedding costs for ±1 embedding changes should not be equivalent. This article proposes a general method to distinguish the embedding costs for different polarities of embedding changes for JPEG images with the help of reference images constructed by block artifact compensation. The original JPEG image is decompressed into spatial domain firstly, and then the block artifact is compensated by smoothing filtering implemented on border pixels of each 8 × 8 block. After that, the compensated image which is more similar to the original uncompressed image is recompressed into DCT domain and adopted as side information to guide the adjusting of the given distortion function. Experiment results show that after the proposed method is employed, the security performance of current popular JPEG steganographic methods is observably increased.

2020 ◽  
Vol 0 (4) ◽  
pp. 43-51
Author(s):  
A. L. Vorontsov ◽  
◽  
I. A. Nikiforov ◽  

Formulae have been obtained that are necessary to calculate cumulative deformation in the process of straitened extrusion in the central area closed to the working end of the counterpunch. The general method of plastic flow proposed by A. L. Vorontsov was used. The obtained formulae allow one to determine the deformed state of a billet in any point of the given area. The formulae should be used to take into account the strengthening of the extruded material.


2020 ◽  
Vol 30 (7) ◽  
pp. 2288-2294
Author(s):  
Weixiang Li ◽  
Kejiang Chen ◽  
Weiming Zhang ◽  
Hang Zhou ◽  
Yaofei Wang ◽  
...  

Author(s):  
Tao Zhang ◽  
Wenjun Hu ◽  
Xiapu Luo ◽  
Xiaobo Ma

Recently, there has been consistent growth in Android applications (apps). Under these circumstances, software maintenance for Android apps becomes an essential and important task. The core of software maintenance is to locate bugs in source files. Previous bug localization approaches mainly focus on open-source desktop software (e.g. Eclipse, Mozilla, GCC). Even though a few studies locate the bugs in the Android apps, they are dedicated to a special app named ZXing, without developing a general method to locate the bugs in Android apps by taking into account the unique characteristics of Android apps’ bug reports. Such characteristics include fewer number of historical bug reports, insufficient detailed description, etc. These characteristics hinder existing localization approaches from being directly delivered to Android apps, because lack of enough information degrades the performance of those localization approaches relying on historical bug reports. Commit messages include more informative data which can provide the details of reported bugs. Therefore, in this paper, we propose a novel information retrieval-based approach which utilizes commit messages to locate new bugs in Android apps. This approach not only considers the structured textual similarity between the given bug and the candidate source files, but also computes the unstructured textual similarities between the new bug and the commit messages linked to the corresponding source files. According to the experimental results on 10 popular open-source Android apps managed by GitHub, our approach outperforms the state-of-the-art bug localization methods that include BugLocator, BLUiR, and two-phase model.


1979 ◽  
Vol 25 (6) ◽  
pp. 664-666 ◽  
Author(s):  
T. Berger ◽  
K. Housewright ◽  
J. Omura ◽  
Suiyin Yung ◽  
J. Wolfowitz

Sign in / Sign up

Export Citation Format

Share Document