N. Rohani, Pablo Ruiz, E. Besler, R. Molina, A. Katsaggelos
{"title":"Variational Gaussian process for sensor fusion","authors":"N. Rohani, Pablo Ruiz, E. Besler, R. Molina, A. Katsaggelos","doi":"10.1109/EUSIPCO.2015.7362367","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362367","url":null,"abstract":"In this paper, we introduce a new Gaussian Process (GP) classification method for multisensory data. The proposed approach can deal with noisy and missing data. It is also capable of estimating the contribution of each sensor towards the classification task. We use Bayesian modeling to build a GP-based classifier which combines the information provided by all sensors and approximates the posterior distribution of the GP using variational Bayesian inference. During its training phase, the algorithm estimates each sensor's weight and then uses this information to assign a label to each new sample. In the experimental section, we evaluate the classiication performance of the proposed method on both synthetic and real data and show its applicability to different scenarios.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128391483","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 parallel block-coordinate approach for primal-dual splitting with arbitrary random block selection","authors":"A. Repetti, É. Chouzenoux, J. Pesquet","doi":"10.1109/EUSIPCO.2015.7362380","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362380","url":null,"abstract":"The solution of many applied problems relies on finding the minimizer of a sum of smooth and/or nonsmooth convex functions possibly involving linear operators. In the last years, primal-dual methods have shown their efficiency to solve such minimization problems, their main advantage being their ability to deal with linear operators with no need to invert them. However, when the problem size becomes increasingly large, the implementation of these algorithms can be complicated, due to memory limitation issues. A simple way to overcome this difficulty consists of splitting the original numerous variables into blocks of smaller dimension, corresponding to the available memory, and to process them separately. In this paper we propose a random block-coordinate primal-dual algorithm, converging almost surely to a solution to the considered minimization problem. Moreover, an application to large-size 3D mesh denoising is provided to show the numerical efficiency of our method.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128536225","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 flexible signature dictionary","authors":"F. Barzideh, K. Skretting, K. Engan","doi":"10.1109/EUSIPCO.2015.7362522","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362522","url":null,"abstract":"Dictionary learning and Sparse representation of signals and images has been a hot topic for the past decade and aims to help find the sparsest representation for the signal(s) at hand. Typically, the Dictionary learning process involves finding a large number of free variables. Also, the resulting dictionary in general does not have a specific structure. In this paper we use the ideas from Image Signature Dictionary and General overlapping frames and proposed a flexible signature dictionary. We show that the resulting signatures capture the essence of the signal and can represent signals of their own type very well in opposed to signals of other types.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128555744","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":"On the convergence, steady-state, and tracking analysis of the SRLMMN algorithm","authors":"Mohammed Mujahid Ulla Faiz, A. Zerguine","doi":"10.1109/EUSIPCO.2015.7362873","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362873","url":null,"abstract":"In this work, a novel algorithm named sign regressor least mean mixed-norm (SRLMMN) algorithm is proposed as an alternative to the well-known least mean mixed-norm (LMMN) algorithm. The SRLMMN algorithm is a hybrid version of the sign regressor least mean square (SRLMS) and sign regressor least mean fourth (SRLMF) algorithms. Analytical expressions are derived to describe the convergence, steady-state, and tracking behavior of the proposed SRLMMN algorithm. To validate our theoretical findings, a system identification problem is considered for this purpose. It is shown that there is a very close correspondence between theory and simulation. Finally, it is also shown that the SRLMMN algorithm is robust enough in tracking the variations in the channel.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128176178","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}
A. Lavrenko, Anastasia Romer, G. D. Galdo, R. Thomä, O. Arikan
{"title":"Detection of time-varying support via rank evolution approach for effective joint sparse recovery","authors":"A. Lavrenko, Anastasia Romer, G. D. Galdo, R. Thomä, O. Arikan","doi":"10.1109/EUSIPCO.2015.7362677","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362677","url":null,"abstract":"Efficient recovery of sparse signals from few linear projections is a primary goal in a number of applications, most notably in a recently-emerged area of compressed sensing. The multiple measurement vector (MMV) joint sparse recovery is an extension of the single vector sparse recovery problem to the case when a set of consequent measurements share the same support. In this contribution we consider a modification of the MMV problem where the signal support can change from one block of data to another and the moment of change is not known in advance. We propose an approach for the support change detection based on the sequential rank estimation of a windowed block of the measurement data. We show that under certain conditions it allows for an unambiguous determination of the moment of change, provided that the consequent data vectors are incoherent to each other.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128627951","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":"Matrix factorization for bilinear blind source separation: Methods, separability and conditioning","authors":"Y. Deville","doi":"10.1109/EUSIPCO.2015.7362714","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362714","url":null,"abstract":"This paper deals with a general class of blind source separation methods for bilinear mixtures, using a structure based on matrix factorization, which models the direct, i.e. mixing, function, thus not requiring the analytical form of the inverse model. This approach also initially does not set restrictions on e.g. statistical independence, nonnegativity or sparsity, but on linear independence of sources and some source products. The separation principle used for adapting the parameters of the above structure consists in fitting the observations with the above direct model. We prove (for two sources at this stage) that this principle ensures separability, i.e. unique decomposition. Associated criteria and algorithms are also described. Performance is illustrated with preprocessed hyperspectral remote sensing data. This also allows us to highlight potential conditioning issues of some practical bilinear matrix factorization (BMF) methods and to suggest how to extend them.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129793698","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":"Digital image self-recovery using unequal error protection","authors":"Saeed Sarreshtedari, M. Akhaee, A. Abbasfar","doi":"10.1109/EUSIPCO.2015.7362347","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362347","url":null,"abstract":"In this paper, an unequal error protection (UEP)-based scheme is presented to generate tamper-proof images, in which the lost content of the original image is recoverable despite the malicious tampering. For this purpose, a representation of the original image is embedded into itself, after being protected by the proper channel coding. Since better protection is considered for the more important bits of the image representation through a dynamic programming (DP) optimization scheme, they survive higher tampering rates than the less important image information. As a result, the quality of the restored image degrades with respect to the true tampering rate.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130079052","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":"Scale invariant divergences for signal and image reconstruction","authors":"H. Lantéri, C. Theys, C. Aime","doi":"10.1109/EUSIPCO.2015.7362767","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362767","url":null,"abstract":"The subject of this paper is the reconstruction of a signal or an image under constraints of non negativity and of constant sum. The sum constraint is imposed by the use of scale invariant divergences, which allows the development of simple iterative reconstruction algorithms. Two families of divergences between two data fields p and q are considered, the a-divergence and the β-divergence. A procedure is applied to make them scale-invariant w.r.t. p and q. The resulting method is an interior point type algorithm useful in the context of ill-posed problems. Numerical illustrations are given for the deconvolution of a solar spectrum and an interferometric image.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125650917","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":"Variational blind source separation toolbox and its application to hyperspectral image data","authors":"O. Tichý, V. Šmídl","doi":"10.1109/EUSIPCO.2015.7362599","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362599","url":null,"abstract":"The task of blind source separation (BSS) is to decompose sources that are observed only via their linear combination with unknown weights. The separation is possible when additional assumptions on the initial sources are given. Different assumptions yield different separation algorithms. Since we are primarily concerned with noisy observations, we follow the Variational Bayes approach and define noise properties and assumptions on the sources by prior probability distributions. Due to properties of the Variational Bayes algorithm, the resulting inference algorithm is very similar for many different source assumptions. This allows us to build a modular toolbox, where it is easy to code different assumptions as different modules. By using different modules, we obtain different BSS algorithms. The potential of this open-source toolbox is demonstrated on separation of hyperspectral image data. The MATLAB implementation of the toolbox is available for download.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"47 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593851","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":"Comparison of windowing schemes for speech coding","authors":"Johannes Fischer, Tomas Bäckström","doi":"10.1109/EUSIPCO.2015.7362494","DOIUrl":"https://doi.org/10.1109/EUSIPCO.2015.7362494","url":null,"abstract":"The majority of speech coding algorithms are based on the code excited linear prediction (CELP) paradigm, modelling the speech signal by linear prediction. This coding approach offers the advantage of a very short algorithmic delay, due to the windowing scheme based on rectangular windowing of the residual of the linear predictor. Although widely used, the performance and structural choices of this windowing scheme have not been extensively documented. In this paper we introduce three alternative windowing schemes, as alternatives to the one already used in CELP codecs. These windowing schemes differ in their handling of transitions between frames. Our subject evaluation shows that omitting the error feedback loop yields an increase in perceptual quality at scenarios with high quantization noise. In addition, objective measures show that while error feedback improves the accuracy slightly at high bitrates, at low bitrates it causes a degradation in quality, resulting in a lower SNR.","PeriodicalId":401040,"journal":{"name":"2015 23rd European Signal Processing Conference (EUSIPCO)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132275912","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}