Pub Date : 2015-02-26DOI: 10.1109/RIVF.2015.7049882
T. Ngo, M. Seo, Yenwei Chen, N. Matsushiro
Facial paralysis is a common clinical condition with the rate from 20 to 25 patients per 100,000 people per year. An objectively quantitative tool to support for medical diagnostics is very necessary and important. This paper proposes a very simple, visual, and highly efficient method that overcomes the drawbacks of other methods to develop this tool. In our research, we use the tracking of interest points to measure the features that are used for training and testing. Experiments show that our method outperforms other techniques testing on a dynamic facial expression database.
{"title":"Quantitative evaluation of facial paralysis using tracking method","authors":"T. Ngo, M. Seo, Yenwei Chen, N. Matsushiro","doi":"10.1109/RIVF.2015.7049882","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049882","url":null,"abstract":"Facial paralysis is a common clinical condition with the rate from 20 to 25 patients per 100,000 people per year. An objectively quantitative tool to support for medical diagnostics is very necessary and important. This paper proposes a very simple, visual, and highly efficient method that overcomes the drawbacks of other methods to develop this tool. In our research, we use the tracking of interest points to measure the features that are used for training and testing. Experiments show that our method outperforms other techniques testing on a dynamic facial expression database.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115925259","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049891
Tuan-Minh Pham
Information-centric networking (ICN) models have recently emerged as novel network architectures for dealing with current Internet usage, where most users are interested in retrieving content without regard to its physical location. In this paper, we consider a noncooperative game between an Internet Service Provider (ISP) and content provider (CP) in an ICN model where the ISP is motivated to cache content and the polarity of the side-payment (from the ISP to the CP) in an ICN is basically different from that in the current Internet model (i.e. host-centric communication model). We analyze the existence of equilibrium in the game where in-network caching and pricing are taken into account. We show a condition with respect to the demand-response and caching cost functions for caching investment of the ISP profitable. The Nash equilibrium, the impact of caching on the utility, and comparison between the ICN and Internet models are studied numerically.
{"title":"Analysis of ISP caching in information-centric networks","authors":"Tuan-Minh Pham","doi":"10.1109/RIVF.2015.7049891","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049891","url":null,"abstract":"Information-centric networking (ICN) models have recently emerged as novel network architectures for dealing with current Internet usage, where most users are interested in retrieving content without regard to its physical location. In this paper, we consider a noncooperative game between an Internet Service Provider (ISP) and content provider (CP) in an ICN model where the ISP is motivated to cache content and the polarity of the side-payment (from the ISP to the CP) in an ICN is basically different from that in the current Internet model (i.e. host-centric communication model). We analyze the existence of equilibrium in the game where in-network caching and pricing are taken into account. We show a condition with respect to the demand-response and caching cost functions for caching investment of the ISP profitable. The Nash equilibrium, the impact of caching on the utility, and comparison between the ICN and Internet models are studied numerically.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116851036","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049876
T. K. Tran
Sentiment analysis or opinion mining is a new research field but playing an important role in computer sciences, attracting interests of academia as well as industry. As a field of research, it is closely related to natural language processing, machine learning, text mining and information retrieval. In this paper, we use the machine learning approach to classify hotel service reviews. The results of this phase are integrated into our voice server system that we have successfully developed previously ([31], [32]). As a result, users can consult hotel information via phone calls instead of the keyboard.
{"title":"SentiVoice - a system for querying hotel service reviews via phone","authors":"T. K. Tran","doi":"10.1109/RIVF.2015.7049876","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049876","url":null,"abstract":"Sentiment analysis or opinion mining is a new research field but playing an important role in computer sciences, attracting interests of academia as well as industry. As a field of research, it is closely related to natural language processing, machine learning, text mining and information retrieval. In this paper, we use the machine learning approach to classify hotel service reviews. The results of this phase are integrated into our voice server system that we have successfully developed previously ([31], [32]). As a result, users can consult hotel information via phone calls instead of the keyboard.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114425028","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049893
Tuan-Duc Nguyen, T. T. Thanh, L. Nguyen, Huu-Tue Huynh
In the context of ubiquitous wireless sensor network, this paper presents a framework for wireless sensor networks (WSNs) designed to observe impacts of climate change in crop fields. We propose a system architecture for ubiquitous WSNs for monitoring automatically and continuously in real-time. A prototype system includes two base stations and several sensor nodes which are powered by solar cell are designed and implemented. Climatic parameters from sensor nodes are sent via WSN to the base station, while base station communicates with remote data server center through GPRS/3G network. By using multiple methods of communication, it could enable monitor areas where not in GPRS/3G coverage. With advantages of low-cost and ubiquitous monitoring, the system can be applied widely in agriculture in developing countries like Vietnam. Power consumption estimation and NS-2 simulation results prove the energy efficient of environment stations and data collection networks.
{"title":"On the design of energy efficient environment monitoring station and data collection network based on ubiquitous wireless sensor networks","authors":"Tuan-Duc Nguyen, T. T. Thanh, L. Nguyen, Huu-Tue Huynh","doi":"10.1109/RIVF.2015.7049893","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049893","url":null,"abstract":"In the context of ubiquitous wireless sensor network, this paper presents a framework for wireless sensor networks (WSNs) designed to observe impacts of climate change in crop fields. We propose a system architecture for ubiquitous WSNs for monitoring automatically and continuously in real-time. A prototype system includes two base stations and several sensor nodes which are powered by solar cell are designed and implemented. Climatic parameters from sensor nodes are sent via WSN to the base station, while base station communicates with remote data server center through GPRS/3G network. By using multiple methods of communication, it could enable monitor areas where not in GPRS/3G coverage. With advantages of low-cost and ubiquitous monitoring, the system can be applied widely in agriculture in developing countries like Vietnam. Power consumption estimation and NS-2 simulation results prove the energy efficient of environment stations and data collection networks.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114946660","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049883
N. Dat, Thanh Binh Nguyen
In recent years, computers have become more and more important in human life and work. People used computers to control highway, traffic violation, etc. These jobs need process input images to detect interesting objects. This step is important in many computer vision applications such as image segmentation, object recognition, etc. There are a lot of methods to solve this problem. However, most of output images from them need enhance quality, and color change at object contour. In this paper, we propose a method for enhancing object quality. The proposed method uses saliency map based on global contrast and derivative on color distance. The proposed method is simple to know, easy to implement and efficient to apply. The results of the proposed method are better than those of the other methods at the saliency map quality when evaluated by using a large public dataset. We can control masks, and the extracted object quality by using a derivative operator on color distances and this idea brings the results as expected.
{"title":"Enhancing object quality based on saliency map and derivatives on color distances","authors":"N. Dat, Thanh Binh Nguyen","doi":"10.1109/RIVF.2015.7049883","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049883","url":null,"abstract":"In recent years, computers have become more and more important in human life and work. People used computers to control highway, traffic violation, etc. These jobs need process input images to detect interesting objects. This step is important in many computer vision applications such as image segmentation, object recognition, etc. There are a lot of methods to solve this problem. However, most of output images from them need enhance quality, and color change at object contour. In this paper, we propose a method for enhancing object quality. The proposed method uses saliency map based on global contrast and derivative on color distance. The proposed method is simple to know, easy to implement and efficient to apply. The results of the proposed method are better than those of the other methods at the saliency map quality when evaluated by using a large public dataset. We can control masks, and the extracted object quality by using a derivative operator on color distances and this idea brings the results as expected.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127210239","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049874
N. Hai
Maximizing the spread of influence was recently studied in several models of social networks. For location-based social networks, it also plays an important role, so a further research about this field is necessary. In this study, based on users' movement histories and their friendships, we first design the Predicting Mobility in the Near Future (PMNF) model to capture human mobility. Human mobility is inferred from the model by taking into account the following three features: (1) the regular movement of users, (2) the movement of friends of users, (3) hot regions, the most attractive places for all users. Second, from the result of predicting movements of users at each location, we determine influence of each user on friends with the condition that friends are predicted to come to the location. Third, the Influence Maximization (IM) algorithms are proposed to find a set of k influential users who can make the maximum influence on their friends according to either the number of influenced users (IM num) or the total of probability of moving the considered location of influenced users (IM score). The model and algorithms are evaluated on three large datasets collected by from 40,000 to over 60,000 users for each dataset over a period of two years in the real world at over 500,000 checked-in points as well as 400,000 to nearly 2,000,000 friendships also considered. The points are clustered into locations by density-based clustering algorithms such as OPTICS and GRID. As a result, our algorithms give an order of magnitude better performance than baseline approaches like choosing influential users based on the number of check-ins of users and selecting influential users by the number of friends of users. From the result of experiments, we are able to apply to some areas like advertisement to get the most efficient with the minimum costs. We show that our framework reliably determines the most influential users with high accuracy.
{"title":"A novel approach for location promotion on location-based social networks","authors":"N. Hai","doi":"10.1109/RIVF.2015.7049874","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049874","url":null,"abstract":"Maximizing the spread of influence was recently studied in several models of social networks. For location-based social networks, it also plays an important role, so a further research about this field is necessary. In this study, based on users' movement histories and their friendships, we first design the Predicting Mobility in the Near Future (PMNF) model to capture human mobility. Human mobility is inferred from the model by taking into account the following three features: (1) the regular movement of users, (2) the movement of friends of users, (3) hot regions, the most attractive places for all users. Second, from the result of predicting movements of users at each location, we determine influence of each user on friends with the condition that friends are predicted to come to the location. Third, the Influence Maximization (IM) algorithms are proposed to find a set of k influential users who can make the maximum influence on their friends according to either the number of influenced users (IM num) or the total of probability of moving the considered location of influenced users (IM score). The model and algorithms are evaluated on three large datasets collected by from 40,000 to over 60,000 users for each dataset over a period of two years in the real world at over 500,000 checked-in points as well as 400,000 to nearly 2,000,000 friendships also considered. The points are clustered into locations by density-based clustering algorithms such as OPTICS and GRID. As a result, our algorithms give an order of magnitude better performance than baseline approaches like choosing influential users based on the number of check-ins of users and selecting influential users by the number of friends of users. From the result of experiments, we are able to apply to some areas like advertisement to get the most efficient with the minimum costs. We show that our framework reliably determines the most influential users with high accuracy.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124965606","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049879
Tri H. Nguyen, D. M. Duong, D. Duong
In this paper, we propose a blind digital image watermarking technique by combining Discrete Wavelet Transform (DWT) with Singular Value Decomposition (SVD) to improve the robustness and the capacity. In detail, Singular Values (SVs) of watermarks are replaced with the suitable SVs of HH sub-bands of the original images. Additionally, our method generates keys that ensures the security for the watermarks in the embedding and the extraction process. Experiments on images for digital watermarking attacked by Stirmark Benchmark 4.0 tool show that our method is more robust, imperceptible and higher capacity than others'.
{"title":"Robust and high capacity watermarking for image based on DWT-SVD","authors":"Tri H. Nguyen, D. M. Duong, D. Duong","doi":"10.1109/RIVF.2015.7049879","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049879","url":null,"abstract":"In this paper, we propose a blind digital image watermarking technique by combining Discrete Wavelet Transform (DWT) with Singular Value Decomposition (SVD) to improve the robustness and the capacity. In detail, Singular Values (SVs) of watermarks are replaced with the suitable SVs of HH sub-bands of the original images. Additionally, our method generates keys that ensures the security for the watermarks in the embedding and the extraction process. Experiments on images for digital watermarking attacked by Stirmark Benchmark 4.0 tool show that our method is more robust, imperceptible and higher capacity than others'.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114253179","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049867
Hong-Quan Nguyen, Phuong-Thai Nguyen, Thanh-Quyen Dang, V. Nguyen
Vietnamese Treebank is a syntactically annotated corpus newly published in 2009. In this paper, we applied automated methods to detect errors in Vietnammese Treebank based on the concept of equivalence classes proposed by Dickinson. On this basis, we propose an improved method of error detection by transforming syntax trees based on vertical markovization. Our experimental results on Vietnamese Treebank showed that the scope of error detection was extended more than 2 times and the precision was improved more than 18.07% in comparison with the base line methods.
{"title":"Automatic detection of problematic rules in Vietnamese Treebank","authors":"Hong-Quan Nguyen, Phuong-Thai Nguyen, Thanh-Quyen Dang, V. Nguyen","doi":"10.1109/RIVF.2015.7049867","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049867","url":null,"abstract":"Vietnamese Treebank is a syntactically annotated corpus newly published in 2009. In this paper, we applied automated methods to detect errors in Vietnammese Treebank based on the concept of equivalence classes proposed by Dickinson. On this basis, we propose an improved method of error detection by transforming syntax trees based on vertical markovization. Our experimental results on Vietnamese Treebank showed that the scope of error detection was extended more than 2 times and the precision was improved more than 18.07% in comparison with the base line methods.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"18 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132968655","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049886
N. Do, LongVan Ho
The significant increase in number of the online newspapers has given web users a giant information source. The users are really difficult to manage content as well as check the correctness of articles. In this paper, we introduce algorithms of extracting keyphrase and matching signatures for near-duplicate articles detection. Based on ontology, keyphrases of articles are extracted automatically and similarity of two articles is calculated by using extracted keyphrases. Algorithms are applied on Vietnamese online newspapers for Labor & Employment. Experimental results show that our proposed methods are effective.
{"title":"Domain-specific keyphrase extraction and near-duplicate article detection based on ontology","authors":"N. Do, LongVan Ho","doi":"10.1109/RIVF.2015.7049886","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049886","url":null,"abstract":"The significant increase in number of the online newspapers has given web users a giant information source. The users are really difficult to manage content as well as check the correctness of articles. In this paper, we introduce algorithms of extracting keyphrase and matching signatures for near-duplicate articles detection. Based on ontology, keyphrases of articles are extracted automatically and similarity of two articles is calculated by using extracted keyphrases. Algorithms are applied on Vietnamese online newspapers for Labor & Employment. Experimental results show that our proposed methods are effective.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133423749","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 : 2015-02-26DOI: 10.1109/RIVF.2015.7049870
Vinh Q. Tran, T. Cao
In a dictionary, a word can have different senses, and each sense is described by a gloss. However, a gloss is short and may not be satisfactorily informative to users. Meanwhile, mostly each word sense has a corresponding article in Wikipedia that contains rich information about the concept expressed by the word sense. In this work, we propose two different methods to link online dictionary word senses to the appropriate Wikipedia articles, namely, text similarity and machine learning. Experimental results on Wiktionary and Oxford English Dictionary are also presented.
{"title":"Linking online dictionaries to Wikipedia","authors":"Vinh Q. Tran, T. Cao","doi":"10.1109/RIVF.2015.7049870","DOIUrl":"https://doi.org/10.1109/RIVF.2015.7049870","url":null,"abstract":"In a dictionary, a word can have different senses, and each sense is described by a gloss. However, a gloss is short and may not be satisfactorily informative to users. Meanwhile, mostly each word sense has a corresponding article in Wikipedia that contains rich information about the concept expressed by the word sense. In this work, we propose two different methods to link online dictionary word senses to the appropriate Wikipedia articles, namely, text similarity and machine learning. Experimental results on Wiktionary and Oxford English Dictionary are also presented.","PeriodicalId":166971,"journal":{"name":"The 2015 IEEE RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117303605","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
扫码关注我们
求助内容：
应助结果提醒方式：