Efficient string matching: an aid to bibliographic search
Communications of the ACM
Automatic Reassembly of Document Fragments via Context Based Statistical Models
ACSAC '03 Proceedings of the 19th Annual Computer Security Applications Conference
Scalability in the XFS file system
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Automated reassembly of file fragmented images using greedy algorithms
IEEE Transactions on Image Processing
Fragmentation Point Detection of JPEG Images at DHT Using Validator
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
Forensic triage for mobile phones with DEC0DE
SEC'11 Proceedings of the 20th USENIX conference on Security
Classification and Recovery of Fragmented Multimedia Files using the File Carving Approach
International Journal of Mobile Computing and Multimedia Communications
Image content analysis for sector-wise JPEG fragment classification
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
File carving is a technique whereby data files are extracted from a digital device without the assistance of file tables or other disk meta-data. One of the primary challenges in file carving can be found in attempting to recover files that are fragmented. In this paper, we show how detecting the point of fragmentation of a file can benefit fragmented file recovery. We then present a sequential hypothesis testing procedure to identify the fragmentation point of a file by sequentially comparing adjacent pairs of blocks from the starting block of a file until the fragmentation point is reached. By utilizing serial analysis we are able to minimize the errors in detecting the fragmentation points. The performance results obtained from the fragmented test-sets of DFRWS 2006 and 2007 show that the method can be effectively used in recovery of fragmented files.