2004 · 38 citations · 9 references
ComputingComputer ScienceData StructuresDigital ForensicsInformation RetrievalComputer ForensicsData CompressionDocument StructureForensic EvidenceFragmentation AnalysisData FragmentationDigital Forensic EvidenceForensicsFragment ReassemblyHamiltonian Path AlgorithmsHamiltonian Path ProblemReassembly
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. We address the digital forensic equivalent, i.e., reassembly of document fragments, using statistical modelling tools applied in data compression. We propose a general process model for automatically analyzing a collection fragments to reconstruct the original document by placing the fragments in proper order. Probabilities are assigned to the likelihood that two given fragments are adjacent in the original using context modelling techniques in data compression. The problem of finding the optimal ordering is shown to be equivalent to finding a maximum weight Hamiltonian path in a complete graph. Heuristics are designed and explored and implementation results provided which demonstrate the validity of the proposed technique.
9
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.7K citations
John Kubiatowicz, David Bindel, Yan Chen et al. · ACM SIGPLAN Notices · 2000 · 2K citations · Full text
An analysis of alpha-beta pruning
Donald E. Knuth, Ronald W. Moore · Artificial Intelligence · 1975 · 1K citations
J. Rissanen, Glen G. Langdon · IBM Journal of Research and Development · 1979 · 739 citations
A universal data compression system
J. Rissanen · IEEE Transactions on Information Theory · 1983 · 645 citations