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

2013 IEEE Global Conference on Signal and Information Processing最新文献

筛选
英文 中文
Global image editing using the spectrum of affinity matrices 使用亲和矩阵谱的全局图像编辑
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737005
Hossein Talebi Esfandarani, P. Milanfar
{"title":"Global image editing using the spectrum of affinity matrices","authors":"Hossein Talebi Esfandarani, P. Milanfar","doi":"10.1109/GlobalSIP.2013.6737005","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737005","url":null,"abstract":"In this work we introduce a new image editing tool, based on the spectrum of a global filter computed from image affinities. Recently, we have shown that the global filter derived from a fully connected graph representing the image, can be approximated using the Nyström extension [1]. This filter is computed by approximating the leading eigenvectors of the filter. These orthonormal eigenfunctions are highly expressive of the coarse and fine details in the underlying image, where each eigenvector can be interpreted as one scale of a data-dependent multiscale image decomposition. In this filtering scheme, each eigenvalue can boost or suppress the corresponding signal component in each scale. Our analysis shows that the mapping of the eigenvalues by an appropriate polynomial function endows the filter with a number of important capabilities, such as edge-aware sharpening, denoising and tone manipulation.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"36 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132467592","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
Two-hop networks with energy harvesting: The (non-)impact of buffer size 具有能量收集的两跳网络:缓冲区大小的(非)影响
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736899
Burak Varan, A. Yener
{"title":"Two-hop networks with energy harvesting: The (non-)impact of buffer size","authors":"Burak Varan, A. Yener","doi":"10.1109/GlobalSIP.2013.6736899","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736899","url":null,"abstract":"In this paper, a two-hop channel is considered with energy harvesting transmitter nodes. In particular, the offline throughput maximization problem is solved for a constant power relay, and a relay with one energy arrival, in both cases assuming a finite buffer is available at the relay for temporarily storing data received from the source. The focus is on assessing the impact of this data buffer at the relay on optimal transmission policies. The solution is found indirectly, by first assuming that the relay has an infinite size buffer, and then proving that an optimal policy exists that does not require any data buffer at the relay, thus solving the problem regardless of the data buffer size at the relay. Numerical results demonstrate that the proposed solution performs significantly better than naïve policies, and a constant relay rate limits the average throughput as the peak energy harvest rate for the source increases.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"291 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130030722","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}
引用次数: 32
Performance guarantees for undersampled recursive sparse recovery in large but structured noise 大但结构化噪声下欠采样递归稀疏恢复的性能保证
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737077
Brian Lois, Namrata Vaswani, Chenlu Qiu
{"title":"Performance guarantees for undersampled recursive sparse recovery in large but structured noise","authors":"Brian Lois, Namrata Vaswani, Chenlu Qiu","doi":"10.1109/GlobalSIP.2013.6737077","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737077","url":null,"abstract":"We study the problem of recursively reconstructing a time sequence of sparse vectors St from measurements of the form Mt = ASt +BLt where A and B are known measurement matrices, and Lt lies in a slowly changing low dimensional subspace. We assume that the signal of interest (St) is sparse, and has support which is correlated over time. We introduce a solution which we call Recursive Projected Modified Compressed Sensing (ReProMoCS), which exploits the correlated support change of St. We show that, under weaker assumptions than previous work, with high probability, ReProMoCS will exactly recover the support set of St and the reconstruction error of St is upper bounded by a small time-invariant value. A motivating application where the above problem occurs is in functional MRI imaging of the brain to detect regions that are “activated” in response to stimuli. In this case both measurement matrices are the same (i.e. A = B). The active region image constitutes the sparse vector St and this region changes slowly over time. The background brain image changes are global but the amount of change is very little and hence it can be well modeled as lying in a slowly changing low dimensional subspace, i.e. this constitutes Lt.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130126083","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}
引用次数: 16
Exact optimization conditions for discrete linear inverse problems 离散线性逆问题的精确优化条件
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737090
A. Tuysuzoglu, Emre Yilmaz, W. C. Karl, D. Castañón
{"title":"Exact optimization conditions for discrete linear inverse problems","authors":"A. Tuysuzoglu, Emre Yilmaz, W. C. Karl, D. Castañón","doi":"10.1109/GlobalSIP.2013.6737090","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737090","url":null,"abstract":"Recently, graph cut methods have been used with great success on discrete-label problems occurring in computer vision. Unfortunately, the presence of linear image mappings prevents the use of these techniques in image deconvolution. This work aims to expand the application of the successful graph-cut framework to linear inverse problems and deconvolution. We analyze the structure of linear inverse problems, showing the relationship of the sensing structure to graph non-representability of the problem and use insights from our analysis to present a class of linear operators that is graph representable. We propose a new method of variable relabeling that can transform a class of non-representable problems of this type to corresponding ones which are graph representable, thus allowing the use of graph-cut techniques for these problems.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130225740","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
Optimal resource allocation for Type-II-HARQ-based OFDMA ad hoc networks 基于type - ii - harq的OFDMA自组网资源优化分配
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736894
N. Ksairi, P. Ciblat, C. Martret
{"title":"Optimal resource allocation for Type-II-HARQ-based OFDMA ad hoc networks","authors":"N. Ksairi, P. Ciblat, C. Martret","doi":"10.1109/GlobalSIP.2013.6736894","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736894","url":null,"abstract":"We address the problem of multiuser power and bandwidth allocation for a general class of OFDMA-based wireless networks that employ a Type-II Hybrid Automatic Repeat reQuest (HARQ) transmission scheme. We assume that the resource manager has only statistical knowledge of the Channel State Information (CSI) of the Rayleigh-distributed fast-fading links forming the network. We then propose the optimal algorithm minimizing the total transmit power required to satisfy per-user goodput constraints when practical Coding and modulation Schemes (MCSs) are carried out.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130248066","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}
引用次数: 4
An improvement ISAR range alignment algorithm 一种改进的ISAR距离对准算法
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736984
Haibin Sun, Yi Sun, Xiaojun Jing, Songlin Sun
{"title":"An improvement ISAR range alignment algorithm","authors":"Haibin Sun, Yi Sun, Xiaojun Jing, Songlin Sun","doi":"10.1109/GlobalSIP.2013.6736984","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736984","url":null,"abstract":"In general, the conventional Range Alignment methods can provide the satisfactory alignment result in Inverse Synthetic Aperture Radar (ISAR) image. However, because of the airflow disturbance or echo vibration, the target altitude may change and some echoes that deteriorate the precision of Alignment will appear. Considering this problem, echoes feature are analyzed in this paper. To remove the disturbed echoes, the Principal Component Feature Parameters (PCFP) of echoes are discussed. And the correlation of each echo with the PCFP by the euclidean distance are analyzed. Then, the deteriorating echoes can be extracted and separated through the proposed algorithm. The effectiveness and validity of algorithm are proved by simulation results.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134059807","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
Time-domain compression of complex-baseband LTE signals for cloud radio access networks 云无线接入网络中复杂基带LTE信号的时域压缩
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737122
K. Nieman, B. Evans
{"title":"Time-domain compression of complex-baseband LTE signals for cloud radio access networks","authors":"K. Nieman, B. Evans","doi":"10.1109/GlobalSIP.2013.6737122","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737122","url":null,"abstract":"Modern cellular networks such as Long-Term Evolution (LTE) transport complex-baseband samples between remote radio hardware and processing equipment. Common Public Radio Interface (CPRI) links are widely used in practice and enable flexible radio head deployments, distributed antenna systems, and advanced spatial processing such as coordinated multi-point (CoMP) transmission and reception. Current CPRI links already have insufficient capacity to support 20 MHz bandwidth LTE for a basestation with three sectors and four antennas per sector. By supporting eight antennas per sector and up to 5× system bandwidth, LTE-A will require substantial increases in CPRI capacity. In this work, we develop compression methods that exploit the temporal and spectral structure of LTE signals with the goal of achieving high compression with limited impact on end-to-end communication performance. Our contributions include (i) design of a low-complexity compression method for LTE and (ii) validation of this method using an LTE link-level simulation. Our method achieves up to 5× compression for uplink and downlink signals.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162357","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}
引用次数: 50
Energy-efficient power control policies in fading channels with Markov arrivals and QoS constraints 具有马尔可夫到达和QoS约束的衰落信道节能功率控制策略
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736901
Mustafa Ozmen, M. C. Gursoy
{"title":"Energy-efficient power control policies in fading channels with Markov arrivals and QoS constraints","authors":"Mustafa Ozmen, M. C. Gursoy","doi":"10.1109/GlobalSIP.2013.6736901","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736901","url":null,"abstract":"In this paper, energy efficiency in fading channels is analyzed when data arrivals are modeled as a discrete Markov process and statistical QoS constraints are imposed. In particular, under the assumption that the channel side information is available at the transmitter, energy-efficient power adaptation policies are identified, taking into account both transmission and circuit power consumptions. In this setting, the impact of QoS limitations, circuit power considerations and source burstiness on the optimal power control policies and the optimal average power transmission levels required for energy efficient operation is investigated.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131599778","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
Improved carrier frequency offset estimator for common referenced sampling and RF oscillators in OFDM transceivers OFDM收发器中常用参考采样和射频振荡器载波频偏估计的改进
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6737116
Jin Yuan, M. Torlak
{"title":"Improved carrier frequency offset estimator for common referenced sampling and RF oscillators in OFDM transceivers","authors":"Jin Yuan, M. Torlak","doi":"10.1109/GlobalSIP.2013.6737116","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737116","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) has been proven to be very sensitive to carrier drifts due to fact that both carrier frequency offset (CFO) and sampling frequency offset (SFO) destroy the orthogonality cross multiple subcarriers. The sampling clock and the local oscillator, from which the carrier frequency is derived, sharing a common reference clock is becoming a configuration extensively used in wireless transceivers. In this paper, we propose a maximum likelihood (ML) estimation scheme with the common reference clock assumption. We further propose two CFO estimators with low computational complexity - a near ML estimator and a method of moments estimator. With the common reference clock assumption, the CFO estimation range is widened to many multiples of subcarrier spacing without any additional training symbols or constructing the training symbol by multiple identical parts. The performance of the proposed algorithms in comparison with existing estimators is studied through simulations. The proposed algorithms are validated on a real-time hardware testbed.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131049555","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}
引用次数: 2
Optimal Bayesian feature selection 最优贝叶斯特征选择
2013 IEEE Global Conference on Signal and Information Processing Pub Date : 2013-12-01 DOI: 10.1109/GlobalSIP.2013.6736814
Lori A. Dalton
{"title":"Optimal Bayesian feature selection","authors":"Lori A. Dalton","doi":"10.1109/GlobalSIP.2013.6736814","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736814","url":null,"abstract":"Biomarker discovery and classification in medical applications both typically involve feature selection applied to a small-sample high-dimensional dataset. Recent work has proposed a framework to integrate a prior over an uncertainty class of parameterized feature-label distributions with training data to obtain optimal classifiers, MMSE classifier error estimates, and evaluate the MSE of error estimates. However, feature selection has not been investigated rigorously in this paradigm. In the present work, we begin to address optimal feature selection in a Bayesian framework via a sparsity inducing prior that assumes the number of “good” features is small. From modeling assumptions and this prior we derive expressions for the sample-conditioned probability mass over good feature sets. It thus becomes possible to find feature sets that are optimal relative to maximal posterior probability. Furthermore, one may provide this probability along with a given feature set, and thereby evaluate the validity and reliability of the results.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133481607","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
首页 上一页 下一页 尾页
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学术官方微信
小红书