arrow
Return

Efficient reversible data hiding algorithm based on gradient-based edge direction prediction

delete2013-02-01
delete26
PRE
AI
W
Wei-Jen Yang *
K
Kuo‐Liang Chung
H
Hong-Yuan Mark Liao
W
Wen-Kuang Yu
DOI:10.1016/j.jss.2012.09.041delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, we present an efficient RDH algorithm based on a new gradient-based edge direction prediction (GEDP) scheme. Since the proposed GEDP scheme can generate more accurate prediction results, the prediction errors tend to form a sharper Laplacian distribution. Therefore, the proposed algorithm can guarantee larger embedding capacity and produce better quality of marked images. The determination of appropriate thresholds is also a critical issue for a RDH algorithm, so we design a new systematic way to tackle this problem. In addition, a modified embedding order determination strategy is presented to reduce the distortion of a marked image. Based on typical test images, experimental results demonstrate the superior properties of the proposed algorithm in terms of embedding capacity and marked image quality. (c) 2012 Elsevier Inc. All rights reserved.
Keywords:
Difference expansion
Edge direction
Embedding capacity
Marked image quality
Prediction
Reversible data hiding

Journal

Journal of Systems and Software cover
Journal of Systems and Software
IF:
4.1
Papers:
5.4K
Citations:
8.4K

Organization

A
academia sinica - taiwan
Scholars:
1.9W
Papers: 1.6W
Citations: 17
N
national taiwan university of science & technology
Scholars:
8.8K
Papers: 8.7K
Citations: 9