发布求助
文献互助 智能选刊 最新文献

2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)最新文献

筛选
英文 中文
Cooperative spectrum sensing with censoring of cognitive radios and improved energy detector under majority logic fusion 多数逻辑融合下认知无线电滤波协同频谱感知与改进型能量探测器
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335607
S. Nallagonda, S. Sudheer, S. D. Roy, S. Kundu
{"title":"Cooperative spectrum sensing with censoring of cognitive radios and improved energy detector under majority logic fusion","authors":"S. Nallagonda, S. Sudheer, S. D. Roy, S. Kundu","doi":"10.1109/ICSPCC.2012.6335607","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335607","url":null,"abstract":"In this paper, performance of cooperative spectrum sensing (CSS) has been assessed in the presence of Rayleigh fading. Cognitive radio (CR) users which employ improved energy detectors (IEDs) are censored depending on the quality of radio channels between them and a fusion center (FC). A training based channel estimator is used at the FC to estimate the fading coefficients characterizing the channels between the CRs and the FC. The CRs utilize selection combining (SC) of the decision statistics obtained by IEDs with multiple antennas for making hard decisions about the presence of primary user (PU) and transmit the information to the FC using BPSK signaling if the CR is selected to transmit. The majority logic fusion is applied at the FC for estimating the performance in terms of missed detection and total error probability for both perfect and imperfect channel estimation under different channel and network parameter conditions.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122561503","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}
引用次数: 6
Optimal training design for channel estimation in inhomogeneous distributed sensor networks 非均匀分布式传感器网络信道估计的最优训练设计
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335682
Li Zhang, Xinyuan Wang, Yue Pan
{"title":"Optimal training design for channel estimation in inhomogeneous distributed sensor networks","authors":"Li Zhang, Xinyuan Wang, Yue Pan","doi":"10.1109/ICSPCC.2012.6335682","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335682","url":null,"abstract":"This paper investigates the optimal training design for channel estimation in an inhomogeneous distributed sensor network, which is used to estimate a unknown parameter. The training design includes the power allocated for each sensor and the power scheduling between training pilots and sensor observations. In addition to the total power constraint on all the sensors, we introduce individual power constraint for each sensor, which reflects the practical scenario where all sensors are separated from one another. Since the final average mean square error (MSE) depends on the unknown parameter, a lower bound of the MSE is derived to compensate the channel estimation error (CEE). The Multilevel and “cave” waterfilling type solutions are proposed for the optimal training design to minimize the lower bound MSE, with only the sum power constraint and both the sum and individual power constraints, respectively. Simulation results demonstrate the performance of the proposed training design.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114444039","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}
引用次数: 0
A novel block SLM scheme for PAPR reduction of OFDM systems 一种用于OFDM系统PAPR降低的分组SLM方案
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335669
Ping-You Lin, Jung-Shan Lin
{"title":"A novel block SLM scheme for PAPR reduction of OFDM systems","authors":"Ping-You Lin, Jung-Shan Lin","doi":"10.1109/ICSPCC.2012.6335669","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335669","url":null,"abstract":"This paper proposes a novel block selected mapping (SLM) scheme to obtain better PAPR reduction performance with lower computational complexity compared with conventional SLM strategy. The proposed algorithm is capable of partitioning the OFDM symbol sequence into several blocks multiplied by various phase rotation sequences in frequency domain, and further employs appropriate combination of block signals to create more alternative OFDM signal sequences. As a result, with the same phase rotation sequences, our proposed scheme has the potentials to provide better PAPR reduction performance with lower computational complexity. In addition, the PAPR reduction performance could be further enhanced with more partition blocks.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114516616","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}
引用次数: 0
AVS 3D video streaming system over internet 互联网上的AVS 3D视频流系统
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335735
Baicheng Xin, Ronggang Wang, Zhenyu Wang, Wenmin Wang, Chenchen Gu, Quanzhan Zheng, Wen Gao
{"title":"AVS 3D video streaming system over internet","authors":"Baicheng Xin, Ronggang Wang, Zhenyu Wang, Wenmin Wang, Chenchen Gu, Quanzhan Zheng, Wen Gao","doi":"10.1109/ICSPCC.2012.6335735","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335735","url":null,"abstract":"The progresses on PC based 3D video display technology have made it feasible to provide 3D video streaming service over internet. Compared with 2D video streaming, 3D video streaming system demands more network bandwidth, computing power, and more complex transmission mechanism. There are rarely online 3D video services. In this paper, we describe a 3D video streaming services developed by our team cooperated with CNTV and NVIDIA. The main features of the proposed system are high compression performance of 3D video with low complexity both on processing and transmission. The system has been used to distribute 3D content for the 16th Asian Games Guangzhou.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114234970","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}
引用次数: 7
On the design and implementation of a high definition multi-view intelligent video surveillance system 介绍了一种高清晰度多视点智能视频监控系统的设计与实现
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335739
Shengyao Zhang, S. Chan, R. Qiu, K. Ng, Y. Hung, W. Lu
{"title":"On the design and implementation of a high definition multi-view intelligent video surveillance system","authors":"Shengyao Zhang, S. Chan, R. Qiu, K. Ng, Y. Hung, W. Lu","doi":"10.1109/ICSPCC.2012.6335739","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335739","url":null,"abstract":"This paper proposes a distributed architecture for high definition (HD) multi-view video surveillance system. It adopts a modular design where multiple intelligent Internet Protocol (IP)-based video surveillance cameras are connected to a local video server. Each server is equipped with storage and optional graphics processing units (GPUs) for supporting high-level video analytics and processing algorithms such as real-time decoding and tracking for the video captured. The servers are connected to the IP network for supporting distributed processing and remote data access. The DSP-based surveillance camera is equipped with real-time algorithms for streaming compressed videos to the server and performing simple video analytics functions. We also developed video analytics algorithms for security monitoring. Both publicly available data set and real video data that are captured under indoor and outdoor scenarios are used to validate our algorithms. Experimental results show that our distributed system can support real-time video applications with high definition resolution.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126447025","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}
引用次数: 11
Performance comparison of JPEG compressed domain image retrieval techniques JPEG压缩域图像检索技术的性能比较
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335725
David Edmundson, G. Schaefer
{"title":"Performance comparison of JPEG compressed domain image retrieval techniques","authors":"David Edmundson, G. Schaefer","doi":"10.1109/ICSPCC.2012.6335725","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335725","url":null,"abstract":"Although content-based image retrieval (CBIR) has been an active research area for more than two decades, relatively little work takes into account that virtually all images exist in compressed form, mostly in (lossy) JPEG format. In this paper, we benchmark eight state-of-the-art CBIR algorithms that operate directly in the compressed domain of JPEG by performing retrieval based on DCT coefficients. We analyse their performance on a benchmark dataset, compare them against common pixel-domain techniques, investigate whether they are affected by compression ratio, and measure their computational complexity. We conclude that several of the JPEG CBIR techniques allow much faster feature calculation and faster image retrieval, while providing retrieval performance similar to common pixel-domain algorithms.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131895093","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}
引用次数: 18
Mapping Loops of multimedia algorithms for Coarse-grained reconfigurable architectures 面向粗粒度可重构体系结构的多媒体算法映射回路
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335722
Ziyu Yang, Peng Zhao, Guanwu Wang, Sikun Li
{"title":"Mapping Loops of multimedia algorithms for Coarse-grained reconfigurable architectures","authors":"Ziyu Yang, Peng Zhao, Guanwu Wang, Sikun Li","doi":"10.1109/ICSPCC.2012.6335722","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335722","url":null,"abstract":"Coarse-Grained Reconfigurable Architectures (CGRAs) are widely used as coprocessors to accelerate data-intensive applications. However, the parallelization of sequential programs and the optimization of critical loops are still challenging issues, since the access delay introduced by the massive memory accesses contained in those loops has become the bottleneck of CGRA's performance. In this paper we focus on the parallel optimization of applications by considering the critical loops mapping under the CGRA's resource constraints. We first propose a novel approach to parallelize loops by multi-level tilling. Then a genetic algorithm is introduced to schedule tiled loops with memory-aware object functions. Data locality and communication cost are optimized during the parallel processing as well. Experimental results show that our approach can generate more effective parallel tasks to improve the data locality and load-balanced execution, while obtains 9.6% better speedup compared with the memory-unaware parallel processing.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132598732","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}
引用次数: 1
Robust minimum sidelobe beamforming in mode space for circular arrays 圆形阵列模式空间鲁棒最小旁瓣波束形成
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335704
Yong Wang, Yixin Yang, Yuanliang Ma, Xiaoyu Wang
{"title":"Robust minimum sidelobe beamforming in mode space for circular arrays","authors":"Yong Wang, Yixin Yang, Yuanliang Ma, Xiaoyu Wang","doi":"10.1109/ICSPCC.2012.6335704","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335704","url":null,"abstract":"Beamformer with low sidelobe is important in many applications, but its performance will degrade in the presence of errors in sensor array characteristics, such as position, gain and phase errors. White noise gain constraint is always used to improve the robustness, but it is not clear how to choose the related parameters according to the given level of errors. The robust method based on worst-case performance optimization can use the a priori knowledge of the error levels, but not sufficiently. The bounds of the manifold vector uncertainty set cannot be easily obtained. In this paper, a feasible way is used to derive the bounds considering the errors in sensor array characteristics together, and then a robust minimum sidelobe beamforming method based on worst-case performance optimization in mode space for circular arrays is presented. This problem can be transformed to convex optimization and solved by second-order cone programming. Simulation results show the computation load of this method is effectively reduced and the results are more reliable.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130788690","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}
引用次数: 3
An optimized parametric model for the simulation of reverberant microphone signals 混响传声器信号仿真的优化参数模型
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335733
S. Gergen, C. Borß, N. Madhu, R. Martin
{"title":"An optimized parametric model for the simulation of reverberant microphone signals","authors":"S. Gergen, C. Borß, N. Madhu, R. Martin","doi":"10.1109/ICSPCC.2012.6335733","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335733","url":null,"abstract":"In 2011, Borß introduced a parametric model for the design of virtual acoustics, which creates a natural sounding virtual environment for applications requiring virtualization e.g., in teleconferencing systems and computer games. In this work we refine this model to make it applicable for the simulation of room acoustics and reverberation to aid in the development of single- and multi-channel audio signal enhancement systems. The model takes early reflections with a frequency-dependent attenuation and the diffuse character of late reverberation with its coherence characteristics into account and provides predefined rooms and reverberation times according to a norm defined by the German Institute for Standardization, to ensure a high degree of realism and usability. Compared to the standard image source model for generating virtual acoustics, the proposed system generates a more realistic virtual acoustic environment.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618235","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}
引用次数: 8
Robot audition for dynamic environments 动态环境的机器人试镜
2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012) Pub Date : 2012-10-22 DOI: 10.1109/ICSPCC.2012.6335729
K. Nakadai, G. Ince, K. Nakamura, H. Nakajima
{"title":"Robot audition for dynamic environments","authors":"K. Nakadai, G. Ince, K. Nakamura, H. Nakajima","doi":"10.1109/ICSPCC.2012.6335729","DOIUrl":"https://doi.org/10.1109/ICSPCC.2012.6335729","url":null,"abstract":"This paper addresses robot audition for dynamic environments, where speakers and/or a robot is moving within a dynamically-changing acoustic environment. Robot Audition studied so far assumed only stationary human-robot interaction scenes, and thus they have difficulties in coping with such dynamic environments. We recently developed new techniques for a robot to listen to several things simultaneously using its own ears even in dynamic environments; MUltiple SIgnal Classification based on Generalized Eigen-Value Decomposition (GEVD-MUSIC), Geometrically constrained High-order Decorrelation based Source Separation with Adaptive Step-size control (GHDSS-AS), Histogram-based Recursive Level Estimation (HRLE), and Template-based Ego Noise Suppression (TENS). GEVD-MUSIC provides noise-robust sound source localization. GHDSS-AS is a new sound source separation method which quickly adapts its sound source separation parameters to dynamic changes. HRLE is a practical post-filtering method with a small number of parameters. ENS estimates the motor noise of the robot by using templates recorded in advance and eliminates it. These methods are implemented as modules for our open-source robot audition software HARK to be easily integrated. We show that each of these methods and their combinations are effective to cope with dynamic environments through off-line experiments and on-line real-time demonstrations.","PeriodicalId":147514,"journal":{"name":"2012 IEEE International Conference on Signal Processing, Communication and Computing (ICSPCC 2012)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124328833","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}
引用次数: 34
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书