Kavita Sonawane

Work place: MSTME, NMIMS University, Mumbai, India

E-mail: kavitavinaysonawane@gmail.com

Website: https://orcid.org/0000-0003-0865-6760

Research Interests: Image Processing, Computer Architecture and Organization, Computer systems and computational processes, Computational Engineering, Data Structures and Algorithms


Ms. Kavita V. Sonawane has received M.E (Computer Engineering) degree from Mumbai University in 2008. Pursuing Ph.D. from Mukesh Patel School of Technology Management and Engineering, SVKM’s NMIMS University, Vile Parle (w), Mumbai, INDIA. She has more than 10 years of experience in teaching. Currently working as Assistant professor in Department of Computer Engineering at St. Francis Institute of Technology Mumbai. Her area of interest is Image Processing, Data structures and Computer Architecture. She has 23 papers in National/ International conferences / Journals to her credit. She is life time member of ISTE.

Author Articles
COVID-19 and Malaria Parasite Detection and Classification by Bins Approach with Statistical Moments Using Machine Learning

By Hrishikesh Telang Kavita Sonawane

DOI: https://doi.org/10.5815/ijigsp.2023.03.01, Pub. Date: 8 Jun. 2023

This work introduces the novelty as an application of histogram-based bins approach with statistical moments for detecting and classifying malaria using blood smear images into parasitized and uninfected cell images and the rising disease of COVID-19/Normal lung images. Proposed algorithms greatly vary as compared to the previous work. This work aims to improve accuracy in detection and classification and reduce feature vector dimensionality. It focuses on detailed image contents extracted into 8 bins by considering the significance of the R, G, and B color component relationship in the formation of each pixel. The texture features are represented by the first four moments for each of the three colors separately. This leads to the generation of 12 features vectors, each of size 8 components for each image in the database. Feature dimensionality reduction is achieved by applying different feature selection techniques to obtain desired optimum feature space. The comprehensive feature analysis presented here identifies many useful findings in order to validate the contribution of each image content uniquely in detection and classification. The proposed approach experimented with two image datasets: the malaria dataset obtained from the National Library of Medicine (NLM) and the lung image dataset acquired from the Radiography Database from Kaggle. The performance of work presented here is evaluated and compared with previous work with the same set of parameters, namely precision, recall, F1 score, and the AUC. We have achieved and improved the performances compared to previous work and also achieved better results even for the COVID-19 dataset.

[...] Read more.
Histogram Bins Matching Approach for CBIR Based on Linear grouping for Dimensionality Reduction

By H. B. Kekre Kavita Sonawane

DOI: https://doi.org/10.5815/ijigsp.2014.01.10, Pub. Date: 8 Nov. 2013

This paper describes the histogram bins matching approach for CBIR. Histogram bins are reduced from 256 to 32 and 16 by linear grouping and effect of this dimensionality reduction is analyzed, compared, and evaluated. Work presented in this paper contributes in all three main phases of CBIR that are feature extraction, similarity matching and performance evaluation. Feature extraction explores the idea of histogram bins matching for three colors R, G and B. Histogram bin contents are used to represent the feature vector in three forms. First form of feature is count of pixels, and then other forms are obtained by computing the total and mean of intensities for the pixels falling in each of the histogram bins. Initially the size of the feature vector is 256 components as histogram with the all 256 bins. Further the size of the feature vector is reduced to 32 bins and then 16 bins by simple linear grouping of the bins. Feature extraction processes for each size and type of the feature vector is executed over the database of 2000 BMP images having 20 different classes. It prepares the feature vector databases as preprocessing part of this work. Similarity matching between query and database image feature vectors is carried out by means of first five orders of Minkowski distance and also with the cosine correlation distance. Same set of 200 query images are executed for all types of feature vector and for all similarity measures. Performance of all aspects addressed in this paper are evaluated using three parameters PRCP (Precision Recall Cross over Point), LS (longest string), LSRR (Length of String to Retrieve all Relevant images).

[...] Read more.
Other Articles