25.12.2013 Views

SLAMorris Final Thesis After Corrections.pdf - Cranfield University

SLAMorris Final Thesis After Corrections.pdf - Cranfield University

SLAMorris Final Thesis After Corrections.pdf - Cranfield University

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

check for each potential fragment. If a byte frequency is over the cut of, or a<br />

byte has a frequency of 0% the fragment will be rejected.<br />

Table 8-1: JPEG sequence markers found in Visual thumbnails<br />

Byte<br />

Sequence<br />

Meaning<br />

Relative Position(s) in<br />

visual thumbnail<br />

FFD8 Start of JPEG image 0<br />

FFE0 JFIF marker 2<br />

FFDB<br />

Define Quantization table<br />

marker<br />

20, 89<br />

FFC0 Start of frame marker 158<br />

FFC4<br />

Define Huffman table<br />

marker<br />

177, 210, 393, 426<br />

FFDA Start of Scan marker 609<br />

FF00 0xFF with filling byte 0x00;<br />

read as just 0xFF<br />

Anywhere in the scan<br />

sequence<br />

FFD9 End of JPEG Image End of visual<br />

thumbnail<br />

In order to construct a method for identifying H3 fragments the checks detailed<br />

in this section were used to pre-process the data. Any fragments which met the<br />

checks were used as potential candidates for the neural network. The neural<br />

network architecture is the same as the one used in Section 7.9; a copy of the<br />

neural network implementation was created with a single output node and retrained<br />

using the pre-processed data. The sigmoid transfer function and back<br />

Page<br />

213

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!