Smitha N Pai

Dr. Smitha N Pai

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2023 in International Journal of Electrical and Computer Engineering (IJECE)
Verified
Journal Article
Open access
PDF file
AKANITA S KINI
ANITA S KINI
PVPrema K V
Prema K V
SPSmitha N Pai
Smitha N Pai
Computer vision techniques are an emerging trend today. Digital image processing is gaining popularity because of the significant upsurge in the usage of digital images over the internet. Digital image processing is a practice that can help in designing sophisticated high-end machines, which can hold the ophthalmic functionality of the human eye. In agriculture, leaf examination is important for disease identification and fair warning for any deficiency within the plant. Many prominent plant species are facing extinction because of a lack of knowledge. A proper realization of computer vision techniques aid in extracting a significant amount of information from leaf image. This necessitates the requirement of an automatic leaf disease detection method to diagnose disease occurrences and severity, for timely crop management, by spraying pesticides. This study focuses on techniques of digital image processing and machine learning rendered in plant leaf disease detection, which has great potential in precision agriculture. To support this study, techniques exercised by various researchers in recent years are tabulated.

27 November 2023 in IEEE Access
Verified
Journal Article
Open access
AGAgastya Gummaraju
Agastya Gummaraju
ASAjitha K B Shenoy
Ajitha K B Shenoy
SPSmitha N Pai
Smitha N Pai
This work focuses on comparing the suitability of different machine learning models for the classification of handwritten digits in the Devanagari script. The models that will be compared in this study are: K-Nearest Neighbours (K-NN), Support Vector Machine (SVM), Convolutional Neural Network (CNN), GoogLeNet (Inception v1), and ResNet-50. GoogLeNet and ResNet-50 are complex, deep neural networks. They possess a large number of hidden layers, and are generally used for more complex image classification tasks. The use of these models in this project is to gauge how well they perform on simpler image data. The foundation of this research is based on the ever increasing demand for accurate and efficient digit classification models in India, for purposes such as document scanning, ID card recognition, and the digitization of institutional records. The primary objective of this research project is to identify the most accurate and efficient digit classification model for numbers in the Devanagari script. Surprisingly, proposed simple CNN model outperforms the other complex GoogleNet and ResNet-50 models. Accuracy and Fl score of proposed CNN model is 99.522% and 0.9978 respectively. Also, the proposed CNN model used in this study outperforms other CNN model considered for Devanagari numerals classification.

24 December 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
ASAjitha K B Shenoy
Ajitha K B Shenoy
SPSmitha N Pai
Smitha N Pai
The structural property of the search graph plays an important role in the success of local search-based metaheuristic algorithms. Magnification is one of the structural properties of the search graph. This study builds the relationship between the magnification of a search graph and the mixing time of Markov Chain (MC) induced by the local search-based metaheuristics on that search space. The result shows that the ergodic reversible Markov chain induced by the local search-based metaheuristics is inversely proportional to magnification. This result indicates that it is desirable to use a search space with large magnification for the optimization problem in hand rather than using any search spaces. The performance of local search-based metaheuristics may be good on such search spaces since the mixing time of the underlying Markov chain is inversely proportional to the magnification of search space. Using these relations, this work shows that MC induced by the Metropolis Algorithm (MA) mixes rapidly if the search graph has a large magnification. This indicates that for any combinatorial optimization problem, the Markov chains associated with the MA mix rapidly i.e., in polynomial time if the underlying search graph has large magnification. The usefulness of the obtained results is illustrated using the 0/1-Knapsack Problem, which is a well-studied combinatorial optimization problem in the literature and is NP-Complete. Using the theoretical results obtained, this work shows that Markov Chains (MCs) associated with the local search-based metaheuristics like random walk and MA for 0/1-Knapsack Problem mixes rapidly.

11 May 2021
Verified
Book Chapter
Closed access
PDF file
AKAdit V. Kaneria
Adit V. Kaneria
ARAbishek B. Rao
Abishek B. Rao
SAShivani G. Aithal
Shivani G. Aithal
SPSmitha N Pai
Smitha N Pai

31 October 2018
Verified
Book Chapter
Closed access
PDF file
TDTejaswee Triyambak Das
Tejaswee Triyambak Das
SVShubhendu Vinayak
Shubhendu Vinayak
SPSmitha N Pai
Smitha N Pai

1 January 2013 in Communications in Computer and Information Science
Verified
Book Chapter
Closed access
PDF file
SPSmitha N Pai
Smitha N Pai
KSK. C. Shet
K. C. Shet
HMH. S. Mruthyunjaya
H. S. Mruthyunjaya