SMS. Mohanapriya

S. Mohanapriya

*This is an algorithmically generated author record based on publicly available information.

S. Mohanapriya has a total of 13 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Introduction to Industry 4.0: Practical Issues and Challenges

    by S. Mohana Saranya, Dinesh Komarasamy, S. Mohanapriya, M. R. Prasanndh Raaju

  • Enhancing Segmentation Accuracy of Diabetic Retinal Images Using Transform Techniques and deepLabV3+ with Ensemble Classification

    by S. Mohana Saranya, T. Pranesh, R. Rajasurya, A. H. Sabareesh, Dinesh Komarasamy, S. Mohanapriya


  • Environmental sound recognition using Gaussian mixture model and neural network classifier

    by S. P. Mohanapriya, E. P. Sumesh, R. Karthika

    Environmental sound recognition is an audio scene identification process in which a person's location is found by analyzing the background sound. This paper deals with the prototype modeling for environmental sound recognition. Sound recognition involves the collection of audio data, extraction of important features, clustering of similar features and their classification. The Mel frequency cepstrum co-efficients are extracted. These features are used for clustering by a Gaussian mixture model which is a probabilistic model. Neural Network classifier is used for classification of the features and to identify the environmental audio scene. The implementation is done with the help of MATLAB. Five major environmental sounds which include the sound of car, office, restaurant, street, subway are considered. This shows a better efficiency than the already existing method. The efficiency achieved in this method is 98.9%.


  • A micropartitioning technique for massive data analysis using MapReduce

    by S. Mohanapriya, P. Natesan

    Over the past years, large amounts of structured and unstructured data are being collected from various sources. These huge amounts of data are difficult to handle by a single machine which requires the work to be distributed across large number of computers. Hadoop is one such distributed framework which process data in distributed manner by using Mapreduce programming model. In order for Mapreduce to work, it has to divide the workload across the machines in the cluster. The performance of Mapreduce depends on how evenly it distributes the workload to the machines without skew and avoids executing job in a poorly running node called straggler. The workload distribution depends on the algorithm that partitions the data. To overcome the problem from skew, an efficient partitioning technique is proposed. The proposed algorithm improves load balancing as well as reduces the memory requirements. Slow running nodes degrade the performance of Mapreduce job. To overcome this problem, a technique called micropartitioning is used that divide the tasks into smaller tasks greater than the number of reducers and are assigned to reducers. Running many small tasks lessens the impact of stragglers, since work that would have been scheduled on slow nodes is only small which can be performed by other idle workers.

  • Automatic retrival of MRI brain image using multiqueries system

    by S. Mohanapriya, M. Vadivel

    CBIR technique is becoming increasingly important in medical field in order to store, manage, and retrieve image data based on user query. Searching is done by means of matching the image features such as texture, shape or different combinations of them. Texture features play an important role in computer vision, image processing and pattern recognition. In this paper we introduce a novel method of using SVM (Support Vector machine) classifier followed by KNN (K-nearest neighbour) for CBIR using texture and shape feature. We propose a robust retrieval using a supervised classifier which concentrates on extracted features. Gray level co-occurance matrix algorithm is implemented to extract the texture features from images. The feature optimization is done on the extracted features to select best features out of it to train the classifier. The classification is performed on the dataset and it is classified into three categories such as normal, benign and malignant. The query image is classified by the classifier to a particular class and the relevant images are retrieved from the database. To improve accuracy to calculate the precision value and recall in relevant image. Furthermore no of tissues stage storage in database to get relevant image in different feature extraction method.


  • Clustering gene expression data using Shannon's entropy

    by S. Mohanapriya, S. Anitha Elavarasi, J. Akilandeswari

    Clustering is a process of grouping a set of physical or abstract objects into classes of similar objects. The purpose of clustering gene expression data is to discover the natural data structures and gain some information regarding data distribution. It can be done with the help of clustering method. Hierarchical clustering groups' data objects into a tree of clusters. Traditional clustering algorithms uses proximity measures to identify clusters with spherical shapes and is more sensitive in the presence of outliers. The most common proximity measures used are Euclidean distance, Manhattan distance, and Pearson correlation co-efficient. In this paper, Shannon's entropy is used as a proximity measure. By using this entropy, we can able to capture the local structure of the input dataset regardless of their shapes and it is very less sensitive to outliers. It also helps to reduce the time complexity involved in identifying the gene clusters. The characteristics of the gene clusters which are produced as a result of this algorithm can be identified with the help of Gene Ontology (GO).