2010
DOI: 10.1109/tifs.2010.2066971
|View full text |Cite
|
Sign up to set email alerts
|

Reversible Data Hiding Based on Histogram Modification of SMVQ Indices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
27
0
2

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 48 publications
(29 citation statements)
references
References 21 publications
0
27
0
2
Order By: Relevance
“…A reversible data hiding method hiding embedding data into a transformed media and holds lossless reinstatement of vector quantization (VQ) indices has lately been presented by Lee et al (2010). The side-matched VQ scheme modifies the VQ compressed image to lead a transformed media, so that, to obtain very high embedding capacity and a low bit rate [42].…”
Section: Smvq (Side-matched Vector Quantization)mentioning
confidence: 99%
See 2 more Smart Citations
“…A reversible data hiding method hiding embedding data into a transformed media and holds lossless reinstatement of vector quantization (VQ) indices has lately been presented by Lee et al (2010). The side-matched VQ scheme modifies the VQ compressed image to lead a transformed media, so that, to obtain very high embedding capacity and a low bit rate [42].…”
Section: Smvq (Side-matched Vector Quantization)mentioning
confidence: 99%
“…The side-matched VQ scheme modifies the VQ compressed image to lead a transformed media, so that, to obtain very high embedding capacity and a low bit rate [42]. proposed a novel reversible data hiding scheme that can embed high capacity of secret bits and recover image after data extraction [42].…”
Section: Smvq (Side-matched Vector Quantization)mentioning
confidence: 99%
See 1 more Smart Citation
“…The difference value usually needs fewer bits than the index itself, and then some secret bits are concatenated to each difference value. Scheme [16] appends secret bits to the SMVQ indices. In [29] a method has been proposed to compress the VQ index table namely adjoining state codebook mapping; for each block two state codebooks are constructed and the index is encoded by its position in the state codebooks, some secret bits are appended to the compressed code of each index.…”
Section: Introductionmentioning
confidence: 99%
“…proposed [1,3,[5][6][7]. Tian [7] expands the difference of two adjacent pixels to embed secret bits.…”
mentioning
confidence: 99%