KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Search Results

Now showing 1 - 10 of 11
  • Some of the metrics are blocked by your 
    Item type:Item,
    Hand gesture recognition for Lao alphabet sign language using HOG and correlation
    (2017-11-03)
    Sombandith, Vimonhak
    ;
    Walairacht, Aranya
    ;
    Walairacht, Somsak
    Hand gesture is one of a powerful means of communication among human. Sign language is an essential and natural expressive mean of communication especially for the deaf people. The article proposes a technique for the recognition of Lao alphabet sign language. The technique of image processing, that is Histogram of Oriented Gradients (HOG), is applied in order to extract characteristics of the hand images performing individual alphabet of Lao sign language. The extracted features are then sent to the template matching process. The similarity between the extracted features and the prototype features are measured by using correlation technique. The totals of 54 Lao alphabets are used in the experiments. Four subjects are asked to perform each alphabet of Lao sign language in which each subject had performed totally 540 gestures. The recognition rate of the proposed technique at about 79 % is achieved.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Recognition of Lao sentence sign language using kinect sensor
    (2017-11-03)
    Sombandith, Vimonhak
    ;
    Walairacht, Aranya
    ;
    Walairacht, Somsak
    This paper presents a technique for recognition Lao sentence sign language by using a Kinect sensor. By using Kinect sensor, feature joint positions of human body can be tracked. After that the joint angles between each pair of joint vectors of adjacent joint positions are measured. When the user perform a series of posture representing a simple sentence of Lao sign language, the system records joint angles that is significantly changed from one posture to another posture. Feature joint angles stored in the database is used to recognition the testing sentence's posture. The recognition rate of about 75% is achieved from the experiments performed 10 simple sentences of Lao sign language.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Door lock system via web application
    (2017-10-19)
    Vongchumyen, Charoen
    ;
    Watanachaturaporn, Pakorn
    ;
    Jinjakam, Chompoonuch
    ;
    Watcharapupong, Akkradach
    ;
    Kasemsiri, Watjanapong
    This research proposes the smart way to solve the common problem of the conventional door-locking system. The important problems of the ordinary door-locking systems are key lost, forgetting to lock the system and cannot check the lock status from remote. To solve these problems, we proposed a method to lock-unlock the system which utilizes the web application and passcode alongside the usual method of using the ordinary keys. The proposed system can remotely lock, remotely unlock, remotely check door state, remotely check door locking state, send the email to the owner in case of someone knocking on the door and generate the temporary passcode to use in specific date and time.
  • Some of the metrics are blocked by your 
    Item type:Item,
    JGroovy: An alternative approach to implement extensible Java compiler
    (2013-01-01)
    Sateanpattanakul, Siwadol
    ;
    Hamamoto, Kazuhiko
    ;
    Walairacht, Aranya
    The main reason for the invention of computer programming languages is for these languages to express a command-to-control machine behavior. Some of these programming languages have specific advantages that are used in specific environments such as structured query language (SQL), hypertext markup language (HTML), and spreadsheet. The common definitions of these languages are domain-specific languages (DSLs). Although DSLs are the best way to deal with specific systems, it is hard to use with other environments or platforms. Groovy is a dynamic programming language that runs on the Java virtual machine. Groovy has some features that allow programmers to manage DSLs within its unique style. Groovy has some disadvantages because it does not support all Java features and syntax while also producing unnecessary byte code during compilation. This paper proposes an extended-architecture technique to implement a computer programming language and compiler through extending Java with Groovy language. The extensible language is called 'JGroovy'. And JGroovy is supported both by Java and Groovy language. We implement the compiler for JGroovy and call it the 'JGroovy compiler' (JGC). By its extended architecture, JGC is more compatible for Java source code than Javac can claim to be. And it also produces a better and more compact byte code than the Groovy compiler, with an approximate improvement of 8-12%. © 2013 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.
  • Some of the metrics are blocked by your 
    Item type:Item,
    JGroovy - An extensible java programming language with groovy
    (2010-05-24)
    Sateanpattanakul, Siwadol
    ;
    Walairacht, Aranya
    Java is Object-Oriented Programming Languages (OOPL) that widely used for software development. But Java has a limitation for working with Domain-Specific Languages (DSLs). Java language structure and syntax has not more support for working with DSLs and including type of Java language. Static language likes Java does not flexible more for DSLs handle. This limitation has to solve by adding new language structure and syntax into Java language. Groovy is a dynamic programming languages that support DSLs with internal structure. In this paper, we introduce "JGroovy" which is extended Java programming language with Groovy programming. We are built JGroovy compilers that fully support Java programming language.
  • Some of the metrics are blocked by your 
    Item type:Item,
    User preference retrieval using semantic categorization for web search
    (2010-05-24)
    Bounoy, Teerakorn
    ;
    Walairacht, Aranya
    Search engines have been one of the most popular ways for people to find web pages of interest. Presently, when a user enters a keyword in a search engine, the search results are usually presented the same result to other users who search the same keyword, which might not be related to each user's field of interest. Therefore, the researcher of this study would like to propose a new searching technique to get each user's most relevant information by using a user preference. This research will categorize user preference to build the user profile and general profile base on user's search history and category hierarchy, respectively. The search engines then use those profiles to determine the interests of each user, execute the search query to obtain a set of relevant documents, and reranking the documents in a manner that best reflects their relevance to the user's profile. Many algorithms have been designed, analyzed, implemented and experimented to find the most appropriate and the most effective one to create the relationship between each keyword and each category to best meet each user's preference.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Efficiency improvement for unconstrained face recognition by weightening probability values of modular PCA and Wavelet PCA
    (2008-05-29)
    Puyati, Wayo
    ;
    Walairacht, Aranya
    Principal Component Analysis (PCA) is a well-known classical appearance-base method in face recognition. In the previous works, the preprocessing process significantly improved the recognition rate. Modular PCA and Wavelet PCA are the preprocessing processes of PCA, which increase the recognition rate of the original PCA. Modular PCA is suitable for the highvaried face database, while Wavelet PCA for the low-varied face database. In this paper, we propose the preprocessing method which combines between Modular PCA and Wavelet PCA with the weightening probability values. The experiments are compared among our propose method, Modular PCA, Wavelet PCA and original PCA with face database from Yale, ORL and UMIST. The experimental results show that the recognition rate of our method is higher compared to the other methods and also support variety of face database.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Spam mail templates using genetic algorithm
    (2007-12-01)
    Walairacht, Aranya
    In this paper, we propose a mechanism for filtering e-mails by constructing spam mail prototypes by using genetic algorithm. Keywords extracted from e-mail's subject and body are categorized by their meaning into 8 categories. The binary representation of a chromosome string having 8 genes is constructed from keywords. Genetic operations are applied to create varieties of spam mail prototypes for filtering. From the experiments, the proposed technique shows the accuracy of filtering spam mails by 87.05% in average. When comparing with the other technique liked Bayesian, the proposed technique still has higher accuracy.
  • Some of the metrics are blocked by your 
    Item type:Item,
    Adaptive spam mail filtering using genetic algorithm
    (2006-11-17)
    Sanpakdee, Usarat
    ;
    Walairacht, Aranya
    ;
    Walairacht, Somsak
    In this paper, we propose a mechanism for filtering incoming spam mails by generating spam mail prototypes using genetic algorithm. Firstly, words from e-mails are extracted and are categorized by their relating meaning into 7 groups. Then, we compose a string of chromosome having 7 genes, i.e., groups of words. Each gene, represented words in each group, is encoded into binary value. The genetic algorithm and its operations are applied to create varieties of spam mail prototypes which inherit from old spam mails. It saves time for preparing training sets and need no large training set for learning like other methods. The spam mail prototypes are the result of this learning mechanism. The experimental results show that the proposed system has efficiency. When testing with both spams and hams, the accuracy is about 85% in average.
  • Some of the metrics are blocked by your 
    Item type:Item,
    PCA in wavelet domain for face recognition
    (2006-11-17)
    Puyati, Wayo
    ;
    Walairacht, Somsak
    ;
    Walairacht, Aranya
    In this paper, the preprocessing process aimed to reduce size of input image by using wavelet transform before transformed image is sent to the process of PCA for recognition. We used ORL Face Databases from AT&T Laboratories Cambridge in the experiments. The results show that the 4<sup>th</sup> Order Symlets level 2 and level 3 improve the accuracy rate of recognition when compare among Haar wavelets, the 4<sup>th</sup> Order Daubechies wavelets, and Biorthogonal wavelets (orthogonal 6.8). In the case of overall processing time for training, the length of filter of wavelet is directly effect the time consuming. Since LL subband of wavelet decomposition becomes the input for PCA, the memory usage can be greatly reduced.