Optimizing rice variety classification with transfer learning: A robust and scalable model for agricultural applications P. Dhaneesh, A.V. Prajeesh, Vijay Manohar Results in Engineering, 2025 This paper investigates the use of transfer learning to classify five rice varieties using images of rice grains and husks. Automated rice variety classification is a crucial component of precision agriculture, offering numerous benefits to optimize rice production. Accurate classification enables farmers to make informed decisions about seed selection, crop management, and quality control. Automated systems, powered by computer vision and deep learning, offer a more efficient and reliable solution compared to traditional methods, enabling rapid processing of large datasets, improved accuracy, and real-time monitoring. The authors compare six pre-trained deep convolutional neural networks (VGG19, Xception, ResNet50, ResNet152V2, DenseNet201, and EfficientNetB7) and propose a fine-tuned ResNet50-based model. The experimental results demonstrate that the proposed model achieves the highest accuracy (98.12%), outperforming the other transfer learning models considered and improving the previous work in the literature. This approach offers a promising solution for automated rice variety classification, contributing to precision agriculture. • Uses husk image analysis with fine-tuned ResNet50 and transfer learning for accurate, scalable rice variety classification. • Husk images provide key structural and textural features for robust rice variety classification in real-world conditions. • Fine-tuned ResNet50 with custom layers, dropout, batch norm, and L2 reduces overfitting, achieving 98.12% accuracy. • Transfer learning on pre-trained DCNNs enables accurate, scalable rice variety classification even with limited data.
A characterization of group vertex magic trees of diameter up to 5 Australasian Journal of Combinatorics, 2023
Local antimagic chromatic number of certain classes of trees Sarath V S, A V Prajeesh 2023 2nd International Conference on Electrical Electronics Information and Communication Technologies Iceeict 2023, 2023 Let G = (V, E) be a connected graph with |V| = <tex>$n$</tex> and | E| = m. A bijection <tex>$f$</tex> from <tex>$E$</tex> to the set of integers <tex>$\\{1, 2,\\ldots,\\ m\\}$</tex> is called a local antimagic labeling of <tex>$G$</tex> if for any two adjacent vertices <tex>$u$</tex> and <tex>$v$</tex> in G, w(u) is not equal to w(v), where <tex>$w$</tex>(u) is the sum of the labels of all the edges incident to u. Thus any local antimagic labeling induces a proper vertex coloring of <tex>$G$</tex> where the vertex <tex>$v$</tex> is assigned the color <tex>$w$</tex>(<tex>$v$</tex>). Also, the local antimagic chromatic number is defined to be the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, the local antimagic chromatic number of diameter 3 trees, certain classes of diameter 4 trees and complete bipartite graph K<inf>m,n</inf> where <tex>$m$</tex> and <tex>$n$</tex> are of different parity are obtained.
Quasimagic rectangles D. Froncek, K. Paramasivam, A. V. Prajeesh Journal of Combinatorial Designs, 2022 Abstract A quasimagic rectangle is an array with odd and even whose entries are , each appearing exactly once, such that the sum of every row is equal to a constant and the sum of every column is equal to a constant . In this article, we prove the existence of for all possible values of and , when . In addition, if , we prove that the condition is necessary and sufficient for the existence of .
(a,d)-distance antimagicness of disconnected 2-regnlar graphs A. V. Prajeesh, K. Muhammed Sabeel, K. Paramasivam Aip Conference Proceedings, 2021 A distance magic labeling of a graph G on p vertices is a bijection l from the vertex set of G to {1, 2, ···, p} such that for any vertex x of G, the weight of x, wG(x) = ∑v ∈ NG(x) l(v) is a constant. Further, if the weights of vertices of the graph G are in an arithmetic progression of the form a, a + d, …, a + (p – 1)d, then l is an (a, d)-distance antimagic labeling of the graph G. In this paper, we provide a partial solution to the problem on (a, d)-distance antimagicness of disconnected two regular graphs posted by Arumugam and Kamatchi [7].
Maximal super edge-magic graph and its strength T. Sreehari, A. V. Prajeesh, Janitha Kolayil, K. Paramasivam Aip Conference Proceedings, 2021 A (p, q)-graph G is known as super edge-magic if there exists a bijection f from V (G) ∪ E(G) to {1, …, p + q} in such a way that, for any edge uv of G, f (u) + f (v) + f (uv) = c f, is a constant and f (v) ∈ {1, …, p}. Such an f is called a super edge-magic labeling of G and c f is called the super edge-magic constant of G. The strength of a super edge-magic graph G is the minimum of all such c f ’s where the minimum is taken over all super edge-magic labeling f of G. If G is a (p, q)-super edge-magic graph, then we have that q ≤ 2p − 3. Further, any super edge-magic graph G is maximal if q = 2p − 3. In this paper, we give a characterization for any connected triangle-free graph G to attain the lower bound of its super edge-magic strength. Moreover, we determine the strength of certain well-known classes of maximal super edge-magic graphs with girth less than 4.
Note on group distance magicness of product graphs A. V. Prajeesh, K. Paramasivam Contributions to Discrete Mathematics, 2021 In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a characterization for a tree to be group distance magic.
On distance magic Harary graphs Utilitas Mathematica, 2020
On group vertex magic graphs N. Kamatchi, K. Paramasivam, A.V. Prajeesh, K. Muhammed Sabeel, S. Arumugam Akce International Journal of Graphs and Combinatorics, 2020 Let G = ( V ( G ) , E ( G ) ) be a simple undirected graph and let A be an additive abelian group with identity 0. A mapping l : V ( G ) → A ∖ { 0 } is said to be a A -vertex magic labeling of G if there exists an element μ of A such that w ( v ) = ∑ u ∈ N ( v ) l ( u ) = μ for any vertex v of G , where N ( v ) is the open neighborhood of v . A graph G that admits such a labeling is called an A -vertex magic graph. If G is A -vertex magic graph for any nontrivial abelian group A , then G is called a group vertex magic graph. In this paper, we obtain a few necessary conditions for a graph to be group vertex magic. Further, when A ≅ Z 2 ⊕ Z 2 , we give a characterization of trees with diameter at most 4 which are A -vertex magic.
A note on handicap incomplete tournaments Appattu Vallapil Prajeesh, Krishnan Paramasivam, Nainarraj Kamatchi Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2019
RECENT SCHOLAR PUBLICATIONS
Optimizing rice variety classification with transfer learning: A robust and scalable model for agricultural applications P Dhaneesh, AV Prajeesh, V Manohar Results in Engineering 28, 107570 , 2025 2025 Citations: 1
Local antimagic chromatic number of certain classes of trees VS Sarath, AV Prajeesh 2023 Second International Conference on Electrical, Electronics, Information … , 2023 2023 Citations: 2
A characterization of group vertex magic trees of diameter up to 5 M. Sabeel, K Paramasivam, AV Prajeesh, N Kamatchi, S Arumugam AUSTRALASIAN JOURNAL OF COMBINATORICS (1), 49-60 85 (1), 49-60 , 2023 2023 Citations: 10
Quasimagic rectangles D Froncek, K Paramasivam, AV Prajeesh Journal of Combinatorial Designs 30 (3), 193-202 , 2022 2022 Citations: 5
( a , d )-distance antimagicness of disconnected 2-regular graphs AV Prajeesh, KM Sabeel, K Paramasivam AIP Conference Proceedings 2336 (1), 050007 , 2021 2021 Citations: 1
Maximal super edge-magic graph and its strength T Sreehari, AV Prajeesh, J Kolayil, K Paramasivam AIP Conference Proceedings 2336 (1), 050006 , 2021 2021
Note on group distance magicness of product graphs AV Prajeesh, K Paramasivam Contributions to discrete mathematics 16 (1), 72-88 , 2021 2021 Citations: 1
A Characterization for -Vertex Magicness of Trees with Diameter 5 MS Kollaran, AV Prajeesh, K Paramasivam International Conference on Computational Sciences-Modelling, Computing and … , 2020 2020 Citations: 4
On distance magic harary graphs AV Prajeesh, K Paramasivam, KM Kathiresan Utilitas Mathematica 115, 251-266 , 2020 2020 Citations: 2
On group vertex magic graphs N Kamatchi, K Paramasivam, AV Prajeesh, K Muhammed Sabeel, ... AKCE International Journal of Graphs and Combinatorics 17 (1), pp. 461-465 , 2020 2020 Citations: 14
A note on handicap incomplete tournaments AV Prajeesh, K Paramasivam, N Kamatchi International Workshop on Combinatorial Algorithms, 1-9 , 2019 2019 Citations: 3
MOST CITED SCHOLAR PUBLICATIONS
On group vertex magic graphs N Kamatchi, K Paramasivam, AV Prajeesh, K Muhammed Sabeel, ... AKCE International Journal of Graphs and Combinatorics 17 (1), pp. 461-465 , 2020 2020 Citations: 14
A characterization of group vertex magic trees of diameter up to 5 M. Sabeel, K Paramasivam, AV Prajeesh, N Kamatchi, S Arumugam AUSTRALASIAN JOURNAL OF COMBINATORICS (1), 49-60 85 (1), 49-60 , 2023 2023 Citations: 10
Quasimagic rectangles D Froncek, K Paramasivam, AV Prajeesh Journal of Combinatorial Designs 30 (3), 193-202 , 2022 2022 Citations: 5
A Characterization for -Vertex Magicness of Trees with Diameter 5 MS Kollaran, AV Prajeesh, K Paramasivam International Conference on Computational Sciences-Modelling, Computing and … , 2020 2020 Citations: 4
A note on handicap incomplete tournaments AV Prajeesh, K Paramasivam, N Kamatchi International Workshop on Combinatorial Algorithms, 1-9 , 2019 2019 Citations: 3
Local antimagic chromatic number of certain classes of trees VS Sarath, AV Prajeesh 2023 Second International Conference on Electrical, Electronics, Information … , 2023 2023 Citations: 2
On distance magic harary graphs AV Prajeesh, K Paramasivam, KM Kathiresan Utilitas Mathematica 115, 251-266 , 2020 2020 Citations: 2
Optimizing rice variety classification with transfer learning: A robust and scalable model for agricultural applications P Dhaneesh, AV Prajeesh, V Manohar Results in Engineering 28, 107570 , 2025 2025 Citations: 1
( a , d )-distance antimagicness of disconnected 2-regular graphs AV Prajeesh, KM Sabeel, K Paramasivam AIP Conference Proceedings 2336 (1), 050007 , 2021 2021 Citations: 1
Note on group distance magicness of product graphs AV Prajeesh, K Paramasivam Contributions to discrete mathematics 16 (1), 72-88 , 2021 2021 Citations: 1
Maximal super edge-magic graph and its strength T Sreehari, AV Prajeesh, J Kolayil, K Paramasivam AIP Conference Proceedings 2336 (1), 050006 , 2021 2021
