Associate Professor Supavadee Aramvith, Ph.D.
รศ. ดร.สุภาวดี อร่ามวิทย์
Education
- Ph.D. (Electrical Engineering) University of Washington, Seattle, USA, 2001
- M.S. (Electrical Engineering) University of Washington, Seattle, USA, 1996
- B.Sc. First Class Honors (Computer Science) Mahidol Univerity, Thailand, 1993
Email: Supavadee.A@chula.ac.th
Research Interest
- Computer vision and deep learning techniques for surveillance applications.
- Image and Video Super Resolution.
- Video Anomaly Detection.
- Video Coding and Transmissions.
- Implementation of computer vision and deep learning model on SoC and FPGA.
Research Cluster
1.
Navakitkanok, P; Aramvith, S; Chandrachai, A
INNOVATIVE ENTREPRENEURSHIP MODEL FOR AGRICULTURAL PROCESSING SMES IN THAILAND’S DIGITAL AND INDUSTRIES 4.0 ERA Journal Article
In: Academy of Entrepreneurship Journal, vol. 26, no. 4, pp. 1-15, 2020, ISSN: 10879595, (cited By 0).
@article{Navakitkanok2020,
title = {INNOVATIVE ENTREPRENEURSHIP MODEL FOR AGRICULTURAL PROCESSING SMES IN THAILAND’S DIGITAL AND INDUSTRIES 4.0 ERA},
author = {P Navakitkanok and S Aramvith and A Chandrachai},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85103635326&partnerID=40&md5=0176c6efb90827d87cff21a6a57d3444},
issn = {10879595},
year = {2020},
date = {2020-01-01},
journal = {Academy of Entrepreneurship Journal},
volume = {26},
number = {4},
pages = {1-15},
publisher = {Allied Business Academies},
abstract = {Recently, the development of innovation has changed dramatically due to the advancement of digital technology. The evolution of industrial development is inevitably bound to play an important role in the operations of entrepreneurs and businesses. The agro-processing industry is one of the most valuable industries in many countries. Small and medium-sized enterprises (SMEs) are important groups in the development and promotion of economic progress. Entrepreneurs need to direct various orientations and operations to support the occurring changes in order to act auspiciously. Entrepreneurship models in the past have studied Entrepreneurial Orientation (EO), Marketing Orientation (MO), and Learning Orientation (LO), but not the Digital Orientation (DO) and Industry 4.0 Readiness Orientation perspectives. This study explores the development of an entrepreneurship model of SMEs’ which processes agriculture, which affects the firm performances of the digital and industry era by studying important factors explained in literature on priori entrepreneurial model. Two new factors were added, DO and IRO, which affects both financial and non-financial performances of the firm. Qualitative research was conducted through in-depth interviews with 19 people, 5 experts and 14 entrepreneurs, in the agro-processing industry, to obtain a prototype of the entrepreneurial model. A quantitative study of practitioners was considered, and 340 samples were involved. The results show the importance and necessity of entrepreneurship models with 4 orientations, Entrepreneurial Orientation (EO), Market and Learning Orientation (MLO), Digital orientation and Organization Strategy (DOS) and Industries 4.0 Adaptability Orientation (IAO). The implication of the model in this study was to assess entrepreneurship for developing entrepreneurs, who will be ready for digital and industrial 4.0 in the future. © 2020. All Rights Reserved.},
note = {cited By 0},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Recently, the development of innovation has changed dramatically due to the advancement of digital technology. The evolution of industrial development is inevitably bound to play an important role in the operations of entrepreneurs and businesses. The agro-processing industry is one of the most valuable industries in many countries. Small and medium-sized enterprises (SMEs) are important groups in the development and promotion of economic progress. Entrepreneurs need to direct various orientations and operations to support the occurring changes in order to act auspiciously. Entrepreneurship models in the past have studied Entrepreneurial Orientation (EO), Marketing Orientation (MO), and Learning Orientation (LO), but not the Digital Orientation (DO) and Industry 4.0 Readiness Orientation perspectives. This study explores the development of an entrepreneurship model of SMEs’ which processes agriculture, which affects the firm performances of the digital and industry era by studying important factors explained in literature on priori entrepreneurial model. Two new factors were added, DO and IRO, which affects both financial and non-financial performances of the firm. Qualitative research was conducted through in-depth interviews with 19 people, 5 experts and 14 entrepreneurs, in the agro-processing industry, to obtain a prototype of the entrepreneurial model. A quantitative study of practitioners was considered, and 340 samples were involved. The results show the importance and necessity of entrepreneurship models with 4 orientations, Entrepreneurial Orientation (EO), Market and Learning Orientation (MLO), Digital orientation and Organization Strategy (DOS) and Industries 4.0 Adaptability Orientation (IAO). The implication of the model in this study was to assess entrepreneurship for developing entrepreneurs, who will be ready for digital and industrial 4.0 in the future. © 2020. All Rights Reserved.
2.
Ganokratanaa, T; Aramvith, S; Sebe, N
Unsupervised Anomaly Detection and Localization Based on Deep Spatiotemporal Translation Network Journal Article
In: IEEE Access, vol. 8, pp. 50312-50329, 2020, ISSN: 21693536, (cited By 3).
@article{Ganokratanaa2020,
title = {Unsupervised Anomaly Detection and Localization Based on Deep Spatiotemporal Translation Network},
author = {T Ganokratanaa and S Aramvith and N Sebe},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082308390&doi=10.1109%2fACCESS.2020.2979869&partnerID=40&md5=f848e77ee37ca775859c224b69b91084},
doi = {10.1109/ACCESS.2020.2979869},
issn = {21693536},
year = {2020},
date = {2020-01-01},
journal = {IEEE Access},
volume = {8},
pages = {50312-50329},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {Anomaly detection is of great significance for intelligent surveillance videos. Current works typically struggle with object detection and localization problems due to crowded and complex scenes. Hence, we propose a Deep Spatiotemporal Translation Network (DSTN), novel unsupervised anomaly detection and localization method based on Generative Adversarial Network (GAN) and Edge Wrapping ( $EW$ ). In training, we use only the frames of normal events in order to generate their corresponding dense optical flow as temporal features. During testing, since all the video sequences are input into the system, unknown events are considered as anomalous events due to the fact that the model knows only the normal patterns. To benefit from the information provided by both appearance and motion features, we introduce (i) a novel fusion of background removal and real optical flow frames with (ii) a concatenation of the original and background removal frames. We improve the performance of anomaly localization in the pixel-level evaluation by proposing (iii) the Edge Wrapping to reduce the noise and suppress non-related edges of abnormal objects. Our DSTN has been tested on publicly available anomaly datasets, including UCSD pedestrian, UMN, and CUHK Avenue. The results show that it outperforms other state-of-the-art algorithms with respect to the frame-level evaluation, the pixel-level evaluation, and the time complexity for abnormal object detection and localization tasks. © 2013 IEEE.},
note = {cited By 3},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Anomaly detection is of great significance for intelligent surveillance videos. Current works typically struggle with object detection and localization problems due to crowded and complex scenes. Hence, we propose a Deep Spatiotemporal Translation Network (DSTN), novel unsupervised anomaly detection and localization method based on Generative Adversarial Network (GAN) and Edge Wrapping ( $EW$ ). In training, we use only the frames of normal events in order to generate their corresponding dense optical flow as temporal features. During testing, since all the video sequences are input into the system, unknown events are considered as anomalous events due to the fact that the model knows only the normal patterns. To benefit from the information provided by both appearance and motion features, we introduce (i) a novel fusion of background removal and real optical flow frames with (ii) a concatenation of the original and background removal frames. We improve the performance of anomaly localization in the pixel-level evaluation by proposing (iii) the Edge Wrapping to reduce the noise and suppress non-related edges of abnormal objects. Our DSTN has been tested on publicly available anomaly datasets, including UCSD pedestrian, UMN, and CUHK Avenue. The results show that it outperforms other state-of-the-art algorithms with respect to the frame-level evaluation, the pixel-level evaluation, and the time complexity for abnormal object detection and localization tasks. © 2013 IEEE.
3.
Muhammad, W; Aramvith, S
Multi-scale inception based super-resolution using deep learning approach Journal Article
In: Electronics (Switzerland), vol. 8, no. 8, 2019, ISSN: 20799292, (cited By 2).
@article{Muhammad2019,
title = {Multi-scale inception based super-resolution using deep learning approach},
author = {W Muhammad and S Aramvith},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85071883406&doi=10.3390%2felectronics8080892&partnerID=40&md5=e2a8faf5f84152a7944429d55829bd14},
doi = {10.3390/electronics8080892},
issn = {20799292},
year = {2019},
date = {2019-01-01},
journal = {Electronics (Switzerland)},
volume = {8},
number = {8},
publisher = {MDPI AG},
abstract = {Single image super-resolution (SISR) aims to reconstruct a high-resolution (HR) image from a low-resolution (LR) image. In order to address the SISR problem, recently, deep convolutional neural networks (CNNs) have achieved remarkable progress in terms of accuracy and efficiency. In this paper, an innovative technique, namely a multi-scale inception-based super-resolution (SR) using deep learning approach, or MSISRD, was proposed for fast and accurate reconstruction of SISR. The proposed network employs the deconvolution layer to upsample the LR image to the desired HR image. The proposed method is in contrast to existing approaches that use the interpolation techniques to upscale the LR image. Primarily, interpolation techniques are not designed for this purpose, which results in the creation of undesired noise in the model. Moreover, the existing methods mainly focus on the shallow network or stacking multiple layers in the model with the aim of creating a deeper network architecture. The technique based on the aforementioned design creates the vanishing gradients problem during the training and increases the computational cost of the model. Our proposed method does not use any hand-designed pre-processing steps, such as the bicubic interpolation technique. Furthermore, an asymmetric convolution block is employed to reduce the number of parameters, in addition to the inception block adopted from GoogLeNet, to reconstruct the multiscale information. Experimental results demonstrate that the proposed model exhibits an enhanced performance compared to twelve state-of-the-art methods in terms of the average peak signal-to-noise ratio (PSNR), structural similarity index (SSIM) with a reduced number of parameters for the scale factor of 2×, 4×, and 8×. © 2019 by the authors. Licensee MDPI, Basel, Switzerland.},
note = {cited By 2},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Single image super-resolution (SISR) aims to reconstruct a high-resolution (HR) image from a low-resolution (LR) image. In order to address the SISR problem, recently, deep convolutional neural networks (CNNs) have achieved remarkable progress in terms of accuracy and efficiency. In this paper, an innovative technique, namely a multi-scale inception-based super-resolution (SR) using deep learning approach, or MSISRD, was proposed for fast and accurate reconstruction of SISR. The proposed network employs the deconvolution layer to upsample the LR image to the desired HR image. The proposed method is in contrast to existing approaches that use the interpolation techniques to upscale the LR image. Primarily, interpolation techniques are not designed for this purpose, which results in the creation of undesired noise in the model. Moreover, the existing methods mainly focus on the shallow network or stacking multiple layers in the model with the aim of creating a deeper network architecture. The technique based on the aforementioned design creates the vanishing gradients problem during the training and increases the computational cost of the model. Our proposed method does not use any hand-designed pre-processing steps, such as the bicubic interpolation technique. Furthermore, an asymmetric convolution block is employed to reduce the number of parameters, in addition to the inception block adopted from GoogLeNet, to reconstruct the multiscale information. Experimental results demonstrate that the proposed model exhibits an enhanced performance compared to twelve state-of-the-art methods in terms of the average peak signal-to-noise ratio (PSNR), structural similarity index (SSIM) with a reduced number of parameters for the scale factor of 2×, 4×, and 8×. © 2019 by the authors. Licensee MDPI, Basel, Switzerland.
4.
Maung, H M; Aramvith, S; Miyanaga, Y
In: Electronics (Switzerland), vol. 8, no. 3, 2019, ISSN: 20799292, (cited By 0).
@article{Maung2019,
title = {Hierarchical-p reference picture selection based error resilient video coding framework for high efficiency video coding transmission applications},
author = {H M Maung and S Aramvith and Y Miyanaga},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064047467&doi=10.3390%2felectronics8030310&partnerID=40&md5=4e4231746014c34f409008ebc6e65c70},
doi = {10.3390/electronics8030310},
issn = {20799292},
year = {2019},
date = {2019-01-01},
journal = {Electronics (Switzerland)},
volume = {8},
number = {3},
publisher = {MDPI AG},
abstract = {In this paper, a new reference picture selection (RPS) is proposed for a high efficiency video coding (HEVC) framework. In recent studies, HEVC has been shown to be sensitive to packet error which is unavoidable in transmission applications especially for wireless networks. RPS is an effective error resilient technique for video transmission systems where a feedback channel with short round trip delay time is available. However, its procedure cannot directly apply to the HEVC framework and thus this paper expands it. In RPS, error propagation can still happen during round trip delay time. To alleviate the effect of error propagation for better quality, the proposed algorithm considers both the RPS technique and the region-based intra mode selection method by using some novel features of HEVC. Experimental results demonstrate that the proposed method outperforms the hierarchical-P RPS algorithm in terms of PSNR and other metrics. The average PSNR improvement of the proposed algorithm over the reference algorithm under 10% packet error rate is 1.56 dB for 1080p sequences, 2.32 dB for 720p sequences and 1.01 dB for wide video graphics array (WVGA) sequences, respectively. The performance of proposed method is also tested for applications where feedback information is not available. The proposed method shows noticeable improvement for video sequences that contain low or moderate level of motions. © 2019 by the authors. Licensee MDPI, Basel, Switzerland.},
note = {cited By 0},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, a new reference picture selection (RPS) is proposed for a high efficiency video coding (HEVC) framework. In recent studies, HEVC has been shown to be sensitive to packet error which is unavoidable in transmission applications especially for wireless networks. RPS is an effective error resilient technique for video transmission systems where a feedback channel with short round trip delay time is available. However, its procedure cannot directly apply to the HEVC framework and thus this paper expands it. In RPS, error propagation can still happen during round trip delay time. To alleviate the effect of error propagation for better quality, the proposed algorithm considers both the RPS technique and the region-based intra mode selection method by using some novel features of HEVC. Experimental results demonstrate that the proposed method outperforms the hierarchical-P RPS algorithm in terms of PSNR and other metrics. The average PSNR improvement of the proposed algorithm over the reference algorithm under 10% packet error rate is 1.56 dB for 1080p sequences, 2.32 dB for 720p sequences and 1.01 dB for wide video graphics array (WVGA) sequences, respectively. The performance of proposed method is also tested for applications where feedback information is not available. The proposed method shows noticeable improvement for video sequences that contain low or moderate level of motions. © 2019 by the authors. Licensee MDPI, Basel, Switzerland.
5.
Tun, E E; Aramvith, S; Miyanaga, Y
Fast Coding Unit Encoding Scheme for HEVC Using Genetic Algorithm Journal Article
In: IEEE Access, vol. 7, pp. 68010-68021, 2019, ISSN: 21693536, (cited By 0).
@article{Tun2019a,
title = {Fast Coding Unit Encoding Scheme for HEVC Using Genetic Algorithm},
author = {E E Tun and S Aramvith and Y Miyanaga},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85067195685&doi=10.1109%2fACCESS.2019.2918508&partnerID=40&md5=1a82f25491373b1366452ff0660f67bd},
doi = {10.1109/ACCESS.2019.2918508},
issn = {21693536},
year = {2019},
date = {2019-01-01},
journal = {IEEE Access},
volume = {7},
pages = {68010-68021},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {High efficiency video coding (HEVC) is the newest video codec to increase significantly the coding efficiency of its ancestor H.264/Advance Video Coding with the aids of its new features, such as the quadtree-based coding unit partitioning, a simple deblocking filter, and other advanced coding techniques. However, the HEVC delivers a highly increased computation complexity, which is mainly due to the exhaustive rate distortion optimization search of quadtree-based coding unit partitioning. In this paper, a coding unit partitioning pattern optimization method based on a genetic algorithm is proposed to save the computational complexity of hierarchical quadtree-based coding unit partitioning. The required coding unit partitioning pattern for exhaustive partitioning and the rate distortion cost are efficiently considered as the chromosome and the fitness function of the genetic algorithm, respectively. To reduce the computational time, coding unit partitioning patterns of the key frame are searched and shared to other consecutive frames by taking into account the highly temporal correlation. Our evaluation results show that the proposed method can achieve 62.5% and 16.7% computational complexity reduction on average with a negligible average quality degradation compared with HM16.5 and state-of-the-art support vector machine-based fast algorithm, respectively, under low-delay P configuration with rate control while 64.1% and 15.1% under low-delay configuration with rate control. © 2013 IEEE.},
note = {cited By 0},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
High efficiency video coding (HEVC) is the newest video codec to increase significantly the coding efficiency of its ancestor H.264/Advance Video Coding with the aids of its new features, such as the quadtree-based coding unit partitioning, a simple deblocking filter, and other advanced coding techniques. However, the HEVC delivers a highly increased computation complexity, which is mainly due to the exhaustive rate distortion optimization search of quadtree-based coding unit partitioning. In this paper, a coding unit partitioning pattern optimization method based on a genetic algorithm is proposed to save the computational complexity of hierarchical quadtree-based coding unit partitioning. The required coding unit partitioning pattern for exhaustive partitioning and the rate distortion cost are efficiently considered as the chromosome and the fitness function of the genetic algorithm, respectively. To reduce the computational time, coding unit partitioning patterns of the key frame are searched and shared to other consecutive frames by taking into account the highly temporal correlation. Our evaluation results show that the proposed method can achieve 62.5% and 16.7% computational complexity reduction on average with a negligible average quality degradation compared with HM16.5 and state-of-the-art support vector machine-based fast algorithm, respectively, under low-delay P configuration with rate control while 64.1% and 15.1% under low-delay configuration with rate control. © 2013 IEEE.
6.
Watcharapinchai, N; Aramvith, S; Siddhichai, S
Automatic vehicle classification using linked visual words Journal Article
In: Journal of Electronic Imaging, vol. 26, no. 4, 2017, ISSN: 10179909, (cited By 2).
@article{Watcharapinchai2017,
title = {Automatic vehicle classification using linked visual words},
author = {N Watcharapinchai and S Aramvith and S Siddhichai},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026540368&doi=10.1117%2f1.JEI.26.4.043009&partnerID=40&md5=0801defa298583a6bfbf59821f1b2f19},
doi = {10.1117/1.JEI.26.4.043009},
issn = {10179909},
year = {2017},
date = {2017-01-01},
journal = {Journal of Electronic Imaging},
volume = {26},
number = {4},
publisher = {SPIE},
abstract = {An improvement in the method of automatic vehicle classification is investigated. The challenges are to correctly classify vehicles regardless of changes in illumination, differences in points of view of the camera, and variations in the types of vehicles. Our proposed appearance-based feature extraction algorithm is called linked visual words (LVWs) and is based on the existing technique bag-of-visual word (BoVW) with the addition of spatial information to improve accuracy of classification. In addition, to prevent over-fitting due to a large number of LVWs, four common sampling techniques with LVWs are investigated. Our results suggest that the sampling of LVWs using TF-IDF with grouping improved the accuracy of classification for the test dataset. In summary, the proposed system is able to classify nine types of vehicles and work with surveillance cameras in real-world scenarios. The classification accuracy of the proposed system is 5.58% and 4.27% higher on average for three datasets when compared with BoVW + SVM and Lenet-5, respectively. © 2017 SPIE and IS&T.},
note = {cited By 2},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
An improvement in the method of automatic vehicle classification is investigated. The challenges are to correctly classify vehicles regardless of changes in illumination, differences in points of view of the camera, and variations in the types of vehicles. Our proposed appearance-based feature extraction algorithm is called linked visual words (LVWs) and is based on the existing technique bag-of-visual word (BoVW) with the addition of spatial information to improve accuracy of classification. In addition, to prevent over-fitting due to a large number of LVWs, four common sampling techniques with LVWs are investigated. Our results suggest that the sampling of LVWs using TF-IDF with grouping improved the accuracy of classification for the test dataset. In summary, the proposed system is able to classify nine types of vehicles and work with surveillance cameras in real-world scenarios. The classification accuracy of the proposed system is 5.58% and 4.27% higher on average for three datasets when compared with BoVW + SVM and Lenet-5, respectively. © 2017 SPIE and IS&T.
7.
Lertniphonphan, K; Aramvith, S; Chalidabhongse, T H
Human action classification using adaptive key frame interval for feature extraction Journal Article
In: Journal of Electronic Imaging, vol. 25, no. 1, 2016, ISSN: 10179909, (cited By 3).
@article{Lertniphonphan2016,
title = {Human action classification using adaptive key frame interval for feature extraction},
author = {K Lertniphonphan and S Aramvith and T H Chalidabhongse},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84957837511&doi=10.1117%2f1.JEI.25.1.013017&partnerID=40&md5=86be26a75dabaf2c9f10b5e40d993fac},
doi = {10.1117/1.JEI.25.1.013017},
issn = {10179909},
year = {2016},
date = {2016-01-01},
journal = {Journal of Electronic Imaging},
volume = {25},
number = {1},
publisher = {SPIE},
abstract = {Human action classification based on the adaptive key frame interval (AKFI) feature extraction is presented. Since human movement periods are different, the action intervals that contain the intensive and compact motion information are considered in this work. We specify AKFI by analyzing an amount of motion through time. The key frame is defined to be the local minimum interframe motion, which is computed by using frame differencing between consecutive frames. Once key frames are detected, the features within a segmented period are encoded by adaptive motion history image and key pose history image. The action representation consists of the local orientation histogram of the features during AKFI. The experimental results on Weizmann dataset, KTH dataset, and UT Interaction dataset demonstrate that the features can effectively classify action and can classify irregular cases of walking compared to other well-known algorithms. © 2016 SPIE and IS&T.},
note = {cited By 3},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Human action classification based on the adaptive key frame interval (AKFI) feature extraction is presented. Since human movement periods are different, the action intervals that contain the intensive and compact motion information are considered in this work. We specify AKFI by analyzing an amount of motion through time. The key frame is defined to be the local minimum interframe motion, which is computed by using frame differencing between consecutive frames. Once key frames are detected, the features within a segmented period are encoded by adaptive motion history image and key pose history image. The action representation consists of the local orientation histogram of the features during AKFI. The experimental results on Weizmann dataset, KTH dataset, and UT Interaction dataset demonstrate that the features can effectively classify action and can classify irregular cases of walking compared to other well-known algorithms. © 2016 SPIE and IS&T.
8.
Hashimoto, T; Chauksuvanit, T; Aramvith, S; Shirota, Y
Human reaction in thailand based on social media analysis after the East Japan great earthquake Journal Article
In: Frontiers in Artificial Intelligence and Applications, vol. 272, pp. 108-119, 2014, ISSN: 09226389, (cited By 0; Conference of 24th International Conference on Information Modelling and Knowledge Bases, EJC 2014 ; Conference Date: 3 June 2014 Through 6 June 2014; Conference Code:109482).
@article{Hashimoto2014a,
title = {Human reaction in thailand based on social media analysis after the East Japan great earthquake},
author = {T Hashimoto and T Chauksuvanit and S Aramvith and Y Shirota},
editor = {Yoshida Kiyoki N Y Thalheim B. Jaakkola H.},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84922574606&doi=10.3233%2f978-1-61499-472-5-108&partnerID=40&md5=07741a1b1d3b8712a7ab121c81074a6a},
doi = {10.3233/978-1-61499-472-5-108},
issn = {09226389},
year = {2014},
date = {2014-01-01},
journal = {Frontiers in Artificial Intelligence and Applications},
volume = {272},
pages = {108-119},
publisher = {IOS Press},
abstract = {After the East Japan Great Earthquake occurred in Japan on 11th March 2011, a large number of messages related to the earthquake were posted to social media web sites not only in Japan but also all over the world. Particularly, in Asian countries, a lot of topics concerned about the earthquake were observed. Exploring topics related to the earthquake on social media gains rich insights into the social contexts. The goal of this research is to analyze Asian people reactions to the East Japan Great Earthquake on social media. As the first target, this paper selected Thai language and analyzed how people reacted to the earthquake by comparing with reactions in Japan. This analysis also presented some characteristics of Thai society and culture. © 2014 The authors and IOS Press. All rights reserved.},
note = {cited By 0; Conference of 24th International Conference on Information Modelling and Knowledge Bases, EJC 2014 ; Conference Date: 3 June 2014 Through 6 June 2014; Conference Code:109482},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
After the East Japan Great Earthquake occurred in Japan on 11th March 2011, a large number of messages related to the earthquake were posted to social media web sites not only in Japan but also all over the world. Particularly, in Asian countries, a lot of topics concerned about the earthquake were observed. Exploring topics related to the earthquake on social media gains rich insights into the social contexts. The goal of this research is to analyze Asian people reactions to the East Japan Great Earthquake on social media. As the first target, this paper selected Thai language and analyzed how people reacted to the earthquake by comparing with reactions in Japan. This analysis also presented some characteristics of Thai society and culture. © 2014 The authors and IOS Press. All rights reserved.
9.
Aramvith, S; Aswakul, C; Saivichit, C; Prapinmongkolkarn, P; Aimdilokwong, A
NGN trial use and test site in Phuket, Thailand by national telecommunications commission (NTC) and Chula UniSearch Journal Article
In: Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, vol. 46, pp. 622-625, 2011, ISSN: 18678211, (cited By 0; Conference of 6th International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TRIDENTCOM 2010 ; Conference Date: 18 May 2010 Through 20 May 2010; Conference Code:98879).
@article{Aramvith2011,
title = {NGN trial use and test site in Phuket, Thailand by national telecommunications commission (NTC) and Chula UniSearch},
author = {S Aramvith and C Aswakul and C Saivichit and P Prapinmongkolkarn and A Aimdilokwong},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84885886930&doi=10.1007%2f978-3-642-17851-1_60&partnerID=40&md5=9e13655b2bfccec818a42bc7861de6af},
doi = {10.1007/978-3-642-17851-1_60},
issn = {18678211},
year = {2011},
date = {2011-01-01},
journal = {Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST},
volume = {46},
pages = {622-625},
address = {Berlin},
abstract = {National Telecommunication Commission of Thailand has initiated the pilot project which involved the trial and testbed of Next Generation Networks (NGNs) technology in Phuket, Thailand. This project consists of many new technologies implementation in the real environment. In order to implement the NGN technology successfully, we need to be able to summarize the outcomes of these deployment and prepare for improvement in the future. This project also extends the test to the communities in Phuket such as E- Learning applications. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2011.},
note = {cited By 0; Conference of 6th International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, TRIDENTCOM 2010 ; Conference Date: 18 May 2010 Through 20 May 2010; Conference Code:98879},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
National Telecommunication Commission of Thailand has initiated the pilot project which involved the trial and testbed of Next Generation Networks (NGNs) technology in Phuket, Thailand. This project consists of many new technologies implementation in the real environment. In order to implement the NGN technology successfully, we need to be able to summarize the outcomes of these deployment and prepare for improvement in the future. This project also extends the test to the communities in Phuket such as E- Learning applications. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2011.
10.
Watcharapinchai, N; Aramvith, S; Siddhichai, S
Two-probabilistic latent semantic model for image annotation and retrieval Journal Article
In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6468 LNCS, no. PART1, pp. 359-369, 2011, ISSN: 03029743, (cited By 6; Conference of International Workshops on Computer Vision, ACCV 2010 ; Conference Date: 8 November 2010 Through 9 November 2010; Conference Code:86650).
@article{Watcharapinchai2011,
title = {Two-probabilistic latent semantic model for image annotation and retrieval},
author = {N Watcharapinchai and S Aramvith and S Siddhichai},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80053109084&doi=10.1007%2f978-3-642-22822-3_36&partnerID=40&md5=843c4da73c9dcc84f0f7e7eebdf98935},
doi = {10.1007/978-3-642-22822-3_36},
issn = {03029743},
year = {2011},
date = {2011-01-01},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
volume = {6468 LNCS},
number = {PART1},
pages = {359-369},
address = {Queenstown},
abstract = {A novel latent variable modeling technique for image annotation and retrieval is proposed. This model is useful for annotating the images with relevant semantic meanings as well as for retrieving images which satisfy the users query with specific text or image. The framework of two-step latent variable is proposed to support multi-functionality of the retrieval and annotation system. Furthermore, the existing and the proposed image annotation models are compared in terms of their annotating performance. Images from standard databases are used in the comparison in order to identify the best model for automatic image annotation, using precision-recall measurement. Local features, or visual words, of each image in the database are extracted using Scale-Invariant Feature Transform (SIFT) and clustering techniques. Each image is then represented by Bag-of-Features (BoF) which is a histogram of visual words. Semantic meanings can then be related to each BoF using latent variable for annotation purposes. Subsequently, for image retrieval, each image query is also related to semantic meanings. Finally, image retrieval results are obtained by matching semantic meanings of the query with those of the images in the database using a second latent variable. © 2011 Springer-Verlag Berlin Heidelberg.},
note = {cited By 6; Conference of International Workshops on Computer Vision, ACCV 2010 ; Conference Date: 8 November 2010 Through 9 November 2010; Conference Code:86650},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
A novel latent variable modeling technique for image annotation and retrieval is proposed. This model is useful for annotating the images with relevant semantic meanings as well as for retrieving images which satisfy the users query with specific text or image. The framework of two-step latent variable is proposed to support multi-functionality of the retrieval and annotation system. Furthermore, the existing and the proposed image annotation models are compared in terms of their annotating performance. Images from standard databases are used in the comparison in order to identify the best model for automatic image annotation, using precision-recall measurement. Local features, or visual words, of each image in the database are extracted using Scale-Invariant Feature Transform (SIFT) and clustering techniques. Each image is then represented by Bag-of-Features (BoF) which is a histogram of visual words. Semantic meanings can then be related to each BoF using latent variable for annotation purposes. Subsequently, for image retrieval, each image query is also related to semantic meanings. Finally, image retrieval results are obtained by matching semantic meanings of the query with those of the images in the database using a second latent variable. © 2011 Springer-Verlag Berlin Heidelberg.
11.
Panyavaraporn, J; Aramvith, S
In: Journal of Electronic Imaging, vol. 20, no. 2, 2011, ISSN: 10179909, (cited By 3).
@article{Panyavaraporn2011,
title = {Error resilient framework using one-pass explicit flexible macroblock ordering map generation and error concealment for H.264/AVC wireless video communication},
author = {J Panyavaraporn and S Aramvith},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80055122203&doi=10.1117%2f1.3589307&partnerID=40&md5=38ae1245bc235fc6f61b0ae05b233a96},
doi = {10.1117/1.3589307},
issn = {10179909},
year = {2011},
date = {2011-01-01},
journal = {Journal of Electronic Imaging},
volume = {20},
number = {2},
abstract = {H.264/AVC is the newest standard for digital video compression developed jointly by ITU-T's Video Coding Experts Group and ISO/IEC's Moving Picture Experts Group. One feature of the new standard is the adoption of a robust error resilience tool at the encoder known as flexible macroblock ordering (FMO). In this paper, we present an algorithm to generate a one-pass FMO map based on spatial and temporal information at the encoder, and an error concealment method at the decoder for wireless video transmission. The error concealment method at the decoder is applied according to the residual information derived from the distortion information obtained at the encoder while the one-pass FMO map is being generated. Our simulation results performed under slow and fast fading channels confirm that the proposed technique can reduce the number of undecodable macroblocks up to 66.79% and 80.54%, respectively, when compared with no FMO. The peak signal-to-noise ratio improvements are up to 2.67 and 1.05 dB, respectively when compared to predefined FMO (Type 1). © 2011 SPIE and IS&T.},
note = {cited By 3},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
H.264/AVC is the newest standard for digital video compression developed jointly by ITU-T's Video Coding Experts Group and ISO/IEC's Moving Picture Experts Group. One feature of the new standard is the adoption of a robust error resilience tool at the encoder known as flexible macroblock ordering (FMO). In this paper, we present an algorithm to generate a one-pass FMO map based on spatial and temporal information at the encoder, and an error concealment method at the decoder for wireless video transmission. The error concealment method at the decoder is applied according to the residual information derived from the distortion information obtained at the encoder while the one-pass FMO map is being generated. Our simulation results performed under slow and fast fading channels confirm that the proposed technique can reduce the number of undecodable macroblocks up to 66.79% and 80.54%, respectively, when compared with no FMO. The peak signal-to-noise ratio improvements are up to 2.67 and 1.05 dB, respectively when compared to predefined FMO (Type 1). © 2011 SPIE and IS&T.
12.
Vu, T H; Aramvith, S; Miyanaga, Y
New error resilience technique using adaptive FMO and intra refresh for H.264 video transmission Journal Article
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol. E94-A, no. 8, pp. 1647-1655, 2011, ISSN: 09168508, (cited By 3).
@article{Vu2011a,
title = {New error resilience technique using adaptive FMO and intra refresh for H.264 video transmission},
author = {T H Vu and S Aramvith and Y Miyanaga},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79961058865&doi=10.1587%2ftransfun.E94.A.1647&partnerID=40&md5=99ac9a918c0ec4ff0700feea5dce4086},
doi = {10.1587/transfun.E94.A.1647},
issn = {09168508},
year = {2011},
date = {2011-01-01},
journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
volume = {E94-A},
number = {8},
pages = {1647-1655},
publisher = {Institute of Electronics, Information and Communication, Engineers, IEICE},
abstract = {In this paper, we propose an error resilience scheme for wireless video coding based on adaptive flexible macroblock ordering (FMO) and intra refresh. An FMO explicit map is generated frame-byframe by using prior information. This information involves estimated locations of guard and burst sections in the channel and estimated effect of error propagation (EEP) from the previous frame to the current frame. In addition, the role of the current frame in propagating an error to the next frame is also considered. A suitable intra refresh rate which is adaptive to the channel state is used to reduce the dependence between frames and thus can stop the EEP. The results in experiments show that the proposed method gains some improvements in terms of peak signal-to-noise rate (PSNR) as compared with some other methods that have not considered the channel condition and the error propagation in generating an FMO map. © 2011 The Institute of Electronics, Information and Communication Engineers.},
note = {cited By 3},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
In this paper, we propose an error resilience scheme for wireless video coding based on adaptive flexible macroblock ordering (FMO) and intra refresh. An FMO explicit map is generated frame-byframe by using prior information. This information involves estimated locations of guard and burst sections in the channel and estimated effect of error propagation (EEP) from the previous frame to the current frame. In addition, the role of the current frame in propagating an error to the next frame is also considered. A suitable intra refresh rate which is adaptive to the channel state is used to reduce the dependence between frames and thus can stop the EEP. The results in experiments show that the proposed method gains some improvements in terms of peak signal-to-noise rate (PSNR) as compared with some other methods that have not considered the channel condition and the error propagation in generating an FMO map. © 2011 The Institute of Electronics, Information and Communication Engineers.
13.
Nashat, S; Abdullah, A; Aramvith, S; Abdullah, M Z
Support vector machine approach to real-time inspection of biscuits on moving conveyor belt Journal Article
In: Computers and Electronics in Agriculture, vol. 75, no. 1, pp. 147-158, 2011, ISSN: 01681699, (cited By 43).
@article{Nashat2011,
title = {Support vector machine approach to real-time inspection of biscuits on moving conveyor belt},
author = {S Nashat and A Abdullah and S Aramvith and M Z Abdullah},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78650519991&doi=10.1016%2fj.compag.2010.10.010&partnerID=40&md5=67753c14c3db8ca43d263e165f68250e},
doi = {10.1016/j.compag.2010.10.010},
issn = {01681699},
year = {2011},
date = {2011-01-01},
journal = {Computers and Electronics in Agriculture},
volume = {75},
number = {1},
pages = {147-158},
abstract = {An intelligent system for colour inspection of biscuit products is proposed. In this system, the state-of-the-art classification techniques based on Support Vector Machines (SVM) and Wilk's λ analysis were used to classify biscuits into one of four distinct groups: under-baked, moderately baked, over-baked, and substantially over-baked. The accuracy of the system was compared with standard discriminant analysis using both direct and multi-step classifications. It was discovered that the radial basis SVM after Wilk's λ was more precise in classification compared to other classifiers. Real-time implementation was achieved by means of multi-core processor with advanced multiple-buffering and multithreading algorithms. The system resulted in correct classification rate of more than 96% for stationary and moving biscuits at 9. m/min. It was discovered that touching and non-touching biscuits did not significantly interfere with accurate assessment of baking. However, image processing of touching biscuits was considerably slower compared to non-touching biscuits, averaging at 36.3. ms and 9.0. ms, respectively. The decrease in speed was due to the complexity of the watershed-based algorithm used to segment touching biscuits. This image computing platform can potentially support the requirements of the high-volume biscuit production. © 2010 Elsevier B.V.},
note = {cited By 43},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
An intelligent system for colour inspection of biscuit products is proposed. In this system, the state-of-the-art classification techniques based on Support Vector Machines (SVM) and Wilk's λ analysis were used to classify biscuits into one of four distinct groups: under-baked, moderately baked, over-baked, and substantially over-baked. The accuracy of the system was compared with standard discriminant analysis using both direct and multi-step classifications. It was discovered that the radial basis SVM after Wilk's λ was more precise in classification compared to other classifiers. Real-time implementation was achieved by means of multi-core processor with advanced multiple-buffering and multithreading algorithms. The system resulted in correct classification rate of more than 96% for stationary and moving biscuits at 9. m/min. It was discovered that touching and non-touching biscuits did not significantly interfere with accurate assessment of baking. However, image processing of touching biscuits was considerably slower compared to non-touching biscuits, averaging at 36.3. ms and 9.0. ms, respectively. The decrease in speed was due to the complexity of the watershed-based algorithm used to segment touching biscuits. This image computing platform can potentially support the requirements of the high-volume biscuit production. © 2010 Elsevier B.V.
14.
Eiamjumrus, N; Aramvith, S
Rate control scheme based on cauchy R-D optimization model for H.264/AVC under low delay constraint Journal Article
In: Journal of Digital Information Management, vol. 6, no. 2, pp. 180-188, 2008, ISSN: 09727272, (cited By 1).
@article{Eiamjumrus2008,
title = {Rate control scheme based on cauchy R-D optimization model for H.264/AVC under low delay constraint},
author = {N Eiamjumrus and S Aramvith},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-72449205119&partnerID=40&md5=60340eb5bbe6774b89e2d6c72f1c7181},
issn = {09727272},
year = {2008},
date = {2008-01-01},
journal = {Journal of Digital Information Management},
volume = {6},
number = {2},
pages = {180-188},
abstract = {The motivation of this work is based on the observation that Cauchy distribution provides more accurate estimates of rate and distortion characteristics of video sequences than the previously used distribution such as Laplacian distribution. In this paper, we propose a new rate control scheme for H.264 low-delay video transmission using Cauchy rate-distortion optimization model. Our proposed method uses the Lagrange Multiplier technique to optimize the cost function, and be able to find the rate and distortion model subject to the target bit rate constraint resulting in the optimum choice of quantization step sizes. Model parameters are estimated using statistical linear regression analysis. The target number of bits for each frame is determined according to their buffer status, the number of bits use in the previous frame, and basic unit complexity. The proposed scheme has been implemented on H.264 video coder. Simulation results show that the proposed rate control algorithm achieves, on the average, an improvement in PSNR for up to 1.68dB with lesser number of frames skipped as compared with the default H.264 JM8.6 rate control scheme.},
note = {cited By 1},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
The motivation of this work is based on the observation that Cauchy distribution provides more accurate estimates of rate and distortion characteristics of video sequences than the previously used distribution such as Laplacian distribution. In this paper, we propose a new rate control scheme for H.264 low-delay video transmission using Cauchy rate-distortion optimization model. Our proposed method uses the Lagrange Multiplier technique to optimize the cost function, and be able to find the rate and distortion model subject to the target bit rate constraint resulting in the optimum choice of quantization step sizes. Model parameters are estimated using statistical linear regression analysis. The target number of bits for each frame is determined according to their buffer status, the number of bits use in the previous frame, and basic unit complexity. The proposed scheme has been implemented on H.264 video coder. Simulation results show that the proposed rate control algorithm achieves, on the average, an improvement in PSNR for up to 1.68dB with lesser number of frames skipped as compared with the default H.264 JM8.6 rate control scheme.
15.
Thanasorravit, A; Charoenpanichkit, A; Suriya, A; Wuttisittikulkij, L; Aramvith, S
Delay performance analysis of uniform (UNI) and uniform with limited access techniques (UNI+LA) in wireless communication systems Journal Article
In: IEEE Vehicular Technology Conference, vol. 2, pp. 962-966, 2002, ISSN: 07400551, (cited By 0).
@article{Thanasorravit2002,
title = {Delay performance analysis of uniform (UNI) and uniform with limited access techniques (UNI+LA) in wireless communication systems},
author = {A Thanasorravit and A Charoenpanichkit and A Suriya and L Wuttisittikulkij and S Aramvith},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-0036346082&doi=10.1109%2fVTC.2002.1002631&partnerID=40&md5=5ca1fe594ed038e9322fb0cdbd891f94},
doi = {10.1109/VTC.2002.1002631},
issn = {07400551},
year = {2002},
date = {2002-01-01},
journal = {IEEE Vehicular Technology Conference},
volume = {2},
pages = {962-966},
abstract = {This paper presents the delay analysis of two new channel reservation schemes namely UNI and UNI+LA for the relatively long delay systems. Mathematical models have been formulated for the performance evaluation. We found that the numerical results from the formation derived yield the same output as the simulation results. In addition, the numerical results show that the delay performance of the system depends on the traffic load and the ratio of the number of request slots per frame.},
note = {cited By 0},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
This paper presents the delay analysis of two new channel reservation schemes namely UNI and UNI+LA for the relatively long delay systems. Mathematical models have been formulated for the performance evaluation. We found that the numerical results from the formation derived yield the same output as the simulation results. In addition, the numerical results show that the delay performance of the system depends on the traffic load and the ratio of the number of request slots per frame.
16.
Suriya, A; Charoenpanichkit, A; Thanasorravit, A; Aramvith, S; Wuttisittikulkij, L
New single-access channel reservation schemes for QoS constrained multimedia traffic Journal Article
In: IEEE Vehicular Technology Conference, vol. 1, pp. 209-213, 2002, ISSN: 07400551, (cited By 2).
@article{Suriya2002,
title = {New single-access channel reservation schemes for QoS constrained multimedia traffic},
author = {A Suriya and A Charoenpanichkit and A Thanasorravit and S Aramvith and L Wuttisittikulkij},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-0036061046&doi=10.1109%2fVTC.2002.1002694&partnerID=40&md5=432074bdb1db91869642af88072745c5},
doi = {10.1109/VTC.2002.1002694},
issn = {07400551},
year = {2002},
date = {2002-01-01},
journal = {IEEE Vehicular Technology Conference},
volume = {1},
pages = {209-213},
abstract = {We consider a single-access system where high bit-rate communication systems constrain the propagation delay between users and the base station. In this scenario, we found that existing channel reservation schemes cannot guarantee the satisfaction to all users regarding different Quality of Service (QoS). Thus in this paper, we propose two new channel reservation schemes which taken into consideration priority service to more delay-sensitive multimedia traffics, namely, UNI+MLA, and Partial UNI+MLA schemes for multimedia traffics, an extension of our recently proposed UNI+LA scheme for single-class traffic. The goal is to achieve the highest system performance and enable each traffic types to meet their QoS requirements. We evaluate the performance of each scheme by mathematical analysis. The numerical results show that our proposed schemes are effective in enabling different traffic users to achieve the best successful rate possible in this kind of environment.},
note = {cited By 2},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We consider a single-access system where high bit-rate communication systems constrain the propagation delay between users and the base station. In this scenario, we found that existing channel reservation schemes cannot guarantee the satisfaction to all users regarding different Quality of Service (QoS). Thus in this paper, we propose two new channel reservation schemes which taken into consideration priority service to more delay-sensitive multimedia traffics, namely, UNI+MLA, and Partial UNI+MLA schemes for multimedia traffics, an extension of our recently proposed UNI+LA scheme for single-class traffic. The goal is to achieve the highest system performance and enable each traffic types to meet their QoS requirements. We evaluate the performance of each scheme by mathematical analysis. The numerical results show that our proposed schemes are effective in enabling different traffic users to achieve the best successful rate possible in this kind of environment.