{"title":"Fundamental limits for support recovery of tree-sparse signals from noisy compressive samples","authors":"Akshay Soni, J. Haupt","doi":"10.1109/GlobalSIP.2013.6737052","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737052","url":null,"abstract":"Recent breakthrough results in compressive sensing (CS) have established that many high dimensional signals can be accurately recovered from a relatively small number of non-adaptive linear observations, provided that the signals possess a sparse representation in some basis. Subsequent efforts have shown that the performance of CS can be improved by exploiting structure in the locations of the nonzero signal coefficients during inference, or by utilizing some form of data-dependent adaptive measurement scheme during the sensing process. Our previous work established that an adaptive sensing strategy specifically tailored to signals that are tree-sparse can significantly outperform adaptive and non-adaptive sensing strategies that are agnostic to the underlying structure in noisy support recovery tasks. In this paper we establish corresponding fundamental performance limits for these support recovery tasks, in settings where measurements may be obtained either non-adaptively (using a randomized Gaussian measurement strategy motivated by initial CS investigations) or by any adaptive sensing strategy. Our main results here imply that the adaptive tree sensing procedure analyzed in our previous work is nearly optimal, in the sense that no other sensing and estimation strategy can perform fundamentally better for identifying the support of tree-sparse signals.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"52 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":"133521035","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 LabVIEW-based fast prototyping software defined GPS receiver platform","authors":"D. Akopian, A. Soghoyan","doi":"10.1109/GlobalSIP.2013.6737130","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737130","url":null,"abstract":"Software defined radio (SDR) technology has become popular for design and implementation of a versatile, modular, and reconfigurable GPS receivers. SDR receiver developers continuously advance algorithmic and/or hardware accelerator integration solutions. There exists a need in fast prototyping and testing instrumentation to shorten development and redesign cycles. This paper demonstrates an integrated instrumentation platform for GPS signal simulation, testing and development, including fast prototyping hardware solutions.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"9 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":"133313070","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":"Scribble2focus: An interactive photo refocusing system based on mobile stereo imaging","authors":"Dung T. Vu, Benjamin Chidester, Jiangbo Lu, M. Do","doi":"10.1109/GlobalSIP.2013.6737001","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737001","url":null,"abstract":"This paper proposes a novel, depth-based image refocusing system for mobile devices equipped with stereo cameras, called Scribble2focus. The system provides a simple and intuitive interface, which allows the user to refocus the image by indicating an object of interest with a simple finger stroke. A stereo matching algorithm based on a Minimum Spanning Tree approach is proposed to infer depth from images from the stereo cameras. Using the depth information and a thin lens model, input all-focus images are synthetically refocused. Experiments show that the proposed system produces quality refocusing results with minimal computational requirements. The system requires only around 1.5 seconds to process a pair of 640×360 images in the off-line step, making it possible for future deployment on a mobile device.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"39 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":"133313834","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":"Diffusion analysis of distributed adaptive networks with graphical evolutionary game","authors":"Chunxiao Jiang, Yan Chen, K. Liu","doi":"10.1109/GlobalSIP.2013.6736949","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736949","url":null,"abstract":"Most existing distributed adaptive filtering algorithms focus on de- signing different information diffusion rules, regardless of the nature evolutionary characteristic of a distributed network. However, due to the natural selfishness and rationality, nodes in a distributed network may not be willing to follow a predefined rule. Instead, they tend to follow some nature evolutionary rule. Therefore, it is ample of importance to study the information diffusion problem in a distributed network from the evolutionary game theoretic perspective. In this paper, we analyze the information diffusion over the adaptive net- work with regular graph and derive the close-form expression for the diffusion probability using graphical evolutionary game theory. Simulation are conducted to verify the effectiveness of our analysis.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"12 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":"133477244","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":"Classification via regularization on graphs","authors":"A. Sandryhaila, José M. F. Moura","doi":"10.1109/GlobalSIP.2013.6736923","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736923","url":null,"abstract":"We present a novel data classifier that is based on the regularization of graph signals. Our approach is based on the theory of discrete signal processing on graphs where the graph represents similarities between data and we interpret labels for the dataset elements as a signal indexed by the nodes of the graph. We postulate that true labels form a low-frequency graph signal and the classifier finds the smoothest graph signal that satisfies constraints given by known data labels. Our experiments demonstrate that our approach achieves high accuracy in multiclass classification and outperforms other classification approaches.","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":"131316582","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}
Ganesh Venkatraman, Antti Tölli, Janne Janhunen, M. Juntti
{"title":"Iterative scheduling for cell-edge in multi-cell MU-MIMO","authors":"Ganesh Venkatraman, Antti Tölli, Janne Janhunen, M. Juntti","doi":"10.1109/GlobalSIP.2013.6737084","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737084","url":null,"abstract":"The paper addresses the iterative joint scheduling algorithms for cooperative multi-cell multi-user (MU) multiple-input multiple-output (MIMO) transmission scheme with the sum rate maximization objective for the cell-edge users. We propose an iterative scheduling scheme which selects the users in each coordinating base station (BS) by considering the mutual interference among the chosen sets. At first, a static user selection (S-US) scheme is discussed, which performs the user selection in a centralized way from the users associated with each BS. Following that, we study the performance of the scheduling scheme, namely coordinated user selection (C-US) scheme, which performs scheduling of users and the associated BS so as to maximize the sum rate. In the C-US scheme, the users are linked dynamically to a BS by the C-US algorithm. The sum rate performance is discussed for the proposed algorithms with the precoders designed using either with zero-forcing (ZF) beamforming (BF) or weighted minimum mean squared error (W-MMSE) scheme.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"189 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":"133729926","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 identification of molecularly targeted drug effect coefficient using H∞ filter","authors":"Lijun Qian, Xiangfang Li, E. Dougherty","doi":"10.1109/GlobalSIP.2013.6736824","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736824","url":null,"abstract":"In recent years, targeted therapy to treat cancer is gaining popularity. However, how to quantitatively and dynamically analyze the drug effect for molecularly targeted agents is quite different from traditional cytotoxic drugs. A novel preclinical model combining experimental methods and theoretical analysis is proposed to investigate the mechanisms of action and identify pharmacodynamic characteristic of a targeted drug. A robust estimator, namely the H∞ filter, is applied to time-course data of tumor cells' responses to drugs. The results show strong correlation between dosage and drug effect coefficient. The proposed method will help us gain more comprehensive understanding of the molecular mechanisms of action of drugs and design better dosing regimens for targeted therapy.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"71 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":"114938355","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 sparse randomized Kaczmarz algorithm","authors":"H. Mansour, Ö. Yilmaz","doi":"10.1109/GlobalSIP.2013.6736958","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736958","url":null,"abstract":"In this paper, we propose a modification that speeds up the convergence of the randomized Kaczmarz algorithm for systems of linear equations with sparse solutions. The speedup is achieved by projecting every iterate onto a weighted row of the linear system while maintaining the random row selection criteria of Strohmer and Vershynin. While the Kaczmarz algorithm and its variants can only find solutions to overdetermined linear systems, our algorithm surprisingly succeeds in finding sparse solutions to underdetermined linear systems as well. Our numerical experiments demonstrate the accelerated convergence in the overdetermined case as well as the sparse recovery capabilities of our approach in the underdetermined case.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"21 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":"115063077","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":"Learning-based distributed load forecasting in energy grids","authors":"Khalid Kalbat, A. Tajer","doi":"10.1109/GlobalSIP.2013.6736933","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6736933","url":null,"abstract":"This paper proposes a generic distributed framework for load forecasting, as a pivotal function in energy grids. Energy grids are rapidly evolving towards complex interconnected subnetworks that are potentially operated by different entities with distinct physical constraints, generation capacitance, and load demands. Such subnetworks, nevertheless, are also interconnected through shared sensing, actuating, and controlling modules. The goal of this paper is to exploit such underlying interconnectivity structures among the subnetworks and formalize a mechanism for 1) forming local predictions in the subnetworks based on local stochastic dynamics and historic data, and 2) aggregating the local predictions for reaching network-wide optimal load predictions. The advantages of the proposed framework is supported by simulations in the standard IEEE-14 bus power system.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"6 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":"117321016","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. Bautista-Contreras, R. Parra-Michel, R. Carrasco-Alvarez, E. Romero-Aguirre
{"title":"A SDR architecture based on FPGA for multi-standard transmitter","authors":"B. Bautista-Contreras, R. Parra-Michel, R. Carrasco-Alvarez, E. Romero-Aguirre","doi":"10.1109/GlobalSIP.2013.6737139","DOIUrl":"https://doi.org/10.1109/GlobalSIP.2013.6737139","url":null,"abstract":"This paper presents the architecture and implementation of configurable base-band transmitter for software defined radio system. The proposed architecture is capable of generating data-frames for multiple communications standards. The radio parameters can be adjusted on-the-fly: length of data frame, training scheme, transmitter rate, upsampling factor, modulation type and pulse-shaping filter waveform. The configuration is carried out through an interface module via control words. Additionally, it is possible to operate in both continuous and burst data flow. The architecture was described using Verilog HDL and targeted in Altera Stratix V: 5SGXMA7N1F45C1. The implementation results show a reduced consumption of FPGA resources (≤ 1%) and frequency operation over 224 MHz.","PeriodicalId":311464,"journal":{"name":"2013 IEEE Global Conference on Signal and Information Processing","volume":"256 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":"123517531","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}