Data hiding using run length matching
by Ki-Hyun Jung, Kee-Young Yoo
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 3, No. 3, 2009

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.

Online publication date: Fri, 07-Aug-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com