Mosaicking of torn image using graph algorithm and color pixel matching

Mosaicking of torn image is a challenge for the investigators while reconstructing image from nonlinear torn images. Numerous researches were conducted in the past few decades to develop accurate algorithms to reconstruct images from torn image. Due to several factors, torn image reconstruction is n...

Full description

Saved in:

Bibliographic Details
Main Author:	Thorig, Ibrahim
Format:	Thesis
Language:	English
Published:	2014
Subjects:	QA75 Electronic computers Computer science
Online Access:	http://eprints.utm.my/id/eprint/50727/25/IbrahimThorigMFC2014.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.50727
record_format	uketd_dc
spelling	my-utm-ep.507272020-07-10T09:31:48Z Mosaicking of torn image using graph algorithm and color pixel matching 2014-09 Thorig, Ibrahim QA75 Electronic computers. Computer science Mosaicking of torn image is a challenge for the investigators while reconstructing image from nonlinear torn images. Numerous researches were conducted in the past few decades to develop accurate algorithms to reconstruct images from torn image. Due to several factors, torn image reconstruction is not matured. In past researches, researchers focused on only image contour matching. The challenge in the contour matching technique is that extracting exact contour of the image fragment. Therefore, in this project, a new technique has been proposed to address the torn image reconstruction based on contour matching and contour pixel color matching. This project discussed the existing techniques used for torn image reconstruction and the advantages and disadvantages of those techniques. In this study, the proposed solution was evaluated based on the performance of the system in terms of accuracy and computational speed of the image reconstruction. The simulation indicates that the proposed technique performs better than existing technique in terms of accuracy. While simulating the system, 15 images were fragmented out of which 60% of the images were reconstructed fully, 33.33% of images reconstructed ¾ of the image fragments and 6.7% of images reconstructed half of the image. Most surprisingly, none of the images failed to reconstruct, at least 50% of image fragments reconstructed in the worst reconstruction while performing simulations. In terms of computational speed, it takes unacceptable time to reconstruct which is worse than traditional methods. Therefore, researcher classified the area’s to refine which will be helpful for the future researchers, those who are attentive in the field of image reconstruction field. 2014-09 Thesis http://eprints.utm.my/id/eprint/50727/ http://eprints.utm.my/id/eprint/50727/25/IbrahimThorigMFC2014.pdf application/pdf en public http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:90551 masters Universiti Teknologi Malaysia, Faculty of Computing Faculty of Computing
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA75 Electronic computers Computer science
spellingShingle	QA75 Electronic computers Computer science Thorig, Ibrahim Mosaicking of torn image using graph algorithm and color pixel matching
description	Mosaicking of torn image is a challenge for the investigators while reconstructing image from nonlinear torn images. Numerous researches were conducted in the past few decades to develop accurate algorithms to reconstruct images from torn image. Due to several factors, torn image reconstruction is not matured. In past researches, researchers focused on only image contour matching. The challenge in the contour matching technique is that extracting exact contour of the image fragment. Therefore, in this project, a new technique has been proposed to address the torn image reconstruction based on contour matching and contour pixel color matching. This project discussed the existing techniques used for torn image reconstruction and the advantages and disadvantages of those techniques. In this study, the proposed solution was evaluated based on the performance of the system in terms of accuracy and computational speed of the image reconstruction. The simulation indicates that the proposed technique performs better than existing technique in terms of accuracy. While simulating the system, 15 images were fragmented out of which 60% of the images were reconstructed fully, 33.33% of images reconstructed ¾ of the image fragments and 6.7% of images reconstructed half of the image. Most surprisingly, none of the images failed to reconstruct, at least 50% of image fragments reconstructed in the worst reconstruction while performing simulations. In terms of computational speed, it takes unacceptable time to reconstruct which is worse than traditional methods. Therefore, researcher classified the area’s to refine which will be helpful for the future researchers, those who are attentive in the field of image reconstruction field.
format	Thesis
qualification_level	Master's degree
author	Thorig, Ibrahim
author_facet	Thorig, Ibrahim
author_sort	Thorig, Ibrahim
title	Mosaicking of torn image using graph algorithm and color pixel matching
title_short	Mosaicking of torn image using graph algorithm and color pixel matching
title_full	Mosaicking of torn image using graph algorithm and color pixel matching
title_fullStr	Mosaicking of torn image using graph algorithm and color pixel matching
title_full_unstemmed	Mosaicking of torn image using graph algorithm and color pixel matching
title_sort	mosaicking of torn image using graph algorithm and color pixel matching
granting_institution	Universiti Teknologi Malaysia, Faculty of Computing
granting_department	Faculty of Computing
publishDate	2014
url	http://eprints.utm.my/id/eprint/50727/25/IbrahimThorigMFC2014.pdf
_version_	1747817521711415296

Mosaicking of torn image using graph algorithm and color pixel matching

Similar Items