{"title":"Segmentation of hand gesture based on dark channel prior in projector-camera system","authors":"Qingrui Zhang, Mingqiang Yang, Qinghe Zheng, Xinxin Zhang","doi":"10.1109/ICCChina.2017.8330336","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330336","url":null,"abstract":"In order to achieve human-computer interaction based on hand gesture in a projector-camera system, an accurate and fast gesture segmentation is necessary. However, it is difficult for traditional method to obtain precise segmentation results because of the complex backgrounds, variable external illumination, and shadows of hand gesture. In this paper, based on the observation of the captured images' dark channel maps, we propose a dark channel prior in the projector-camera system, and thereby putting forward a saliency detection method in this scene. Then a graph-based segmentation method is utilized to refine the saliency map. After integrating the pixel saliency value with regional saliency value and making a segmentation, the hand gesture regions are finally obtained. Experimental results show that the proposed method has an excellent performance, and is reliable against complex illumination and backgrounds in the projector-camera system.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124556613","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}
{"title":"Fast unknown tag identification in large-scale RFID systems","authors":"Yu Fu, Z. Qian, G. Ji, Xin-zhao Gao, Qiao Zhu","doi":"10.1109/ICCChina.2017.8330440","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330440","url":null,"abstract":"Unknown tags appear when tagged objects are newly moved in or wrongly placed in systems. In this paper, we investigate time-efficient protocols for collecting IDs from unknown tags. Consider the influence of unknown tag density on total recognition time, we design a high-density unknown tags identification (HUTI) protocol and a low-density unknown tags identification (LUTI) protocol, which are suitable for dense unknown tags environment and sparse unknown tags environment, respectively. Indicator vectors are constructed to help tags know expected status of selected slots. The difference between the two proposed protocols is the number of indicator vectors to be used. LUTI utilizes two indicator vectors to accurately decide each expected slot status, while HUTI only use one indicator vector to save transmitting time when the number of unknown tags is large. In order to minimize execution time, we conduct investigations on frame length and round count, of which the results are concluded as the optimal setting parameters. Simulation results demonstrate that our protocols outperform related protocols with respect to total execution time.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124569522","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}
Canhuang Dai, Dongjin Xu, Liang Xiao, M. Peng, Limin Sun
{"title":"Collaborative UFH-based anti-jamming broadcast with learning","authors":"Canhuang Dai, Dongjin Xu, Liang Xiao, M. Peng, Limin Sun","doi":"10.1109/ICCChina.2017.8330489","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330489","url":null,"abstract":"Uncoordinated frequency hopping (UFH) technique has been developed to address smart jamming attacks in wireless networks, in which the receiver does not need to know the pre-shared physical-layer secret keys such as the frequency hopping pattern with the transmitter and thus cannot be efficiently blocked by smart jammers that eavesdrop the public control channel of the network. However, collaborative UFH-based broadcast (CUB) that exploits both the spatial and frequency diversity still suffers from a low communication efficiency, because the probability that a receiver happens to use the same channel with a transmitter with a random channel selection is very low. In this paper, we propose a collaborative UFH-based broadcast scheme based on reinforcement learning to further improve the communication efficiency against smart jamming. More specifically, by applying Q-learning algorithm, a radio node can achieve the optimal transmit strategy via trials in the repeated game without being aware of the jamming model and the network model. Simulation results show that the Q-learning based anti-jamming broadcast can significantly decrease the broadcast delay and reduce the total energy cost, compared with the CUB scheme.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121168801","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}
{"title":"Wireless channel modeling through automatic stereoscopic warehouse in industrial Internet","authors":"Qihan Zhang, Lei Guo, Weigang Hou, Mengru Wu","doi":"10.1109/ICCChina.2017.8330374","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330374","url":null,"abstract":"The development of the Industrial Internet is getting faster and faster. In order to store and retrieve different goods during various processes, the automatic stereoscopic warehouse supporting the wireless communication in its control system is introduced. However, frequent operations such as stacker crane addressing, storing or retrieving goods pose higher real-time and accurate demand for the wireless communication through the automatic stereoscopic warehouse. For this end, we model the wireless channel between the stacker crane and the console converged optical through the automatic stereoscopic warehouse, by virtue of the Finite-Difference Time-Domain (FDTD) method. The simulation results demonstrate that the received waveform performs serious magnitude and distortion, even higher attenuation value compared to the free-space loss used in most protocols. The simulation results are closer to the actual value in real industrial site.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128921044","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}
D. Wu, Shushan Si, Honggang Wang, Ruyang Wang, Junjie Yan
{"title":"Social influence aware sybil detection in social networks","authors":"D. Wu, Shushan Si, Honggang Wang, Ruyang Wang, Junjie Yan","doi":"10.1109/ICCChina.2017.8330345","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330345","url":null,"abstract":"Based on the behavior analysis, a Sybil detection mechanism for social networks is proposed in this paper. We calculate the influence of nodes according to static similarity and dynamic similarity, and then identity the suspect nodes. Next, the Hidden Markov Model is adopted to infer the true identity of suspect nodes from their abnormal behaviors, thus the Sybil can be more precisely detected. Results show the proposed mechanism can effectively improve the recognition rate, reduce the false detection rate of the Sybil and protect the privacy and interests of social individuals better.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128442278","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}
{"title":"A reduced-complexity differential recursive detection scheme for multiple-symbol differential detection of DDPSK","authors":"Kaiming Liu, Zheyu Xue, Yuan’an Liu, G. Xie","doi":"10.1109/ICCChina.2017.8330510","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330510","url":null,"abstract":"The Double Differential Phase Shift Keying (DDPSK) is almost immune to frequency offset, which makes it ideal for communication in high dynamic environments. However, it suffers from significantly high complexity when using the Multiple-symbol differential detection (MSDD) to get better performance. A Reduced-Complexity Differential Recursive Detection (RC-DRD) scheme is proposed for MSDD in DDPSK system. By comparing with the maximum likelihood detection sequence as well as operating iteratively, it only needs M searches to detect a phase for M-ary DDPSK signals while much more are needed in conventional MSDD. Moreover, it can be used in multivariate optimization problems, which is very meaningful. The simulation results show that it improves performance and get lower bound with very low complexity.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128503386","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}
Qian Zhou, Baoling Liu, Fangyuan Zhou, Zhi Zhang, Nan Ma
{"title":"An energy efficient target tracking algorithm based on triangular cluster in WSNs","authors":"Qian Zhou, Baoling Liu, Fangyuan Zhou, Zhi Zhang, Nan Ma","doi":"10.1109/ICCChina.2017.8330503","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330503","url":null,"abstract":"Energy efficiency is a critical issue for mobile target tracking in wireless sensor networks, which typically consist of small-sized battery-operated devices with limited processing capability. Clustering techniques are widely adopted for target tracking in large-scale sensor networks to reduce energy consumption and delay. In this paper, we propose an energy efficient target tracking algorithm, called triangular cluster-based target tracking (TCTT). However, clustering based target tracking suffers from the boundary problem caused by insufficient switch among clusters when the target moves close to the boundary. To overcome the boundary problem, we propose a cluster transforming mechanism to prevent loss of the target. To reduce the complexity of accurately locating the target position, we employ the gray model prediction algorithm with wavelet denoising. Through simulation results, we show that our proposed scheme achieves better energy efficiency compared with other typical target tracking algorithms.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115749980","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}
Shuangshuang Han, P. Zhang, Feijin Shi, Dongpu Cao, Feiyue Wang
{"title":"Low-complexity detection for multi-antenna differential unitary space-time modulation systems","authors":"Shuangshuang Han, P. Zhang, Feijin Shi, Dongpu Cao, Feiyue Wang","doi":"10.1109/ICCChina.2017.8330463","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330463","url":null,"abstract":"As known, conventional sphere detection (SD) obtains lower computational complexity compared to the optimal maximum-likelihood (ML) detection. However, its computational complexity is still high especially for low Signal-to-Noise Ratio (SNR) region. Therefore, in this paper, a new low-complexity sphere detection algorithm is proposed for differential unitary space-time modulation systems with multiple antennas. The main idea of the proposed algorithm is to constraint the searching radius of the sphere by a heuristic SNR-dependent factor. The use of this factor provides a much reduced computational complexity and a near-optimal performance, and it keeps the complexity low over the entire range of SNRs. Furthermore, the benefits are expected to be more and more evident and useful with the increasing number of antennas, i.e., massive multiple-input multiple-output (MIMO) systems. Finally, the simulation results further demonstrate the advantages of the proposed low-complexity detection algorithm.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114313413","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}
Chenfei Yang, Dapeng Li, Bo Huang, Feng Tian, Haitao Zhao, Changyu Liu
{"title":"Distributed renewable energy allocation for cellular backhaul with price sensitive users","authors":"Chenfei Yang, Dapeng Li, Bo Huang, Feng Tian, Haitao Zhao, Changyu Liu","doi":"10.1109/ICCChina.2017.8330506","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330506","url":null,"abstract":"This paper considers the problem of renewable energy allocation for a cellular backhaul network where the wireless operator can request renewable energy from multiple renewable power suppliers (RPSs) to serve the end users. The problem is formulated as a Stackelberg game between the leader (the wireless operator) and multiple followers (RPSs). Efficient distributed algorithms are proposed to find the RPSs' unique equilibrium pricing scheme and the operator's optimal energy storage and service price decisions. Our analysis provides the important observation that direct competition between RPSs on the same backhaul node will induce the operator to store more energy and can thus improve the revenues of both the operator and the RPSs. Furthermore, we consider that RPSs along the backhaul may form coalitions when they sell energy to the wireless operator. A distributed algorithm is proposed to obtain the Nash stable coalition structure and the corresponding energy pricing strategy for each coalition. Finally, simulation results are presented to compare the solutions of the competitive model and the cooperative model. We show that forming coalitions between RPSs benefits both the RPSs and the operator.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115328066","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}
Jiejiao Tian, Ying-Chang Liang, Xin Kang, Gang Yang
{"title":"Eavesdropping via pilot relay attack","authors":"Jiejiao Tian, Ying-Chang Liang, Xin Kang, Gang Yang","doi":"10.1109/ICCChina.2017.8330342","DOIUrl":"https://doi.org/10.1109/ICCChina.2017.8330342","url":null,"abstract":"In this paper, we propose a new type of attack from the perspective of the eavesdropper. The full-duplex eavesdropper acts as a relay in the uplink channel estimation phase forwarding the received pilot signal from legitimate receiver to confound the legitimate transmitter. Compared to pilot spoofing attack, which needs the eavesdropper to know the pilot signal accurately, the pilot relay attack only needs the eavesdropper to know the frame structure of the legitimate transceiver pair. In this paper, we study the optimal amplify-and-forward strategy of the eavesdropper so that its eavesdropping behavior is harder to be detected by maximizing the transmission rate from the legitimate transmitter to the legitimate receiver under the constraint that the eavesdropping rate is larger than the legitimate transmission rate. Furthermore, we analyze the performance of the pilot relay attack when Eve is at different locations, the simulations have shown that different strategies should be adopted at different locations.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121696784","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}