SLAMorris Final Thesis After Corrections.pdf - Cranfield University

Once the fragments have been identified and classified, reassembly methods
can be used to attempt to reconstruct the files; the reconstruction enables a
larger amount of information to be extracted. One task which requires fragment
reassembly is completing a jigsaw [Pomeranz, 2011]; the methodologies
employed for the completion of a jigsaw can be applied to other fragment
reassembly problems. For example, fragment reassembly has been a large
area of research in subjects such as archaeology where it is often necessary to
reconstruct artefacts [Willis, 2008].
Fragment reassembly methods in related work have focused on solving path
problems such as using the Hamiltonian, and K-Vertex disjoint path algorithms
[Pal, 2006]; the K-Vertex disjoint path problem uses each cluster in unallocated
space as a vertex. Pre-processing by first classifying the fragments and then
only using related classifications in the graph would reduce the processing time.
The use of context based statistical models for reassembly was explored by
Shanmugasundaram [2003]; the method relies on in depth knowledge of the
structure and syntax of the file type in order to build appropriate models to
assist with the reassembly process.
For this research it has been shown that reassembly approaches use
information about the expected structure of the object; the structural information
provides guidance for selecting the next component at each point of the
reassembly and validation of the reassembled object. This section has also
established the adaptability of jigsaw reassembly methodology to other
reassembly problems.
9.3 Methodology
As described in Chapter 8, the reassembly of a file is similar to the reassembly
of a jigsaw; this research will apply jigsaw reassembly methodology to the
Page
233