microarray image
Recently Published Documents


TOTAL DOCUMENTS

189
(FIVE YEARS 14)

H-INDEX

16
(FIVE YEARS 2)

2021 ◽  
Vol 2071 (1) ◽  
pp. 012032
Author(s):  
K A Mat Said ◽  
A B Jambek

Abstract A deoxyribonucleic acid (DNA) microarray image requires a three-stage process to enhance and preserve the image’s important information. These are gridding, segmentation, and intensity extraction. Of these three processes, segmentation is considered the most difficult, as its function is to differentiate between features in the foreground and background. The elements in the foreground form the object or the vital information of the image, while the background features less critical information for DNA microarray image analysis. This paper presents a study that utilises the Markov random field (MRF) segmentation algorithm on a DNA microarray image. The MRF algorithm evaluates the current pixel depends on its neighbouring pixels. The experimental results show that the MRF algorithm works effectively in the segmentation process for a DNA microarray image.


2021 ◽  
Vol 69 (2) ◽  
pp. 2245-2260
Author(s):  
R. Sowmyalakshmi ◽  
Mohamed Ibrahim Waly ◽  
Mohamed Yacin Sikkandar ◽  
T. Jayasankar ◽  
Sayed Sayeed Ahmad ◽  
...  

Author(s):  
Karthik S. A. ◽  
Manjunath S. S.

In cDNA microarray image analysis, classification of pixels as forefront area and the area covered by background is very challenging. In microarray experimentation, identifying forefront area of desired spots is nothing but computation of forefront pixels concentration, area covered by spot and shape of the spots. In this piece of writing, an innovative way for spot partitioning of microarray images using autonomously organizing maps (AOM) method through C-V model has been proposed. Concept of neural networks has been incorpated to train and to test microarray spots.In a trained AOM the comprehensive information arising from the prototypes of created neurons are clearly integrated to decide whether to get smaller or get bigger of contour. During the process of optimization, this is done in an iterative manner. Next using C-V model, inside curve area of trained spot is compared with test spot finally curve fitting is done.The presented model can handle spots with variations in terms of shape and quality of the spots and meanwhile it is robust to the noise. From the review of experimental work, presented approach is accurate over the approaches like C-means by fuzzy, Morphology sectionalization.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 159196-159205
Author(s):  
Bogdan Belean ◽  
Robert Gutt ◽  
Carmen Costea ◽  
Ovidiu Balacescu

Microarray is a significant tool and influential method which is used to analyze the cDNA expression in living beings. With the help of this technology one can compute gene expression profile in massive and parallel way. Microarray image segmentation offers an input for subsequent analysis of the extracted microarray data. This work addresses on the different approaches used for segmentation of microarray images. Based on the morphology, topology of spots various methods such as circular shaped, region based, active-contour model based segmentation, shape based, supervised learning and watershed segmentation has been taken for this study. This paper explores and compiles various non statistical approaches used in the field of microarray image segmentation. Finally general tendencies in microarray image segmentation are presented.


2019 ◽  
Vol 8 (4) ◽  
pp. 2514-2519

Microarray is a fast and rapid growing technology which plays dynamic role in the medical field. It is an advanced than MRI (Magnetic Resonance Imaging) and CT scanning (Computerised Tomography). The purpose of this work is to make fine perfection against the gene expression. In this study the two clustering are used which fuzzy c means and k means and also it classifies with better results. The microarray data base indicates the classification in support vector machine. Segmentation is most important step in microarray image. The classification in support vector machine is compared with other two classifiers which means the k nearest neighbour and with the Bayes classifiers.


Sign in / Sign up

Export Citation Format

Share Document