Pub Date : 2014-03-27DOI: 10.1109/ICACT.2014.6779136
Jongkuk Lee, Youn-seo Jeong, Ki-dong Nam
The time synchronization is very important for network testing that is at a long distance. For time synchronization, two different network testing apparatuses uses a network time protocol (NTP) or a geographic position system (GPS). For using GPS with less timing error, an expensive GPS antenna needs to be installed outside the door. NTP is through the network. The network itself causes a time delay and the error in the time delay of the network occurs. So, NTP has not been used to measure a high speed network. This paper has been made in an effort to provide a network testing system using a Standard Wave to facilitate time synchronization with at least two network testing apparatuses, and an operating method thereof. The Standard Wave has extremely little time error. It helps to perform accurate testing.
{"title":"Time synchronization method of network testing system by standard wave","authors":"Jongkuk Lee, Youn-seo Jeong, Ki-dong Nam","doi":"10.1109/ICACT.2014.6779136","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779136","url":null,"abstract":"The time synchronization is very important for network testing that is at a long distance. For time synchronization, two different network testing apparatuses uses a network time protocol (NTP) or a geographic position system (GPS). For using GPS with less timing error, an expensive GPS antenna needs to be installed outside the door. NTP is through the network. The network itself causes a time delay and the error in the time delay of the network occurs. So, NTP has not been used to measure a high speed network. This paper has been made in an effort to provide a network testing system using a Standard Wave to facilitate time synchronization with at least two network testing apparatuses, and an operating method thereof. The Standard Wave has extremely little time error. It helps to perform accurate testing.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"31 1","pages":"1136-1139"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75621211","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6778989
Ji-Soo Oh, Min-Woo Park, Tai M. Chung
The Android's message passing system provides late run-time binding between components in the same or different applications, and it promotes inter-application collaboration. However, the message passing mechanism has also numerous vulnerabilities, so that Android applications can be exposed to attacks from malicious applications. Denial of service (DoS) attack on ordered broadcasts is a typical attack that exploits vulnerabilities of message passing. A malicious application which launches the attack intercepts broadcast messages by setting itself high priority, and then aborts it to prevent other benign applications from receiving it. In this paper, we propose a security framework for detecting DoS attacks on ordered broadcasts. We insert our framework into Android platform, and then the framework inspects receivers of broadcast messages. If the framework detects any threats, it issues warning to user. Finally, we provides scenario about our framework and discuss future directions.
{"title":"The solution of denial of service attack on ordered broadcast Intent","authors":"Ji-Soo Oh, Min-Woo Park, Tai M. Chung","doi":"10.1109/ICACT.2014.6778989","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6778989","url":null,"abstract":"The Android's message passing system provides late run-time binding between components in the same or different applications, and it promotes inter-application collaboration. However, the message passing mechanism has also numerous vulnerabilities, so that Android applications can be exposed to attacks from malicious applications. Denial of service (DoS) attack on ordered broadcasts is a typical attack that exploits vulnerabilities of message passing. A malicious application which launches the attack intercepts broadcast messages by setting itself high priority, and then aborts it to prevent other benign applications from receiving it. In this paper, we propose a security framework for detecting DoS attacks on ordered broadcasts. We insert our framework into Android platform, and then the framework inspects receivers of broadcast messages. If the framework detects any threats, it issues warning to user. Finally, we provides scenario about our framework and discuss future directions.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"1 1","pages":"397-400"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73199678","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 : 2014-03-27DOI: 10.1109/ICACT.2015.7224909
Xing Fan, Bo Yang, R. Yamamoto, Y. Tanaka
VANET (Vehicular ad hoc Network) is a special kind of ad hoc wireless network where every single node is a vehicle moving in a relatively high velocity, which leads to exclusive challenges like rapid changing topologies, safety and privacy concerns. In this specific network, the propagation of emergency messages could be critical to save human lives and property. Many researchers have proposed routing or broadcast protocols to solve the problems in VANET. The objective of this paper is to propose a broadcast scheme in VANET that is not likely to cause broadcast storm problem with a reasonable delay and high delivery rate. Since VANET is an attack-prone network and any kind of malicious behaviour in VANET might cause serious loss or even death in reality, we should also refrain from using beacons to exchange privacy-sensitive information in V2V (Vehicle to Vehicle). In this paper, a multi-hop broadcast scheme that makes use of RSU and V2I (Vehicle to Infrastructure) communication is proposed. The simulation result shows that the proposed scheme outperforms static stochastic broadcast scheme in terms of delivery rate. Comparing to flooding, we offer a better delay and less network usage.
VANET(车辆自组织网络)是一种特殊的自组织无线网络，其中每个节点都是一辆以相对较高速度移动的车辆，这导致了快速变化的拓扑，安全和隐私问题等排他性挑战。在这个特定的网络中，紧急信息的传播对于拯救人类生命和财产至关重要。许多研究人员提出了路由或广播协议来解决VANET中的问题。本文的目标是在VANET中提出一种不可能引起广播风暴问题的广播方案，具有合理的延迟和高传输率。由于VANET是一个容易受到攻击的网络，在现实中，VANET中的任何恶意行为都可能造成严重的损失甚至死亡，因此我们也应该避免在V2V(车对车)中使用信标交换隐私敏感信息。本文提出了一种利用RSU和V2I (Vehicle to Infrastructure)通信的多跳广播方案。仿真结果表明，该方案在传输速率方面优于静态随机广播方案。与泛洪相比，我们提供了更好的延迟和更少的网络使用。
{"title":"Road side unit assisted stochastic multi-hop broadcast scheme for instant emergency message propagation","authors":"Xing Fan, Bo Yang, R. Yamamoto, Y. Tanaka","doi":"10.1109/ICACT.2015.7224909","DOIUrl":"https://doi.org/10.1109/ICACT.2015.7224909","url":null,"abstract":"VANET (Vehicular ad hoc Network) is a special kind of ad hoc wireless network where every single node is a vehicle moving in a relatively high velocity, which leads to exclusive challenges like rapid changing topologies, safety and privacy concerns. In this specific network, the propagation of emergency messages could be critical to save human lives and property. Many researchers have proposed routing or broadcast protocols to solve the problems in VANET. The objective of this paper is to propose a broadcast scheme in VANET that is not likely to cause broadcast storm problem with a reasonable delay and high delivery rate. Since VANET is an attack-prone network and any kind of malicious behaviour in VANET might cause serious loss or even death in reality, we should also refrain from using beacons to exchange privacy-sensitive information in V2V (Vehicle to Vehicle). In this paper, a multi-hop broadcast scheme that makes use of RSU and V2I (Vehicle to Infrastructure) communication is proposed. The simulation result shows that the proposed scheme outperforms static stochastic broadcast scheme in terms of delivery rate. Comparing to flooding, we offer a better delay and less network usage.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"46 1","pages":"103-108"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72823561","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779186
M. Han
In this paper, we propose a simple and feasible dynamic bandwidth allocation (SFDBA) algorithm in order to utilize the unallocated bandwidth and to achieve the implementation feasibility. SFDBA is based on an immediate allocation with colorless grant (IACG) algorithm but SFDBA uses only a single available byte counter and a single down counter for multiple queues of a same service class. Since multiple queues share the same available byte counter, the unallocated bandwidth of a queue can be utilized by another queues. For better service fairness, SFDBA changes the starting queue of scheduling in a round-robin manner. Using simulations, we show that SFDBA is superior to existing methods in mean delay, frame delay variance and frame loss rate.
{"title":"Simple and feasible dynamic bandwidth and polling allocation for XGPON","authors":"M. Han","doi":"10.1109/ICACT.2014.6779186","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779186","url":null,"abstract":"In this paper, we propose a simple and feasible dynamic bandwidth allocation (SFDBA) algorithm in order to utilize the unallocated bandwidth and to achieve the implementation feasibility. SFDBA is based on an immediate allocation with colorless grant (IACG) algorithm but SFDBA uses only a single available byte counter and a single down counter for multiple queues of a same service class. Since multiple queues share the same available byte counter, the unallocated bandwidth of a queue can be utilized by another queues. For better service fairness, SFDBA changes the starting queue of scheduling in a round-robin manner. Using simulations, we show that SFDBA is superior to existing methods in mean delay, frame delay variance and frame loss rate.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"43 1","pages":"298-304"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73777744","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779025
A. Matoba, M. Hanada, Ho-Gun Moon, M. Kim
A wireless network node with the Omni antenna tends to cause problems called "Hidden Node" and "Exposed Node". RTS/CTS mechanism has been introduced to mitigate Hidden Node and most of existing researches assume that RTS and CTS are sent at the same data rate. In this paper we have intentionally allocate different transmission rate to RTS and CTS in order to mitigate effect of Exposed Node. The simulation result showed that the proposed method achieved higher throughput.
{"title":"Asymmetric RTS/CTS in ad hoc Wireless LAN","authors":"A. Matoba, M. Hanada, Ho-Gun Moon, M. Kim","doi":"10.1109/ICACT.2014.6779025","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779025","url":null,"abstract":"A wireless network node with the Omni antenna tends to cause problems called \"Hidden Node\" and \"Exposed Node\". RTS/CTS mechanism has been introduced to mitigate Hidden Node and most of existing researches assume that RTS and CTS are sent at the same data rate. In this paper we have intentionally allocate different transmission rate to RTS and CTS in order to mitigate effect of Exposed Node. The simulation result showed that the proposed method achieved higher throughput.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"26 1","pages":"575-578"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74179684","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6778985
S. Choi, Joongsoo Ma
In case of wireless networks which does not contain a localization system, Euclidean distance between two nodes those are out of carrier sensing range each other cannot be measured with ranging techniques such as RSSI, ToA, and TDoA since they are not able to communicate directly. To deal with this issue, range-free schemes like a hop-count based approach and a connectivity based approach were used. These methods, however, are decreased in accuracy at low node density networks, so it is hard to apply to other wireless network except the densely deployed sensor networks. In this paper, we present a novel distance estimation method. When two nodes are in 2-hop neighbor relation, our method can estimate a distance using ranging information of their overlapped neighbors and connectivity information. Simulation results show that the proposed method outperforms hop count based and connectivity based distance estimation methods.
{"title":"Novel distance estimation algorithm of two-hop neighbor in wireless sensor networks","authors":"S. Choi, Joongsoo Ma","doi":"10.1109/ICACT.2014.6778985","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6778985","url":null,"abstract":"In case of wireless networks which does not contain a localization system, Euclidean distance between two nodes those are out of carrier sensing range each other cannot be measured with ranging techniques such as RSSI, ToA, and TDoA since they are not able to communicate directly. To deal with this issue, range-free schemes like a hop-count based approach and a connectivity based approach were used. These methods, however, are decreased in accuracy at low node density networks, so it is hard to apply to other wireless network except the densely deployed sensor networks. In this paper, we present a novel distance estimation method. When two nodes are in 2-hop neighbor relation, our method can estimate a distance using ranging information of their overlapped neighbors and connectivity information. Simulation results show that the proposed method outperforms hop count based and connectivity based distance estimation methods.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"6 1","pages":"378-381"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79078954","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6778953
Noppamas Pukkhem
This paper seeks to identify the factors of university students in major of Computer Science at Thaksin University, Thailand that predicts successful completion of the bachelor's degree. Decision tree C4.5/J48, ID3 and ADTree algorithm, the classification algorithms in data mining which are commonly used in many areas can also be implemented to generate the classification rules. In our experiment with 128 training records, we found an overall accuracy of C4.5/J48 algorithm was 90.625%, ID3 algorithm and ADTree were 96.875%. Moreover, we extend the classification rule by applying a semantic-based approach for creating a classification tree ontology. The ontology represent about the classification rules that used to enable machines to interpret and identify learner factors in process of prediction. We also explain how ontological representation plays a role in classifying students to predictive target class. The inference layer of classification tree ontology is based on SWRL (Semantic Web Rule Language), making a clarify separation of the program component and connected explicit modules. One of the major advantages of the proposed approach is that identifying success factors will give students an awareness of essential features for successful completion of their graduate studies.
{"title":"A semantic-based approach for representing successful graduate predictive rules","authors":"Noppamas Pukkhem","doi":"10.1109/ICACT.2014.6778953","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6778953","url":null,"abstract":"This paper seeks to identify the factors of university students in major of Computer Science at Thaksin University, Thailand that predicts successful completion of the bachelor's degree. Decision tree C4.5/J48, ID3 and ADTree algorithm, the classification algorithms in data mining which are commonly used in many areas can also be implemented to generate the classification rules. In our experiment with 128 training records, we found an overall accuracy of C4.5/J48 algorithm was 90.625%, ID3 algorithm and ADTree were 96.875%. Moreover, we extend the classification rule by applying a semantic-based approach for creating a classification tree ontology. The ontology represent about the classification rules that used to enable machines to interpret and identify learner factors in process of prediction. We also explain how ontological representation plays a role in classifying students to predictive target class. The inference layer of classification tree ontology is based on SWRL (Semantic Web Rule Language), making a clarify separation of the program component and connected explicit modules. One of the major advantages of the proposed approach is that identifying success factors will give students an awareness of essential features for successful completion of their graduate studies.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"60 1","pages":"222-227"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81993233","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6778998
Kohei Higo, G. Hasegawa, Y. Taniguchi, H. Nakano, Morito Matsuoka
In IEEE 802.16J relay networks, time division multiple access (TDMA) is adopted for sharing wireless network resources while avoiding radio wave interference. Time slot assignment determines the degree of spatial reuse of wireless network resources and radio interference strength, which affects network performance. The relay network performance is also influenced by various factors, such as background noise level, path loss exponent, density of relay nodes, and transmission signal strength. In this paper, we present the results of multiple regression analysis of IEEE 802.16J relay network throughput. We first summarize the network environment parameters that affect the throughput of relay networks and conduct extensive simulation experiments with various sets of parameter values. From the simulation results, we investigate the relative effect of parameters on throughput performance by multiple regression analysis. The analysis results show that background noise level and path loss exponent are the key parameters for determining relay network throughput. We also obtain a regression equation to estimate the throughput with enough accuracy.
{"title":"Multiple regression analysis of IEEE 802.16j relay network throughput","authors":"Kohei Higo, G. Hasegawa, Y. Taniguchi, H. Nakano, Morito Matsuoka","doi":"10.1109/ICACT.2014.6778998","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6778998","url":null,"abstract":"In IEEE 802.16J relay networks, time division multiple access (TDMA) is adopted for sharing wireless network resources while avoiding radio wave interference. Time slot assignment determines the degree of spatial reuse of wireless network resources and radio interference strength, which affects network performance. The relay network performance is also influenced by various factors, such as background noise level, path loss exponent, density of relay nodes, and transmission signal strength. In this paper, we present the results of multiple regression analysis of IEEE 802.16J relay network throughput. We first summarize the network environment parameters that affect the throughput of relay networks and conduct extensive simulation experiments with various sets of parameter values. From the simulation results, we investigate the relative effect of parameters on throughput performance by multiple regression analysis. The analysis results show that background noise level and path loss exponent are the key parameters for determining relay network throughput. We also obtain a regression equation to estimate the throughput with enough accuracy.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"1 1","pages":"437-441"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82183879","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779055
Muhammad Umair, Wan Seok Kim, Byoung Chul Choi, S. Jung
Sensing and computational capabilities in smartphones are enabling attractive new applications in the area of location aware systems. Location aware devices can accurately compute their physical location in the form of latitude and longitude. However places contain much more valuable information to user rather than coordinates. A place is important to a user's personal daily life and carries socially important meanings to a user such as a place where one studies, works, eats, lives etc. GPS enabled devices like smartphones and tablets use location as a context in applications to share their current location. A GPS log of a moving object contains time stamped latitude and longitude information. The discovery of a user's places is a key challenge and involves mapping of GPS data log to meaningful personally important places. In this paper, we propose an algorithm that extracts a user's personally important places from location traces, and evaluate the algorithm with real user's data.
{"title":"Discovering personal places from location traces","authors":"Muhammad Umair, Wan Seok Kim, Byoung Chul Choi, S. Jung","doi":"10.1109/ICACT.2014.6779055","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779055","url":null,"abstract":"Sensing and computational capabilities in smartphones are enabling attractive new applications in the area of location aware systems. Location aware devices can accurately compute their physical location in the form of latitude and longitude. However places contain much more valuable information to user rather than coordinates. A place is important to a user's personal daily life and carries socially important meanings to a user such as a place where one studies, works, eats, lives etc. GPS enabled devices like smartphones and tablets use location as a context in applications to share their current location. A GPS log of a moving object contains time stamped latitude and longitude information. The discovery of a user's places is a key challenge and involves mapping of GPS data log to meaningful personally important places. In this paper, we propose an algorithm that extracts a user's personally important places from location traces, and evaluate the algorithm with real user's data.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"29 1","pages":"709-713"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84671175","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 : 2014-03-27DOI: 10.1109/ICACT.2014.6779041
Jung-Jae Yu, S. Han
This work is aimed at the estimation of the skin region in pornographic images to identify and block the pornographic contents. We propose a novel method to estimate the skin region using simple operation in HSV color space and additional postprocessing to reduce the noise effects. Our method does not require any pre-process such as object detection. It is fast and its result is good enough to be used for fitlering out the clear non-objectionable images before main identification process. So the proposed method can be used as pre-processing for more accurate poronographic image identification process.
{"title":"Skin detection for adult image identification","authors":"Jung-Jae Yu, S. Han","doi":"10.1109/ICACT.2014.6779041","DOIUrl":"https://doi.org/10.1109/ICACT.2014.6779041","url":null,"abstract":"This work is aimed at the estimation of the skin region in pornographic images to identify and block the pornographic contents. We propose a novel method to estimate the skin region using simple operation in HSV color space and additional postprocessing to reduce the noise effects. Our method does not require any pre-process such as object detection. It is fast and its result is good enough to be used for fitlering out the clear non-objectionable images before main identification process. So the proposed method can be used as pre-processing for more accurate poronographic image identification process.","PeriodicalId":6380,"journal":{"name":"16th International Conference on Advanced Communication Technology","volume":"1 1","pages":"645-648"},"PeriodicalIF":0.0,"publicationDate":"2014-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90897332","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
扫码关注我们
求助内容：
应助结果提醒方式：