Data hiding using run length matching

Authors:
Ki-Hyun Jung;Kee-Young Yoo
Affiliations:
School of Computer Information, Yeungjin College, 218, Bokhyun-Dong, Buk-Gu, Daegu, 702-721, Republic of Korea.;Dept. of Computer Engineering, Kyungpook National University, 1370, Sankuk-Dong, Buk-Gu, Daegu, 702-701, Republic of Korea
Venue:
International Journal of Intelligent Information and Database Systems
Year:
2009

Citing 6
Cited 1

Digital Image Processing

Digital Image Processing
A steganographic method for images by pixel-value differencing

Pattern Recognition Letters
Secret image sharing with smaller shadow images

Pattern Recognition Letters
Exploring Steganography: Seeing the Unseen

Computer
New image steganographic methods using run-length approach

Information Sciences: an International Journal
On the limits of steganography

IEEE Journal on Selected Areas in Communications

A compact covering method to exploit embedding capacity for matrix encoding

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes two data hiding methods based on run length matching encoding. All of the proposed methods use the location of accumulated run length values where it compares the run length of the cover data with that of the secret data. The run length matching (RLM) method uses the run length table, which is constructed from the cover data and secret data. The reduced run length matching (RRLM) method calculates the difference value before making the run length encoding table. The experimental results demonstrate that RLM and RRLM have their own strengths with respect to different types of data and run length encoding value matching.