![]() ![]() We provide a framework to tackle this problem, which consists of the following key components: (i) a new similarity metric (CED) to evaluate if two data blocks are consecutive in the same JPEG file and a fragmentation point detection algorithm based on CED and (ii) an overall recovery algorithm to reconstruct the JPEG file from fragmented pieces. The difficulty lies on how to order fragmented pieces into a complete picture without sufficient decoding information. ![]() In this paper, we focus on JPEG file carving, with an emphasis on heavily fragmented cases. Chow (University of Hong Kong), Siu Ming (University of Hong Kong), Jun Xu (Harbin Institute of Technology), Bo Feng (Stony Brook University), Qiong Li (Harbin Institute of Technology), Qi Han (Harbin Institute of Technology)įile carving from a damaged file system plays an important role in file recovery for identifying evidence in digital forensics. Authors: Yanbin Tang (University of Hong Kong), Junbin Fang (Jinan University), K.P. ![]()
0 Comments
Leave a Reply. |