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

Detection of damaged files and measurement of similarity to originals using entropy graph characteristics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
1
0
Order By: Relevance
“…Cho et al [16] proposed a method that detects damaged files using information entropy graphs to consider the limitations of the forensic processes for detection and distinction of files. The experimental results show that the proposed method enables quantitative comparison of the similarity of files before and after damage with their original versions through graph pattern similarity test even when files had damaged header, footer, or body regions, the similarity of the graph pattern was preserved.…”
mentioning
confidence: 99%
“…Cho et al [16] proposed a method that detects damaged files using information entropy graphs to consider the limitations of the forensic processes for detection and distinction of files. The experimental results show that the proposed method enables quantitative comparison of the similarity of files before and after damage with their original versions through graph pattern similarity test even when files had damaged header, footer, or body regions, the similarity of the graph pattern was preserved.…”
mentioning
confidence: 99%