Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

De-noising of noisy MRI brain image using the switching-based clustering algorithm

Authors: Siti Noraini Sulaiman; Siti Mastura Che Ishak; Iza Sazanita Isa; Norhazimi Hamzah;

De-noising of noisy MRI brain image using the switching-based clustering algorithm

Abstract

Magnetic Resonance Image is one of the technologies used for diagnosing brain cancer. Radiographers use the information obtained from MRI images to diagnose the disease and plan further treatment for the patient. MRI images are always corrupted with noise. Removing noise from images is crucial but it is not an easy task. Filtering algorithm is the most common method used to remove noise. A segmentation technique is normally used to process the image in order to detect the abnormality that has been observed, specifically in the brain. However, segmentation alone would be best to implement when the images are in good condition. In the case where the images are corrupted with noise, there are pre-processing steps that need to be implemented first before we can proceed to the next task. Therefore, in this project, we have proposed a simpler method that can de-noise and at the same time segment the image into several significant regions. The proposed method is called the switching-based clustering algorithm. The algorithm is implemented on the MRI brain images which are corrupted with a certain level of salt-and-pepper noise. During the segmentation process, the results show that the proposed algorithm has the ability to minimize the effect of noise without degrading the original images. The density of noise in the MRI images varies from 5% to 20%. The results are compared with the conventional clustering algorithm. Based on the experimental result obtained, the switching-based algorithm provides a better segmentation performance with fewer noise effects than the conventional clustering algorithm. Quantitative and qualitative analyses have shown positive results for the proposed switching-based clustering algorithm.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    3
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
3
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!