This document presents a new method for spot detection in microarray images. It begins with edge detection using an adaptive multi-structure morphological algorithm to effectively suppress noise while preserving image edges. Morphological filling is then used to fill holes in the binary image output from edge detection. Finally, an automatic spot detection algorithm is used to segment each sub-grid into individual spot regions by applying gridding based on the intensity projection profile of the sub-grid. Fuzzy c-means clustering is then used to segment each spot from the background pixels. The results show the method is fully automatic without needing human intervention or parameter presetting.
Research on Iris Region Localization AlgorithmsIJERA Editor
Iris recognition is a biometric technique that offers premium performance. Iris localization is critical to the success of an iris recognition system, since data that is falsely represented as iris pattern data will corrupt the biometric templates generated, resulting in poor recognition rates. So far different algorithms for iris localization having been proposed. This paper explored four efficient methods for iris localization, out of these three methods of iris localization in circular form and one methods of unwrapping the iris in to a flat bed. Experimental results are reported to demonstrate performance evaluation of every implemented algorithms. Conclusion based on comparisons can provide most significant information for further research. A CASIA and UPOL iris databases of iris images has been used for implementation of iris localization General Term Biometrics,Iris Recognition,Iris Localization
Performance Analysis of CRT for Image Encryption ijcisjournal
With the fast advancements of information technology, the security of image data transmitted or stored over
internet is become very difficult. To hide the details, an effective method is encryption, so that only
authorized persons can decrypt the image with the keys available. Since the default features of digital
image such as high capacity data, large redundancy and large similarities among pixels, the conventional
encryption algorithms such as AES, , DES, 3DES, and Blow Fish, are not applicable for real time image
encryption. This paper presents the performance of CRT for image encryption to secure storage and
transmission of image over internet.
Copy Move Forgery Detection Using GLCM Based Statistical Features ijcisjournal
The features Gray Level Co-occurrence Matrix (GLCM) are mostly explored in Face Recognition and
CBIR. GLCM technique is explored here for Copy-Move Forgery Detection. GLCMs are extracted from all
the images in the database and statistics such as contrast, correlation, homogeneity and energy are
derived. These statistics form the feature vector. Support Vector Machine (SVM) is trained on all these
features and the authenticity of the image is decided by SVM classifier. The proposed work is evaluated on
CoMoFoD database, on a whole 1200 forged and processed images are tested. The performance analysis
of the present work is evaluated with the recent methods.
A novel approach for efficient skull stripping using morphological reconstruc...eSAT Journals
Abstract Brain is the part of the central nervous system located in skull. For the diagnosis of human brain bearing tumour, skull stripping plays an important pre-processing role. Skull stripping is the process separating brain and non-brain tissues of the head which is the critical processing step in the analysis of neuroimaging data. Though various algorithms have been proposed to address this problem, challenges remain. In this paper a new efficient skull stripping method for magnetic resonance images (MRI) is proposed. This method adopts a two-step approach; in the first step an improved systematic application of morphological reconstructions operations is done for the brain image and in the second step, a thresholding based technique is used to extract the brain inside the skull. This paper experimented on Axial PD and FLAIR MRI brain images. Index Terms: Skull stripping, thresholding, morphological reconstruction, Axial PD and FLAIR MRI images of brain.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
bayesImageS: an R package for Bayesian image analysisMatt Moores
There are many approaches to Bayesian computation with intractable likelihoods, including the exchange algorithm, approximate Bayesian computation (ABC), thermodynamic integration, and composite likelihood. These approaches vary in accuracy as well as scalability for datasets of significant size. The Potts model is an example where such methods are required, due to its intractable normalising constant. This model is a type of Markov random field, which is commonly used for image segmentation. The dimension of its parameter space increases linearly with the number of pixels in the image, making this a challenging application for scalable Bayesian computation. My talk will introduce various algorithms in the context of the Potts model and describe their implementation in C++, using OpenMP for parallelism. I will also discuss the process of releasing this software as an open source R package on the CRAN repository.
As a part of a growing information society, security and the authentication of individuals become nowadays more than ever an asset of great significance in almost every field. Iris recognition system provides identification and verification automatically of an individual based on characteristics and unique features in iris structure. Accurate iris recognition system based on iris segmentation method and how localized the inner and outer iris boundaries that can be damaged by irrelevant parts such as eyelashes and eyelid, to achieve this aim, the proposed method applied using [Iris Segmentation Based on Brightness Correction ISBC] to edge detection then circle distribution "CD" transformation on an eye image passed through preprocessing operations. The proposed iris normalization is done by using the important information that resulted from iris segmentation such as center and radius of iris to convert iris region in the original image from the Cartesian coordinates (x, y) to the normalized polar coordinates (r, θ). The proposed approach tested conducted on the iris CASIA (Chinese Academy of Science and Institute of Automation) data set (CASIA v1.0 and CASIA v4.0-interval ) iris image database and the results indicated that proposed approach has 100% accuracy rate with (CASIA v1.0), and has 100% accuracy rate with (CASIA v4.0- interval) .
Research on Iris Region Localization AlgorithmsIJERA Editor
Iris recognition is a biometric technique that offers premium performance. Iris localization is critical to the success of an iris recognition system, since data that is falsely represented as iris pattern data will corrupt the biometric templates generated, resulting in poor recognition rates. So far different algorithms for iris localization having been proposed. This paper explored four efficient methods for iris localization, out of these three methods of iris localization in circular form and one methods of unwrapping the iris in to a flat bed. Experimental results are reported to demonstrate performance evaluation of every implemented algorithms. Conclusion based on comparisons can provide most significant information for further research. A CASIA and UPOL iris databases of iris images has been used for implementation of iris localization General Term Biometrics,Iris Recognition,Iris Localization
Performance Analysis of CRT for Image Encryption ijcisjournal
With the fast advancements of information technology, the security of image data transmitted or stored over
internet is become very difficult. To hide the details, an effective method is encryption, so that only
authorized persons can decrypt the image with the keys available. Since the default features of digital
image such as high capacity data, large redundancy and large similarities among pixels, the conventional
encryption algorithms such as AES, , DES, 3DES, and Blow Fish, are not applicable for real time image
encryption. This paper presents the performance of CRT for image encryption to secure storage and
transmission of image over internet.
Copy Move Forgery Detection Using GLCM Based Statistical Features ijcisjournal
The features Gray Level Co-occurrence Matrix (GLCM) are mostly explored in Face Recognition and
CBIR. GLCM technique is explored here for Copy-Move Forgery Detection. GLCMs are extracted from all
the images in the database and statistics such as contrast, correlation, homogeneity and energy are
derived. These statistics form the feature vector. Support Vector Machine (SVM) is trained on all these
features and the authenticity of the image is decided by SVM classifier. The proposed work is evaluated on
CoMoFoD database, on a whole 1200 forged and processed images are tested. The performance analysis
of the present work is evaluated with the recent methods.
A novel approach for efficient skull stripping using morphological reconstruc...eSAT Journals
Abstract Brain is the part of the central nervous system located in skull. For the diagnosis of human brain bearing tumour, skull stripping plays an important pre-processing role. Skull stripping is the process separating brain and non-brain tissues of the head which is the critical processing step in the analysis of neuroimaging data. Though various algorithms have been proposed to address this problem, challenges remain. In this paper a new efficient skull stripping method for magnetic resonance images (MRI) is proposed. This method adopts a two-step approach; in the first step an improved systematic application of morphological reconstructions operations is done for the brain image and in the second step, a thresholding based technique is used to extract the brain inside the skull. This paper experimented on Axial PD and FLAIR MRI brain images. Index Terms: Skull stripping, thresholding, morphological reconstruction, Axial PD and FLAIR MRI images of brain.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
bayesImageS: an R package for Bayesian image analysisMatt Moores
There are many approaches to Bayesian computation with intractable likelihoods, including the exchange algorithm, approximate Bayesian computation (ABC), thermodynamic integration, and composite likelihood. These approaches vary in accuracy as well as scalability for datasets of significant size. The Potts model is an example where such methods are required, due to its intractable normalising constant. This model is a type of Markov random field, which is commonly used for image segmentation. The dimension of its parameter space increases linearly with the number of pixels in the image, making this a challenging application for scalable Bayesian computation. My talk will introduce various algorithms in the context of the Potts model and describe their implementation in C++, using OpenMP for parallelism. I will also discuss the process of releasing this software as an open source R package on the CRAN repository.
As a part of a growing information society, security and the authentication of individuals become nowadays more than ever an asset of great significance in almost every field. Iris recognition system provides identification and verification automatically of an individual based on characteristics and unique features in iris structure. Accurate iris recognition system based on iris segmentation method and how localized the inner and outer iris boundaries that can be damaged by irrelevant parts such as eyelashes and eyelid, to achieve this aim, the proposed method applied using [Iris Segmentation Based on Brightness Correction ISBC] to edge detection then circle distribution "CD" transformation on an eye image passed through preprocessing operations. The proposed iris normalization is done by using the important information that resulted from iris segmentation such as center and radius of iris to convert iris region in the original image from the Cartesian coordinates (x, y) to the normalized polar coordinates (r, θ). The proposed approach tested conducted on the iris CASIA (Chinese Academy of Science and Institute of Automation) data set (CASIA v1.0 and CASIA v4.0-interval ) iris image database and the results indicated that proposed approach has 100% accuracy rate with (CASIA v1.0), and has 100% accuracy rate with (CASIA v4.0- interval) .
IMPROVED PARALLEL THINNING ALGORITHM TO OBTAIN UNIT-WIDTH SKELETONijma
To extract the creditable features in a fingerprint image, many people use a thinning algorithm that plays a
very important role in preprocessing. In this paper, we propose a robust parallel thinning algorithm that
can preserve the connectivity of the binarized fingerprint image, while making the thinnest skeleton of only
1-pixel wide, which gets extremely close to the medial axis. The proposed thinning method repeats three
sub-iterations. The first sub-iteration takes off only the outermost boundary pixel using the inner points. To
extract the one-sided skeletons, the second sub-iteration seeks the skeletons with a 2-pixel width. The third
sub-iteration prunes the needless pixels with a 2-pixel width existing in the obtained skeletons. The
proposed thinning algorithm shows robustness against rotation and noise and makes the balanced medial
axis. To evaluate the performance of the proposed thinning algorithm, we compare it with and analyze
previous algorithms.
Efficient fingerprint image enhancement algorithm based on gabor filtereSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Robust Adaptive Threshold Algorithm based on Kernel Fuzzy Clustering on Image...cscpconf
Using thresholding method to segment an image, a fixed threshold is not suitable if the
background is rough here, we propose a new adaptive thresholding method using KFCM. The
method requires only one parameter to be selected and the adaptive threshold surface can be
found automatically from the original image. An adaptive thresholding scheme using adaptive
tracking and morphological filtering. KFCM algorithm computes the fuzzy membership values
for each pixel. Our method is good for detecting large and small images concurrently. It is also
efficient to denoise and enhance the responses of images with low local contrast can be detected. The efficiency and accuracy of the algorithm is demonstrated by the experiments on the MR brain images.
A Hybrid Technique for the Automated Segmentation of Corpus Callosum in Midsa...IJERA Editor
The corpus callosum (CC) is the largest white-matter structure in human brain. In this paper, we take two techniques to observe the results of segmentation of Corpus Callosum. The first one is mean shift algorithm and morphological operation. The second one is k-means clustering. In this paper, it is performed in three steps. The first step is finding the corpus callosum area using adaptive mean shift algorithm or k-means clustering . In second step, the boundary of detected CC area is then used as the initial contour in the Geometric Active Contour (GAC) mode and final step to remove unknown noise using morphological operation and evolved to get the final segmentation result. The experimental results demonstrate that the mean shift algorithm and k-means clustering has provided a reliable segmentation performance.
Hierarchical Vertebral Body Segmentation Using Graph Cuts and Statistical Sha...IJTET Journal
Abstract— Bone Mineral Density (BMD) estimations and fracture investigation of the spine bones are retrained to the vertebral bodies (VBs).A contemporary shape and appearance based method is proposed to segment VBs in clinical Computed Tomography (CT) images without any user arbitration. The proposed approach depends on both image appearance and shape information. Shape knowledge is aggregated from a set of training shapes. Then shape variations are estimated using statistical shape model which approximates the shape variations of the vertebral bodies and its background in the variability region. To segment a VB, the graph cut method used to detect the VB region automatically. Detected contours are aligned and mean shape model is created. The spatial interaction between the neighboring pixels is identified. The statistical shape model is used to produce the deformable shape model and all instances of the shape lies with the current estimate of the mean shape.
A methodology for visually lossless jpeg2000 compression of monochrome stereo...LeMeniz Infotech
A methodology for visually lossless jpeg2000 compression of monochrome stereo images.
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
FPGA ARCHITECTURE FOR FACIAL-FEATURES AND COMPONENTS EXTRACTIONijcseit
Several methods for detecting the face and extracting the facial features and components exist in the
literature. These methods are different in their complexity, performance, type and nature of the images and
the targeted application. The facial features and components are used in security applications, robotics and
assistance for the disabled. We use these components and characteristics to determine the state of alertness
and fatigue for medical diagnoses. In this work we use plain color background images whose color is
different from the skin and which contain a single face. We are interested in FPGA implementation of this
application. This implementation must meet two constraints, which are the execution time and the FPGA
resources. We have selected and have associated a face detection algorithm based on the skin detection
(using the RGB space) with a facial-feature extraction algorithm based on tracking the gradient and the
geometric model.
Analysis and characterization of dendrite structures from microstructure imag...eSAT Journals
Abstract Digital Image processing (DIP) and Computer vision (CV) techniques have great support role in material manufacturing by providing precise insight of materials. The morphology of constituents in metal alloys basically depends on the process of solidification. The solidification method (air, oil or water) and time are the reasons for definite morphology of constituents. Dendrite structures are one of the, such morphological structures and many important properties of materials are closely related to the morphology of the dendrite. The information about solidification process of materials is a must-know information in the process of production of materials which can be extracted through characterization of dendrite structures. In this paper, an automated and robust method that comprises of image processing, computer vision and serial sectioning techniques as a means of 3D characterization of the solidified microstructures of magnesium-based alloys is presented. The phase fraction and morphologies of intermetallics of magnesium –aluminium alloy material are determined. The results obtained by proposed method are compared with the manual computations based on the Scheil–Gulliver solidification model [12,13] for the authenticity of proposed method. The comparison of results indicates that the results of the proposed method are much accurate compared to other methods. Therefore, the proposed method will enable a comprehensive understanding of solidification variables, microstructure, and properties. Keywords: Dendrite, three-dimensional analysis, serial sectioning, Scheil–Gulliver solidification model.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Face recognition based on curvelets, invariant moments features and SVMTELKOMNIKA JOURNAL
Recent studies highlighted on face recognition methods. In this paper, a new algorithm is proposed for face recognition by combining Fast Discrete Curvelet Transform (FDCvT) and Invariant Moments with Support vector machine (SVM), which improves rate of face recognition in various situations. The reason of using this approach depends on two things. first, Curvelet transform which is a multi-resolution method, that can efficiently represent image edge discontinuities; Second, the Invariant Moments analysis which is a statistical method that meets with the translation, rotation and scale invariance in the image. Furthermore, SVM is employed to classify the face image based on the extracted features. This process is applied on each of ORL and Yale databases to evaluate the performance of the suggested method. Experimentally, the proposed method results show that our system can compose efficient and reasonable face recognition feature, and obtain useful recognition accuracy, which is able to face and side-face states detection of persons to decrease fault rate of production.
IMPROVED PARALLEL THINNING ALGORITHM TO OBTAIN UNIT-WIDTH SKELETONijma
To extract the creditable features in a fingerprint image, many people use a thinning algorithm that plays a
very important role in preprocessing. In this paper, we propose a robust parallel thinning algorithm that
can preserve the connectivity of the binarized fingerprint image, while making the thinnest skeleton of only
1-pixel wide, which gets extremely close to the medial axis. The proposed thinning method repeats three
sub-iterations. The first sub-iteration takes off only the outermost boundary pixel using the inner points. To
extract the one-sided skeletons, the second sub-iteration seeks the skeletons with a 2-pixel width. The third
sub-iteration prunes the needless pixels with a 2-pixel width existing in the obtained skeletons. The
proposed thinning algorithm shows robustness against rotation and noise and makes the balanced medial
axis. To evaluate the performance of the proposed thinning algorithm, we compare it with and analyze
previous algorithms.
Efficient fingerprint image enhancement algorithm based on gabor filtereSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Robust Adaptive Threshold Algorithm based on Kernel Fuzzy Clustering on Image...cscpconf
Using thresholding method to segment an image, a fixed threshold is not suitable if the
background is rough here, we propose a new adaptive thresholding method using KFCM. The
method requires only one parameter to be selected and the adaptive threshold surface can be
found automatically from the original image. An adaptive thresholding scheme using adaptive
tracking and morphological filtering. KFCM algorithm computes the fuzzy membership values
for each pixel. Our method is good for detecting large and small images concurrently. It is also
efficient to denoise and enhance the responses of images with low local contrast can be detected. The efficiency and accuracy of the algorithm is demonstrated by the experiments on the MR brain images.
A Hybrid Technique for the Automated Segmentation of Corpus Callosum in Midsa...IJERA Editor
The corpus callosum (CC) is the largest white-matter structure in human brain. In this paper, we take two techniques to observe the results of segmentation of Corpus Callosum. The first one is mean shift algorithm and morphological operation. The second one is k-means clustering. In this paper, it is performed in three steps. The first step is finding the corpus callosum area using adaptive mean shift algorithm or k-means clustering . In second step, the boundary of detected CC area is then used as the initial contour in the Geometric Active Contour (GAC) mode and final step to remove unknown noise using morphological operation and evolved to get the final segmentation result. The experimental results demonstrate that the mean shift algorithm and k-means clustering has provided a reliable segmentation performance.
Hierarchical Vertebral Body Segmentation Using Graph Cuts and Statistical Sha...IJTET Journal
Abstract— Bone Mineral Density (BMD) estimations and fracture investigation of the spine bones are retrained to the vertebral bodies (VBs).A contemporary shape and appearance based method is proposed to segment VBs in clinical Computed Tomography (CT) images without any user arbitration. The proposed approach depends on both image appearance and shape information. Shape knowledge is aggregated from a set of training shapes. Then shape variations are estimated using statistical shape model which approximates the shape variations of the vertebral bodies and its background in the variability region. To segment a VB, the graph cut method used to detect the VB region automatically. Detected contours are aligned and mean shape model is created. The spatial interaction between the neighboring pixels is identified. The statistical shape model is used to produce the deformable shape model and all instances of the shape lies with the current estimate of the mean shape.
A methodology for visually lossless jpeg2000 compression of monochrome stereo...LeMeniz Infotech
A methodology for visually lossless jpeg2000 compression of monochrome stereo images.
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
FPGA ARCHITECTURE FOR FACIAL-FEATURES AND COMPONENTS EXTRACTIONijcseit
Several methods for detecting the face and extracting the facial features and components exist in the
literature. These methods are different in their complexity, performance, type and nature of the images and
the targeted application. The facial features and components are used in security applications, robotics and
assistance for the disabled. We use these components and characteristics to determine the state of alertness
and fatigue for medical diagnoses. In this work we use plain color background images whose color is
different from the skin and which contain a single face. We are interested in FPGA implementation of this
application. This implementation must meet two constraints, which are the execution time and the FPGA
resources. We have selected and have associated a face detection algorithm based on the skin detection
(using the RGB space) with a facial-feature extraction algorithm based on tracking the gradient and the
geometric model.
Analysis and characterization of dendrite structures from microstructure imag...eSAT Journals
Abstract Digital Image processing (DIP) and Computer vision (CV) techniques have great support role in material manufacturing by providing precise insight of materials. The morphology of constituents in metal alloys basically depends on the process of solidification. The solidification method (air, oil or water) and time are the reasons for definite morphology of constituents. Dendrite structures are one of the, such morphological structures and many important properties of materials are closely related to the morphology of the dendrite. The information about solidification process of materials is a must-know information in the process of production of materials which can be extracted through characterization of dendrite structures. In this paper, an automated and robust method that comprises of image processing, computer vision and serial sectioning techniques as a means of 3D characterization of the solidified microstructures of magnesium-based alloys is presented. The phase fraction and morphologies of intermetallics of magnesium –aluminium alloy material are determined. The results obtained by proposed method are compared with the manual computations based on the Scheil–Gulliver solidification model [12,13] for the authenticity of proposed method. The comparison of results indicates that the results of the proposed method are much accurate compared to other methods. Therefore, the proposed method will enable a comprehensive understanding of solidification variables, microstructure, and properties. Keywords: Dendrite, three-dimensional analysis, serial sectioning, Scheil–Gulliver solidification model.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Face recognition based on curvelets, invariant moments features and SVMTELKOMNIKA JOURNAL
Recent studies highlighted on face recognition methods. In this paper, a new algorithm is proposed for face recognition by combining Fast Discrete Curvelet Transform (FDCvT) and Invariant Moments with Support vector machine (SVM), which improves rate of face recognition in various situations. The reason of using this approach depends on two things. first, Curvelet transform which is a multi-resolution method, that can efficiently represent image edge discontinuities; Second, the Invariant Moments analysis which is a statistical method that meets with the translation, rotation and scale invariance in the image. Furthermore, SVM is employed to classify the face image based on the extracted features. This process is applied on each of ORL and Yale databases to evaluate the performance of the suggested method. Experimentally, the proposed method results show that our system can compose efficient and reasonable face recognition feature, and obtain useful recognition accuracy, which is able to face and side-face states detection of persons to decrease fault rate of production.
Padrões de deploy para DevOps e Entrega Contínua, por Danilo SatoThoughtworks
Práticas de DevOps e Entrega Contínua ajudam a aumentar a frequência de deploys na sua empresa, ao mesmo tempo aumentando a estabilidade e robustez do sistema em produção. Com o foco em automação, é possível realizar diversos deploys por dia, porém é comum encontrar resistência do time de operações quando você tenta
colocar isso em prática. Nesta palestra iremos apresentar alguns padrões de deploy que irão te ajudar a diminuir o risco ao implantar novas versões de seus sistemas e aplicativos em produção e discutiremos como estreitar a colaboração
entre as equipes de desenvolvimento e de operações para implantar DevOps na sua empresa.
It's finally Christmas! We've spent a whole year creating thousands of snackable graphics & now it's time to snack on some xmas goodies! So from all of us here at JESS3 to all of you, Merry Christmas & a happy, healthy New Year!
Presentation at DIGITAL CONTENT NEXT Legal & Legislative Day 2016, Washington DC. DCN represent the premium media groups in the US and internationally (Disney, NYT, Bloomberg, CNN, CBS, ABC, etc.)
Презентация к циклу мастер-классов. Часть 1.
Два эксперта с суммарным опытом работы с персоналом 31 год делятся секретами и тонкостями поиска, найма, тестирования, мотивации, управления и увольнения "кадров" в непростую эпоху дефицита специалистов и кадровой конкуренции.
Remarks as written by MCCM(SW/AW/EXW) Jon McMillan, Master Chief for U.S. Navy Public Affairs at the National Association of Naval Photographers 2015 Convention / San Diego Shoot Off Banquet.
September 26, 2015
Iris Localization - a Biometric Approach Referring Daugman's AlgorithmEditor IJCATR
In general, there are many methods of biometric identification. But the Iris
recognition is most accurate and secure means of biometric identification. Iris has
many properties which makes it ideal biometric identification. There are many
methods used to identify the Iris location. To locate Iris many traditional methods are
used. In this we proposed such methods which can identify Iris Center(IC) as well as
localize its center. In this paper we are proposing a method which can use novel IC
localization method on the fact that the elliptical shape (ES) of Iris varies according to
the rotation of eye movement. In this paper various IC locations are generated and
stored in database. Finally the location of IC is detected by matching the ES of the Iris
of input eye image withes candidates in DB. In this paper we are comparing different
methods for Iris localization.
An Analysis and Comparison of Quality Index Using Clustering Techniques for S...CSCJournals
In this paper, the proposed approach consists of mainly three important steps: preprocessing, gridding and segmentation of micro array images. Initially, the microarray image is preprocessed using filtering and morphological operators and it is given for gridding to fit a grid on the images using hill-climbing algorithm. Subsequently, the segmentation is carried out using the fuzzy c-means clustering. Initially the enhanced fuzzy c-means clustering algorithm (EFCMC) is implemented to effectively clustering the image whether the image may be affected by the noises or not. Then, the EFCM method was employed the real microarray images and noisy microarray images in order to investigate the efficiency of the segmentation. Finally, the segmentation efficiency of the proposed approach was compared with the various algorithms in terms of quality index and the obtained results ensures that the performance efficiency of the proposed algorithm was improved in term of quality index rather than other algorithms.
Gabor filter is a powerful way to enhance biometric images like fingerprint images in order to extract correct features from these images, Gabor filter used in extracting features directly asin iris images, and sometimes Gabor filter has been used for texture analysis. In fingerprint images The even symmetric Gabor filter is contextual filter or multi-resolution filter will be used to enhance fingerprint imageby filling small gaps (low-pass effect) in the direction of the ridge (black regions) and to increase the discrimination between ridge and valley (black and white regions) in the direction, orthogonal to the ridge, the proposed method in applying Gabor filter on fingerprint images depending on translated fingerprint image into binary image after applying some simple enhancing methods to partially overcome time consuming problem of the Gabor filter.
SLIC Superpixel Based Self Organizing Maps Algorithm for Segmentation of Micr...IJAAS Team
We can find the simultaneous monitoring of thousands of genes in parallel Microarray technology. As per these measurements, microarray technology have proven powerful in gene expression profiling for discovering new types of diseases and for predicting the type of a disease. Gridding, Intensity extraction, Enhancement and Segmentation are important steps in microarray image analysis. This paper gives simple linear iterative clustering (SLIC) based self organizing maps (SOM) algorithm for segmentation of microarray image. The clusters of pixels which share similar features are called Superpixels, thus they can be used as mid-level units to decrease the computational cost in many vision applications. The proposed algorithm utilizes superpixels as clustering objects instead of pixels. The qualitative and quantitative analysis shows that the proposed method produces better segmentation quality than k-means, fuzzy cmeans and self organizing maps clustering methods.
RECOGNITION OF CDNA MICROARRAY IMAGE USING FEEDFORWARD ARTIFICIAL NEURAL NETWORKijaia
The complementary DNA (cDNA) sequence considered the magic biometric technique for personal identification. Microarray image processing used for the concurrent genes identification. In this paper, we present a new method for cDNA recognition based on the artificial neural network (ANN). We have segmented the location of the spots in a cDNA microarray. Thus, a precise localization and segmenting of a spot are essential to obtain a more exact intensity measurement, leading to a more accurate gene expression measurement. The segmented cDNA microarray image resized and used as an input for the
proposed artificial neural network. For matching and recognition, we have trained the artificial neural
network. Recognition results are given for the galleries of cDNA sequences . The numerical results show
that, the proposed matching technique is an effective in the cDNA sequences process. The experimental
results of our matching approach using different databases shows that, the proposed technique is an effective matching performance.
EV-SIFT - An Extended Scale Invariant Face Recognition for Plastic Surgery Fa...IJECEIAES
This paper presents a new technique called Entropy based SIFT (EV-SIFT) for accurate face recognition after the plastic surgery. The corresponding feature extracts the key points and volume of the scale-space structure for which the information rate is determined. This provides least effect on uncertain variations in the face since the entropy is the higher order statistical feature. The corresponding EV-SIFT features are applied to the Support vector machine for classification. The normal SIFT feature extracts the key points based on the contrast of the image and the V- SIFT feature extracts the key points based on the volume of the structure. However, the EV- SIFT method provides both the contrast and volume information. Thus EV-SIFT provide better performance when compared with PCA, normal SIFT and VSIFT based feature extraction.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
Call for paper 2012, hard copy of Certificate, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJCER, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, research and review articles, IJCER Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathematics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer review journal, indexed journal, research and review articles, engineering journal, www.ijceronline.com, research journals,
yahoo journals, bing journals, International Journal of Computational Engineering Research, Google journals, hard copy of Certificate,
journal of engineering, online Submission
Proposed Hough Technique for Estimating Climatic Conditions recorded in the C...iosrjce
Complex ensemble of shapes in an image is very difficult for segmentation. Hough transform is one
of the robust algorithms for detecting geometric shapes in the images. The modification of this Hough transform
is used for effecting way of segmenting images. By tuning the parameters of the circle detection model,
extracting the concentric shapes is achieved. In this paper, we proposed an algorithm for finding the distance
between the concentric closed shapes in an image. These achieved by splitting the image into four quadrants
and apply the Hough transform for detecting the curves in each quadrant and finally combine the result of four
quadrants and achieve the result
This paper presents an improved edge detection algorithm for facial and remotely sensed images using
vector order statistics. The developed algorithm processes coloured images directly without been converted
to grey scale. A number of the existing algorithms converts the coloured images into grey scale before
detection of edges. But this process leads to inaccurate precision of recognized edges, thus producing false
and broken edges in the output edge map. Facial and remotely sensed images consist of curved edge lines
which have to be detected continuously to prevent broken edges. In order to deal with this, a collection of
pixel approach is introduced with a view to minimizing the false and broken edges that exists in the
generated output edge map of facial and remotely sensed images.
Microarray spot partitioning by autonomously organising maps through contour ...IJECEIAES
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Binary operation based hard exudate detection and fuzzy based classification ...IJECEIAES
Diabetic retinopathy (DR) is one of the most considerable reasons for visual impairment. The main objective of this paper is to automatically detect and recognize DR lesions like hard exudates, as it helps in diagnosing and screening of the disease. Here, binary operation based image processing for detecting lesions and fuzzy logic based extraction of hard exudates on diabetic retinal images are discused. In the initial stage, the binary operations are used to identify the exudates. Similarly, the RGB channel space of the DR image is used to create fuzzy sets and membership functions for extracting the exudates. The membership directives obtained from the fuzzy rule set are used to detect the grade of exudates. In order to evaluate the proposed approach, experiment tests are carriedout on various set of images and the results are verified. From the experiment results, the sensitivity obtained is 98.10%, specificity is 96.96% and accuracy is 98.2%. These results suggest that the proposed method could be a diagnostic aid for ophthalmologists in the screening for DR.
AN AUTOMATIC SCREENING METHOD TO DETECT OPTIC DISC IN THE RETINAijait
The location of Optic Disc (OD) is of critical importance in retinal image analysis. This research paper carries out a new automated methodology to detect the optic disc (OD) in retinal images. OD detection helps the ophthalmologists to find whether the patient is affected by diabetic retinopathy or not. The proposed technique is to use line operator which gives higher percentage of detection than the already existing methods. The purpose of this project is to automatically detect the position of the OD in digital retinal fundus images. The method starts with converting the RGB image input into its LAB component. This image is smoothed using bilateral smoothing filter. Further, filtering is carried out using line operator. After which gray orientation and binary map orientation is carried out and then with the use of the resulting maximum image variation the area of the presence of the OD is found. The portions other
than OD are blurred using 2D circular convolution. On applying mathematical steps like peak classification, concentric circles design and image difference calculation, OD is detected. The proposed method was evaluated using a subset of the STARE project’s dataset and the success percentage was found
to be 96%.
Prediction of Interpolants in Subsampled Radargram Slicesijtsrd
This paper provides an algorithmic procedure to predict interpolants of subsampled images. Given a digital image, one can subsample it by forcing pixel values in the alternate columns and rows to zero. Thus, the size of the subsampled image is reduced to half of the size of the original image. This means 75 of the information in the original image is lost in the subsampled image. The question that arises here is whether it is possible to predict these lost pixel values, which are called interpolants so that the reconstructed image is in accordance with the original image. In this paper, two novel interpolant prediction techniques, which are reliable and computationally efficient, are discussed. They are i interpolant prediction using neighborhood pixel value averaging and ii interpolant prediction using extended morphological filtering. T. Kishan Rao | E. G. Rajan | Dr. M Shankar Lingam "Prediction of Interpolants in Subsampled Radargram Slices" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-1 , December 2020, URL: https://www.ijtsrd.com/papers/ijtsrd38207.pdf Paper URL : https://www.ijtsrd.com/computer-science/artificial-intelligence/38207/prediction-of-interpolants-in-subsampled-radargram-slices/t-kishan-rao
FINGERPRINT CLASSIFICATION BASED ON ORIENTATION FIELDijesajournal
ABSTRACT
This paper introduces an effective method of fingerprint classification based on discriminative feature gathering from orientation field. A nonlinear support vector machines (SVMs) is adopted for the classification. The orientation field is estimated through a pixel-Wise gradient descent method and the percentage of directional block classes is estimated. These percentages are classified into four-dimensional vector considered as a good feature that can be combined with an accurate singular point to classify the fingerprint into one of five classes. This method shows high classification accuracy relative to other spatial domain classifiers.
Similar to A new method of gridding for spot detection in microarray images (20)
A new method of gridding for spot detection in microarray images
1. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
25
A New Method of Gridding for Spot Detection in Microarray
Images
J.Harikiran1
, D.RamaKrishna2
, B.Avinash3
, Dr.P.V.Lakshmi4
, Dr.R.KiranKumar5
1. Member IEEE and Assistant professor, Department of IT, GITAM University, Visakhapatnam
2. Assistant professor, Department of CSE, GIT, GITAM University
3. Project Fellow, UGC Major Research Project, GIT, GITAM University, Visakhapatnam
4. Professor and Head, Department of IT, GITAM University, Visakhapatnam.
5. Assistant professor, Department of Computer science, Krishna University, Machilipatnam.
Abstract
A Deoxyribonucleic Acid (DNA) microarray is a collection of microscopic DNA spots attached to a solid
surface, such as glass, plastic or silicon chip forming an array. The analysis of DNA microarray images allows
the identification of gene expressions to draw biological conclusions for applications ranging from genetic
profiling to diagnosis of cancer. The DNA microarray image analysis includes three tasks: gridding,
segmentation and intensity extraction. The gridding process is usually divided into two main steps: sub-gridding
and spot detection. In this paper, a fully automatic approach to detect the location of spots is proposed. Each spot
is associated with a gene and contains the pixels that indicate the level of expression of that particular gene.
After gridding, the image is segmented using fuzzy c-means clustering algorithm for separation of spots from the
background pixels. The result of the experiment shows that the method presented in this paper is accurate and
automatic without human intervention and parameter presetting.
Keywords: Microarray Image, Mathematical Morphology, Image Processing
1. Introduction
Microarrays, widely recognized as the next revolution in molecular biology, enable scientists to analyze genes,
proteins and other biological molecules on a genomic scale [1]. A microarray is a collection of spots containing
DNA deposited on the solid surface of glass slide. Each of the spot contains multiple copies of single DNA
sequence [2]. Microarray expression technology helps in the monitoring of gene expression for tens and
thousands of genes in parallel [3]. The processing of the microarray images [5] usually consists of the following
three steps: (i) gridding, which is the process of segmenting the microarray image into compartments, each
compartment having only one spot and background (ii) Segmentation, which is the process of segmenting each
compartment into one spot and its background area (iii) Intensity extraction, which calculates red and green
foreground intensity pairs and background intensities.
Many approaches have been proposed for spot detection in microarray images. Hirata [6] presented an automatic
sub-array and spot gridding method using the horizontal and vertical profile signal of the image. User assistance
was required in this method to fix image rotation and check if the segmentation is correct. This method is valid
only if the sub-array sizes are equal. Jain [7] proposed a gridding algorithm based on axis projection of image
intensity along the rows and columns of the microarray image. The algorithm requires large number of spots and
is not robust to misalignment of different grids. Y.Wang [8] demonstrated a fully automatic gridding
methodology using intensity projection profile of microarray image. The method is sensitive to contaminations
and large number of missing spots. Shuqing Zhao [13] proposed microarray image processing using
mathematical morphology. An improved gridding method based on mathematical morphology is proposed,
which is characterized by filtering out the block noise and filtering projection plots. Several parameters about the
sub-array and spots are required during the gridding and spotting procedure which can be preset in advance or
acquired from database. Deepa.J [14] proposed automatic gridding of DNA microarray images using optimum
subimage. The approach is based on the selection of optimum subimage and the parameters for gridding are
calculated using the intensity projection profile of the sub-image.
In this paper, a fully automatic gridding algorithm for spot detection is presented. After gridding, fuzzy C-means
clustering algorithm is used for segmentation of microarray image into spots and image background. The
algorithm is automatic and accurate for misalignment of spots in microarray image. Furthermore, when we apply
this algorithm on different microarray images, human intervention and parameter presetting is unnecessary. The
paper is organized as follows: section II presents edge detection using adaptive multi-structure morphological
algorithm, Section III presents Morphological filling, Section IV presents gridding algorithm, Section V presents
the Fuzzy c-means clustering algorithm, Section VI presents the qualitative and quantitative results, and finally
Section VI repots conclusions.
2. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
26
2. Edge Detection Using Adaptive Multistructure Morphological Algorithm
Because of the unicity and fixity of structural element (SE) in traditional Edge detection using mathematical
morphology, there are two main deficiencies: on the one hand, a single SE can only detect the edge of the same
direction with the SE, but is not sensitive to different directions; on the other hand large-scale SE has strong
ability to restrain noise, but the detected edge image is rough; small-scale SE is good at checking the details of
the edge, but weak at noise suppression. In order to effectively restrain noise and preserve image edge
information, we use adaptive multi-structure morphological algorithm to get the edge images [12]. We calculate
the gray scale distance of original image to adaptively define the weights of SEs. The eight structuring elements
of different directions with the size of 5X5 are shown in figure 1.
0 0 0 0 0
0 0 0 0 0
1 1 1 1 1
0 0 0 0 0
0 0 0 0 0
SE with 00
0 0 0 0 0
0 0 0 0 1
0 0 1 0 0
1 0 0 0 0
0 0 0 0 0
SE with 22.50
0 0 0 0 1
0 0 0 1 0
0 0 1 0 0
0 1 0 0 0
1 0 0 0 0
SE with 450
0 0 0 1 0
0 0 0 0 0
0 0 1 0 0
0 0 0 0 0
0 1 0 0 0
SE with 67.50
0 0 1 0 0
0 0 1 0 0
0 0 1 0 0
0 0 1 0 0
0 0 1 0 0
SE with 900
0 1 0 0 0
0 0 0 0 0
0 0 1 0 0
0 0 0 0 0
0 0 0 1 0
SE with 112.50
1 0 0 0 0
0 1 0 0 0
0 0 1 0 0
0 0 0 1 0
0 0 0 0 1
SE with 1350
0 0 0 0 0
1 0 0 0 0
0 0 1 0 0
0 0 0 0 1
0 0 0 0 0
SE with 157.50
Figure 1. SEs with different directions.
a9 a8 a7 a6 a5
a10 a23 a24 a25 a4
a11 a22 a1 a2 a3
a12 a21 a20 a19 a18
a13 a14 a15 a16 a17
Figure 2. Image Sub-block
3. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
27
Figure 2 shows the sub-block with the size 5X5, in which a1 is the gray-scale value of the center pixel, and
a2,a3,a4…..,a25 stand for its neighborhood gray scale value, then the gray-scale distance of a1 and its
neighborhood can be performed as:
dk= |a1-ak|, k= 2,3,4,….,25. (1)
The larger the gray-scale distance, the higher extent of salutation, and the bigger possibility that the pixel is an
edge point in the image. The Edge Gray-Scale distances of a1 can be defined as follows.
G1(x,y) = d4 + d5 + d6 + d7 + d8 + d9 + d10 + d12 +d13 + d14 + d15 + d16 + d17 + d18 + d19 + d20 + d21 + d23+ d24 +
d25 ; --for direction 00
G2(x,y) = d4 + d5 + d6 + d7 + d8 + d9 + d10 + d12 +d13 + d14 + d15 + d16 + d17 + d18 + d19 + d20 + d21 + d22 + d23+
d24 + d25; --for direction 22.50
G3(x,y) = d2 + d3+ d4 + d6 + d7 + d8 + d9 + d10 + d11 + d12 + d14 + d15 + d16 + d17 + d18 + d19 + d20 + d22 + d23+ d24
; ----for direction 450
G4(x,y) = d2 + d3 +d4 + d5 + d7 + d8 + d9 + d10 + d11 +d12 + d13 + d14 +d15 + d16 + d17 + d18 + d19 + d21 + d22 +d23
+d24+ d25 ;
---for direction 67.50
G5(x,y) = d2 + d3 +d4 + d5 + d6 + d8 + d9 + d10 + d11+d12 +d13 + d14 + d16 + d17 + d18 + d19 + d20 + d21 + d23+ d25
; ----for direction 900
G6(x,y) = d2 + d3 +d4 + d5 + d6 + d7 + d9 + d10 + d11 +d12 + d13 + d14 + d15 + d17 + d18 + d19 + d20+d21 + d22 +d23
+d24+ d25 ;
---for direction 112.50
G7(x,y) = d2 + d3 +d4 + d5 + d6 + d8 + d9 + d10 + d11+d12 +d13 + d14 + d16 + d17 + d18 + d19 + d20 + d21 + d23+ d25
; ----for direction 1350
G8(x,y) = d2 + d3 +d4 + d5 + d6 + d7 + d8 + d10 + d11 +d12 + d13 + d14 + d15 + d16 +d18 + d19 + d20+d21 +d24+ d25
;
---for direction 157.50
As for the whole image, the gray-scale distances of each edge and adaptive weights of SEs can be calculated as
below:
EDk = ∑∑
−
=
−
=
1
2
1
2
N
y
M
x
Gk (x,y), k=1,2,….,8 (1)
wk = EDk / ( ∑=
8
1k
EDk ) , k=1,2,….,8 (2)
The edge E extracted adaptively by multi-structure morphology is given by
E= ∑=
8
1k
wk [(I о bk ) bk -( I • bk )Ɵ bk) ] (3)
3. Morphological Filling
A hole may be defined as a background region surrounded by a connected border of foreground pixels.
The filling holes in an image are based on set dilation, complementation and intersection [11]. The following
procedure fill all the holes with 1’s until Xk=Xk-1.
Xk= (Xk-1 B) ∩ Ac
k=1, 2, 3…. (4)
4. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
28
Where B is a symmetric structuring element and A is the binary image (output of Edge Detection). X0 is an array
containing 0’s with the same size of A except at the locations corresponding to the point in each hole is 1. The
union of Xk with the image A gives the filled region.
4. Automatic Spot Detection Algorithm
A microarray image contains a number of sub-grids and each sub-grid representing a two dimensional array of
spots. Gridding refers to accurately locating each spot within a microarray image namely sub-gridding and spot
detection. The sub-grid detection is done by the method in [10]. After sub-grid detection, the aim is to separate
the sub-grid into spot regions by means of a grid. The output of gridding is to obtain a 2D matrix G of same size
of sub-grid. Initially the values of G[i,j]= 0, for i=1,….,M and j=1,….,N.
The steps of the automatic spot detection algorithm are as follows:
Step 1: Convert the RGB Microarray image into grayscale image
Step 2: Perform Edge detection using method in section 1 on the grayscale microarray image.
Step 3: Perform morphological filling on the edge image obtained from step 2.
Step 4: Calculation of Horizontal and Vertical Intensity profiles
Horizontal and vertical intensity projection profiles of binary image (Morphological Filled Image) are the sum of
pixel intensities along each row and column respectively. Let Mb indicates the filled image of size MxN . Then
the intensity projection profile along ith
row and jth
column are computed using (3) and (4).
Si=
1
( , )
N
pi b
j
M M i j
=
= ∑ i=1…..M (5)
Sj=
1
( , )
M
pj b
i
M M i j
=
= ∑ j=1……..N (6)
Step 5: Calculation of row width (RW) and column width (CW)
The values in Si are used for identification of row width and values in Sj are used for identification of column
width. The values in Si and Sj looks like zeros followed by nonzero again zeros and so on.
The procedure for row width calculation is as follows:
i. For i = 1 to M,
Count the number of zeroes in Si (between the elements in Si having nonzero) = Wyp, Where p = 1,
2, 3 …, k.
Count the number of non-zeroes in Si (between the elements in Si having zero) = Wxp, Where p =
1, 2, 3 …, k.
ii. For p=1,2,…,k Wzp= Wxp + (Wyp + Wy(p+1))/2,
iii. Row width (RW) = median (Wz).
iv. Using the value RW draw horizontal grid lines at positions of i, where i=1, 2 ….. M with step
increment RW.
for i=1to M step RW
for j=1 to N
G[i,j] =1;
The procedure for column width calculation is as follows:
i. For j = 1 to N,
Count the number of zeroes in Sj (between the elements in Si having nonzero) = Wyp, Where p = 1,
2, 3 …, k.
Count the number of non-zeroes in Sj (between the elements in Si having zero) = Wxp, Where p =
1, 2, 3 …, k.
ii. For p=1,2,…,k Wzp= Wxp + (Wyp + Wy(p+1))/2,
iii. Column width (CW) = median (Wz).
iv. Using the value CW draw horizontal grid lines at positions of j, where j=1, 2 ….. N with step
increment CW.
for j=1to N step RW
for i=1 to M
G[i,j] =1;
Step 6: Map these grid matrix G onto the grayscale image.
5. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
29
Step 7: Compute all the connected components in the gridded optimum image using 8-adjacency. The number of
connected components is equal to the number of spots. Assign a label for pixels in each connected component
generating a label matrix.
Step 8: The pixels with one particular label represents a region of the single spot. Using region properties,
compute the centroid and area for each region (spot). From the centroids of the spots, we can find the distance
between the spots.
4. Segmentation Using Fuzzy C-Means Clustering Algorithm
The Fuzzy C-means [4][9] is an unsupervised clustering algorithm. The main idea of introducing fuzzy concept
in the Fuzzy C-means algorithm is that an object can belong simultaneously to more than one class and does so
by varying degrees called memberships. It distributes the membership values in a normalized fashion. It does not
require prior knowledge about the data to be segmented. It can be used with any number of features and number
of classes. The fuzzy K-means is an iterative method which tries to separate the set of data into a number of
compact clusters. The segmented microarray image using fuzzy c-means is shown in figure 7.
The Fuzzy K-means algorithm is summarized as follows:
Algorithm Fuzzy K-Means(x,n,c,m)
Input:
N=number of pixels to be clustered; x = {x1, x2 ,..., xN}: pixels of microarray image;
c=2: foreground and background clusters; m=2: the fuzziness parameter;
Output: u: membership values of pixels and segmented Image
Begin
Step_1: Initialize the membership matrix uij is a value in (0,1) and the fuzziness parameter m (m=2). The sum of
all membership values of a pixel belonging to clusters should satisfy the constraint expressed in the following.
∑=
c
j 1
uij =1 (7)
for all i= 1,2,…….N, where c (=2) is the number of clusters and N is the number of pixels in microarray image.
Step_2: Compute the centroid values for each cluster cj. Each pixel should have a degree of membership to those
designated clusters. So the goal is to find the membership values of pixels belonging to each cluster. The
algorithm is an iterative optimization that minimizes the cost function defined as follows:
F= ∑∑ ==
c
i
N
j 11
uij
m
|| xj-ci||2
(8)
where uij represents the membership of pixel xj in the ith cluster and m is the fuzziness parameter.
Step_3: Compute the updated membership values uij belonging to clusters for each pixel and cluster centroids
according to the given formula.
(9)
Step_4: Repeat steps 2-3 until the cost function is minimized.
End.
5. Qualitative and Quantitative Results
The proposed spot detection algorithm is performed on a two different microarray slides drawn from the
Stanford microarray Database corresponds to breast category aCGH tumor tissue. The first sub-grid slide is a
261*289 pixel image (Figure 3) that consists of a total of 75429 pixels. The second sub-grid slide is a 559*489
pixel image (Figure 4) that consists of total 273351 pixels. The output of the proposed automatic spot detection
algorithm on two microarray sub-grids is shown in figure3 and figure 4.
6. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
30
(a) (b) (c)
(d) (e) (f)
(g) (h)
Figure 3: a) Grey scale Image, b) Edge Detection, c) Morphological Filling d) Plot of piM (for all rows) (Si)
e) Plot of pjM (for all columns)( Sj) f) gridded image g) centroids h) segmented image using fuzzy c-means
7. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
31
(a) (b) (c)
(d) (e) (f)
(g) (h)
Figure 4:, a) Grey scale Image, b) Edge Detection, c) Morphological Filling d) Plot of piM (for all rows) (Si)
e) Plot of pjM (for all columns)( Sj) f) gridded image g) centroids h) segmented image using fuzzy c-means
The accuracy of the gridding algorithm was calculated as
Percentage accuracy = X100 (10)
8. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
32
The performance of the proposed spot gridding algorithm was evaluated by comparing the results with the
methods in [6], [7], [8] , [13] ,[14] are shown in table 1 .
Table 1: Percentage accuracy of gridding
Method Percentage Accuracy
figure 1
Percentage Accuracy
figure 2
Hirata [6] 87 79
Jain [7] 89 81
Wang [8] 91 82
Shuqing Zhao[13] 90 84
Deepa .J [14] 92 88
Proposed 96 91
After gridding, the segmentation of spots from the background pixels is done by using fuzzy c-means clustering
algorithm. The method is implemented in such a way that the intensity value of each pixel and the pixels of the
image has been grouped in two clusters. The number of pixels clustered as spot and background for two different
microarray images has been presented in Table 2.
Table 2: The number of pixels clustered as spots and background
Method Total
Number of
Pixels
Spots Background
Image 1 75429 40535 34714
Image 2 273351 111669 161682
6. Conclusion
In this paper, a fully automatic gridding method for separating spot centers in microarray sub-grids has been
proposed. The proposed automatically locates the individual spots without any input parameters and human
intervention. It can be proved that percentage accuracy of gridding is high with the methods that use projection
profile of the entire image. After gridding, the image is segmented using fuzzy c-means clustering algorithm.
The proposed method is accurate and automatic, which takes a microarray sub-grid as input image and makes no
assumptions about the size of the spots, rows and columns in the grid.
References
[1] M.Schena, D.Shalon, Ronald W.davis and Patrick O.Brown, “Quantitative Monitoring of gene expression
patterns with a complementary DNA microarray”, Science, 270,199,pp:467-470.
[2] Wei-Bang Chen, Chengcui Zhang and Wen-Lin Liu, “An Automated Gridding and Segmentation method for
cDNA Microarray Image Analysis”, 19th IEEE Symposium on Computer-Based Medical Systems.
[3] Tsung-Han Tsai Chein-Po Yang, Wei-ChiTsai, Pin-Hua Chen, “Error Reduction on Automatic Segmentation
in Microarray Image”, IEEE 2007.
[4] Volkan Uslan, Ihsan Omur Bucak, “Clustering based Spot Segmentation of cDNA Microarray Images “,
32nd
Annual International Conference of IEEE EMBS , IEEE 2010.
[5] J.Harikiran, Dr.P.V.Lakshmi, Dr.R.Kiran Kumar,” Edge detection using mathematical morphology for
gridding of Microarray image”, International Journal of Advanced Research in Computer Science, vol 3, No 2,
pp- 172-175. March 2012.
9. Computer Engineering and Intelligent Systems www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol.5, No.3, 2014
33
[6] Roberto Hirata Jr, Junior Barrera, R.F. Hashimoto, O.D.Daniel,” Microarray Gridding by mathematical
Morphology”, 2001 IEEE, PP. 112-119.
[7] A.N.Jain, Tokuyasu, Snijders,” Fully Automatic Quantification of microarray image data”, Genome research,
12(2), 32-332.
[8] Y.Wang, F.Y.Shih, M.Ma, “Precise Gridding of microarray images by detecting and correcting rotations in
subarrays”, in proceedings of sixth International conference on computer vision, Patternrecognition and Image
Processing, 2010.
[9] J.Harikiran,” Fuzzy C-means with Bi-dimensional Empirical Mode decomposition for segmentation of
Microarray image”, IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 5, No 3, September
2012.
[10] L.Reuda, “Sub-grid Detection in DNA Microarray Images”, Proceedings of the IEEE Pacific-RIM
Symposium on image and video technology, pp 248-259, 2007.
[11] R.Gongalez, R.E.Woods,” Digital Image Processing”, 4th
Edition, Printice Hall India, 2010.
[12] J.Harikiran, Dr.P.V.Lakshmi, Dr.R.Kiran Kumar,” Edge detection using mathematical morphology for
gridding of Microarray image”, International Journal of Advanced Research in Computer Science, Volume 3, No
2, pp- 172-175. March 2012.
[13] Shuqing Zhao, Qiaoning Yang, “Microarray Image Processing Based on Mathematical Morphology”,
Proceedings of ICSP 2006, IEEE.
[14] Deepa J, Tessamma Thomas,“ A New Gridding Technique for High Density Microarray Images Using
Intensity Projection Profile of Best Sub Image”, Computer Engineering and Intelligent systems, Vol 4 No 1 : pp
7-18.