Segmentation of Microarray Image Using Information Bottleneck

Article ID

7ZD1T

Segmentation of Microarray Image Using Information Bottleneck

S.RaghavaRao
S.RaghavaRao
M.S.MadhanMohan
M.S.MadhanMohan
Dr.G.M.V.Prasad
Dr.G.M.V.Prasad
DOI

Abstract

DNA microarrays provide a simple tool to identify andquantify the gene expression for tens of thousands of genessimultaneously. The DNA microarray image analysis includes three tasks: gridding, segmentation and intensity extraction.Spots segmentation, which isto distinguish the spot signals from background pixels,is a critical step in microarray image processing. In this paper, new image segmentation algorithm based on the hard version of the information bottleneck method is presented. The objective of this method is to extract a compact representation of a variable, considered the input, with minimal loss of mutual information with respect to another variable, considered the output. The input variable here, is the histogram bins and the output variable is the set of regions obtained from the split and merge algorithm. The proposed method is compared with existing segmentation methods such as k-means and Fuzzy C-means. The experimental results show that the proposed algorithm has segmented spots of the microarray image more accurately than other segmentation methods.

Segmentation of Microarray Image Using Information Bottleneck

DNA microarrays provide a simple tool to identify andquantify the gene expression for tens of thousands of genessimultaneously. The DNA microarray image analysis includes three tasks: gridding, segmentation and intensity extraction.Spots segmentation, which isto distinguish the spot signals from background pixels,is a critical step in microarray image processing. In this paper, new image segmentation algorithm based on the hard version of the information bottleneck method is presented. The objective of this method is to extract a compact representation of a variable, considered the input, with minimal loss of mutual information with respect to another variable, considered the output. The input variable here, is the histogram bins and the output variable is the set of regions obtained from the split and merge algorithm. The proposed method is compared with existing segmentation methods such as k-means and Fuzzy C-means. The experimental results show that the proposed algorithm has segmented spots of the microarray image more accurately than other segmentation methods.

S.RaghavaRao
S.RaghavaRao
M.S.MadhanMohan
M.S.MadhanMohan
Dr.G.M.V.Prasad
Dr.G.M.V.Prasad

No Figures found in article.

Dr.J.Harikiran. 1970. “. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 19): .

Download Citation

Journal Specifications
Issue Cover
GJCST Volume 11 Issue 19
Pg. 31- 33
Classification
Not Found
Article Matrices
Total Views: 20876
Total Downloads: 10647
2026 Trends
Research Identity (RIN)
Related Research
Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Segmentation of Microarray Image Using Information Bottleneck

S.RaghavaRao
S.RaghavaRao
M.S.MadhanMohan
M.S.MadhanMohan
Dr.G.M.V.Prasad
Dr.G.M.V.Prasad

Research Journals