{"title":"Fisher vectors in PLDA speaker verification system","authors":"Zbynek Zajíc, M. Hrúz","doi":"10.1109/ICSP.2016.7878044","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7878044","url":null,"abstract":"The goal of this paper is to examine the Fisher Vector and incorporate this vector in the PLDA based speaker verification system. The PLDA based system utilizes the Supervector of Statistics extracted from a Gaussian Mixture Model (adopted from the speaker adaptation task) to collect the information about a speaker from a dataset. We compare the efficiency of the PLDA based speaker verification system using Supervector of Statistics and the same system with Fisher vector. The experimental results of these two approaches to the verification task and the fusion of these two systems indicate that the Fisher Vector brings almost the same information to the PLDA verification process as the Supervector of Statistics when sufficient data are available.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122994392","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":"Probing signal design for MIMO radar: A Riemannian distance approach","authors":"Y. Zhou, J. Xu, K. Wong, T. Davidson","doi":"10.1109/ICSP.2016.7878100","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7878100","url":null,"abstract":"We consider the problem of designing probing signals for a Multi-Input Multi-Output (MIMO) radar. The goal is to design a signal vector with a desired covariance while ensuring the side-lobes of the ambiguity functions are small. We will also consider cases in which a bandwidth constraint is placed on the signal. Since covariance matrices are structurally constrained, they form a manifold in the signal space. Hence, we argue that the difference between these matrices should not be in terms of the conventional Euclidean distance (ED), rather, the distance should be measured along the surface of the manifold, i.e., in terms of Riemannian distance (RD). In either case, the optimization problem is quartic in the design variables. An efficient algorithm based on iterative convex quadratic optimization is developed and is effective in producing good solutions. In addition, we show that by optimizing over the manifold, the number of iterations can be significantly reduced in comparison to optimizing in the Euclidean space. Several orthonormal signal sets, including the Walsh functions, the cosine functions and the WLJ functions, are employed to design the transmission signal vector, giving us different feasible regions in the optimization. It is observed that the WLJ othornormal basis yields feasible solutions under tight time-frequency constraints.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115288478","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}
W. Mengmeng, Tian Chun-na, G. Xinbo, Li Minglangjun
{"title":"Robust tracking by selecting object-related candidates with deep features","authors":"W. Mengmeng, Tian Chun-na, G. Xinbo, Li Minglangjun","doi":"10.1109/ICSP.2016.7877854","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7877854","url":null,"abstract":"In this paper, we propose an effective visual tracking method based on candidates selected by deep features and CNSGM. Higher level deep features contain semantic information, which enables the tracker focus more on the target than on the background. A certain convolutional layer contains many neurons. Different neurons response different things in the image. We pick the neuron has larger response on the target to select the object-related candidates for CNSGM, which can reduce the calculation load on local sparse representation in CNSGM to improve tracking speed by around 6 times. Turn out the deep features can also improve the tracking accuracy by choosing the object-related candidates. Experiment results on TB-76 video database proved that the proposed method has better performance in general.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116727","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}
Dan Liu, Yinsheng Liu, Z. Zhong, Deshan Miao, Zhuyan Zhao, Hao Guan
{"title":"5G uplink performance of filter bank multi-carrier","authors":"Dan Liu, Yinsheng Liu, Z. Zhong, Deshan Miao, Zhuyan Zhao, Hao Guan","doi":"10.1109/ICSP.2016.7878022","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7878022","url":null,"abstract":"One of 5G communication typical scenarios is machine-to-machine communication with large number of devices, which proposes new requirements for uplink transmission. Filter bank multi-carrier with offset quadrature amplitude modulation (FBMC/OQAM) is one of the popular nonorthogonal waveform candidates for 5G transmission. In this paper, FBMC/OQAM and cyclic prefix OFDM with single antenna settings are comprehensively evaluated and compared in uplink transmission form four aspects: power spectral density, timing and frequency misalignments, guard bands between adjacent users and time efficiency. At last, our comparison results show that FBMC is more suitable for 5G uplink multi-user asynchronous transmissions than CP-OFDM.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116791629","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":"Towards a simplified cardiac fiber architecture — Multiscale fiber merging","authors":"Hongying Li, M. Robini, Feng Yang, Yuemin M. Zhu","doi":"10.1109/ICSP.2016.7877791","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7877791","url":null,"abstract":"Cardiac tractography consists in generating fiber paths for representing and visualizing cardiac fiber architecture. In this process, a large redundant number of fiber paths are usually generated in order to cover the whole myocardium. However, it is difficult to render and visualize dense fibers, and this poses problems for further qualitative and quantitative analysis of cardiac fiber structure. We propose a sparse cardiac fiber structure representation to highlight the main cardiac architecture and perform effective visualization and quantitative analysis. To this end, a fiber oriented approach, called fiber merging, is developed that allows us to obtain simplified cardiac fiber architecture. Fiber merging is achieved by averaging and connecting fiber segments according to a cell grid. Experiments on real cardiac data show that the produced simplified fiber architecture can highlight the cardiac fiber configuration.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117258425","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":"The discarding points-FBLMS algorithm in PBR","authors":"Yuping Zhang, Chao Yuan, Qiang Chen, Yunjie Li","doi":"10.1109/ICSP.2016.7877858","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7877858","url":null,"abstract":"This paper deals with the problem of clutter cancellation in passive bistatic radar (PBR), the cancellation performance of the frequency-domain block least-mean-square (FBLMS) algorithm is limited in presence of the clutter ahead of the reference signal. In order to address it, the discarding point-FBLMS (DP-FBLMS) algorithm is proposed, which discards appropriate points of the reference signal, and combine the original echo signal to perform FBLMS algorithm. Furthermore, the criterion used for discarding point is also given. In order to not affect subsequent target detection, the original reference signal and cancellation output are fed to cross-correlation process. Finally, the effectiveness of the proposed method has been verified by simulated data and real-life data.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120946342","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 palmprint ROI extraction method for mobile devices in complex environment","authors":"Tingting Chai, Shenghui Wang, Dongmei Sun","doi":"10.1109/ICSP.2016.7878045","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7878045","url":null,"abstract":"Palmprint ROI (Region of Interest) extraction is an important procedure in palmprint recognition or authentication which mainly aims to obtain standardized images for feature extraction and matching. ∗Locating contactless palmprint ROI in complex environment is a challenging work because of unstable external factors and relaxed operation environment. As to mobile palmprint recognition, the inherent problems mainly focus on hand postures, complex background, illumination variation and restricted processing capability. In this paper, a new palmprint ROI extraction (PRE) method is proposed which uses the modified convexity theory. PRE method abandons typical edge detection, centroid and coordinate procedure. Verification experiments on contactless palmprint databases demonstrate that PRE method is feasible and effective for mobile palmprint ROI extraction.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121343834","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}
Han Yu, Wang Zhenyong, Liang Dezhi, Guo Qing, Li Jie
{"title":"A novel multi-dimensional constellation design method based on lattices for sparse code multiple access","authors":"Han Yu, Wang Zhenyong, Liang Dezhi, Guo Qing, Li Jie","doi":"10.1109/ICSP.2016.7878029","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7878029","url":null,"abstract":"Sparse Code Multiple Access (SCMA), as a new non-orthogonal multiple access scheme, achieves the good performance to access to massive information. Shaping gain of a multi-dimensional constellation is the main source of the performance improvement. However, when the number of constellation points is large, the process of the constellation design is too complex. In this paper, a novel multidimensional constellation design method based on lattices is proposed. The constellation with spherical boundary, which has the largest shaping gain, is designed and correspondingly a simplified optimization algorithm is proposed. We present the capacity of the constrained constellation on the AWGN channel. Experimental results show that the proposed constellation design method reduces the average transmit power. In addition, compared to orthogonal frequency division multiple access (OFDMA), the performance of the system is improved.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121353065","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":"CRB for joint estimation of moving target in distributed phased array radars on moving platforms","authors":"Ziyang Cheng, Zishu He, Xuejing Zhang","doi":"10.1109/ICSP.2016.7878068","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7878068","url":null,"abstract":"In this paper, we investigate the location and velocity joint estimattion performance for distributed radars on moving platforms, each platform is equipped with phased array radar. The distributed radars system can be inplemented as non-coherent MIMO radar. Firstly, this paper presents maximum likelihood estimation of location and velocity, and then the Cramer-Rao bound for location and velocity joint estimation are derived. We analyze the influnce of the signal bandwith and observation time on estimation performance. Simulation results are provided to verify the correctness of Cramer-Rao bound derivation.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127075360","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":"Mobile phone-based internet of things human action recognition for E-health","authors":"Jiao Bao, Mao Ye, Yumin Dou","doi":"10.1109/ICSP.2016.7877972","DOIUrl":"https://doi.org/10.1109/ICSP.2016.7877972","url":null,"abstract":"Human action recognition plays an important role in E-health, such as risk assessment, disease treatment, rehabilitation and so on. We proposes a mobile phone-based internet of things method for human action recognition. In the work, data are collected from a smart phone worn on the waist and transmitted to the application server on the internet. The application server program cuts these data into segments of 128 samples with 50% overlap. And each segment is embedded into a 6-dimensional pseudo phase space, then a geometric template matching algorithm is applied to classify them into different actions. Last, Bayesian principle and voting rule are combined to confuse the results of the k-nearest neighbor classifiers. Experimental results on UCI HAR datasets show that this method can obtain a significant improvement in accuracy compared with the traditional SVM methods.","PeriodicalId":234499,"journal":{"name":"2016 IEEE 13th International Conference on Signal Processing (ICSP)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124953910","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}