{"title":"A novel adaptive algorithm for diffusion networks using projections onto hyperslabs","authors":"S. Chouvardas, K. Slavakis, S. Theodoridis","doi":"10.1109/CIP.2010.5604244","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604244","url":null,"abstract":"In this paper, a new algorithm for distributed learning in sensor networks is developed. The algorithm is built upon a diffusion protocol to implement cooperation among neighbouring nodes. The algorithm is developed in the convex set theoretic approach, and it is based on a sequence of metric projections on hyperslabs. Full convergence results have been obtained and the experimental set up demonstrates significant performance improvements, compared to previously derived algorithms of similar complexity.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128931815","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}
Tiziana Veracini, S. Matteoli, M. Diani, G. Corsini
{"title":"Robust hyperspectral image segmentation based on a non-Gaussian model","authors":"Tiziana Veracini, S. Matteoli, M. Diani, G. Corsini","doi":"10.1109/CIP.2010.5604242","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604242","url":null,"abstract":"Spectra collected by hyperspectral sensors over samples of the same material are not deterministic quantities. Their inherent spectral variability can be accounted for by making use of suitable statistical models. Within this framework, the Gaussian Mixture Model (GMM) is one of the most widely adopted models for modeling hyperspectral data. Unfortunately, the GMM has been shown not to be sufficiently adequate to represent the statistical behavior of real hyperspectral data, especially for the tails of the distributions. The class of elliptically contoured distributions, which accommodates longer tails, promises to better match the spectral distribution of hyperspectral data.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"14 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117324269","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":"Dissimilarity-based classification of data with missing attributes","authors":"M. Millán-Giraldo, R. Duin, J. S. Sánchez","doi":"10.1109/CIP.2010.5604125","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604125","url":null,"abstract":"In many real world data applications, objects may have missing attributes. Conventional techniques used to classify this kind of data are represented in a feature space. However, usually they need imputation methods and/or changing the classifiers. In this paper, we propose two classification alternatives based on dissimilarities. These techniques promise to be appealing for solving the problem of classification of data with missing attributes. Results obtained with the two approaches outperform the results of the techniques based in the feature space. Besides, the proposed approaches have the advantage that they hardly require additional computations like imputations or classifier updating.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133870048","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}
Roberto López-Valcarce, G. Vazquez-Vilar, J. Sala-Álvarez
{"title":"Multiantenna spectrum sensing for Cognitive Radio: overcoming noise uncertainty","authors":"Roberto López-Valcarce, G. Vazquez-Vilar, J. Sala-Álvarez","doi":"10.1109/CIP.2010.5604095","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604095","url":null,"abstract":"Spectrum sensing is a key ingredient of the dynamic spectrum access paradigm, but it needs powerful detectors operating at SNRs well below the decodability levels of primary signals. Noise uncertainty poses a significant challenge to the development of such schemes, requiring some degree of diversity (spatial, temporal, or in distribution) for identifiability of the noise level. Multiantenna detectors exploit spatial independence of receiver thermal noise. We review this class of schemes and propose a novel detector trading off performance and complexity. However, most of these methods assume that the noise power, though unknown, is the same at all antennas. As it turns out, calibration errors have a substantial impact on these detectors. Another novel detector is proposed, based on an approximation to the Generalized Likelihood Ratio, outperforming previous schemes for uncalibrated multiantenna receivers.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129866192","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":"Waveform design with stopband and correlation constraints for cognitive radar","authors":"Hao He, P. Stoica, Jian Li","doi":"10.1109/CIP.2010.5604089","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604089","url":null,"abstract":"One of the main objectives of cognitive radar is to adapt the spectrum of transmit waveforms to certain needs, such as avoiding reserved frequency bands or narrowband interferences. Besides spectral requirements, good correlation properties of the transmit waveforms are also desired in specific applications, such as range compression. Moreover, practical hardware constraints usually require the transmit waveforms be unimodular (i.e. only phase-modulated). In this paper, we propose a new algorithm named SCAN (stopband cyclic algorithm new) to design unimodular sequences with spectral power suppressed in arbitrary bands and with low correlation sidelobes as well. The SCAN algorithm, which starts from random initializations, can generate many sequences possessing similarly good properties. Furthermore, the SCAN algorithm is based on FFT (fast Fourier transform) operations and thus is computationally efficient, which facilitates long-sequence design and real-time waveform update.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127964221","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}
D. Shutin, Haipeng Zheng, Bernard H. Fleury, Sanjeev R. Kulkarni, H. V. Poor
{"title":"Space-alternating attribute-distributed sparse learning","authors":"D. Shutin, Haipeng Zheng, Bernard H. Fleury, Sanjeev R. Kulkarni, H. V. Poor","doi":"10.1109/CIP.2010.5604254","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604254","url":null,"abstract":"The paper proposes a new variational Bayesian algorithm for multivariate regression with attribute-distributed or dimensionally distributed data. Compared to the existing approaches the proposed algorithm exploits the variational version of the Space-Alternating Generalized Expectation-Maximization (SAGE) algorithm that by means of admissible hidden data - an analog of the complete data in the EM framework - allows parameters of a single agent to be updated assuming that parameters of the other agents are fixed. This allows learning to be implemented in a distributed fashion by sequentially updating the agents one after another. Inspired by Bayesian sparsity techniques, the algorithm also introduces constraints on the agent parameters via parametric priors. This adds a mechanism for pruning irrelevant agents, as well as for minimizing the effect of overfitting. Using synthetic data, as well as measurement data from the UCI Machine Learning Repository it is demonstrated that the proposed algorithm outperforms existing solutions both in the achieved mean-square error (MSE), as well as in convergence speed due to the ability to sparsify noninformative agents, while at the same time allowing distributed implementation and flexible agent update protocols.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126730727","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":"Beamforming in underlay cognitive radio: Null-shaping design for efficient Nash equilibrium","authors":"Eduard Axel Jorswieck, R. Mochaourab","doi":"10.1109/CIP.2010.5604224","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604224","url":null,"abstract":"We consider a multiuser cognitive radio setting where multiple secondary systems, consisting of transmitter-receiver pairs, coexist with multiple primary systems. Each secondary transmitter is equipped with multiple antennas, while all receivers use a single antenna. In this setting, the secondary transmitters are to operate under the constraints of producing restricted amount of interference at the primary users. We consider two settings. In the first setting, the primary systems are assumed to tolerate an amount of interference originating from secondary systems. This amount of interference is controlled by a pricing mechanism that penalizes the secondary systems in proportion to the interference they produce on the primary users. In the second setting, the primary systems are assumed not to tolerate any interference from secondary systems. Such constraints on the secondary systems are referred to as null-shaping constraints. We characterize for both settings transmission strategies that correspond to Pareto optimal operation points for the secondary systems. The interesting result is that all points on the Pareto boundary can be achieved as the outcome of a non-cooperative game by imposing certain null shaping constraints.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128635363","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 story of a single cell: Peeking into the semantics of spikes","authors":"Roi Kliper, Thomas Serre, D. Weinshall, I. Nelken","doi":"10.1109/CIP.2010.5604119","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604119","url":null,"abstract":"Traditionally, the modeling of sensory neurons has focused on the characterization and/or the learning of input-output relations. Motivated by the view that different neurons impose different partitions on the stimulus space, we propose instead to learn the structure of the stimulus space, as imposed by the cell, by learning a cell specific distance function or kernel. Metaphorically speaking, this direction attempts to bypass the syntactic question of “how the cell speaks”, by focusing instead on the semantic and fundamental question of “what the cell says”.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130647745","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}
Seung-Jun Kim, E. Dall’Anese, G. Giannakis, S. Pupolin
{"title":"Collaborative channel gain map tracking for cognitive radios","authors":"Seung-Jun Kim, E. Dall’Anese, G. Giannakis, S. Pupolin","doi":"10.1109/CIP.2010.5604035","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604035","url":null,"abstract":"A collaborative algorithm is developed to track the channel gains from arbitrary positions in a geographical area to each node of a cognitive radio network. Spatio-temporal shadow fading effects are characterized using an experimentally verified spatial loss field model. Kriged Kalman filtering (KKF) is then applied to track the time-varying shadowing field. The proposed KKF algorithm consists of a distributed Kalman filter that estimates the spatio-temporal trend field, and a Kriging interpolator which captures the temporally white yet spatially descriptive component at the individual sensors. Numerical tests demonstrate that the collaborative tracking algorithm outperforms a non-collaborative alternative in terms of mean-square error when applied to a cognitive radio sensing task.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130958353","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":"Bayesian joint recovery of correlated signals in Distributed Compressed Sensing","authors":"Pablo Viñuelas-Peris, Antonio Artés-Rodríguez","doi":"10.1109/CIP.2010.5604103","DOIUrl":"https://doi.org/10.1109/CIP.2010.5604103","url":null,"abstract":"In this paper we address the problem of Distributed Compressed Sensing (DCS) of correlated signals. We model the correlation using the sparse components correlation coefficient of signals, a general and simple measure. We develop an sparse Bayesian learning method for this setting, that can be applied to both random and optimized projection matrices. As a result, we obtain a reduction of the number of measurements needed for a given recovery error that is dependent on the correlation coefficient, as shown by computer simulations in different scenarios.","PeriodicalId":171474,"journal":{"name":"2010 2nd International Workshop on Cognitive Information Processing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117322353","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}