Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025902
Punsiri Boonyakiat, P. Silapachote
Segmentation of the optic nerve head or optic disc in digital retinal fundus photographs is a non-invasive procedure that plays an important role in early detection of abnormalities of the eyes, particularly glaucoma diseases. Developing an automatic system, we employ image processing techniques coupled with graph cut algorithms from combinatorial optimization. Avoiding the need of manual pre-segmentation for constructing an initial graph, a supervised learning approach is effectively and efficiently applied. Crucial information is extracted from a set of labeled binary masks and integrated into weight assignments of the edges of the graph. We associate the characteristically bell-shape of a Gaussian distribution with the rounded circular-shape of the optic disc. Our approach was validated and evaluated on the RIM-ONE open database. Segmentation is successful on 91.12% of the entire 169 images, achieving 91% sensitivity and 88% accuracy.
{"title":"Segmentation of optic nerve head images","authors":"Punsiri Boonyakiat, P. Silapachote","doi":"10.1109/JCSSE.2017.8025902","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025902","url":null,"abstract":"Segmentation of the optic nerve head or optic disc in digital retinal fundus photographs is a non-invasive procedure that plays an important role in early detection of abnormalities of the eyes, particularly glaucoma diseases. Developing an automatic system, we employ image processing techniques coupled with graph cut algorithms from combinatorial optimization. Avoiding the need of manual pre-segmentation for constructing an initial graph, a supervised learning approach is effectively and efficiently applied. Crucial information is extracted from a set of labeled binary masks and integrated into weight assignments of the edges of the graph. We associate the characteristically bell-shape of a Gaussian distribution with the rounded circular-shape of the optic disc. Our approach was validated and evaluated on the RIM-ONE open database. Segmentation is successful on 91.12% of the entire 169 images, achieving 91% sensitivity and 88% accuracy.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"9 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87778457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025916
Wisrut Kwankhoom, P. Muneesawang
This paper presents principles and techniques of a human gesture recognition algorithm for person identification which identifies personal gait patterns recorded with a 3D depth sensing camera, in this case the Microsoft Kinect® version 2. The recorded images are analyzed against a dataset of gait gestures derived from a sample of 37 people. We compared two algorithms for analyzing movement trajectories; Sparse code and Incremental Dynamic Time Warping (IDTW). Experimental results show that the methods have an encouraging performance. When comparing the accuracy of algorithms, IDTW gave better recognition results than the Sparse code method.
{"title":"An Incremental Dynamic Time Warping for person re-identification","authors":"Wisrut Kwankhoom, P. Muneesawang","doi":"10.1109/JCSSE.2017.8025916","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025916","url":null,"abstract":"This paper presents principles and techniques of a human gesture recognition algorithm for person identification which identifies personal gait patterns recorded with a 3D depth sensing camera, in this case the Microsoft Kinect® version 2. The recorded images are analyzed against a dataset of gait gestures derived from a sample of 37 people. We compared two algorithms for analyzing movement trajectories; Sparse code and Incremental Dynamic Time Warping (IDTW). Experimental results show that the methods have an encouraging performance. When comparing the accuracy of algorithms, IDTW gave better recognition results than the Sparse code method.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"57 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85646551","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025932
Patchara Pattanakimhun, W. Chinthammit, N. Chotikakamthorn
Large public displays are widely used in public spaces for serving information. The flow of the information is largely a one-way passive communication due to a lack of user-content interaction, which in some ways limits its effectiveness as an information display system. We propose a use of mobile phones as a tool to interact with a public display. Our proposed mobile-public display user interaction uses a mobile phone to control and retrieve information from a public display. In this paper we present results of a usability test of our proposed interaction, which indicated that there was a strong correlation between the information retrieval performances and the participant's level of engagement with the mobile phone.
{"title":"Evaluation of mobile phone interaction with large public displays","authors":"Patchara Pattanakimhun, W. Chinthammit, N. Chotikakamthorn","doi":"10.1109/JCSSE.2017.8025932","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025932","url":null,"abstract":"Large public displays are widely used in public spaces for serving information. The flow of the information is largely a one-way passive communication due to a lack of user-content interaction, which in some ways limits its effectiveness as an information display system. We propose a use of mobile phones as a tool to interact with a public display. Our proposed mobile-public display user interaction uses a mobile phone to control and retrieve information from a public display. In this paper we present results of a usability test of our proposed interaction, which indicated that there was a strong correlation between the information retrieval performances and the participant's level of engagement with the mobile phone.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"15 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72912768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025914
Nattanan Watcharenwong, K. Saikaew
Facebook has become a major communication channel for internet users. Unfortunately, with its great popularity and a great number of users, spams are also increasing. A number of Facebook services do not require spam detection, whereas the group usage does. Group users are generally those who are interested in the same topics or purposes. Members usually share the contents of interest in the group. These characteristics enable detection of unwanted posts, referred to as spam that annoys others. It should be noted that some spam may jeopardize the group, for example, by malicious URLs. The objective of this article is to present the design concept for detecting spam in closed groups by using the combination of text features and social features, which comprised 11 features for classifying spam by applying Random Forest machine learning algorithm on 1,200 labeled posts. The result indicated 98% of spam detection efficiency. Additionally, from the feature importance, the number of likes, one of the social features, was found to be the most effective for spam detection.
{"title":"Spam detection for closed Facebook groups","authors":"Nattanan Watcharenwong, K. Saikaew","doi":"10.1109/JCSSE.2017.8025914","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025914","url":null,"abstract":"Facebook has become a major communication channel for internet users. Unfortunately, with its great popularity and a great number of users, spams are also increasing. A number of Facebook services do not require spam detection, whereas the group usage does. Group users are generally those who are interested in the same topics or purposes. Members usually share the contents of interest in the group. These characteristics enable detection of unwanted posts, referred to as spam that annoys others. It should be noted that some spam may jeopardize the group, for example, by malicious URLs. The objective of this article is to present the design concept for detecting spam in closed groups by using the combination of text features and social features, which comprised 11 features for classifying spam by applying Random Forest machine learning algorithm on 1,200 labeled posts. The result indicated 98% of spam detection efficiency. Additionally, from the feature importance, the number of likes, one of the social features, was found to be the most effective for spam detection.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"91 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86751734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025915
M. I. W. Pramana, Suhardi, N. Kurniawan, Jaka Semibiring
Stolen credential incident is rising nowadays, most of the cyber attacks have been targeting user credential which could be easily abused. The usage of behavioral biometric is predicted to be increasing in order to encounter such act by authenticating user using multi-factor authentication of both password and behavioral biometrics to stop illegitimate user attempt. Keystroke dynamics is a behavioral biometric that can be collected efficiently from user typing behavior. This research studied about keystroke dynamic authentication system using dynamic time warping, dataset is used in testing phase along with system usability questionnaire. The method results in 17.6% equal error rate and 70 points of system usability scale.
{"title":"Keystroke dynamics for authentication using dynamic time warping","authors":"M. I. W. Pramana, Suhardi, N. Kurniawan, Jaka Semibiring","doi":"10.1109/JCSSE.2017.8025915","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025915","url":null,"abstract":"Stolen credential incident is rising nowadays, most of the cyber attacks have been targeting user credential which could be easily abused. The usage of behavioral biometric is predicted to be increasing in order to encounter such act by authenticating user using multi-factor authentication of both password and behavioral biometrics to stop illegitimate user attempt. Keystroke dynamics is a behavioral biometric that can be collected efficiently from user typing behavior. This research studied about keystroke dynamic authentication system using dynamic time warping, dataset is used in testing phase along with system usability questionnaire. The method results in 17.6% equal error rate and 70 points of system usability scale.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"60 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84641530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025942
Ronnakorn Jirachariyakool, Napat Sra-ium, S. Lerkvaranyu
This paper presents design and implement of fiber to the home (FTTH) for residential condominium based on Gigabit-capable passive optical network (GPON) ITU-T G.984 standard in order to achieve the maximum 320 subscribers and support high bandwidth for triple play service more efficiently. The proposed design complies both with power budget and rise time budget standard. Finally, the proposed design achieves the maximum 320 subscribers, average bandwidth per subscriber at 62.2 Mbps for downstream and 31.1 Mbps for upstream, power margin is above 0 and rise time budget is below 70 percent of an NRZ bit period.
{"title":"Design and implement of GPON-FTTH network for residential condominium","authors":"Ronnakorn Jirachariyakool, Napat Sra-ium, S. Lerkvaranyu","doi":"10.1109/JCSSE.2017.8025942","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025942","url":null,"abstract":"This paper presents design and implement of fiber to the home (FTTH) for residential condominium based on Gigabit-capable passive optical network (GPON) ITU-T G.984 standard in order to achieve the maximum 320 subscribers and support high bandwidth for triple play service more efficiently. The proposed design complies both with power budget and rise time budget standard. Finally, the proposed design achieves the maximum 320 subscribers, average bandwidth per subscriber at 62.2 Mbps for downstream and 31.1 Mbps for upstream, power margin is above 0 and rise time budget is below 70 percent of an NRZ bit period.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86865528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025910
Mathara Rojanamontien, U. Watchareeruetai
This paper proposes a novel shape feature extractor named Contour-SIFT along with a matching method that computes the similarity between two set of proposed descriptors. It allows a shape to be recognized based on automatically located outstanding local features on its contour, which are extracted from 1-D signal representations of different smoothing scales. The algorithm describes each local feature as a list of frequencies from curvature histogram, which is created from curve segment around each local position. The descriptors will give high similarity compared with a model descriptors of a similar shape. The algorithm has properties of image scaling-, translation-, and rotation-invariants. An experiment were conducted with 200 images from Flavia dataset for verification. The result of using the proposed algorithm is compared with the result of using CSS.
{"title":"Shape recognition by using Scale Invariant Feature Transform for contour","authors":"Mathara Rojanamontien, U. Watchareeruetai","doi":"10.1109/JCSSE.2017.8025910","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025910","url":null,"abstract":"This paper proposes a novel shape feature extractor named Contour-SIFT along with a matching method that computes the similarity between two set of proposed descriptors. It allows a shape to be recognized based on automatically located outstanding local features on its contour, which are extracted from 1-D signal representations of different smoothing scales. The algorithm describes each local feature as a list of frequencies from curvature histogram, which is created from curve segment around each local position. The descriptors will give high similarity compared with a model descriptors of a similar shape. The algorithm has properties of image scaling-, translation-, and rotation-invariants. An experiment were conducted with 200 images from Flavia dataset for verification. The result of using the proposed algorithm is compared with the result of using CSS.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"107 2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89694836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025943
Soravit Rodruksa, D. Pradubsuwun
This paper has proposed a formal verification of ABAP by Z specification. An ABAP programming language is used to create a customized program in SAP ERP. The program must satisfy a business requirement. It likely has a defect from the developed program. Since a specification is created as the business requirement and a program should have functioned as in the specification, the formal verification is needed to assure the correctness of the function in the program. Both an ABAP program and its specification are translated into Z specification and they are verified by Isabelle in order to ensure that the ABAP program conforms to its specification. We also give some experimental result to show the effectiveness of our method.
{"title":"Formal verification of ABAP by Z specification","authors":"Soravit Rodruksa, D. Pradubsuwun","doi":"10.1109/JCSSE.2017.8025943","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025943","url":null,"abstract":"This paper has proposed a formal verification of ABAP by Z specification. An ABAP programming language is used to create a customized program in SAP ERP. The program must satisfy a business requirement. It likely has a defect from the developed program. Since a specification is created as the business requirement and a program should have functioned as in the specification, the formal verification is needed to assure the correctness of the function in the program. Both an ABAP program and its specification are translated into Z specification and they are verified by Isabelle in order to ensure that the ABAP program conforms to its specification. We also give some experimental result to show the effectiveness of our method.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"25 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81038168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025948
Nuttakit Vatcharatiansakul, P. Tuwanut, C. Pornavalai
The Internet of Things (IoT) is a vision which real-world objects are part of the internet. Every object is uniquely identified, and accessible to the network. There are various types of communication protocol for connect the device to the Internet. One of them is a Low Power Wide Area Network (LPWAN) which is a novel technology use to implement IoT applications. There are many platforms of LPWAN such as NB-IoT, LoRaWAN. In this paper, the experimental performance evaluation of LoRaWAN over a real environment in Bangkok, Thailand is presented. From these experimental results, the communication ranges in both an outdoor and an indoor environment are limited. Hence, the IoT application with LoRaWAN technology can be reliable in limited of communication ranges.
{"title":"Experimental performance evaluation of LoRaWAN: A case study in Bangkok","authors":"Nuttakit Vatcharatiansakul, P. Tuwanut, C. Pornavalai","doi":"10.1109/JCSSE.2017.8025948","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025948","url":null,"abstract":"The Internet of Things (IoT) is a vision which real-world objects are part of the internet. Every object is uniquely identified, and accessible to the network. There are various types of communication protocol for connect the device to the Internet. One of them is a Low Power Wide Area Network (LPWAN) which is a novel technology use to implement IoT applications. There are many platforms of LPWAN such as NB-IoT, LoRaWAN. In this paper, the experimental performance evaluation of LoRaWAN over a real environment in Bangkok, Thailand is presented. From these experimental results, the communication ranges in both an outdoor and an indoor environment are limited. Hence, the IoT application with LoRaWAN technology can be reliable in limited of communication ranges.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"52 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77193087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-01DOI: 10.1109/JCSSE.2017.8025933
Kiratijuta Bhumichitr, S. Channarukul, Nattachai Saejiem, Rachsuda Jiamthapthaksin, K. Nongpong
Recommender Systems are an ongoing research that is applied in various domains. Course recommendation is considered a challenged domain that has not been explored thoroughly. It benefits undergraduate students who need suggestion and also enhances course selection processes during the pre-registration period. This paper introduces a recommendation system for university elective courses, which recommends the courses based on the similarity between the course templates of students. This paper utilizes two popular algorithms: collaborative based recommendation using Pearson Correlation Coefficient and Alternating Least Square (ALS), and compares their performance on a dataset of academic records of university students. The experimental results show that applying ALS in this domain is superior to collaborative based with 86 percent of accuracy.
{"title":"Recommender Systems for university elective course recommendation","authors":"Kiratijuta Bhumichitr, S. Channarukul, Nattachai Saejiem, Rachsuda Jiamthapthaksin, K. Nongpong","doi":"10.1109/JCSSE.2017.8025933","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025933","url":null,"abstract":"Recommender Systems are an ongoing research that is applied in various domains. Course recommendation is considered a challenged domain that has not been explored thoroughly. It benefits undergraduate students who need suggestion and also enhances course selection processes during the pre-registration period. This paper introduces a recommendation system for university elective courses, which recommends the courses based on the similarity between the course templates of students. This paper utilizes two popular algorithms: collaborative based recommendation using Pearson Correlation Coefficient and Alternating Least Square (ALS), and compares their performance on a dataset of academic records of university students. The experimental results show that applying ALS in this domain is superior to collaborative based with 86 percent of accuracy.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"40 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80542711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：