Limpiti, Tulaya

Preferred name

Limpiti, Tulaya

Alternative Name

Limpiti, T.

Main Affiliation

School of Engineering

tulaya.li@kmitl.ac.th

Now showing 1 - 10 of 22

Some of the metrics are blocked by your
consent settings
BAMS: Binary Sequence-Augmented Spectrogram with Self-Attention Deep Learning for Human Activity Recognition
(2024-01-01)
Sricom, Natchaya
;
Charakorn, Rujikorn
;
Manoonpong, Poramate
;
Limpiti, Tulaya
Human Activity Recognition (HAR) has rapidly gained interest over the years due to its wide range of applications in AI-based systems, particularly healthcare monitoring. HAR methods typically involve extracting relevant features from data provided by wearable sensors, smartphone sensors, cameras, or their combinations to classify different activities. Nevertheless, a major challenge lies in achieving high classification accuracy with limited data samples, particularly when distinguishing between activities with similar signal attributes. To address this challenge, we propose a novel HAR method called BinAry sequence-augmented spectrograM with Self-attention deep learning (BAMS). Our proposed method leverages only basic wearable sensor data. It utilizes short-time Fourier transform spectrograms to extract spatio-temporal sensor information. The spectrogram is integrated with a binary sequence that captures movement direction. We integrate a scaled dot-product self-attention mechanism into the model to prioritize data from wearable sensors, thereby enhancing the model's performance. The proposed method is evaluated on a public dataset using leave-one-subject-out cross-validation for efficacy and robustness. The method is found to achieve significant improvement over other state-of-the-art methods with the classification accuracy percentage and weighted F-1 scores of 88.06±5.11 and 87.36±5.96, respectively, for a twelve-activity classification.
Some of the metrics are blocked by your
consent settings
A spatiotemporal framework for MEG/EEG evoked response amplitude and latency variability estimation
(2010-03-01)
Limpiti, Tulaya
;
Van Veen, Barry D.
;
Wakai, Ronald T.
This paper presents a spatiotemporal framework for estimating single-trial response latencies and amplitudes from evoked response magnetoencephalographic/ electroencephalographic data. Spatial and temporal bases are employed to capture the aspects of the evoked response that are consistent across trials. Trial amplitudes are assumed independent but have the same underlying normal distribution with unknown mean and variance. The trial latency is assumed to be deterministic but unknown. We assume that the noise is spatially correlated with unknown covariance matrix. We introduce a generalized expectationmaximization algorithm called Trial Variability in Amplitude and Latency ( TriViAL) that computes the maximum likelihood (ML) estimates of the amplitudes, latencies, basis coefficients, and noise covariance matrix. The proposed approach also performs ML source localization by scanning the TriViAL algorithm over spatial bases corresponding to different locations on the cortical surface. Source locations are identified as the locations corresponding to large likelihood values. The effectiveness of the TriViAL algorithm is demonstrated using simulated data and human evoked response experiments. The localization performance is validated using tactile stimulation of the finger. The efficacy of the algorithm in estimating latency variability is shown using the known dependence of the M100 auditory response latency to stimulus tone frequency. We also demonstrate that estimation of response amplitude is improved when latency is included in the signal model. © 2006 IEEE.
Some of the metrics are blocked by your
consent settings
Improved iterative pruning principal component analysis with graph-theoretic hierarchical clustering
(2012-10-02)
Amornbunchornvej, C.
;
Limpiti, T.
;
Assawamakin, A.
;
Intarapanich, A.
;
Tongsima, S.
Various unsupervised clustering algorithms have been used to infer population structure in genetic data. The goals are to separate individuals of similar genetic characteristics into clusters and to estimate the number of clusters within each dataset. Among them, a framework called iterative pruning principal component analysis (ipPCA) have been developed. It performs PCA iteratively on subsets of data samples and clusters them using fuzzy c-mean. We believe that the choice of model-based clustering method affects the individual assignments and cluster quality, as well as the estimated number of clusters. Thus, in this paper we introduce a hierarchical tree clustering concept from graph theory, whose performance is independent of cluster shapes, into the ipPCA framework. We also add a PCA-based feature selection technique as a data pre-processing step to reduce data dimension and increase computational efficiency. The resulting algorithm is called HiClust-ipPCA. We illustrate the improved clustering results of the HiClust-ipPCA algorithm using 47-breed bovine and 28-breed sheep datasets. © 2012 IEEE.
Some of the metrics are blocked by your
consent settings
Wireless intelligent fall detection and movement classification using fuzzy logic
(2012-12-01)
Putchana, Wuttichai
;
Chivapreecha, Sorawat
;
Limpiti, Tulaya
Global population aging leads to increased interests in preventive healthcare technology. As falls are the most common cause of injury or death in old persons, fall detection and movement classification is one of the key topics in this research area. In this paper we propose a simple wireless intelligent system prototype for fall detection and movement classification for real-time monitoring of the elderly. The portable sensor unit acquires data from a triaxial accelerometer and sends the data wirelessly to a computer using Zigbee technology. Alternative to classic methods, the movement data is analyzed using a fuzzy inference system. The system is designed to distinguish between four movement types: standing, sitting, forward fall, and backward fall. Its classification accuracy is investigated using experimental data. It is observed that the system performs well with high sensitivity and excellent specificity. Additionally, the system is applicable for monitoring rehabilitative patients and is extendable to a larger class of movements and postures. ©2012 IEEE.
Some of the metrics are blocked by your
consent settings
Time-frequency analysis for cancer detection using proteomic MS-spectra
(2011-12-01)
Limpiti, T.
;
Assawamakin, A.
;
Intarapanich, A.
;
Tongsima, S.
Mass spectrum data is proven useful in cancer detection and biomarker discovery. Nevertheless, existing methods which analyze peaks of mass spectrum data still have some limitations, including variation in peak locations among individual samples, noisy data, irreproducibility of peak profiles, and computational burden. We introduce a simple algorithm in this paper which alleviate these drawbacks. Our approach is to analyze the mass spectrum data using time-frequency analysis. The data is transformed to features in the time-frequency domain. Informative features are then selected and subsequently used for detection or classification. To assess the efficacy of the proposed algorithm, we apply our algorithm to cancer detection problem. The performance of the algorithm is evaluated on real ovarian and prostate cancer datasets. The promising detection results with high sensitivity and specificity confirm the potential of our method in cancer detection. The algorithm is also applicable to multi-class classification and biomarker identification problems. © 2011 IEEE.
Some of the metrics are blocked by your
consent settings
EEG-BBNet: A Hybrid Framework for Brain Biometric Using Graph Connectivity
(2025-01-01)
Lakhan, Payongkit
;
Banluesombatkul, Nannapas
;
Sricom, Natchaya
;
Sawangjai, Phattarapong
;
Sangnark, Soravitt
Most EEG-based biometrics rely on either convolutional neural networks (CNNs) or graph convolutional neural networks (GCNNs) for personal authentication, potentially overlooking the limitations of each approach. To address this, we propose EEG-BBNet, a hybrid network that combines CNNs and GCNNs. EEG-BBNet leverages CNN’s capability for automatic feature extraction and the GCNN’s ability to learn connectivity patterns between EEG electrodes through graph representation. We evaluate its performance against solely CNN-based and graph-based models across three brain–computer interface tasks, focusing on daily motor and sensory activities. The results show that while EEG-BBNet with Rho index functional connectivity metric outperforms graph-based models, it initially lags behind CNN-based models. However, with additional fine-tuning, EEG-BBNet surpasses CNN-based models, achieving a correct recognition rate of approximately 90%. This improvement enables EEG-BBNet to adapt its learning in new sessions and to acquire different domain knowledge across various BCI tasks (e.g., motor imagery to steady-state visually evoked potentials), demonstrating promise for practical authentication.
Some of the metrics are blocked by your
consent settings
Cardiac Arrhythmia Teletriage using Electrocardiogram
(2021-01-01)
Limpiti, Tulaya
;
Chokchaichumnankit, Thunchanok
;
Sanguanchom, Jirayu
;
Soyphan, Natchanon
;
Puttarak, Nattakan
Telehealth has become a favorable method for receiving medical care during the COVID-19 pandemic. It reduces physical contact and also benefits those who live a distance from hospitals. In this paper we present a cardiac arrhythmia teletriage using electrocardiogram (ECG). The system consists of a diagnostic algorithm for arrhythmias and an Android application. The diagnostic algorithm can detect five types of cardiac problems-arrhythmia, bradycardia, tachycardia, bradyarrhythmia, and tachyarrhythmia. The Android application is the main communication channel between patients and healthcare providers. The user uploads their ECG and receives a preliminary diagnosis of their heart health via the application. The system notifies the user if it detects any abnormalities. The user can then make an appointment online for further examination at the hospital. The capability of the proposed system is evaluated using four databases from PhysioNet - MITBIH Normal Sinus Rhythm Database, MIT-BIH Arrhythmia Database, MIT-BIH Atrial Fibrillation Database, and CU Ventricular Tachyarrhythmia Database. It is found that the algorithm is able to detect abnormal ECG signals with an average accuracy of 82.1%.
Some of the metrics are blocked by your
consent settings
Study of large and highly stratified population datasets by combining iterative pruning principal component analysis and structure
(2011-06-23)
Limpiti, Tulaya
;
Intarapanich, Apichart
;
Assawamakin, Anunchai
;
Shaw, Philip J.
;
Wangkumhang, Pongsakorn
Background: The ever increasing sizes of population genetic datasets pose great challenges for population structure analysis. The Tracy-Widom (TW) statistical test is widely used for detecting structure. However, it has not been adequately investigated whether the TW statistic is susceptible to type I error, especially in large, complex datasets. Non-parametric, Principal Component Analysis (PCA) based methods for resolving structure have been developed which rely on the TW test. Although PCA-based methods can resolve structure, they cannot infer ancestry. Model-based methods are still needed for ancestry analysis, but they are not suitable for large datasets. We propose a new structure analysis framework for large datasets. This includes a new heuristic for detecting structure and incorporation of the structure patterns inferred by a PCA method to complement STRUCTURE analysis.Results: A new heuristic called EigenDev for detecting population structure is presented. When tested on simulated data, this heuristic is robust to sample size. In contrast, the TW statistic was found to be susceptible to type I error, especially for large population samples. EigenDev is thus better-suited for analysis of large datasets containing many individuals, in which spurious patterns are likely to exist and could be incorrectly interpreted as population stratification. EigenDev was applied to the iterative pruning PCA (ipPCA) method, which resolves the underlying subpopulations. This subpopulation information was used to supervise STRUCTURE analysis to infer patterns of ancestry at an unprecedented level of resolution. To validate the new approach, a bovine and a large human genetic dataset (3945 individuals) were analyzed. We found new ancestry patterns consistent with the subpopulations resolved by ipPCA.Conclusions: The EigenDev heuristic is robust to sampling and is thus superior for detecting structure in large datasets. The application of EigenDev to the ipPCA algorithm improves the estimation of the number of subpopulations and the individual assignment accuracy, especially for very large and complex datasets. Furthermore, we have demonstrated that the structure resolved by this approach complements parametric analysis, allowing a much more comprehensive account of population structure. The new version of the ipPCA software with EigenDev incorporated can be downloaded from http://www4a.biotec.or.th/GI/tools/ippca. © 2011 Limpiti et al; licensee BioMed Central Ltd.
Some of the metrics are blocked by your
consent settings
Iterative Neighbor-Joining tree clustering algorithm for genotypic data
(2012-01-01)
Amornbunchornvej, C.
;
Limpiti, T.
;
Assawamakin, A.
;
Intarapanich, A.
;
Tongsima, S.
Issues to explore in genotypic datasets include the number and characteristic patterns of subpopulations and, possibly, relationships among them. Model-based clustering methods have been adopted to find a number of clusters and the individual assignments. However, they cannot infer genetic relationships among subpopulations the way phylogenetic trees, e.g., the widely-used Neighbor-Joining (NJ) tree, can. In this paper we propose an unsupervised, iterative clustering framework called iNJclust. It performs clustering on an NJ tree with a graph-based partitioning technique. The iterative process enhances the zooming ability and corrects the topology of the final NJ trees. Inference on genetic similarities between subpopulations is also possible. As final outputs, the iNJclust algorithm provides an estimate of the number of clusters, individual assignments, a population tree, as well as sub-trees of the terminal nodes. We illustrate the superior clustering performance of the proposed algorithm using Human 27 populations, bovine 47 breeds, and sheep 28 breeds datasets. © 2012 ICPR Org Committee.
Some of the metrics are blocked by your
consent settings
A short-term rain-induced attenuation model for satellite link quality prediction
(2014-01-01)
Poolsawut, Jirutchaya
;
Limpiti, Tulaya
;
Puttarak, Nattakan
This paper proposes a novel but simple satellite link quality prediction based on the relationship between rainfall rate and satellite signal attenuation. After quantifying their relationship statistically, we describe their contemporaneous variations using a linear dynamical system response model. The expectation-maximization (EM) algorithm is used to obtain the maximum likelihood estimates of the model parameters. Subsequently, the communication link quality is predicted by thresholding the estimated short-term signal attenuation level obtained from the Expectation step of the EM algorithm. The prediction performance of the proposed method is compared against the measured beacon signals from Thaicom-4 (IPSTAR) satellite during rainfalls. Using solely the observed rainfall rates from a tipping bucket rain gauge, the algorithm is able to decently predict the satellite link quality. We believe the proposed model can be modified as a predictive tool for real-time link unavailability monitoring of satellite communication system. © 2014 IEEE.

Limpiti, Tulaya

Filters

Settings

Sort By

Results per page