• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

A Lossless Data Hiding Scheme for VQ Indexes Based on Joint Neighboring Coding

Vol. 9, No.8, August 31, 2015
10.3837/tiis.2015.08.013, Download Paper (Free):

Abstract

Designing a new reversible data hiding technique with a high embedding rate and a low compression rate for vector quantization (VQ) compressed images is encouraged. This paper proposes a novel lossless data hiding scheme for VQ-compressed images based on the joint neighboring coding technique. The proposed method uses the difference values between a current VQ index and its left and upper neighboring VQ indexes to embed n secret bits into one VQ index, where n = 1, 2, 3, or 4. The experimental results show that the proposed scheme achieves the embedding rates of 1, 2, 3, and 4 bits per index (bpi) with the corresponding average compression rates of 0.420, 0.483, 0.545, and 0.608 bit per pixel (bpp) for a 256 sized codebook. These results confirm that our scheme performs better than other selected reversible data hiding schemes.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Andrew Rudder and The Duc Kieu, "A Lossless Data Hiding Scheme for VQ Indexes Based on Joint Neighboring Coding," KSII Transactions on Internet and Information Systems, vol. 9, no. 8, pp. 2984-3004, 2015. DOI: 10.3837/tiis.2015.08.013

[ACM Style]
Rudder, A. and Kieu, T. D. 2015. A Lossless Data Hiding Scheme for VQ Indexes Based on Joint Neighboring Coding. KSII Transactions on Internet and Information Systems, 9, 8, (2015), 2984-3004. DOI: 10.3837/tiis.2015.08.013