{"title":"Generating language distance metrics by language recognition using acoustic features","authors":"Le Sun, Roland Hu, Huimin Yu, T. Sluckin","doi":"10.1109/WCSP.2016.7752528","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752528","url":null,"abstract":"A language recognition system is used to build quantitative measure of language distance. The OpenEAR toolkit is used to extract more than 6,000 features per speech sample. The features consist of 56 low level descriptors (LLDs) and their Delta and Delta Delta values, the corresponding 39 functionals. The language model training component is based on the Gentle AdaBoost algorithm. When tested on a group of 10 principally Indo-European languages, the language recognition system performs comparatively to other language recognizers. The UPGMA tree built from the interlanguage distances identifies the major subgroups of Indo-European. Genetic algorithms are also implemented to generate the language map on the 2D plane. Although some errors remain, the obtained language tree and map are indicators of language relationships. We discuss errors in our system and more generally perspectives for the use of sound file classifiers in historical linguistics.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132456776","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}
M. Ding, Ruihui Zhao, K. Koyanagi, Takeshi Tsuchiya, Hiroaki Sawano
{"title":"A Community-based P2P OSNs using broadcast encryption supporting cross-platform with high-security","authors":"M. Ding, Ruihui Zhao, K. Koyanagi, Takeshi Tsuchiya, Hiroaki Sawano","doi":"10.1109/WCSP.2016.7752502","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752502","url":null,"abstract":"Online Social Networks (OSNs) are flourishing such as Facebook and Google+, where people share recent status and personal files with friends. However, security and privacy have become major concerns in existing C/S based OSNs. In this paper, we propose a novel scheme called a Community-based P2P OSNs with Security Enhancement (ComPOSE) that supports cross-platform availability and reputation mechanism in stringent privacy requirements. For the first time, we formulate the privacy issue and design goals for P2P based OSNs. We firstly introduce broadcast encryption into P2P community-based social networks together with hierarchical encryption algorithms in order to decrease the system overhead. In ComPOSE, we employ the Open Directory Project to classify and encode groups. The RESTful web-services help to ensure cross-platform availability and transmission security. As a result, thorough security analysis and performance evaluation on experiments demonstrate that the ComPOSE scheme indeed accords with our proposed design goals.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129637165","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}
Hao Zhou, Xiaoyan Wang, Zhi Liu, Xiaoming Zhao, Yusheng Ji, S. Yamada
{"title":"QoS-aware resource allocation for multicast service over vehicular networks","authors":"Hao Zhou, Xiaoyan Wang, Zhi Liu, Xiaoming Zhao, Yusheng Ji, S. Yamada","doi":"10.1109/WCSP.2016.7752526","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752526","url":null,"abstract":"Quality of service (QoS) constrained multicast service over vehicular networks has considerable benefit for both road safety and entertainment, while the resource allocation problem of it is challenging due to the high mobility of vehicles. In this paper, we manage the vehicle mobility by dividing one scheduling round into multiple segments, and investigate the resource allocation problem to answer the questions of which modulation and coding scheme (MCS) should be adopted for each flow in each segment, and how to schedule the radio resources among all the flows. We consider two kinds of multicast services. For the multicast service to cover all the recipients, we formulate the problem as a resource scheduling problem with fixed MCS profile, and propose a k-commodity packing based approximation algorithm to solve it with low complexity. For the multicast service with adaptive recipients, we notice that the number of valid MCS profiles for each flow is limited, and propose a heuristic algorithm to search for proper MCS profile assignments. The simulation results verify the efficiency of the proposed scheme.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128054784","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":"Speaker localization based on ratio between the second and the first eigenvalue","authors":"Xiaojun Xiong, Haiyan Zhang, Xinwang Wan","doi":"10.1109/WCSP.2016.7752666","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752666","url":null,"abstract":"To locate the position of the speaker, there are many methods, among of them, the method using steered response power is very popular. By phase transform, the steered response method (SRP-PHAT) is robust; with the noise increasing, the performance of the method becomes bad. Using principal eigenvector, the steered response power (SRP-PE) method is better than SRP-PHAT. In this paper, we propose an improved SRP-PE method, which only uses the frequencies with small ratio between the second and the first eigenvalue to estimate the sound source location. Simulation results show that similar to the SRP-PE algorithm, the localization accuracy of the improved SRP-PE method is better than the SRP-PHAT method; moreover, compared to the SRP-PE, the proposed algorithm has lower computational complexity.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115230269","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 nonlinear and non-Gaussian distributed fusion based on Rao-Blackwellized particle filtering","authors":"Jingxian Liu, Zulin Wang, Mai Xu","doi":"10.1109/WCSP.2016.7752599","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752599","url":null,"abstract":"In nonlinear and non-Gaussian multi-sensor fusion scenarios, the Covariance Intersection (CI) algorithm is utilized to fuse estimations from distributed sensors, in which targets are commonly tracked by a family of Particle Filtering (PF) algorithm. Furthermore, standard PF can be replaced by Rao-Blackwellized PF (RBPF) based on linear/nonlinear State Space models to produce more accurate means and variances for CI fusion. Unfortunately, the RBPF algorithm fails in conventional radar systems because their observations contain no information about the linear part of target state. To overcome such an issue, a Kalman Estimation based BRPF (KE-BRPF) algorithm is proposed to form a novel distributed CI fusion. In KE-RBPF, the correlation between linear and nonlinear parts of target state is investigated. Benefitting from this investigation, the linear part of target state is correctly tracked based on the nonlinear one. Finally, the simulations verify that our KE-RBPF-CI fusion outperforms other PF-based CI fusions, in terms of means and deviations.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116761127","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 novel scheme for WSDM based on signal preprocessing","authors":"Jiangong Wang, H. Wei","doi":"10.1109/WCSP.2016.7752752","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752752","url":null,"abstract":"A novel source signal preprocessing method and channel identification algorithm for blind separation were proposed in this paper. In this method, source signals were second-order cyclostationary(SoC) after preprocessing, and this feature was helpful for identifying channel and separating source signals effectively in receiving terminal. We call it pPSoCBSS which is the abbreviation for preprocessing second-order cyclostationary BSS algorithm. pPSoCBSS is a good scheme for Wireless Statistical Division Multiplexing (WSDM). It had three steps: a)source signals preprocessing; b)channel identification; c)source separation. Preprocessing signals has three advantages in identifying channel: more exactly, anti-noise effectively, and without loss in underdetermined case. mathematic analysis and extensive simulation results confirm the validity and high performance of the algorithm. Compared with related algorithms such as JADE and SOBI, pPSoCBSS enjoys better PI performance.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117238377","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":"Credit-aware power control for device-to-device underlaying cellular networks","authors":"Xuejie Zhu, Qinghe Du, Pinyi Ren","doi":"10.1109/WCSP.2016.7752545","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752545","url":null,"abstract":"Social relations between users is a key factor impacting the willingness of users to participate in D2D delivery. However, close social ties and proximity location of users can not always be satisfied due to the time and space limits. In this paper, we introduce social credit to stimulate selfish users for an active D2D communication networks, which is a global and wide social feature measure. Queuing model is used to explicitly characterize the credit constraint. Given the physical communication constraints and social credit constraints, we propose an efficient credit-aware power control scheme for D2D communication promotion. Simulation results show that our proposed scheme can significantly increase the throughput.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121276144","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":"Enhancement of color image based on tone-preserving","authors":"Ya-nan Yang, X. Wang, Feng Liu, Z. Gan","doi":"10.1109/WCSP.2016.7752461","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752461","url":null,"abstract":"Since the lighting conditions in strong contrast regions between the light and dark cant be estimated accurately by traditional center/surround Retinex algorithm, the over-enhancement and color distortion may exist. In view of this, combining with the human visual characteristics, a color image enhancement algorithm based on tone-preserving was proposed. A determination function was added to the bilateral filter to estimate illuminance image more accurately and weaken over-enhancement. According to human visual masking effect, the improved gamma correction was utilized to correct the brightness of illumination image adaptively and the local contrast of reflection image obtained by division was enhanced based on local statistics. Besides, the final enhanced image was obtained by combining illumination image with reflection image, which can make image appear more natural. Compared with other similar algorithms from both subjective and objective aspects, the results show that this method being applied to low-contrast color image enhancement can not only improve image clarity, but reduce color distortion.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127171301","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}
Xin Jin, Sui Yin, Xiaodong Li, Geng Zhao, Zhaohui Tian, Nan Sun, Shuyun Zhu
{"title":"Color image encryption in YCbCr space","authors":"Xin Jin, Sui Yin, Xiaodong Li, Geng Zhao, Zhaohui Tian, Nan Sun, Shuyun Zhu","doi":"10.1109/WCSP.2016.7752646","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752646","url":null,"abstract":"Nowadays, with the development of Internet technology and the improvement of safety awareness, image encryption technique has become very important, especially for color image encryption. The direction of research is focused on the RGB color space. There are few researches in other color spaces, such as HSV, L*a*b*, YCbCr. In this paper, we propose a color image encryption method in YCbCr color space. There is much information in Y channel but little information in Cb and Cr channel. Using this feature, we choose different encryption schemes. We first convert the color space from RGB to YCbCr. Then we encrypt the three channels separately. In Y channel, with Arnold cat map, we can do the preliminary image confusion, and then we use three-dimensional Lu chaotic map to do the further image diffusion. In Cb and Cr channels, we use DNA encoding and 1D Logistic chaotic map. Experimental results show that our color image encryption works well, our method in YCbCr space can compare with the RGB and L*a*b* space, and can resist brute-force attacks, differential attacks. The most prominent point is that the speed of encryption and decryption is much faster.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124735244","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":"Speech reconstruction based on compressed sensing theory using smoothed L0 algorithm","authors":"Haishuang Xue, Linhui Sun, Guozhen Ou","doi":"10.1109/WCSP.2016.7752443","DOIUrl":"https://doi.org/10.1109/WCSP.2016.7752443","url":null,"abstract":"At present, speech signals have good sparsity in frequency domain and discrete cosine transformation (DCT) domain etc. Therefore it can be researched based on compressed sensing (CS). CS compresses signals which are sparse or compressible at the sending end, and then reconstruct them at the receiving end. This paper proposes the compressed speech reconstruction method based smoothed L0 (SL0) algorithm. Simulation results demonstrate that the SL0 algorithm can obtain a better performance than the traditional orthogonal matching pursuit (OMP) method in reconstruction of speech signals.","PeriodicalId":158117,"journal":{"name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125385799","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}