Suchart Khummanee

Dr. Suchart Khummanee

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 June 2023 in CURRENT APPLIED SCIENCE AND TECHNOLOGY
Verified
Journal Article
Open access
PDF file
CJChatklaw Jareanpon
Chatklaw Jareanpon
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee
PSPatharee Sriputta
Patharee Sriputta
PSPeter Scully
Peter Scully
Mushrooms are economically valuable crops of high nutritional value. However, during cultivation they are continually threatened by fungal diseases, even in controlled-condition farm ecosystems. Fungal diseases significantly affect mushroom growth and can rapidly contaminate an entire crop. Farmer inspections can be hazardous to farmer health. This paper contributes an automated fungal disease detection system for the Sajor-caju mushrooms together with an intelligent farm system for precise cultivation environment control. The objective was to create and test a detection system that could detect fungal diseases rapidly, reduce farmer exposure to fungal spores, and alert farmers when fungal disease was detected. The system is composed of three parts: (i) a high-precision environment control system, (ii) an innovative imaging robot system, and (iii) a real-time fungal disease prognosis system using deep learning, with an alarm system. The trial results show that the real-time disease prognosis system has 94.35% precision (89.47% F1-score, n=13,500), and its twice daily inspections detect and report fungal disease typically within 6 to 12 h. The innovative farm’s overall capability for mushroom cultivation (environment control) is regarded as excellent and has precise control (99.6% capability, over 3-months). The innovative imaging robot’s overall operational trial performance is effective (at 99.7%). Moreover, the system effectively notifies farmers via smartphone when a fungal disease is detected.

1 August 2020 in Advances in Science, Technology and Engineering Systems Journal
Verified
Journal Article
Open access
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee
PCPhatthanaphong Chomphuwiset
Phatthanaphong Chomphuwiset
PPPotchara Pruksasri
Potchara Pruksasri

27 June 2018
Verified
Book Chapter
Closed access
PDF file
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee

25 May 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
PSPanida Songram
Panida Songram
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee
JMJirapond Muangprathub
Jirapond Muangprathub
KKKhanabhorn Kawattikul
Khanabhorn Kawattikul
Thai sentiment analysis on social media remains challenging due to the lack of explicit word boundaries, informal expressions, code-mixing, short text length, and severe class imbalance, particularly in the WISESIGHT benchmark dataset. Although transformer-based models such as WangchanBERTa provide strong contextual representations for Thai language processing, conventional hybrid architectures using fixed convolutional kernels may fail to capture diverse local semantic patterns across different sentiment classes. To address this limitation, this study proposes WangchanBERTa with Instance-Class-Aware Dynamic Kernel Selection (WangchanBERTa-IC-DKS), a novel hybrid framework that integrates contextualized embeddings with multi-kernel convolutional neural networks and dynamic kernel selection at both the instance and class levels. The proposed model adaptively determines kernel importance according to sentence semantics and class-specific sentiment characteristics, enabling more effective local feature extraction and improved minority-class recognition. Experiments were conducted on the WISESIGHT sentiment benchmark using four kernel candidates: [2, 3, 4], [3, 4, 5], [2, 3, 4, 5], and [1, 2, 3, 4, 5]. The kernel candidate [2, 3, 4, 5] achieves the best performance, with a mean macro-F1 of 63.93% averaged across three independent runs using different random seeds. Ablation studies further show that combining both class-aware and instance-aware dynamic kernel selection improves balanced classification performance compared with fixed multi-kernel CNN baselines. The proposed model also outperforms the previous state-of-the-art Parallel Hybrid model by 1.23 percentage points on the WISESIGHT dataset and by 1.36 percentage points on the 40 Thai children’s tales dataset. These findings demonstrate that dynamic kernel selection is more effective than fixed convolutional kernels across the two evaluated Thai sentiment benchmarks, particularly for short, noisy, and imbalanced Thai texts.

1 January 2024 in Journal of Interdisciplinary Mathematics
Verified
Journal Article
Closed access
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
CSChalida Sanemueang
Chalida Sanemueang
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee
CSChanwit Suwannapong
Chanwit Suwannapong
SASarutte Atsawaraungsuk
Sarutte Atsawaraungsuk
In this research, a new technique based on quantum key distribution (QKD) is described to lower the likelihood that eavesdroppers can intercept two-party communications without being detected by the sender and the recipient. The central idea is to enhance BB84 by increasing two quantum gates, Pauli-X gate and Pauli-Z gate, on both the sender and receiver sides to change the direction of each quantum state. This signifies that three control parameters must be specified to control three gates on both sides, excluding the control parameter for the quantum gate that generates a random bit on the sender side. In fact, the possibility that eavesdroppers may discreetly capture the information is 0.5 for nearly all methods. However, the probability of information captured by an eavesdropper decreases to 0.25 when all conceivable cases from Tables 1 through 7 are considered. Therefore, the proposed technique for exchanging the secret key is more secure and should be chosen for the implementation.

15 August 2026 in Electronics
Verified
Journal Article
Open access
PDF file
Suchart KhummaneeSuchart Khummanee
Suchart Khummanee
CSChanwit Suwannapong
Chanwit Suwannapong
SASarutte Atsawaraungsuk
Sarutte Atsawaraungsuk
CSChalida Sanemueang
Chalida Sanemueang
TCThipwimon Chompookham
Thipwimon Chompookham
Kritsanapong SomsukKritsanapong Somsuk
Kritsanapong Somsuk
Polynomial multiplication is the main operation in lattice-based cryptography. Modular reduction is required to maintain the correctness within finite rings. In this study, the application of lazy reduction is chosen to reduce the frequency of modular operations in the LightSaber cryptosystem. Four polynomial multiplication algorithms, including Schoolbook, Karatsuba (128 and 64 splits), and Toom-3, are evaluated under both conventional and lazy reduction settings within the same polynomial ring domain. The experimental results show that lazy reduction reduces execution time across all evaluated algorithms. The reductions range from 44.52% to 59.15%. When the number of modular reduction operations is considered, they are reduced by more than 99% for Schoolbook and Karatsuba-based methods, and by 57.14% for Toom-3. Under lazy reduction, the number of modular reductions becomes identical across all algorithms. Among the evaluated coefficient-domain methods, Toom-3 achieved the lowest execution time. Karatsuba-based methods provide a more balanced trade-off between performance, memory usage, and structural complexity. This study further examines coefficient growth and evaluates the risk of overflow to ensure numerical reliability. All intermediate values remain within the range of signed 32-bit integers. Furthermore, lazy reduction leads to an increase in peak memory usage across all algorithms, with the most significant increase observed in Schoolbook, while more advanced methods exhibit only modest growth. Since this study focuses on coefficient-domain polynomial multiplication, transform-based approaches such as the Number Theoretic Transform (NTT) are beyond the scope of this work. NTT operates in a different computational domain and involves distinct implementation trade-offs. Accordingly, the reported performance comparisons are restricted to the coefficient-domain methods evaluated in this study. In addition, hardware-specific evaluations are beyond the scope of this work, because the primary objective is to provide an algorithm-level analysis of computational efficiency, modular reduction behavior, and numerical safety under controlled conditions. Under the evaluated Python implementation and the LightSaber parameter configuration, the results show that lazy reduction is an effective technique for reducing computational overhead in coefficient-domain polynomial multiplication. The observed performance remains dependent on the structural characteristics of each multiplication algorithm.