CFP last date
20 December 2024
Reseach Article

Implementation of Greedy Sequential Unique Path File Carving Algorithm for Fragmented Bitmap Image Files

by K. Srinivas, T. Venugopal
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 71 - Number 3
Year of Publication: 2013
Authors: K. Srinivas, T. Venugopal
10.5120/12342-8625

K. Srinivas, T. Venugopal . Implementation of Greedy Sequential Unique Path File Carving Algorithm for Fragmented Bitmap Image Files. International Journal of Computer Applications. 71, 3 ( June 2013), 40-45. DOI=10.5120/12342-8625

@article{ 10.5120/12342-8625,
author = { K. Srinivas, T. Venugopal },
title = { Implementation of Greedy Sequential Unique Path File Carving Algorithm for Fragmented Bitmap Image Files },
journal = { International Journal of Computer Applications },
issue_date = { June 2013 },
volume = { 71 },
number = { 3 },
month = { June },
year = { 2013 },
issn = { 0975-8887 },
pages = { 40-45 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume71/number3/12342-8625/ },
doi = { 10.5120/12342-8625 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:34:34.572695+05:30
%A K. Srinivas
%A T. Venugopal
%T Implementation of Greedy Sequential Unique Path File Carving Algorithm for Fragmented Bitmap Image Files
%J International Journal of Computer Applications
%@ 0975-8887
%V 71
%N 3
%P 40-45
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Digital Forensic Analyst encounters a mixed file fragments in the absence of File Table information i. e. , files' metadata. File Carving is a process of reconstructing files from mixed file fragments without using files' metadata. File Carving is an interesting and challenging problem in digital forensics and Data Recovery. Recently there have been number of research papers in the area of File Carving. In this paper authors describe File Carving and present its Literature Survey. The implementation of Greedy Sequential Unique Path File Carving algorithm for 4-bit bitmap files, with the help of function prototypes using C language and brief explanation of these prototypes is explained. The experimental results are also shown. The experimental results show that the files can be reconstructed from their fragments without knowing files' metadata. However there are limitations of these methods as mentioned in section 5.

References
  1. Kulesh Shanmugasundaram, Nasir Memon, Automatic Reassembly of Document Fragments via Context Based Statistical Models, Department of Computer and Information Science Polytechnic University Brooklyn, NY 11201.
  2. Nasir Memon, Anandabrata Pal, "Automated Reassembly of File Fragmented Images Using Greedy Algorithms", IEEE Transactions on Image Processing, Volume 15, No. 2, February, 2006.
  3. Simson L. Garfinke, "Carving contiguous and fragmented files with fast object validation" ELSEVEIR digital investigation 4S (2007) S2–S12.
  4. Anandabrata Pal, Husrev T. Sencar, Nasir Memon "DetectingFile Fragmentation Point using Sequential Hyposthesis Testing", ELSEVIER digital Investigations 5 (2008) s2-s13
  5. Anandabrata Pal, Nasir Memon – "The Evolution of File Carving", IEEE signal processing magazine
  6. march 2009
  7. Maurice J Bach Pearson, "The Design of the Unix Operating System" (Pearson Education) – 2003.
Index Terms

Computer Science
Information Sciences

Keywords

GSUP4Bit Algorithm tail bmp head bmp Data of Image File The Challenge File Spurious Disk Cluster Successor Cluster