{"title":"Reducing jitter effects for multiband bandpass sampling systems","authors":"Kuan-Chun Chen, S. Tsai","doi":"10.1109/ICDSP.2015.7251897","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251897","url":null,"abstract":"Multiband bandpass sampling techniques have been widely used in Soft Define Radio (SDR) systems. The performance of systems using bandpass sampling is highly affected by jitter effects. This work investigates jitter effects for multiband bandpass sampling systems, and proposes a receiver that applies a two-stage method for combating the jitter effect. At the first stage, a maximum likelihood pilot-aided algorithm is used to estimate and compensate the dominated jitter. Then, at the second stage, we exploit the oversampled property of the received signal and propose a decimate-and-average scheme to further mitigate the residual jitter effect. Simulation results show that the proposed system can significantly reduce the jitter effect.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115687199","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 feasibility analysis of applying NMF in SAR target recognition","authors":"Z. Cao, Rui Min, Y. Pi, Zhengwu Xu","doi":"10.1109/ICDSP.2015.7251970","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251970","url":null,"abstract":"Synthetic Aperture Radar automatic target recognition (SAR ATR) plays an important role both in national defense and civil applications. In this paper, the recognition process via Non-negative Matrix Factorization (NMF) is visualized and analyzed to verify the feasible of applying NMF in SAR ATR. As a matrix decomposition method, NMF can obtain part-based representation, and can be applied in SAR ATR as a pattern recognition feature. However, most of researches don't consider the intrinsic character and the physical meaning of NMF when using it in SAR images. This paper starts from the basic decomposition formulas, explores the physical meaning of the base matrix and the encoding matrix, and obtains the linear relationship between the sample to be recognized and the train samples. The experiments show that NMF can obtain better performance than other pattern features, and can obtain spare representation with practical physical meaning.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591402","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":"Scalable and robust audio fingerprinting method tolerable to time-stretching","authors":"Jacob George, A. Jhunjhunwala","doi":"10.1109/ICDSP.2015.7251909","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251909","url":null,"abstract":"A time-stretching invariant, robust audio fingerprinting method, based on landmarks in the audio spectrogram is proposed in this paper. Time-stretching of audio clips or songs are done to evade copyright detection as most of the fingerprinting techniques are time dependent. Time-stretching is also used in music industry to produce remix & song mash-ups and in multimedia broadcasting to fit content within the required duration. The proposed algorithm is based on the audio hashing of frequency peaks in the spectrogram. It is scalable and tolerant to time-stretching. The experiment results show the method is highly tolerable to time-stretch than the state-of-the-art Shazam's audio fingerprinting.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114775762","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":"Robust nonlinear acoustic echo cancellation using a metaheuristic optimization approach","authors":"H. Merabti, D. Massicotte","doi":"10.1109/ICDSP.2015.7251879","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251879","url":null,"abstract":"Nonlinearities in audio systems are caused by different nonlinear components like amplifiers and speakers. The nature of these impairments makes acoustic echo cancellation (AEC) harder to achieve, requiring the use of advanced and complex algorithms to offer satisfying performance. Adaptive filters in combination with nonlinear mapping schemes like Volterra and Hammerstein are widely used for this purpose. In this work, we address the AEC problem in the presence of severe nonlinear distortion. The proposed method based on metaheuristic optimization uses a genetic algorithm (GA) to estimate the nonlinear function parameters and the room impulse response. The method is compared to a reference technique that uses a sigmoid transform approach in conjunction with the recursive least square (RLS) algorithm. Simulation results show high robustness of the proposed approach to strong nonlinearities and saturation effects compared to the reference method.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122038741","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":"Dictionary learning with log-regularizer for sparse representation","authors":"Zhenni Li, Shuxue Ding, Yujie Li","doi":"10.1109/ICDSP.2015.7251946","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251946","url":null,"abstract":"We propose a fast and efficient algorithm for learning overcomplete dictionary for sparse representation of signals using the nonconvex log-regularizer for sparsity. The special importance of log-regularizer has been recognized in recent studies on sparse modeling. The log-regularizer, however, leads to a nonconvex and nonsmooth optimization problem that is difficult to solve efficiently. In this paper, We propose a method based on a decomposition scheme and alternating optimization that can turn the whole problem into a set of subminimizations of univariate functions, each of which is dependent on only one dictionary atom or the coefficient vector. Although the subproblem with respects to the coefficient vector is still nonsmooth and nonconvex, remarkably, it becomes much simpler and it has a closed-form solution by introducing a novel technique that is log-thresholding operator. The main advantages of the proposed algorithm is that, as suggested by our analysis and simulation study, it is more efficient than state-of-the-art algorithms with different sparsity constraints.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124664692","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}
Shih-Shinh Huang, Feng-Chia Chang, You-Chen Liu, P. Hsiao, Hong-Fa Ho
{"title":"Vision-based crowd pedestrian detection","authors":"Shih-Shinh Huang, Feng-Chia Chang, You-Chen Liu, P. Hsiao, Hong-Fa Ho","doi":"10.1109/ICDSP.2015.7252002","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7252002","url":null,"abstract":"This paper proposes a crowd pedestrian detection based on monocular vision. To handle with the challenges faced in crowded scenes, such as occlusion, this study combines multiple cues to detect individuals in the observed image. Based on the assumptions that the human head is generally visible and background scene is stationary, all circular regions in the segmented foreground mask are firstly extracted by an algorithm called circle Hough transform (CHT). Each circle is then considered as the head candidate and further verified whether it is exactly an individual or a false one by combining multiple cues. Matching a candidate to a several constructed pedestrian templates is firstly applied for verification. Then, two proposed cues called head foreground contrast (HFC) and block color relation (BCR) are incorporated for further verification. In the experiment, three videos are used to validate the proposed method and the results show that the proposed one lowers the false positives at the expense of little detection rate.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125176998","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":"Semiblind channel estimation for OFDM/OQAM systems assisted by zero-valued pilots","authors":"B. Su","doi":"10.1109/ICDSP.2015.7251900","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251900","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) with offset quadrature amplitude modulation (OQAM) has been considered as a potential alternative to the popular OFDM systems using cyclic prefixes (CP) for advantages in bandwidth efficiency. However, most current channel estimation methods for OFDM/OQAM require a considerable amount of pilots or preamble, which could damage such a bandwidth efficiency. In this paper, semiblind channel estimation for OFDM/OQAM systems is studied. The proposed method is based on exploiting the statistical properties of the signal and interference components in the received OQAM signal. Moreover, a scattered set of pilots of zero values is introduced to further improve channel estimation performance. Compared to a recently reported method, the proposed method shows advantages when the available received data for channel estimation is limited, making the proposed method more suitable when the channel coherence time is small. Simulation results verified the advantages of the proposed method.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774921","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 probabilistic characterization of the rumor graph boundary in rumor source detection","authors":"Liang Zheng, C. Tan","doi":"10.1109/ICDSP.2015.7251979","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251979","url":null,"abstract":"Estimation of the source to an epidemic-like spreading has important applications such as rooting out a computer virus in the Internet or rumor spreading in an online social network. Given a snapshot observation of the nodes in the network possessing the malicious information, how to identify the source of the spreading? This problem was first formulated in the seminal work by Shah and Zaman (TIT 2011) as a maximum likelihood estimation problem for a degree-regular graph. In this paper, we provide a probabilistic characterization to the rumor boundary of the observed graph. This leads to a new probabilistic approach of maximum likelihood estimation for a general tree graph that enables a distributed message-passing algorithm. We also evaluate the performance of the message-passing algorithm for finding the rumor center in general graphs numerically.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125167673","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":"Virtual cameraman - An automatic audience recording system","authors":"C. Fang, You-Ting Tsai, Shuan Chu, Sei-Wang Chen","doi":"10.1109/ICDSP.2015.7252001","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7252001","url":null,"abstract":"This study proposed an automatic virtual cameraman system for audiences to save personnel costs and make professional videos with photographic. System equipment includes two PTZ web-cameras which can be located at the right front or the left front of the lecture theatre. These two PTZ cameras have different utilities. One is named full-shot PTZ camera and the other is movement PTZ camera.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128608297","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}
B. Kumbhani, V. Mohandas, Rudra Pratap Singh, S. Kabra, R. S. Kshetrimayum
{"title":"Analysis of space-time block coded spatial modulation in correlated Rayleigh and Rician fading channels","authors":"B. Kumbhani, V. Mohandas, Rudra Pratap Singh, S. Kabra, R. S. Kshetrimayum","doi":"10.1109/ICDSP.2015.7251926","DOIUrl":"https://doi.org/10.1109/ICDSP.2015.7251926","url":null,"abstract":"Space-time block coded spatial modulation (STBC-SM) system is the multiple input multiple output (MIMO) communication system that gives better error performance than space-time block coded (STBC) MIMO system when compared at the same spectral efficiency. It performs better than spatial modulation (SM) MIMO systems. In this paper, we analyze the bit error probability (BEP) of STBC-SM systems over correlated Rayleigh and Rician fading channels. A closed form expression for upper bound on the BEP is derived and evaluated. The analytical results are validated using Monte Carlo simulation results. The performance of STBC-SM system is also compared with STBC systems and SM systems in correlated and uncorrelated fading channels.","PeriodicalId":216293,"journal":{"name":"2015 IEEE International Conference on Digital Signal Processing (DSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129785884","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}