Distortion function designing for JPEG steganography with uncompressed side-image

2013 ◽  
Author(s):  
Fangjun Huang ◽  
Weiqi Luo ◽  
Jiwu Huang ◽  
Yun-Qing Shi
Keyword(s):  
Distortion Function ◽  
Jpeg Steganography

Adaptive JPEG steganography with new distortion function

2014 ◽  
Vol 69 (7-8) ◽  
pp. 431-440 ◽  
Author(s):  
Fengyong Li ◽  
Xinpeng Zhang ◽  
Jiang Yu ◽  
Wenfeng Shen
Keyword(s):  
Distortion Function ◽  
Jpeg Steganography

Hybrid distortion function for JPEG steganography

2016 ◽  
Vol 25 (5) ◽  
pp. 050501 ◽  
Author(s):  
Zichi Wang ◽  
Xinpeng Zhang ◽  
Zhaoxia Yin
Keyword(s):  
Distortion Function ◽  
Jpeg Steganography

Distortion function based on residual blocks for JPEG steganography

2017 ◽  
Vol 77 (14) ◽  
pp. 17875-17888 ◽  
Author(s):  
Qingde Wei ◽  
Zhaoxia Yin ◽  
Zichi Wang ◽  
Xinpeng Zhang
Keyword(s):  
Distortion Function ◽  
Jpeg Steganography

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
Keyword(s):  
Side Information ◽  
Distortion Function ◽  
Natural Image ◽  
Dct Domain ◽  
Distortion Functions ◽  
Jpeg Steganography ◽  
Reference Images ◽  
Asymmetric Distortion ◽  
The Given ◽  
General Method

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.

scholarly journals Calculating the Number of Cluster Heads Based on the Rate-Distortion Function in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Rate Distortion ◽  
Distortion Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Cluster Heads

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.

Sign in / Sign up

Export Citation Format

Share Document