2017
DOI: 10.1007/s11227-017-1997-7
|View full text |Cite
|
Sign up to set email alerts
|

Raw reversibility of information hiding on the basis of VQ systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…Assuming there is no parent node, the data is called a head node. The classification of such nodes will have an impact on the data, and the classification of the head node itself will not be affected by other data [45]- [48]. Therefore, the compensation vector b in the head node classification is defined as 0, and x k,h is its own vector at time k; otherwise, the data has a parent node, and the data classification is affected by the parent node, so the data classification model is utilized [49].…”
Section: Hiding Information Classification Modelmentioning
confidence: 99%
“…Assuming there is no parent node, the data is called a head node. The classification of such nodes will have an impact on the data, and the classification of the head node itself will not be affected by other data [45]- [48]. Therefore, the compensation vector b in the head node classification is defined as 0, and x k,h is its own vector at time k; otherwise, the data has a parent node, and the data classification is affected by the parent node, so the data classification model is utilized [49].…”
Section: Hiding Information Classification Modelmentioning
confidence: 99%