Claim Missing Document
Check
Articles

Found 3 Documents
Search

Software Reliability Using SPRT: Burr Type III Process Model CH. Smitha; R. Satya Prasad; R. Kiran Kumar
International Journal of Electrical and Computer Engineering (IJECE) Vol 6, No 6: December 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (703.738 KB) | DOI: 10.11591/ijece.v6i6.pp3060-3067

Abstract

Increased dependence on software systems elicited the assessment of their reliability, a crucial task in software development. Effective tools and mechanisms are required to facilitate the assessment of software reliability. Classical approaches like hypothesis testing are significantly time consuming as the conclusion can only be drawn after collecting huge amounts of data. Statistical method such as Sequential Analysis can be applied to arrive at a decision quickly. This paper implemented Sequential Probability Ratio Test (SPRT) for Burr Type III model based on time domain data. For this, parameters were estimated using Maximum Likelihood Estimation to apply SPRT on five real time software failure datasets borrowed from different software projects. The results exemplify that the adopted model has given a rejection decision for the used datasets.
Multiple Feature Fuzzy c-means Clustering Algorithm for Segmentation of Microarray Images J. Harikiran; P.V. Lakshmi; R. Kiran Kumar
International Journal of Electrical and Computer Engineering (IJECE) Vol 5, No 5: October 2015
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (648.364 KB) | DOI: 10.11591/ijece.v5i5.pp1045-1053

Abstract

Microarray technology allows the simultaneous monitoring of thousands of genes. Based on the gene expression 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, segmentation and intensity extraction are the three important steps in microarray image analysis. Clustering algorithms have been used for microarray image segmentation with an advantage that they are not restricted to a particular shape and size for the spots. Instead of using single feature clustering algorithm, this paper presents multiple feature clustering algorithm with three features for each pixel such as pixel intensity, distance from the center of the spot and median of surrounding pixels. In all the traditional clustering algorithms, number of clusters and initial centroids are randomly selected and often specified by the user.  In this paper, a new algorithm based on empirical mode decomposition algorithm for the histogram of the input image will generate the number of clusters and initial centroids required for clustering.   It overcomes the shortage of random initialization in traditional clustering and achieves high computational speed by reducing the number of iterations. The experimental results show that multiple feature Fuzzy C-means has segmented the microarray image more accurately than other algorithms.
Dimensionality Reduction and Classification of Hyperspectral Images using Genetic Algorithm R. Kiran Kumar; B. Saichandana; K. Srinivas
Indonesian Journal of Electrical Engineering and Computer Science Vol 3, No 3: September 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v3.i3.pp503-511

Abstract

This paper presents genetic algorithm based band selection and classification on hyperspectral image data set. Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. In this paper, first filtering based on 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, band selection is done using genetic algorithm in-order to remove bands that convey less information. This dimensionality reduction minimizes many requirements such as storage space, computational load, communication bandwidth etc which is imposed on the unsupervised classification algorithms. Next image fusion is performed on the selected hyperspectral bands to selectively merge the maximum possible features from the selected images to form a single image. This fused image is classified using genetic algorithm. Three different indices, such as K-means Index (KMI) and Jm measure are used as objective functions. This method increases classification accuracy and performance of hyperspectral image than without dimensionality reduction.