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

2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)最新文献

筛选
英文 中文
Optimal haplotype assembly with statistical pruning 最优单倍型装配与统计修剪
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032339
Shreepriya Das, H. Vikalo
{"title":"Optimal haplotype assembly with statistical pruning","authors":"Shreepriya Das, H. Vikalo","doi":"10.1109/GlobalSIP.2014.7032339","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032339","url":null,"abstract":"Solving the haplotype assembly problem by optimizing the commonly used minimum error correction criterion is known to be NP-hard. For this reason, suboptimal heuristics are often used in practice. In this paper, we propose a novel method for optimal haplotype assembly that is based on depth-first branch-and-bound search of the solution space. Our scheme is inspired by the sphere decodng algorithms used heavily in the field of digital communications. Using the statistical information about errors in sequencing data, we constrain the search of the haplotype space and speedily find the optimal solution to the haplotype assembly problem. Theoretical analysis of the expected complexity of the algorithm shows that optimal haplotype assembly is practically feasible for haplotype blocks of moderate lengths typically obtained using present day high throughput sequencers. The scheme is then tested on 1000 Genomes Project experimental data to verify the efficacy of the proposed method.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"30 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125696114","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 cooperative protocol for spectral-efficient cognitive relay networks 频谱高效认知中继网络的合作协议
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032318
A. Argyriou
{"title":"A cooperative protocol for spectral-efficient cognitive relay networks","authors":"A. Argyriou","doi":"10.1109/GlobalSIP.2014.7032318","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032318","url":null,"abstract":"In this paper we propose a cooperative protocol for cognitive wireless networks that can improve the overall system spectral efficiency when a secondary user (SU) incorrectly transmits over the same resource with the primary user (PU). The interfering transmissions are received at relay nodes, that form the cooperative network, and are decoded with successive interference cancellation (SIC). Depending on the decoding results, each relay applies independently a space-time code (STC) to the result and then the relays forward the coded signals simultaneously. The advantages of the protocol are first that it operates passively without the need for source cooperation, and second that it does not adopt a different mode of cooperation for different average channel conditions. Comparative simulations with a state-of-the-art multi-source transmission protocol reveal that our protocol can minimize the impact of incorrectly detecting a PU transmission from the perspective of the overall system spectral efficiency.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122401081","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
A blind source separation criterion where approximate disjointness meets independent component analysis 近似不相交性满足独立分量分析的盲源分离准则
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032174
M. Souden, Jason Wung, B. Juang
{"title":"A blind source separation criterion where approximate disjointness meets independent component analysis","authors":"M. Souden, Jason Wung, B. Juang","doi":"10.1109/GlobalSIP.2014.7032174","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032174","url":null,"abstract":"This paper proposes a sparseness-based blind source separation (BSS) method. In contrast to conventional approaches, we exploit the sparseness property and the ensuing approximate disjointness of the competing audio signals when represented in the short time Fourier transform domain to determine the linear separating matrix such that its outputs are maximally disjoint. By doing so, we deduce an iterative gradient descent to estimate the optimal separation matrix. Interestingly, the resulting optimization problem is shown to have strong links with independent component analysis using higher order statistics, and shares some similarity with non-stationarity-based BSS. The purpose of the proposed study is to provide some insight into the connection between the seemingly different sparseness and independence-based BSS criteria.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129659459","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
Improved time-domain approaches for locating exons in DNA using zero-phase filtering 基于零相位滤波的DNA外显子定位改进时域方法
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032340
Ismail M. El-Badawy, S. Gasser, M. Khedr, A. Aziz
{"title":"Improved time-domain approaches for locating exons in DNA using zero-phase filtering","authors":"Ismail M. El-Badawy, S. Gasser, M. Khedr, A. Aziz","doi":"10.1109/GlobalSIP.2014.7032340","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032340","url":null,"abstract":"Accurate prediction of exons locations in deoxyri-bonucleic acid (DNA) sequences is an important issue for geneticists. Time-domain periodogram (TDP) and average magnitude difference function (AMDF) are two time-domain approaches previously proposed for this purpose. These two approaches employ a second-order infinite impulse response (IIR) resonant filter as a preprocessing stage so as to emphasize the period-3 behavior exhibited by the exonic segments of DNA strands. The major drawback of IIR filters is their non-linear phase response, which results in a delay distortion experienced by the spectral components of the genomic signal at the filter output. This type of distortion affects the exons prediction accuracy of the TDP/AMDF classifier. This paper proposes the use of zero-phase filtering technique in the preprocessing stage so as to eliminate the phase distortion introduced by the traditional filtering. MATLAB simulation conducted on the ASP67 genomic dataset shows that the proposed modified time-domain approaches using zero-phase filtering reveal better performance, compared with the traditional approaches, in terms of the receiver operating characteristic (ROC) curve, precision-recall curve and F-measure.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129675177","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
Femto-macro co-channel interference coordination via pricing game 基于定价博弈的飞宏同信道干扰协调
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032336
Tong Zhou, Yan Chen, Chunxiao Jiang, K. Liu
{"title":"Femto-macro co-channel interference coordination via pricing game","authors":"Tong Zhou, Yan Chen, Chunxiao Jiang, K. Liu","doi":"10.1109/GlobalSIP.2014.7032336","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032336","url":null,"abstract":"Recently, intercell interference coordination in het-erogenous networks attracts great attention. This paper presents an analytical framework to evaluate time mute scheme in closed access femto and macro co-existent networks. We use stochastic geometry to model the downlink scenario and derive the coverage probability of indoor macro users and femto users. Considering the selfishness of the owners of femtos, we formulate the two-tier interference coordination as pricing game, and obtain the closed-form of Nash equilibrium (NE). Simulation results demonstrate the influences of different parameters on the coverage probability of macro users achieved at the NE of the pricing game.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"95 33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129208335","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
Low SNR — When only decoding will do 低信噪比-只有解码才能做到
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032248
M. Médard, Jinfeng Du
{"title":"Low SNR — When only decoding will do","authors":"M. Médard, Jinfeng Du","doi":"10.1109/GlobalSIP.2014.7032248","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032248","url":null,"abstract":"We investigate the issue of distributed receiver cooperation in a multiple-relay network with memoryless independent fading channels, where the channel state information can't be obtained. The received signals at distributed receiving nodes are first compressed or quantized before being sent to the decoder via rate-limited cooperation channels for joint processing. We focus on the low SNR regime and analyze the capacity bounds using network equivalence theory and a multiple-layer binning peaky frequency shift keying (FSK). When the received signals at the relaying nodes are in low SNR regime and the cooperation rates are not sufficiently high, compressed/quantized observations at relaying nodes become useless and only decoding can help.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130677864","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
Energy-efficient clustering design for M2M communications 面向M2M通信的节能集群设计
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032099
P. Zhang, Guowang Miao
{"title":"Energy-efficient clustering design for M2M communications","authors":"P. Zhang, Guowang Miao","doi":"10.1109/GlobalSIP.2014.7032099","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032099","url":null,"abstract":"Machine-to-machine (M2M) communications in cellular networks enables Internet of Things in the macro geographical regions and is a promising technique in next-generation wireless networks. In this paper, we study energy-efficient clustering design in cellular networks to maximize the overall network battery life time. We propose a new clustering design which finds the optimal number of clusters in a cellular network, and maximizes the network energy efficiency, meanwhile rules of selecting and rotating cluster heads. Different from existing clustering designs, we consider both transmission and circuit energy consumption in this paper. The network performance will be both rigorously analyzed and evaluated using simulations with respect to dead device ratio [1], residual energy, and network life. The simulation results show that by using the proposed clustering approach, the network battery life can be improved significantly.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123375498","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}
引用次数: 17
A system for large-scale analysis of distributed cameras 用于大规模分析分布式摄像机的系统
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032135
Ahmed S. Kaseb, E. Berry, Youngsol Koh, A. Mohan, Wenyi Chen, He Li, Yung-Hsiang Lu, E. Delp
{"title":"A system for large-scale analysis of distributed cameras","authors":"Ahmed S. Kaseb, E. Berry, Youngsol Koh, A. Mohan, Wenyi Chen, He Li, Yung-Hsiang Lu, E. Delp","doi":"10.1109/GlobalSIP.2014.7032135","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032135","url":null,"abstract":"Thousands of cameras are connected to the Internet providing streaming data (videos or periodic images). The images contain information that can be used to determine the scene contents such as traffic, weather, and the environment. Analyzing the data from these cameras presents many challenges, such as (i) retrieving data from geographically distributed and heterogeneous cameras, (ii) providing a software environment for users to simultaneously analyze large amounts of data from the cameras, (iii) allocating and managing computation and storage resources. This paper presents a system designed to address these challenges. The system enables users to execute image analysis and computer vision techniques on a large scale with only slight changes to the existing methods. It currently includes more than 65,000 cameras deployed worldwide. Users can select cameras for the types of analysis they can do. The system allocates Amazon EC2 and Windows Azure cloud instances for executing the analysis. Our experiments demonstrate that this system can be used for a variety of image analysis techniques (e.g. motion analysis and human detection) using 2.7 million images from 1274 cameras for three hours using 15 cloud instances to analyze 141 GB of images (at 107 Mbps).","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123604843","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}
引用次数: 22
Texture similarity using periodically extended and adaptive curvelets 使用周期性扩展和自适应曲线的纹理相似性
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032261
H. Al-Marzouqi, G. Al-Regib
{"title":"Texture similarity using periodically extended and adaptive curvelets","authors":"H. Al-Marzouqi, G. Al-Regib","doi":"10.1109/GlobalSIP.2014.7032261","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032261","url":null,"abstract":"This paper presents a new method for texture based image retrieval. The proposed algorithm uses a periodically extended variant of the curvelet transform. The sum of the absolute value of differences in the mean and standard deviation between curvelet wedges representing the query image and the test image is used as the distance index. Performance improvement is demonstrated using the CUReT database, where the proposed algorithm significantly outperforms previously proposed methods that were based on Curvelet, Gabor, LBP, and wavelet features. We also show that adapting curvelet tiles increases the performance of the proposed method.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113955815","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}
引用次数: 5
Detecting symptoms of diseases in poultry through audio signal processing 利用音频信号处理检测家禽疾病症状
2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP) Pub Date : 2014-12-01 DOI: 10.1109/GlobalSIP.2014.7032298
Brandon T. Carroll, David V. Anderson, W. Daley, Simeon D. Harbert, D. Britton, M. Jackwood
{"title":"Detecting symptoms of diseases in poultry through audio signal processing","authors":"Brandon T. Carroll, David V. Anderson, W. Daley, Simeon D. Harbert, D. Britton, M. Jackwood","doi":"10.1109/GlobalSIP.2014.7032298","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2014.7032298","url":null,"abstract":"We developed an audio signal processing algorithm that detects rales (gurgling noises that are a distinct symptom of common respiratory diseases in poultry). We derived features from the audio by calculating mel frequency cepstral coefficients (MFCCs), clustering the MFCC vectors, and examining the distribution of cluster indices over a window of time. The features are classified with a C4.5 decision tree. Our training data consisted of eight minutes of manually labeled audio selected from 25 days of continuous recording from a controlled study. The experiment group was challenged with the infectious bronchitis virus and became sick, while the control group remained healthy. We tested the algorithm on the entire dataset and obtained results that match the course of the disease. Algorithms such as this could be used to continuously monitor chickens in commercial poultry farms, providing an early warning system that could significantly reduce the costs incurred from disease.","PeriodicalId":362306,"journal":{"name":"2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"21 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113974712","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}
引用次数: 25
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信