{"title":"High-Precision Visual Localization and Dense Mapping Based on Visual SLAM for Indoor Environment","authors":"Zhentao Yu, Tong Zhou, Yan Su","doi":"10.1109/ICCC47050.2019.9064221","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064221","url":null,"abstract":"Based on the situation of existing methods of indoor visual localization can hardly meet the fast, robust, practical and high-precision localization requirements simultaneously, a high-precision visual localization and dense mapping solution proposed in this paper. The solution possesses the capacity to estimate and optimize the 6-DoF pose and motion trajectory of a camera by adopting three parallel threads: tracking, local mapping and loop closing. Moreover, the method can reconstruct 3D dense map in real time by stitching point cloud module with input RGB-D images. Experiments show the proposed solution achieves excellent performance in terms of pose accuracy (centimeter) and localization speed (30FPS), which satisfies the requirements of indoor robot visual localization and 3D dense mapping with rapidity, preciseness and robustness.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"95 1","pages":"377-381"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76079694","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":"Sparse Matrix Selection for CSR-Based SpMV Using Deep Learning","authors":"Ping Guo, Changjiang Zhang","doi":"10.1109/ICCC47050.2019.9064309","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064309","url":null,"abstract":"CSR (Compressed Sparse Row) is the most popular and widely used sparse matrix representation format for Sparse Matrix-Vector Multiplication (SpMV), which is a key operation in many scientific and engineering applications. However, considering different matrix features and the given GPUs, CSR-based SpMV on some sparse matrices does not always have better performance than that of SpMV based on other sparse matrix formats. In this paper, we explore deep learning techniques and present a methodology to select the proper sparse matrices for CSR-based SpMV on NVIDIA GPUs. To address the challenge of this matrix selection problem, we convert it to a matrix classification problem, then address this classification problem by using the Convolutional Neural Networks (CNN). The effectiveness of our proposed methodology has been demonstrated by our experimental evaluations performed on NVIDIA GPUs.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"89 1","pages":"2097-2101"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74744117","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":"Improvement of Dynamic Hybrid Collaborative Filtering Based on Spark","authors":"Haorui Li, Qiang Huang","doi":"10.1109/ICCC47050.2019.9064416","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064416","url":null,"abstract":"Iterative computation due to the advantage of memory computing framework in Spark big data platform, so This paper applies ALS model recommendation algorithm on Spark platform and improves its calculation method. Considering more practical factors to get more accurate result sets, we first use C-Means clustering to classify data preprocessing, so as to reduce the calculation of redundant data and the sparsity of matrix. Secondly, the cosine similarity and Pearson similarity are applied to improve the user similarity calculation. Finally, a mixed recommendation function is constructed. On the Spark distributed large data platform, this method trains and compares the results offline and real-time through MovieLens data set, which shows that it reduces the computing time, improves the efficiency and accuracy of the algorithm.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"198 1","pages":"8-12"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72937559","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":"An EMD-Based Micro-Doppler Signature for Moving Vehicles Classification","authors":"Shuangyan Zhai, Tong Mao, Bing Hu","doi":"10.1109/ICCC47050.2019.9064359","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064359","url":null,"abstract":"It is vital to discriminate wheeled vehicles and tracked vehicles because of their different role on modern battlefields. Micro-Doppler induced by mechanical vibration or rotation of structures in a radar target is potentially useful for target detection, classification and recognition. In this paper, a feature extraction of micro-Doppler information of vehicle is proposed. Then the signal is decomposed by empirical mode decomposition (EMD), and effective features would be extracted. At last, the SVM classifier is used to classify the moving vehicles.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"37 1","pages":"1322-1326"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74383343","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}
Jingxuan Xu, Hamada Esmaiel, Haixin Sun, Jie Qi, Mingzhang Zhou, Zeyad A. H. Qasem
{"title":"CS-Based Channel Estimation for Underwater Acoustic Time Reversal FBMC System","authors":"Jingxuan Xu, Hamada Esmaiel, Haixin Sun, Jie Qi, Mingzhang Zhou, Zeyad A. H. Qasem","doi":"10.1109/ICCC47050.2019.9064473","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064473","url":null,"abstract":"Channel Estimation in underwater acoustic (UWA) communication is a big challenge, especially for multicarrier transmission. The conventional methods are not suitable to the severe frequency selective fading channel; also current channel estimation techniques used in the multicarrier underwater communication system do not use the sparsity nature of the underwater acoustic channel efficiently. To solve the UWA channel estimation problem, this paper proposes the time reversal compressive sensing (TRCS) channel estimation method used in the Filter Bank Multicarrier (FBMC) system. Converting the selective fading channel to be impulse like channel based on time reversal mirror is employed to improve the performance of compressive sensing (CS) channel estimation technique. In order to take the carrier frequency offset (CFO) effect, a pattern of a preamble symbol is designed. Simulation results demonstrate that the proposed scheme is more robust and performs better bit error performance in a measured underwater channel compared to the conventional methods..","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"117 4 1","pages":"859-864"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72826016","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":"Dynamic Routing in Machine Reading Comprehension","authors":"Y. Duan, Xiaoyu Li, Sunqiang Hu, Yifan Qiu","doi":"10.1109/ICCC47050.2019.9064378","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064378","url":null,"abstract":"Dynamic routing mechanism was introduced by Geoffrey E Hinton et al. in 2017, which is a new information flow mechanism applied in the deep neural networks (Capsule Networks) for the first time, and achieves state-of-the-art performance on MNIST. The typical mark of CapsuleNet “Vector in Vector out” is a natural property in NLP models (word embedding). So, be inspired by this, we introduce the dynamic routing mechanism in NLP tasks. We focus on machine reading comprehension (MRC) task. On MRC tasks, by introducing the dynamic routing mechanism into BiDAF and BERT, our two models DR-BiDAF and DR-BERT were formed. Experiments on SQuAD2.0 dataset and Facebook bAbI project (The (20) QA bAbI tasks) show that the accuracy and robustness of DR-BiDAF and DR-BERT have a significant improvement compared with their counterpart original models. Besides, the process of model training shows that the convergence speed of new models with dynamic routing is faster than original models. It indicates the optimization problem has also been improved.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"28 1","pages":"348-354"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73368651","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":"Jamming Pattern Recognition Using Spectrum Waterfall: A Deep Learning Method","authors":"Yuan Cai, Kai Shi, Fei Song, Yifan Xu, Ximing Wang, Heyu Luan","doi":"10.1109/ICCC47050.2019.9064207","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064207","url":null,"abstract":"It is very important for communication equipment to realize the recognition and prediction of jamming signals in a short time. In the communication environment with variable jamming mode and noise, it is very difficult to achieve rapidly jamming recognition. To solve this problem, this paper constructs a spectrum waterfall containing white gaussian noise signals, designs a jamming pattern recognition method based on deep learning, and realizes rapid recognition of jamming patterns and important parameters. Simulation results show that the training process of this method has considerable accuracy and the test process has high recognition rate.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"7 1","pages":"2113-2117"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73980826","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":"Improved Soft-Assisted Iterative Bounded Distance Decoding for Product Codes","authors":"Wenjie Li, Jun Lin, Zhongfeng Wang","doi":"10.1109/ICCC47050.2019.9064376","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064376","url":null,"abstract":"Product codes are demonstrated as good candidates for the forward error-correction (FEC) codes in fiber-optic communication systems. As a kind of hard decoding, iterative bounded distance decoding (iBDD) is widely adopted by the practical product decoders since it leads to low complexity and power consumption while achieving high net coding gain (NCG). By exploiting the channel reliabilities, soft-assisted iBDD (SA-iBDD) can avoid flipping some bits that are miscorrected and thus it has better decoding performance. In this paper, we propose an improved SA-iBDD for product codes. Based on the hard decoding results and the channel reliabilities, a voting strategy is introduced to judge whether a component codeword should be corrected or not. Compared with the conventional SA-iBDD, the proposed one improves the decoding performance at the cost of negligible complexity increase and without any additional memory requirement.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"27 1","pages":"710-714"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79212065","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}
Xinghui Gao, H. Qi, X. Wen, Wei Zheng, Zhaoming Lu, Zhiqun Hu
{"title":"Energy Detection Adjustment for Fair Coexistence of Wi-Fi and LAA: A Unimodal Bandit Approach","authors":"Xinghui Gao, H. Qi, X. Wen, Wei Zheng, Zhaoming Lu, Zhiqun Hu","doi":"10.1109/ICCC47050.2019.9064394","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064394","url":null,"abstract":"Toward fair coexistence with Wi-Fi, the Listen-Before-Talk (LBT) procedure has been recommended for Licensed-assisted access (LAA) in 3GPP Release 13. The energy detection threshold determines the access opportunity of LAA nodes, which plays a critical role in fairness performance on coexistence network between Wi-Fi and LAA. In this paper, an energy detection dynamic adjustment based on Unimodal Bandits (EDDA-UB) algorithm is proposed to optimize energy detection threshold for LAA eNBs. First, the impact of LAA deployment on Wi-Fi is formulated as the optimal problem with considering the fairness. To solve it, the EDDA-UB algorithm is proposed to learn the optimal energy detection threshold in time varying environment. Simulation results show that the proposed algorithm has a better convergence. Compared with existing constant or adaptive energy detection algorithm, the proposed EDDA-UB algorithm shows the superiority on fair performance and improves the network performance in throughput.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"PP 1","pages":"1086-1091"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84311575","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":"Load Balancing System Based on Virtual Points in High-Density Wireless Local Area Networks","authors":"Yanli Huang, Fang Geng, X. Liang, Sen Mu","doi":"10.1109/ICCC47050.2019.9064068","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064068","url":null,"abstract":"An efficient load balancing scheme based on virtual access points (APs) migration to optimize network throughput is given in this paper. The overloaded virtual AP, together with the corresponding stations (STAs) will be scheduled by the access point controller (AC) to migrate to another light-loaded physical access point (PAP) nearby as soon as load imbalance occurs in high-density wireless local area networks (WLANs). This paper begins with an introduction to the load imbalance, followed by putting forward a new load balancing mechanism with a protocol named APACP in it, and concludes with experiments and analysis. The experiments results indicate that the system performances well and reduce the migration delay effectively.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"19 1","pages":"1208-1213"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84435525","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}