2016
Villacrés, Grace; Koch, Tobias
Wireless networks of bounded capacity Proceedings Article
En: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 2584-2588, 2016.
@inproceedings{7541766,
title = {Wireless networks of bounded capacity},
author = {Grace Villacr\'{e}s and Tobias Koch},
doi = {10.1109/ISIT.2016.7541766},
year = {2016},
date = {2016-07-01},
booktitle = {2016 IEEE International Symposium on Information Theory (ISIT)},
pages = {2584-2588},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Koch, Tobias; Vazquez-Vilar, Gonzalo
A general rate-distortion converse bound for entropy-constrained scalar quantization Proceedings Article
En: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 735-739, 2016.
@inproceedings{7541396,
title = {A general rate-distortion converse bound for entropy-constrained scalar quantization},
author = {Tobias Koch and Gonzalo Vazquez-Vilar},
doi = {10.1109/ISIT.2016.7541396},
year = {2016},
date = {2016-07-01},
booktitle = {2016 IEEE International Symposium on Information Theory (ISIT)},
pages = {735-739},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Vazquez-Vilar, Gonzalo
Multiple quantum hypothesis testing expressions and classical-quantum channel converse bounds Proceedings Article
En: 2016 IEEE International Symposium on Information Theory (ISIT 2016), Barcelona, Spain, 2016.
BibTeX | Etiquetas:
@inproceedings{gvazquez-isit2016a,
title = {Multiple quantum hypothesis testing expressions and classical-quantum channel converse bounds},
author = {Gonzalo Vazquez-Vilar},
year = {2016},
date = {2016-07-01},
booktitle = {2016 IEEE International Symposium on Information Theory (ISIT 2016)},
address = {Barcelona, Spain},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Vazquez-Vilar, Gonzalo; Campo, Adria Tauste; i Fabregas, Albert Guillen; Martinez, Alfonso
Bayesian M-Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight Artículo de revista
En: IEEE Transactions on Information Theory, vol. 62, no 5, pp. 2324–2333, 2016, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: Bayes methods, Channel Coding, Electronic mail, error probability, Journal, Random variables, Testing
@article{Vazquez-Vilar2016,
title = {Bayesian M-Ary Hypothesis Testing: The Meta-Converse and Verd\'{u}-Han Bounds Are Tight},
author = {Gonzalo Vazquez-Vilar and Adria Tauste Campo and Albert Guillen i Fabregas and Alfonso Martinez},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7434042},
doi = {10.1109/TIT.2016.2542080},
issn = {0018-9448},
year = {2016},
date = {2016-05-01},
journal = {IEEE Transactions on Information Theory},
volume = {62},
number = {5},
pages = {2324--2333},
abstract = {Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy et al.; the second expression is a function of an information-spectrum measure and implies the tightness of a generalized Verd\'{u}-Han lower bound. The formulas characterize the minimum error probability of several problems in information theory and help to identify the steps where existing converse bounds are loose.},
keywords = {Bayes methods, Channel Coding, Electronic mail, error probability, Journal, Random variables, Testing},
pubstate = {published},
tppubtype = {article}
}
Míguez, Joaquín; Vázquez, Manuel A
A Proof of Uniform Convergence Over Time for a Distributed Particle Filter Artículo de revista
En: Signal Processing, vol. 122, pp. 152–163, 2016, ISSN: 01651684.
Resumen | Enlaces | BibTeX | Etiquetas: Convergence analysis, Distributed algorithms, Journal, Parallelization, Particle filtering, Wireless Sensor Networks
@article{Miguez2016,
title = {A Proof of Uniform Convergence Over Time for a Distributed Particle Filter},
author = {Joaqu\'{i}n M\'{i}guez and Manuel A V\'{a}zquez},
url = {http://www.sciencedirect.com/science/article/pii/S0165168415004077},
doi = {10.1016/j.sigpro.2015.11.015},
issn = {01651684},
year = {2016},
date = {2016-05-01},
journal = {Signal Processing},
volume = {122},
pages = {152--163},
abstract = {Distributed signal processing algorithms have become a hot topic during the past years. One class of algorithms that have received special attention are particles filters (PFs). However, most distributed PFs involve various heuristic or simplifying approximations and, as a consequence, classical convergence theorems for standard PFs do not hold for their distributed counterparts. In this paper, we analyze a distributed PF based on the non-proportional weight-allocation scheme of Bolic et al (2005) and prove rigorously that, under certain stability assumptions, its asymptotic convergence is guaranteed uniformly over time, in such a way that approximation errors can be kept bounded with a fixed computational budget. To illustrate the theoretical findings, we carry out computer simulations for a target tracking problem. The numerical results show that the distributed PF has a negligible performance loss (compared to a centralized filter) for this problem and enable us to empirically validate the key assumptions of the analysis.},
keywords = {Convergence analysis, Distributed algorithms, Journal, Parallelization, Particle filtering, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {article}
}
Koblents, Eugenia; Míguez, Joaquín; Rodríguez, Marco A; Schmidt, Alexandra M
A Nonlinear Population Monte Carlo Scheme for the Bayesian Estimation of Parameters of α-stable Distributions Artículo de revista
En: Computational Statistics & Data Analysis, vol. 95, pp. 57–74, 2016, ISSN: 01679473.
Resumen | Enlaces | BibTeX | Etiquetas: Animal movement, Bayesian inference, Importance sampling, L{é}vy process, α-stable distributions
@article{Koblents2016,
title = {A Nonlinear Population Monte Carlo Scheme for the Bayesian Estimation of Parameters of α-stable Distributions},
author = {Eugenia Koblents and Joaqu\'{i}n M\'{i}guez and Marco A Rodr\'{i}guez and Alexandra M Schmidt},
url = {http://www.sciencedirect.com/science/article/pii/S0167947315002340},
doi = {10.1016/j.csda.2015.09.007},
issn = {01679473},
year = {2016},
date = {2016-03-01},
journal = {Computational Statistics \& Data Analysis},
volume = {95},
pages = {57--74},
abstract = {The class of $alpha$-stable distributions enjoys multiple practical applications in signal processing, finance, biology and other areas because it allows to describe interesting and complex data patterns, such as asymmetry or heavy tails, in contrast with the simpler and widely used Gaussian distribution. The density associated with a general $alpha$-stable distribution cannot be obtained in closed form, which hinders the process of estimating its parameters. A nonlinear population Monte Carlo (NPMC) scheme is applied in order to approximate the posterior probability distribution of the parameters of an $alpha$-stable random variable given a set of random realizations of the latter. The approximate posterior distribution is computed by way of an iterative algorithm and it consists of a collection of samples in the parameter space with associated nonlinearly-transformed importance weights. A numerical comparison of the main existing methods to estimate the $alpha$-stable parameters is provided, including the traditional frequentist techniques as well as a Markov chain Monte Carlo (MCMC) and a likelihood-free Bayesian approach. It is shown by means of computer simulations that the NPMC method outperforms the existing techniques in terms of parameter estimation error and failure rate for the whole range of values of $alpha$, including the smaller values for which most existing methods fail to work properly. Furthermore, it is shown that accurate parameter estimates can often be computed based on a low number of observations. Additionally, numerical results based on a set of real fish displacement data are provided.},
keywords = {Animal movement, Bayesian inference, Importance sampling, L{\'{e}}vy process, α-stable distributions},
pubstate = {published},
tppubtype = {article}
}
Pries, Aaron; Ramírez, David; Schreier, Peter J
Detection of Cyclostationarity in the Presence of Temporal or Spatial Structure with Applications to Cognitive Radio Proceedings Article
En: Proc. IEEE Int. Conf. Acoustics, Speech and Signal Process., (ICASSP 2016), Shanghai, 2016.
@inproceedings{Pries2016,
title = {Detection of Cyclostationarity in the Presence of Temporal or Spatial Structure with Applications to Cognitive Radio},
author = {Aaron Pries and David Ram\'{i}rez and Peter J Schreier},
url = {http://www.icassp2016.org/Papers/ViewPapers.asp?PaperNum=1789},
year = {2016},
date = {2016-03-01},
booktitle = {Proc. IEEE Int. Conf. Acoustics, Speech and Signal Process., (ICASSP 2016)},
address = {Shanghai},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Koch, Tobias
A Necessary and Sufficient Condition for the Asymptotic Tightness of the Shannon Lower Bound Proceedings Article
En: International Zurich Seminar on Communications, Zurich, 2016.
BibTeX | Etiquetas:
@inproceedings{Koch2016bb,
title = {A Necessary and Sufficient Condition for the Asymptotic Tightness of the Shannon Lower Bound},
author = {Tobias Koch},
year = {2016},
date = {2016-03-01},
booktitle = {International Zurich Seminar on Communications},
address = {Zurich},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Elvira, Victor; Miguez, Joaquin; Djuric, Petar M
Online Adaptation of the Number of Particles of Sequential Monte Carlo Methods Proceedings Article
En: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2016), Shanghai, 2016.
BibTeX | Etiquetas:
@inproceedings{Elvira2016,
title = {Online Adaptation of the Number of Particles of Sequential Monte Carlo Methods},
author = {Victor Elvira and Joaquin Miguez and Petar M Djuric},
year = {2016},
date = {2016-03-01},
booktitle = {IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2016)},
address = {Shanghai},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Martino, Luca; Elvira, Victor; Luengo, David; Louzada, Francisco
Parallel Metropolis Chains with Cooperative Adaptation Proceedings Article
En: IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2016), Shanghai, 2016.
@inproceedings{Martino2016bb,
title = {Parallel Metropolis Chains with Cooperative Adaptation},
author = {Luca Martino and Victor Elvira and David Luengo and Francisco Louzada},
url = {http://www.icassp2016.org/Papers/ViewPapers.asp?PaperNum=3747},
year = {2016},
date = {2016-03-01},
booktitle = {IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2016)},
address = {Shanghai},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Martín-Fernández, L; Ruiz, D P; Torija, A J; Miguez, Joaquin
A Bayesian Method for Model Selection in Environmental Noise Prediction Artículo de revista
En: Journal of Environmental Informatics, vol. 27, no 1, pp. 31–42, 2016, ISSN: 1726-2135.
Resumen | Enlaces | BibTeX | Etiquetas: Journal
@article{Martin-Fernandez2015b,
title = {A Bayesian Method for Model Selection in Environmental Noise Prediction},
author = {L Mart\'{i}n-Fern\'{a}ndez and D P Ruiz and A J Torija and Joaquin Miguez},
url = {http://www.researchgate.net/publication/268213140_A_Bayesian_method_for_model_selection_in_environmental_noise_prediction},
issn = {1726-2135},
year = {2016},
date = {2016-03-01},
journal = {Journal of Environmental Informatics},
volume = {27},
number = {1},
pages = {31--42},
abstract = {Environmental noise prediction and modeling are key factors for addressing a proper planning and management of urban sound environments. In this paper we propose a maximum a posteriori (MAP) method to compare nonlinear state-space models that describe the problem of predicting environmental sound levels. The numerical implementation of this method is based on particle filtering and we use a Markov chain Monte Carlo technique to improve the resampling step. In order to demonstrate the validity of the proposed approach for this particular problem, we have conducted a set of experiments where two prediction models are quantitatively compared using real noise measurement data collected in different urban areas.},
keywords = {Journal},
pubstate = {published},
tppubtype = {article}
}
Martino, Luca; Elvira, Victor; Luengo, David; Corander, Jukka
Layered adaptive importance sampling Artículo de revista
En: Statistics and Computing, pp. 1–25, 2016, ISSN: 0960-3174.
Resumen | Enlaces | BibTeX | Etiquetas: Bayesian inference Adaptive importance sampling Po, Journal
@article{Martino2016a,
title = {Layered adaptive importance sampling},
author = {Luca Martino and Victor Elvira and David Luengo and Jukka Corander},
url = {http://link.springer.com/10.1007/s11222-016-9642-5},
doi = {10.1007/s11222-016-9642-5},
issn = {0960-3174},
year = {2016},
date = {2016-03-01},
journal = {Statistics and Computing},
pages = {1--25},
publisher = {Springer US},
abstract = {Monte Carlo methods represent the de facto standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use simpler proposal probability densities to draw candidate samples. The performance of any such method is strictly related to the specification of the proposal distribution, such that unfortunate choices easily wreak havoc on the resulting estimators. In this work, we introduce a layered (i.e., hierarchical) procedure to generate samples employed within a Monte Carlo scheme. This approach ensures that an appropriate equivalent proposal density is always obtained automatically (thus eliminating the risk of a catastrophic performance), although at the expense of a moderate increase in the complexity. Furthermore, we provide a general unified importance sampling (IS) framework, where multiple proposal densities are employed and several IS schemes are introduced by applying the so-called deterministic mixture approach. Finally, given these schemes, we also propose a novel class of adaptive importance samplers using a population of proposals, where the adaptation is driven by independent parallel or interacting Markov chain Monte Carlo (MCMC) chains. The resulting algorithms efficiently combine the benefits of both IS and MCMC methods.},
keywords = {Bayesian inference Adaptive importance sampling Po, Journal},
pubstate = {published},
tppubtype = {article}
}
Vazquez-Vilar, Gonzalo; i Fàbregas, Albert Guillén; Verdú, Sergio
Hypothesis testing and quasi-perfect codes Proceedings Article
En: 2016 International Zurich Seminar on Communications (IZS 2016), Zurich, Switzerland, 2016.
BibTeX | Etiquetas:
@inproceedings{gvazquez-izs2016,
title = {Hypothesis testing and quasi-perfect codes},
author = {Gonzalo Vazquez-Vilar and Albert Guill\'{e}n i F\`{a}bregas and Sergio Verd\'{u}},
year = {2016},
date = {2016-03-01},
booktitle = {2016 International Zurich Seminar on Communications (IZS 2016)},
address = {Zurich, Switzerland},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Luengo, David; Ríos-Muñoz, Gonzalo; Elvira, Victor; Artés-Rodríguez, Antonio
A hierarchical algorithm for causality discovery among atrial fibrillation electrograms Proceedings Article
En: 2016 IEEE Int. Conf. Acoust. Speech Signal Process., pp. 774–778, IEEE, 2016, ISBN: 978-1-4799-9988-0.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Luengo2016b,
title = {A hierarchical algorithm for causality discovery among atrial fibrillation electrograms},
author = {David Luengo and Gonzalo R\'{i}os-Mu\~{n}oz and Victor Elvira and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://ieeexplore.ieee.org/document/7471780/},
doi = {10.1109/ICASSP.2016.7471780},
isbn = {978-1-4799-9988-0},
year = {2016},
date = {2016-03-01},
booktitle = {2016 IEEE Int. Conf. Acoust. Speech Signal Process.},
pages = {774--778},
publisher = {IEEE},
abstract = {Multi-channel intracardiac electrocardiograms (electrograms) are sequentially acquired, at the electrophysiology laboratory, in order to guide radio frequency catheter ablation during heart surgery performed on patients with sustained atrial fibrillation (AF). These electrograms are used by cardiologists to determine candidate areas for ablation (e.g., areas corresponding to high dominant frequencies or complex fractionated electrograms). In this paper, we introduce a novel hierarchical algorithm for causality discovery among these multi-output sequentially acquired electrograms. The causal model obtained provides important information about the propagation of the electrical signals inside the heart, uncovering wavefronts and activation patterns that will serve to increase our knowledge about AF and guide cardiologists towards candidate areas for catheter ablation. Numerical results on synthetic signals, generated using the FitzHugh-Nagumo model, show the good performance of the proposed approach.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Stinner, Markus; Olmos, Pablo M
On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs Artículo de revista
En: IEEE Journal on Selected Areas in Communications, vol. 34, no 2, pp. 345–361, 2016, ISSN: 0733-8716.
Resumen | Enlaces | BibTeX | Etiquetas: Analytical models, capacity-achieving codes, Complexity theory, Couplings, Decoding, Encoding, finite-length analysis, Iterative decoding, Low-density parity-check (LDPC) codes, spatially coupled LDPC codes constructed from prot
@article{Stinner2016,
title = {On the Waterfall Performance of Finite-Length SC-LDPC Codes Constructed From Protographs},
author = {Markus Stinner and Pablo M Olmos},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7339427},
doi = {10.1109/JSAC.2015.2504279},
issn = {0733-8716},
year = {2016},
date = {2016-02-01},
journal = {IEEE Journal on Selected Areas in Communications},
volume = {34},
number = {2},
pages = {345--361},
abstract = {An analysis of spatially coupled low-density parity-check (SC-LDPC) codes constructed from protographs is proposed. Given the protograph used to generate the SC-LDPC code ensemble, a set of scaling parameters to characterize the average finite-length performance in the waterfall region is computed. The error performance of structured SC-LDPC code ensembles is shown to follow a scaling law similar to that of unstructured randomly constructed SC-LDPC codes. Under a finite-length perspective, some of the most relevant SC-LDPC protograph structures proposed to date are compared. The analysis reveals significant differences in their finite-length scaling behavior, which is corroborated by simulation. Spatially coupled repeat-accumulate codes present excellent finite-length performance, as they outperform in the waterfall region SC-LDPC codes of the same rate and better asymptotic thresholds.},
keywords = {Analytical models, capacity-achieving codes, Complexity theory, Couplings, Decoding, Encoding, finite-length analysis, Iterative decoding, Low-density parity-check (LDPC) codes, spatially coupled LDPC codes constructed from prot},
pubstate = {published},
tppubtype = {article}
}
Valera, Isabel; Ruiz, Francisco J R; Olmos, Pablo M; Blanco, Carlos; Perez-Cruz, Fernando
Infinite Continuous Feature Model for Psychiatric Comorbidity Analysis. Artículo de revista
En: Neural computation, vol. 28, no 2, pp. 354–381, 2016, ISSN: 1530-888X.
Resumen | Enlaces | BibTeX | Etiquetas: Journal
@article{Valera2016ab,
title = {Infinite Continuous Feature Model for Psychiatric Comorbidity Analysis.},
author = {Isabel Valera and Francisco J R Ruiz and Pablo M Olmos and Carlos Blanco and Fernando Perez-Cruz},
url = {http://www.ncbi.nlm.nih.gov/pubmed/26654208},
doi = {10.1162/NECO_a_00805},
issn = {1530-888X},
year = {2016},
date = {2016-02-01},
journal = {Neural computation},
volume = {28},
number = {2},
pages = {354--381},
abstract = {We aim at finding the comorbidity patterns of substance abuse, mood and personality disorders using the diagnoses from the National Epidemiologic Survey on Alcohol and Related Conditions database. To this end, we propose a novel Bayesian nonparametric latent feature model for categorical observations, based on the Indian buffet process, in which the latent variables can take values between 0 and 1. The proposed model has several interesting features for modeling psychiatric disorders. First, the latent features might be off, which allows distinguishing between the subjects who suffer a condition and those who do not. Second, the active latent features take positive values, which allows modeling the extent to which the patient has that condition. We also develop a new Markov chain Monte Carlo inference algorithm for our model that makes use of a nested expectation propagation procedure.},
keywords = {Journal},
pubstate = {published},
tppubtype = {article}
}
Durisi, Giuseppe; Koch, Tobias; Ostman, Johan; Polyanskiy, Yury; Yang, Wei
Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels Artículo de revista
En: IEEE Transactions on Communications, vol. 64, no 2, pp. 618–629, 2016, ISSN: 0090-6778.
Resumen | Enlaces | BibTeX | Etiquetas: diversity branches, Encoding, ergodic capacity, Fading, fading channels, finite-blocklength information theory, finiteblocklength information theory, infinite-blocklength performance metrics, Journal, machine-type communication systems, maximum coding rate, Mission critical systems, mission-critical machine-type communications, multiple antennas, multiple-antenna Rayleigh block-fading channels, Multiplexing, optimal number, outage capacity, rate gain, Rayleigh channels, Receivers, Reliability, short-packet communications, spatial multiplexing, Throughput, Time-frequency analysis, time-frequency-spatial degrees of freedom, transmit antennas, transmit diversity, Transmitting antennas, Ultra-reliable low-latency communications
@article{Durisi2016b,
title = {Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels},
author = {Giuseppe Durisi and Tobias Koch and Johan Ostman and Yury Polyanskiy and Wei Yang},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7362178},
doi = {10.1109/TCOMM.2015.2511087},
issn = {0090-6778},
year = {2016},
date = {2016-02-01},
journal = {IEEE Transactions on Communications},
volume = {64},
number = {2},
pages = {618--629},
publisher = {IEEE},
abstract = {Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh block-fading channels. Specifically, we obtain finite-blocklength, finite-SNR upper and lower bounds on the maximum coding rate achievable over such channels for a given constraint on the packet error probability. Numerical evidence suggests that our bounds delimit tightly the maximum coding rate already for short blocklengths (packets of about 100 symbols). Furthermore, our bounds reveal the existence of a tradeoff between the rate gain obtainable by spreading each codeword over all available time-frequency-spatial degrees of freedom, and the rate loss caused by the need of estimating the fading coefficients over these degrees of freedom. In particular, our bounds allow us to determine the optimal number of transmit antennas and the optimal number of time-frequency diversity branches that maximize the rate. Finally, we show that infinite-blocklength performance metrics such as the ergodic capacity and the outage capacity yield inaccurate throughput estimates},
keywords = {diversity branches, Encoding, ergodic capacity, Fading, fading channels, finite-blocklength information theory, finiteblocklength information theory, infinite-blocklength performance metrics, Journal, machine-type communication systems, maximum coding rate, Mission critical systems, mission-critical machine-type communications, multiple antennas, multiple-antenna Rayleigh block-fading channels, Multiplexing, optimal number, outage capacity, rate gain, Rayleigh channels, Receivers, Reliability, short-packet communications, spatial multiplexing, Throughput, Time-frequency analysis, time-frequency-spatial degrees of freedom, transmit antennas, transmit diversity, Transmitting antennas, Ultra-reliable low-latency communications},
pubstate = {published},
tppubtype = {article}
}
Valera, Isabel; Ruiz, Francisco J R; Perez-Cruz, Fernando
Infinite Factorial Unbounded-State Hidden Markov Model Artículo de revista
En: IEEE transactions on pattern analysis and machine intelligence, vol. To appear, no 99, pp. 1, 2016, ISSN: 1939-3539.
Resumen | Enlaces | BibTeX | Etiquetas: Bayes methods, Bayesian nonparametrics, CASI CAM CM, Computational modeling, GAMMA-L+ UC3M, Gibbs sampling, Hidden Markov models, Inference algorithms, Markov processes, Probability distribution, reversible jump Markov chain Monte Carlo, slice sampling, Time series, variational inference, Yttrium
@article{Valera2016c,
title = {Infinite Factorial Unbounded-State Hidden Markov Model},
author = {Isabel Valera and Francisco J R Ruiz and Fernando Perez-Cruz},
url = {http://www.ncbi.nlm.nih.gov/pubmed/26571511 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true\&arnumber=7322279},
doi = {10.1109/TPAMI.2015.2498931},
issn = {1939-3539},
year = {2016},
date = {2016-01-01},
journal = {IEEE transactions on pattern analysis and machine intelligence},
volume = {To appear},
number = {99},
pages = {1},
abstract = {There are many scenarios in artificial intelligence, signal processing or medicine, in which a temporal sequence consists of several unknown overlapping independent causes, and we are interested in accurately recovering those canonical causes. Factorial hidden Markov models (FHMMs) present the versatility to provide a good fit to these scenarios. However, in some scenarios, the number of causes or the number of states of the FHMM cannot be known or limited a priori. In this paper, we propose an infinite factorial unbounded-state hidden Markov model (IFUHMM), in which the number of parallel hidden Markov models (HMMs) and states in each HMM are potentially unbounded. We rely on a Bayesian nonparametric (BNP) prior over integer-valued matrices, in which the columns represent the Markov chains, the rows the time indexes, and the integers the state for each chain and time instant. First, we extend the existent infinite factorial binary-state HMM to allow for any number of states. Then, we modify this model to allow for an unbounded number of states and derive an MCMC-based inference algorithm that properly deals with the trade-off between the unbounded number of states and chains. We illustrate the performance of our proposed models in the power disaggregation problem.},
keywords = {Bayes methods, Bayesian nonparametrics, CASI CAM CM, Computational modeling, GAMMA-L+ UC3M, Gibbs sampling, Hidden Markov models, Inference algorithms, Markov processes, Probability distribution, reversible jump Markov chain Monte Carlo, slice sampling, Time series, variational inference, Yttrium},
pubstate = {published},
tppubtype = {article}
}
Nazabal, Alfredo; Garcia-Moreno, Pablo; Artes-Rodriguez, Antonio; Ghahramani, Zoubin
Human Activity Recognition by Combining a Small Number of Classifiers Artículo de revista
En: IEEE journal of biomedical and health informatics, vol. To appear, 2016, ISSN: 2168-2208.
Resumen | Enlaces | BibTeX | Etiquetas: Bayes methods, Bayesian inference, Biological system modeling, Classifier combination, Databases, Estimation, Hidden Markov models, Sensor systems
@article{Nazabal2016bb,
title = {Human Activity Recognition by Combining a Small Number of Classifiers},
author = {Alfredo Nazabal and Pablo Garcia-Moreno and Antonio Artes-Rodriguez and Zoubin Ghahramani},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7161292},
doi = {10.1109/JBHI.2015.2458274},
issn = {2168-2208},
year = {2016},
date = {2016-01-01},
journal = {IEEE journal of biomedical and health informatics},
volume = {To appear},
publisher = {IEEE},
abstract = {We consider the problem of daily Human Activity Recognition (HAR) using multiple wireless inertial sensors and, specifically, HAR systems with a very low number of sensors, each one providing an estimation of the performed activities. We propose new Bayesian models to combine the output of the sensors. The models are based on a soft outputs combination of individual classifiers to deal with the small number of sensors. We also incorporate the dynamic nature of human activities as a first order homogeneous Markov chain. We develop both inductive and transductive inference methods for each model to be employed in supervised and semi-supervised situations, respectively. Using different real HAR databases, we compare our classifiers combination models against a single classifier that employs all the signals from the sensors. Our models exhibit consistently a reduction of the error rate and an increase of robustness against sensor failures. Our models also outperform other classifiers combination models that do not consider soft outputs and a Markovian structure of the human activities.},
keywords = {Bayes methods, Bayesian inference, Biological system modeling, Classifier combination, Databases, Estimation, Hidden Markov models, Sensor systems},
pubstate = {published},
tppubtype = {article}
}
Borchani, Hanen; Larrañaga, Pedro; Gama, J; Bielza, Concha
Mining multi-dimensional concept-drifting data streams using Bayesian network classifiers Artículo de revista
En: Intelligent Data Analysis, vol. 20, 2016.
Enlaces | BibTeX | Etiquetas: CASI CAM CM, CIG UPM, Journal
@article{Borchani2016,
title = {Mining multi-dimensional concept-drifting data streams using Bayesian network classifiers},
author = {Hanen Borchani and Pedro Larra\~{n}aga and J Gama and Concha Bielza},
url = {http://cig.fi.upm.es/node/879},
year = {2016},
date = {2016-01-01},
journal = {Intelligent Data Analysis},
volume = {20},
keywords = {CASI CAM CM, CIG UPM, Journal},
pubstate = {published},
tppubtype = {article}
}
Asheghan, Mohammad Mostafa; Míguez, Joaquín
Stability Analysis and Robust Control of Heart Beat Rate During Treadmill Exercise Artículo de revista
En: Automatica, vol. 63, pp. 311–320, 2016, ISSN: 00051098.
Resumen | Enlaces | BibTeX | Etiquetas: Cardiovascular system, Journal, Nonlinear systems, Robust control
@article{Asheghan2016,
title = {Stability Analysis and Robust Control of Heart Beat Rate During Treadmill Exercise},
author = {Mohammad Mostafa Asheghan and Joaqu\'{i}n M\'{i}guez},
doi = {10.1016/j.automatica.2015.10.027},
issn = {00051098},
year = {2016},
date = {2016-01-01},
journal = {Automatica},
volume = {63},
pages = {311--320},
abstract = {We investigate a nonlinear dynamical model of a human's heart beat rate (HBR) during a treadmill exercise. We begin with a rigorous analysis of the stability of the model that extends significantly the results available in the literature. In particular, we first identify a simple set of necessary and sufficient conditions for both input-state stability and Lyapunov stability of the system, and then prove that the same conditions also hold when the model parameters are subject to unknown but bounded perturbations. The second part of the paper is devoted to the design and analysis of a control structure for this model, where the treadmill speed plays the role of the control input and the output is the subject's HBR, which is intended to follow a prescribed pattern. We propose a simple control scheme, suitable for a practical implementation, and then analyze its performance. Specifically, we prove (i) that the same conditions that guarantee the stability of the system also ensure that the controller attains a desired level of performance (quantified in terms of the admissible deviation of the HBR from the prescribed profile) and (ii) that the controller is robust to bounded perturbations both in the system parameters and the control input. Numerical simulations are also presented in order to illustrate some of the theoretical results.},
keywords = {Cardiovascular system, Journal, Nonlinear systems, Robust control},
pubstate = {published},
tppubtype = {article}
}
Castellanos, Evaristo; Hernandez, Pablo Ruiz M; Ríos-Muñoz, Gonzalo; Ávila, Pablo; Datino, Tomás; Atienza, Felipe; Fernández-Avilés, Francisco; Arenal, Ángel
Influencia del Ritmo en la Identificación de Islotes de Escara Auricular en Pacientes con FA Persistente sin Disfunción Ventricular Izquierda Detectada con Catéter de Mapeo Multielectrodo de 1mm Proceedings Article
En: SEC 2016 - El Congr. las Enfermedades Cardiovasc., 2016.
@inproceedings{Castellanos2016,
title = {Influencia del Ritmo en la Identificaci\'{o}n de Islotes de Escara Auricular en Pacientes con FA Persistente sin Disfunci\'{o}n Ventricular Izquierda Detectada con Cat\'{e}ter de Mapeo Multielectrodo de 1mm},
author = {Evaristo Castellanos and Pablo Ruiz M Hernandez and Gonzalo R\'{i}os-Mu\~{n}oz and Pablo \'{A}vila and Tom\'{a}s Datino and Felipe Atienza and Francisco Fern\'{a}ndez-Avil\'{e}s and \'{A}ngel Arenal},
year = {2016},
date = {2016-01-01},
booktitle = {SEC 2016 - El Congr. las Enfermedades Cardiovasc.},
number = {6002-38},
abstract = {En la fibrilaci\'{o}n auricular persistente (FA-Per), el aislamiento de las venas pulmonares (VVPP) presenta una mayor tasa de recidiva que en FA parox\'{i}stica. La FA-Per induce una remodelaci\'{o}n estructural caracterizada por fibrosis y formaci\'{o}n de tejido cicatricial en la aur\'{i}cula. La remodelaci\'{o}n estructural se asocia con una mayor tasa de recurrencia tras la ablaci\'{o}n. El mapeo electroanat\'{o}mico del tejido cicatricial no asociado a las VVPP podr\'{i}a facilitar la identificaci\'{o}n del sustrato espec\'{i}fico de la FA-Per. Los cat\'{e}teres de mapeo multielectrodo proporcionan una alta definici\'{o}n de tejido fibr\'{o}tico en pacientes con taquicardias auriculares. El objetivo fue evaluar y cuantificar la presencia de islotes de tejido cicatricial (durante el ritmo sinusal (RS) y FA) en los pacientes con FA-Per sin disfunci\'{o}n ventricular izquierda},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Pradier, Melanie F.; Ruiz, Francisco J R; Perez-Cruz, Fernando
Prior Design for Dependent Dirichlet Processes: An Application to Marathon Modeling Artículo de revista
En: PLOS ONE, vol. 11, no 1, pp. e0147402, 2016, ISSN: 1932-6203.
Resumen | Enlaces | BibTeX | Etiquetas: Journal
@article{F.Pradier2016,
title = {Prior Design for Dependent Dirichlet Processes: An Application to Marathon Modeling},
author = {Melanie F. Pradier and Francisco J R Ruiz and Fernando Perez-Cruz},
editor = {Guy Brock},
url = {http://dx.plos.org/10.1371/journal.pone.0147402},
doi = {10.1371/journal.pone.0147402},
issn = {1932-6203},
year = {2016},
date = {2016-01-01},
journal = {PLOS ONE},
volume = {11},
number = {1},
pages = {e0147402},
publisher = {Public Library of Science},
abstract = {This paper presents a novel application of Bayesian nonparametrics (BNP) for marathon data modeling. We make use of two well-known BNP priors, the single-p dependent Dirichlet process and the hierarchical Dirichlet process, in order to address two different problems. First, we study the impact of age, gender and environment on the runners' performance. We derive a fair grading method that allows direct comparison of runners regardless of their age and gender. Unlike current grading systems, our approach is based not only on top world records, but on the performances of all runners. The presented methodology for comparison of densities can be adopted in many other applications straightforwardly, providing an interesting perspective to build dependent Dirichlet processes. Second, we analyze the running patterns of the marathoners in time, obtaining information that can be valuable for training purposes. We also show that these running patterns can be used to predict finishing time given intermediate interval measurements. We apply our models to New York City, Boston and London marathons.},
keywords = {Journal},
pubstate = {published},
tppubtype = {article}
}
2015
Valera, Isabel; Ruiz, Francisco J R; Svensson, Lennart; Perez-Cruz, Fernando
Infinite Factorial Dynamical Model Proceedings Article
En: Advances in Neural Information Processing Systems, pp. 1657–1665, Montreal, 2015.
Resumen | Enlaces | BibTeX | Etiquetas: CASI CAM CM, GAMMA-L+ UC3M
@inproceedings{Valera2015a,
title = {Infinite Factorial Dynamical Model},
author = {Isabel Valera and Francisco J R Ruiz and Lennart Svensson and Fernando Perez-Cruz},
url = {http://papers.nips.cc/paper/5667-infinite-factorial-dynamical-model},
year = {2015},
date = {2015-12-01},
booktitle = {Advances in Neural Information Processing Systems},
pages = {1657--1665},
address = {Montreal},
abstract = {We propose the infinite factorial dynamic model (iFDM), a general Bayesian nonparametric model for source separation. Our model builds on the Markov Indian buffet process to consider a potentially unbounded number of hidden Markov chains (sources) that evolve independently according to some dynamics, in which the state space can be either discrete or continuous. For posterior inference, we develop an algorithm based on particle Gibbs with ancestor sampling that can be efficiently applied to a wide range of source separation problems. We evaluate the performance of our iFDM on four well-known applications: multitarget tracking, cocktail party, power disaggregation, and multiuser detection. Our experimental results show that our approach for source separation does not only outperform previous approaches, but it can also handle problems that were computationally intractable for existing approaches.},
keywords = {CASI CAM CM, GAMMA-L+ UC3M},
pubstate = {published},
tppubtype = {inproceedings}
}
Luengo, David; Martino, Luca; Elvira, Victor; Bugallo, Monica F
Bias correction for distributed Bayesian estimators Proceedings Article
En: 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), pp. 253–256, IEEE, Cancun, 2015, ISBN: 978-1-4799-1963-5.
Resumen | Enlaces | BibTeX | Etiquetas: Bayes methods, Big data, Distributed databases, Estimation, Probability density function, Wireless Sensor Networks
@inproceedings{Luengo2015a,
title = {Bias correction for distributed Bayesian estimators},
author = {David Luengo and Luca Martino and Victor Elvira and Monica F Bugallo},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7383784},
doi = {10.1109/CAMSAP.2015.7383784},
isbn = {978-1-4799-1963-5},
year = {2015},
date = {2015-12-01},
booktitle = {2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)},
pages = {253--256},
publisher = {IEEE},
address = {Cancun},
abstract = {Dealing with the whole dataset in big data estimation problems is usually unfeasible. A common solution then consists of dividing the data into several smaller sets, performing distributed Bayesian estimation and combining these partial estimates to obtain a global estimate. A major problem of this approach is the presence of a non-negligible bias in the partial estimators, due to the mismatch between the unknown true prior and the prior assumed in the estimation. A simple method to mitigate the effect of this bias is proposed in this paper. Essentially, the approach is based on using a reference data set to obtain a rough estimation of the parameter of interest, i.e., a reference parameter. This information is then communicated to the partial filters that handle the smaller data sets, which can thus use a refined prior centered around this parameter. Simulation results confirm the good performance of this scheme.},
keywords = {Bayes methods, Big data, Distributed databases, Estimation, Probability density function, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {inproceedings}
}
Dashti, Marzieh; Yiu, Simon; Yousefi, Siamak; Perez-Cruz, Fernando; Claussen, Holger
RSSI Localization with Gaussian Processes and Tracking Proceedings Article
En: IEEE Globecom, San Diego, 2015.
@inproceedings{Dashi2015,
title = {RSSI Localization with Gaussian Processes and Tracking},
author = {Marzieh Dashti and Simon Yiu and Siamak Yousefi and Fernando Perez-Cruz and Holger Claussen},
url = {http://globecom2015.ieee-globecom.org/},
year = {2015},
date = {2015-12-01},
booktitle = {IEEE Globecom},
address = {San Diego},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Guzman, Borja Genoves; Serrano, Alejandro Lancho; Jimenez, Víctor Gil P
Cooperative Optical Wireless Transmission for Improving Performance in Indoor Scenarios for Visible Light Communications Artículo de revista
En: IEEE Transactions on Consumer Electronics, vol. 61, no 4, pp. 393–401, 2015, ISSN: 0098-3063.
Resumen | Enlaces | BibTeX | Etiquetas: CoMP, Cooperative transmission andreception, Interference, Journal, Nonlinear optics, Optical receivers, Proposals, Pulse Position Division Multiplexing, Radio frequency, VLC, Wireless communication
@article{Guzman2015,
title = {Cooperative Optical Wireless Transmission for Improving Performance in Indoor Scenarios for Visible Light Communications},
author = {Borja Genoves Guzman and Alejandro Lancho Serrano and V\'{i}ctor Gil P Jimenez},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7389772},
doi = {10.1109/TCE.2015.7389772},
issn = {0098-3063},
year = {2015},
date = {2015-11-01},
journal = {IEEE Transactions on Consumer Electronics},
volume = {61},
number = {4},
pages = {393--401},
publisher = {IEEE},
abstract = {In this paper, a novel cooperative transmission and reception scheme in Visible Light Communications (VLC) is proposed and evaluated. This new scheme provides improvements and reliability in large indoor scenarios, such as corridors, laboratories, shops or conference rooms, where the coverage needs to be obtained by using different access points when VLC is used. The main idea behind the proposal is a simple cooperative transmission scheme where the receiver terminal will obtain the signal from different access points at the same time. This proposal outperforms traditional VLC schemes, especially in Non-Line-of-Sight reception where around 3 dB of gain, with respect to traditional schemes, can be obtained for unoptimized parameters, and larger than 3 dB could easily be achieved. The cooperation is studied in terms of the percentage of light coming from the main access point and a parameter called sidelobes??? amplitude level. The performance is evaluated according to the location within the atto-cell.},
keywords = {CoMP, Cooperative transmission andreception, Interference, Journal, Nonlinear optics, Optical receivers, Proposals, Pulse Position Division Multiplexing, Radio frequency, VLC, Wireless communication},
pubstate = {published},
tppubtype = {article}
}
Elvira, Victor; Martino, Luca; Luengo, David; Bugallo, Monica F
On Sample Generation and Weight Calculation in Multiple Importance Sampling Proceedings Article
En: IEEE Conference on Signals, Systems, and Computers (ASILOMAR 2015), Pacific Groove, 2015.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Elvira2015b,
title = {On Sample Generation and Weight Calculation in Multiple Importance Sampling},
author = {Victor Elvira and Luca Martino and David Luengo and Monica F Bugallo},
url = {http://www.asilomarsscconf.org/webpage/asil15/Asilomar 2015 Book of Abstracts v005.pdf},
year = {2015},
date = {2015-11-01},
booktitle = {IEEE Conference on Signals, Systems, and Computers (ASILOMAR 2015)},
address = {Pacific Groove},
abstract = {We investigate various sampling and weight updating techniques, which are the two crucial steps of importance sampling. We discuss the standard mixture sampling that randomly draws samples from a set of proposals and the deterministic mixture sampling, where exactly one sample is drawn from each proposal. For weight calculation, we either compute the weights by considering the particular proposal used for each sample or by interpreting the proposal as a mixture formed by all available proposals. All combinations of sampling and weight calculation and some modifications that improve the performance and/or reduce the computational complexity are examined through computer simulations},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Acer, Utku Gunay; Boran, Aidan; Forlivesi, Claudio; Liekens, Werner; Perez-cruz, Fernando; Kawsar, Fahim
Sensing WiFi Network for Personal IoT Analytics Proceedings Article
En: 2015 5th International Conference on the Internet of Things (IOT), pp. 104–111, IEEE, Seoul, 2015, ISBN: 978-1-4673-8056-0.
Resumen | Enlaces | BibTeX | Etiquetas: Accelerometers, cloud based query server, cloud computing, data transport mechanism, digital signatures, Distance measurement, Internet of Things, internetworking, IoT analytic, Logic gates, Mobile communication, motion signatures, network servers, Probes, proximity ranging algorithm, Search problems, telecommunication network management, WiFi gateway captures, WiFi management probes, WiFi network, wireless LAN
@inproceedings{Acer2015,
title = {Sensing WiFi Network for Personal IoT Analytics},
author = {Utku Gunay Acer and Aidan Boran and Claudio Forlivesi and Werner Liekens and Fernando Perez-cruz and Fahim Kawsar},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7356554},
doi = {10.1109/IOT.2015.7356554},
isbn = {978-1-4673-8056-0},
year = {2015},
date = {2015-10-01},
booktitle = {2015 5th International Conference on the Internet of Things (IOT)},
pages = {104--111},
publisher = {IEEE},
address = {Seoul},
abstract = {We present the design, implementation and evaluation of an enabling platform for locating and querying physical objects using existing WiFi network. We propose the use of WiFi management probes as a data transport mechanism for physical objects that are tagged with WiFi-enabled accelerometers and are capable of determining their state-of-use based on motion signatures. A local WiFi gateway captures these probes emitted from the connected objects and stores them locally after annotating them with a coarse grained location estimate using a proximity ranging algorithm. External applications can query the aggregated views of state-of-use and location traces of connected objects through a cloud-based query server. We present the technical architecture and algorithms of the proposed platform together with a prototype personal object analytics application and assess the feasibility of our different design decisions. This work makes important contributions by demonstrating that it is possible to build a pure network-based IoT analytics platform with only location and motion signatures of connected objects, and that the WiFi network is the key enabler for the future IoT applications.},
keywords = {Accelerometers, cloud based query server, cloud computing, data transport mechanism, digital signatures, Distance measurement, Internet of Things, internetworking, IoT analytic, Logic gates, Mobile communication, motion signatures, network servers, Probes, proximity ranging algorithm, Search problems, telecommunication network management, WiFi gateway captures, WiFi management probes, WiFi network, wireless LAN},
pubstate = {published},
tppubtype = {inproceedings}
}
Ramírez, David; Schreier, Peter J; Via, Javier; Santamaria, Ignacio; Scharf, L L
Detection of Multivariate Cyclostationarity Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 63, no 20, pp. 5395–5408, 2015, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: ad hoc function, asymptotic GLRT, asymptotic LMPIT, block circulant, block-Toeplitz structure, Correlation, covariance matrices, Covariance matrix, covariance structure, cycle period, cyclic spectrum, Cyclostationarity, Detectors, Frequency-domain analysis, generalized likelihood ratio test, generalized likelihood ratio test (GLRT), hypothesis testing problem, locally most powerful invariant test, locally most powerful invariant test (LMPIT), Loe{&}{#}x0300, maximum likelihood estimation, multivariate cyclostationarity detection, power spectral density, random processes, s theorem, scalar valued CS time series, signal detection, spectral analysis, statistical testing, Testing, Time series, Time series analysis, Toeplitz matrices, Toeplitz matrix, ve spectrum, vector valued random process cyclostationary, vector valued WSS time series, wide sense stationary, Wijsman theorem, Wijsman{&}{#}x2019
@article{Ramirez2015,
title = {Detection of Multivariate Cyclostationarity},
author = {David Ram\'{i}rez and Peter J Schreier and Javier Via and Ignacio Santamaria and L L Scharf},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7134806},
doi = {10.1109/TSP.2015.2450201},
issn = {1053-587X},
year = {2015},
date = {2015-10-01},
journal = {IEEE Transactions on Signal Processing},
volume = {63},
number = {20},
pages = {5395--5408},
publisher = {IEEE},
abstract = {This paper derives an asymptotic generalized likelihood ratio test (GLRT) and an asymptotic locally most powerful invariant test (LMPIT) for two hypothesis testing problems: 1) Is a vector-valued random process cyclostationary (CS) or is it wide-sense stationary (WSS)? 2) Is a vector-valued random process CS or is it nonstationary? Our approach uses the relationship between a scalar-valued CS time series and a vector-valued WSS time series for which the knowledge of the cycle period is required. This relationship allows us to formulate the problem as a test for the covariance structure of the observations. The covariance matrix of the observations has a block-Toeplitz structure for CS and WSS processes. By considering the asymptotic case where the covariance matrix becomes block-circulant we are able to derive its maximum likelihood (ML) estimate and thus an asymptotic GLRT. Moreover, using Wijsman's theorem, we also obtain an asymptotic LMPIT. These detectors may be expressed in terms of the Loève spectrum, the cyclic spectrum, and the power spectral density, establishing how to fuse the information in these spectra for an asymptotic GLRT and LMPIT. This goes beyond the state-of-the-art, where it is common practice to build detectors of cyclostationarity from ad-hoc functions of these spectra.},
keywords = {ad hoc function, asymptotic GLRT, asymptotic LMPIT, block circulant, block-Toeplitz structure, Correlation, covariance matrices, Covariance matrix, covariance structure, cycle period, cyclic spectrum, Cyclostationarity, Detectors, Frequency-domain analysis, generalized likelihood ratio test, generalized likelihood ratio test (GLRT), hypothesis testing problem, locally most powerful invariant test, locally most powerful invariant test (LMPIT), Loe{\&}{#}x0300, maximum likelihood estimation, multivariate cyclostationarity detection, power spectral density, random processes, s theorem, scalar valued CS time series, signal detection, spectral analysis, statistical testing, Testing, Time series, Time series analysis, Toeplitz matrices, Toeplitz matrix, ve spectrum, vector valued random process cyclostationary, vector valued WSS time series, wide sense stationary, Wijsman theorem, Wijsman{\&}{#}x2019},
pubstate = {published},
tppubtype = {article}
}
Elvira, Victor; Martino, Luca; Luengo, David; Bugallo, Monica F
Efficient Multiple Importance Sampling Estimators Artículo de revista
En: IEEE Signal Processing Letters, vol. 22, no 10, pp. 1757–1761, 2015, ISSN: 1070-9908.
Resumen | Enlaces | BibTeX | Etiquetas: Adaptive importance sampling, classical mixture approach, computational complexity, Computational efficiency, Computer Simulation, deterministic mixture, estimation theory, Journal, Monte Carlo methods, multiple importance sampling, multiple importance sampling estimator, partial deterministic mixture MIS estimator, Proposals, signal sampling, Sociology, Standards, variance reduction, weight calculation
@article{Elvira2015bb,
title = {Efficient Multiple Importance Sampling Estimators},
author = {Victor Elvira and Luca Martino and David Luengo and Monica F Bugallo},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7105865},
doi = {10.1109/LSP.2015.2432078},
issn = {1070-9908},
year = {2015},
date = {2015-10-01},
journal = {IEEE Signal Processing Letters},
volume = {22},
number = {10},
pages = {1757--1761},
publisher = {IEEE},
abstract = {Multiple importance sampling (MIS) methods use a set of proposal distributions from which samples are drawn. Each sample is then assigned an importance weight that can be obtained according to different strategies. This work is motivated by the trade-off between variance reduction and computational complexity of the different approaches (classical vs. deterministic mixture) available for the weight calculation. A new method that achieves an efficient compromise between both factors is introduced in this letter. It is based on forming a partition of the set of proposal distributions and computing the weights accordingly. Computer simulations show the excellent performance of the associated partial deterministic mixture MIS estimator.},
keywords = {Adaptive importance sampling, classical mixture approach, computational complexity, Computational efficiency, Computer Simulation, deterministic mixture, estimation theory, Journal, Monte Carlo methods, multiple importance sampling, multiple importance sampling estimator, partial deterministic mixture MIS estimator, Proposals, signal sampling, Sociology, Standards, variance reduction, weight calculation},
pubstate = {published},
tppubtype = {article}
}
Mihaljević, Bojan; Benavides-Piccione, Ruth; Guerra, Luis; DeFelipe, Javier; Larrañaga, Pedro; Bielza, Concha
Classifying GABAergic interneurons with semi-supervised projected model-based clustering. Artículo de revista
En: Artificial intelligence in medicine, vol. 65, no 1, pp. 49–59, 2015, ISSN: 1873-2860.
Resumen | Enlaces | BibTeX | Etiquetas: Automatic neuron classification, CASI CAM CM, Cerebral cortex, CIG UPM, Gaussian mixture models, Journal, Semi-supervised projected clustering
@article{Mihaljevic2015,
title = {Classifying GABAergic interneurons with semi-supervised projected model-based clustering.},
author = {Bojan Mihaljevi\'{c} and Ruth Benavides-Piccione and Luis Guerra and Javier DeFelipe and Pedro Larra\~{n}aga and Concha Bielza},
url = {http://www.aiimjournal.com/article/S0933365714001481/fulltext http://cig.fi.upm.es/articles/2015/Mihaljevic-2015-AIIM.pdf},
doi = {10.1016/j.artmed.2014.12.010},
issn = {1873-2860},
year = {2015},
date = {2015-09-01},
journal = {Artificial intelligence in medicine},
volume = {65},
number = {1},
pages = {49--59},
publisher = {Elsevier},
abstract = {OBJECTIVES: A recently introduced pragmatic scheme promises to be a useful catalog of interneuron names. We sought to automatically classify digitally reconstructed interneuronal morphologies according to this scheme. Simultaneously, we sought to discover possible subtypes of these types that might emerge during automatic classification (clustering). We also investigated which morphometric properties were most relevant for this classification. MATERIALS AND METHODS: A set of 118 digitally reconstructed interneuronal morphologies classified into the common basket (CB), horse-tail (HT), large basket (LB), and Martinotti (MA) interneuron types by 42 of the world's leading neuroscientists, quantified by five simple morphometric properties of the axon and four of the dendrites. We labeled each neuron with the type most commonly assigned to it by the experts. We then removed this class information for each type separately, and applied semi-supervised clustering to those cells (keeping the others' cluster membership fixed), to assess separation from other types and look for the formation of new groups (subtypes). We performed this same experiment unlabeling the cells of two types at a time, and of half the cells of a single type at a time. The clustering model is a finite mixture of Gaussians which we adapted for the estimation of local (per-cluster) feature relevance. We performed the described experiments on three different subsets of the data, formed according to how many experts agreed on type membership: at least 18 experts (the full data set), at least 21 (73 neurons), and at least 26 (47 neurons). RESULTS: Interneurons with more reliable type labels were classified more accurately. We classified HT cells with 100% accuracy, MA cells with 73% accuracy, and CB and LB cells with 56% and 58% accuracy, respectively. We identified three subtypes of the MA type, one subtype of CB and LB types each, and no subtypes of HT (it was a single, homogeneous type). We got maximum (adapted) Silhouette width and ARI values of 1, 0.83, 0.79, and 0.42, when unlabeling the HT, CB, LB, and MA types, respectively, confirming the quality of the formed cluster solutions. The subtypes identified when unlabeling a single type also emerged when unlabeling two types at a time, confirming their validity. Axonal morphometric properties were more relevant that dendritic ones, with the axonal polar histogram length in the [$pi$, 2$pi$) angle interval being particularly useful. CONCLUSIONS: The applied semi-supervised clustering method can accurately discriminate among CB, HT, LB, and MA interneuron types while discovering potential subtypes, and is therefore useful for neuronal classification. The discovery of potential subtypes suggests that some of these types are more heterogeneous that previously thought. Finally, axonal variables seem to be more relevant than dendritic ones for distinguishing among the CB, HT, LB, and MA interneuron types.},
keywords = {Automatic neuron classification, CASI CAM CM, Cerebral cortex, CIG UPM, Gaussian mixture models, Journal, Semi-supervised projected clustering},
pubstate = {published},
tppubtype = {article}
}
Borchani, Hanen; Varando, Gherardo; Bielza, Concha; Larrañaga, Pedro
A survey on multi-output regression Artículo de revista
En: Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 5, no 5, pp. 216–233, 2015, ISSN: 19424787.
Resumen | Enlaces | BibTeX | Etiquetas: algorithm adaptation methods, CASI CAM CM, CIG UPM, Journal, Multi-output regression, multi-target regression, performance evaluation measure, problem transformation methods
@article{Borchani2015,
title = {A survey on multi-output regression},
author = {Hanen Borchani and Gherardo Varando and Concha Bielza and Pedro Larra\~{n}aga},
url = {http://doi.wiley.com/10.1002/widm.1157 http://cig.fi.upm.es/articles/2015/Borchani-2015-WDMKD.pdf},
doi = {10.1002/widm.1157},
issn = {19424787},
year = {2015},
date = {2015-09-01},
journal = {Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery},
volume = {5},
number = {5},
pages = {216--233},
abstract = {In recent years, a plethora of approaches have been proposed to deal with the increasingly challenging task of multi-output regression. This study provides a survey on state-of-the-art multi-output regression methods, that are categorized as problem transformation and algorithm adaptation methods. In addition, we present the mostly used performance evaluation measures, publicly available data sets for multi-output regression real-world problems, as well as open-source software frameworks.},
keywords = {algorithm adaptation methods, CASI CAM CM, CIG UPM, Journal, Multi-output regression, multi-target regression, performance evaluation measure, problem transformation methods},
pubstate = {published},
tppubtype = {article}
}
Luengo, David; Ríos-Muñoz, Gonzalo; Elvira, Victor
Causality analysis of atrial fibrillation electrograms Proceedings Article
En: 2015 Comput. Cardiol. Conf., pp. 585–588, IEEE, 2015, ISBN: 978-1-5090-0685-4.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Luengo2015b,
title = {Causality analysis of atrial fibrillation electrograms},
author = {David Luengo and Gonzalo R\'{i}os-Mu\~{n}oz and Victor Elvira},
url = {http://ieeexplore.ieee.org/document/7410978/},
doi = {10.1109/CIC.2015.7410978},
isbn = {978-1-5090-0685-4},
year = {2015},
date = {2015-09-01},
booktitle = {2015 Comput. Cardiol. Conf.},
pages = {585--588},
publisher = {IEEE},
abstract = {Multi-channel intracavitary electrograms (EGMs) are acquired at the electrophysiology laboratory to guide radio frequency catheter ablation of patients suffering from atrial fibrillation (AF). These EGMs are used by cardiologists to determine candidate areas for ablation (e.g., areas corresponding to high dominant frequencies or complex fractionated electrograms). In this paper, we introduce two hierarchical algorithms to retrieve the causal interactions among these multiple EGMs. Both algorithms are based on Granger causality, but other causality measures can be easily incorporated. In both cases, they start by selecting a root node, but they differ on the way in which they explore the set of signals to determine their causeeffect relationships: either testing the full set of unexplored signals (GS-CaRe) or performing a local search only among the set of neighbor EGMs (LS-CaRe). The ensuing causal model provides important information about the propagation of the electrical signals inside the atria, uncovering wavefronts and activation patterns that can guide cardiologists towards candidate areas for catheter ablation. Numerical experiments, on both synthetic signals and annotated real-world signals, show the good performance of the two proposed approaches.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Luengo, David; Ríos-Muñoz, Gonzalo; Elvira, Victor
Causality Analysis of Atrial Fibrillation Electrograms Proceedings Article
En: Computing in Cardiology, Nice, 2015.
@inproceedings{Luengo2015c,
title = {Causality Analysis of Atrial Fibrillation Electrograms},
author = {David Luengo and Gonzalo R\'{i}os-Mu\~{n}oz and Victor Elvira},
url = {http://www.cinc2015.org/},
year = {2015},
date = {2015-09-01},
booktitle = {Computing in Cardiology},
address = {Nice},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Valera, Isabel; Ruiz, Francisco J R; Svensson, Lennart; Perez-Cruz, Fernando
A Bayesian Nonparametric Approach for Blind Multiuser Channel Estimation Proceedings Article
En: 2015 23rd European Signal Processing Conference (EUSIPCO), pp. 2766–2770, IEEE, Nice, 2015, ISBN: 978-0-9928-6263-3.
Resumen | Enlaces | BibTeX | Etiquetas: Bayes methods, Bayesian nonparametric, communication systems, factorial HMM, Hidden Markov models, machine-to-machine, multiuser communication, Receiving antennas, Signal to noise ratio, Transmitters
@inproceedings{Valera2015b,
title = {A Bayesian Nonparametric Approach for Blind Multiuser Channel Estimation},
author = {Isabel Valera and Francisco J R Ruiz and Lennart Svensson and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7362888 http://www.eurasip.org/Proceedings/Eusipco/Eusipco2015/papers/1570096659.pdf},
doi = {10.1109/EUSIPCO.2015.7362888},
isbn = {978-0-9928-6263-3},
year = {2015},
date = {2015-08-01},
booktitle = {2015 23rd European Signal Processing Conference (EUSIPCO)},
pages = {2766--2770},
publisher = {IEEE},
address = {Nice},
abstract = {In many modern multiuser communication systems, users are allowed to enter and leave the system at any given time. Thus, the number of active users is an unknown and time-varying parameter, and the performance of the system depends on how accurately this parameter is estimated over time. We address the problem of blind joint channel parameter and data estimation in a multiuser communication channel in which the number of transmitters is not known. For that purpose, we develop a Bayesian nonparametric model based on the Markov Indian buffet process and an inference algorithm that makes use of slice sampling and particle Gibbs with ancestor sampling. Our experimental results show that the proposed approach can effectively recover the data-generating process for a wide range of scenarios.},
keywords = {Bayes methods, Bayesian nonparametric, communication systems, factorial HMM, Hidden Markov models, machine-to-machine, multiuser communication, Receiving antennas, Signal to noise ratio, Transmitters},
pubstate = {published},
tppubtype = {inproceedings}
}
Santos, Irene; Murillo-Fuentes, Juan Jose; Olmos, Pablo M
Block Expectation Propagation Equalization for ISI Channels Proceedings Article
En: 2015 23rd European Signal Processing Conference (EUSIPCO), pp. 379–383, IEEE, Nice, 2015, ISBN: 978-0-9928-6263-3.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, Approximation methods, BCJR algorithm, channel equalization, Complexity theory, Decoding, Equalizers, expectation propagation, ISI, low complexity, Signal processing algorithms
@inproceedings{Santos2015,
title = {Block Expectation Propagation Equalization for ISI Channels},
author = {Irene Santos and Juan Jose Murillo-Fuentes and Pablo M Olmos},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7362409},
doi = {10.1109/EUSIPCO.2015.7362409},
isbn = {978-0-9928-6263-3},
year = {2015},
date = {2015-08-01},
booktitle = {2015 23rd European Signal Processing Conference (EUSIPCO)},
pages = {379--383},
publisher = {IEEE},
address = {Nice},
abstract = {Actual communications systems use high-order modulations and channels with memory. However, as the memory of the channels and the order of the constellations grow, optimal equalization such as BCJR algorithm is computationally intractable, as their complexity increases exponentially with the number of taps and size of modulation. In this paper, we propose a novel low-complexity hard and soft output equalizer based on the Expectation Propagation (EP) algorithm that provides high-accuracy posterior probability estimations at the input of the channel decoder with similar computational complexity than the linear MMSE. We experimentally show that this quasi-optimal solution outperforms classical solutions reducing the bit error probability with low complexity when LDPC channel decoding is used, avoiding the curse of dimensionality with channel memory and constellation size.},
keywords = {Approximation algorithms, Approximation methods, BCJR algorithm, channel equalization, Complexity theory, Decoding, Equalizers, expectation propagation, ISI, low complexity, Signal processing algorithms},
pubstate = {published},
tppubtype = {inproceedings}
}
Garcia-Moreno, Pablo; Teh, Yee Whye; Perez-Cruz, Fernando; Artés-Rodríguez, Antonio
Bayesian Nonparametric Crowdsourcing Artículo de revista
En: Journal of Machine Learning Research, vol. 16, no August, pp. 1607–1627, 2015.
Resumen | Enlaces | BibTeX | Etiquetas: Bayesian nonparametrics, Dirichlet process, Gibbs sampling, Hierarchical clustering, Journal, Multiple annotators
@article{Moreno2015b,
title = {Bayesian Nonparametric Crowdsourcing},
author = {Pablo Garcia-Moreno and Yee Whye Teh and Fernando Perez-Cruz and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://www.jmlr.org/papers/volume16/moreno15a/moreno15a.pdf},
year = {2015},
date = {2015-08-01},
journal = {Journal of Machine Learning Research},
volume = {16},
number = {August},
pages = {1607--1627},
abstract = {Crowdsourcing has been proven to be an effective and efficient tool to annotate large datasets. User annotations are often noisy, so methods to combine the annotations to produce reliable estimates of the ground truth are necessary. We claim that considering the existence of clusters of users in this combination step can improve the performance. This is especially important in early stages of crowdsourcing implementations, where the number of annotations is low. At this stage there is not enough information to accurately estimate the bias introduced by each annotator separately, so we have to resort to models that consider the statistical links among them. In addition, finding these clusters is interesting in itself as knowing the behavior of the pool of annotators allows implementing efficient active learning strategies. Based on this, we propose in this paper two new fully unsupervised models based on a Chinese Restaurant Process (CRP) prior and a hierarchical structure that allows inferring these groups jointly with the ground truth and the properties of the users. Efficient inference algorithms based on Gibbs sampling with auxiliary variables are proposed. Finally, we perform experiments, both on synthetic and real databases, to show the advantages of our models over state-of-the-art algorithms.},
keywords = {Bayesian nonparametrics, Dirichlet process, Gibbs sampling, Hierarchical clustering, Journal, Multiple annotators},
pubstate = {published},
tppubtype = {article}
}
Martino, Luca; Elvira, Victor; Luengo, David; Corander, Jukka
Parallel interacting Markov adaptive importance sampling Proceedings Article
En: 2015 23rd European Signal Processing Conference (EUSIPCO), pp. 499–503, IEEE, Nice, 2015, ISBN: 978-0-9928-6263-3.
Resumen | Enlaces | BibTeX | Etiquetas: Adaptive importance sampling, Bayesian inference, MCMC methods, Monte Carlo methods, Parallel Chains, Probability density function, Proposals, Signal processing, Signal processing algorithms, Sociology
@inproceedings{Martino2015bb,
title = {Parallel interacting Markov adaptive importance sampling},
author = {Luca Martino and Victor Elvira and David Luengo and Jukka Corander},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7362433 http://www.eurasip.org/Proceedings/Eusipco/Eusipco2015/papers/1570111267.pdf},
doi = {10.1109/EUSIPCO.2015.7362433},
isbn = {978-0-9928-6263-3},
year = {2015},
date = {2015-08-01},
booktitle = {2015 23rd European Signal Processing Conference (EUSIPCO)},
pages = {499--503},
publisher = {IEEE},
address = {Nice},
abstract = {Monte Carlo (MC) methods are widely used for statistical inference in signal processing applications. A well-known class of MC methods is importance sampling (IS) and its adaptive extensions. In this work, we introduce an iterated importance sampler using a population of proposal densities, which are adapted according to an MCMC technique over the population of location parameters. The novel algorithm provides a global estimation of the variables of interest iteratively, using all the samples weighted according to the deterministic mixture scheme. Numerical results, on a multi-modal example and a localization problem in wireless sensor networks, show the advantages of the proposed schemes.},
keywords = {Adaptive importance sampling, Bayesian inference, MCMC methods, Monte Carlo methods, Parallel Chains, Probability density function, Proposals, Signal processing, Signal processing algorithms, Sociology},
pubstate = {published},
tppubtype = {inproceedings}
}
Martino, Luca; Elvira, Victor; Luengo, David; Corander, Jukka
An Adaptive Population Importance Sampler: Learning From Uncertainty Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 63, no 16, pp. 4422–4437, 2015, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: Adaptive importance sampling, adaptive multiple IS, adaptive population importance sampler, AMIS, APIS, Estimation, Importance sampling, IS estimators, iterative estimation, iterative methods, Journal, MC methods, Monte Carlo (MC) methods, Monte Carlo methods, population Monte Carlo, Proposals, Signal processing algorithms, simple temporal adaptation, Sociology, Standards, Wireless sensor network, Wireless Sensor Networks
@article{Martino2015bbb,
title = {An Adaptive Population Importance Sampler: Learning From Uncertainty},
author = {Luca Martino and Victor Elvira and David Luengo and Jukka Corander},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7117437},
doi = {10.1109/TSP.2015.2440215},
issn = {1053-587X},
year = {2015},
date = {2015-08-01},
journal = {IEEE Transactions on Signal Processing},
volume = {63},
number = {16},
pages = {4422--4437},
publisher = {IEEE},
abstract = {Monte Carlo (MC) methods are well-known computational techniques, widely used in different fields such as signal processing, communications and machine learning. An important class of MC methods is composed of importance sampling (IS) and its adaptive extensions, such as population Monte Carlo (PMC) and adaptive multiple IS (AMIS). In this paper, we introduce a novel adaptive and iterated importance sampler using a population of proposal densities. The proposed algorithm, named adaptive population importance sampling (APIS), provides a global estimation of the variables of interest iteratively, making use of all the samples previously generated. APIS combines a sophisticated scheme to build the IS estimators (based on the deterministic mixture approach) with a simple temporal adaptation (based on epochs). In this way, APIS is able to keep all the advantages of both AMIS and PMC, while minimizing their drawbacks. Furthermore, APIS is easily parallelizable. The cloud of proposals is adapted in such a way that local features of the target density can be better taken into account compared to single global adaptation procedures. The result is a fast, simple, robust, and high-performance algorithm applicable to a wide range of problems. Numerical results show the advantages of the proposed sampling scheme in four synthetic examples and a localization problem in a wireless sensor network.},
keywords = {Adaptive importance sampling, adaptive multiple IS, adaptive population importance sampler, AMIS, APIS, Estimation, Importance sampling, IS estimators, iterative estimation, iterative methods, Journal, MC methods, Monte Carlo (MC) methods, Monte Carlo methods, population Monte Carlo, Proposals, Signal processing algorithms, simple temporal adaptation, Sociology, Standards, Wireless sensor network, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {article}
}
Olmos, Pablo M; Mitchell, David G M; Costello, Daniel J
Analyzing the Finite-Length Performance of Generalized LDPC Codes Proceedings Article
En: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 2683–2687, IEEE, Hong Kong, 2015, ISBN: 978-1-4673-7704-1.
Resumen | Enlaces | BibTeX | Etiquetas: BEC, binary codes, binary erasure channel, Block codes, Codes on graphs, Decoding, Differential equations, error probability, finite-length generalized LDPC block codes, finite-length performance analysis, generalized LDPC codes, generalized peeling decoder, GLDPC block codes, graph degree distribution, graph theory, Iterative decoding, parity check codes, protographs
@inproceedings{Olmos2015b,
title = {Analyzing the Finite-Length Performance of Generalized LDPC Codes},
author = {Pablo M Olmos and David G M Mitchell and Daniel J Costello},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7282943},
doi = {10.1109/ISIT.2015.7282943},
isbn = {978-1-4673-7704-1},
year = {2015},
date = {2015-06-01},
booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},
pages = {2683--2687},
publisher = {IEEE},
address = {Hong Kong},
abstract = {In this paper, we analyze the performance of finite-length generalized LDPC (GLDPC) block codes constructed from protographs when transmission takes place over the binary erasure channel (BEC). A generalized peeling decoder is proposed and we derive a system of differential equations that gives the expected evolution of the graph degree distribution during decoding. We then show that the finite-length performance of a GLDPC code can be estimated by means of a simple scaling law, where a single scaling parameter represents the finite-length properties of the code. We also show that, as we consider stronger component codes, both the asymptotic threshold and the finite-length scaling parameter are improved.},
keywords = {BEC, binary codes, binary erasure channel, Block codes, Codes on graphs, Decoding, Differential equations, error probability, finite-length generalized LDPC block codes, finite-length performance analysis, generalized LDPC codes, generalized peeling decoder, GLDPC block codes, graph degree distribution, graph theory, Iterative decoding, parity check codes, protographs},
pubstate = {published},
tppubtype = {inproceedings}
}
Stinner, Markus; Olmos, Pablo M
Finite-Length Performance of Multi-Edge Protograph-Based Spatially Coupled LDPC Codes Proceedings Article
En: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 889–893, IEEE, Hong Kong, 2015, ISBN: 978-1-4673-7704-1.
Resumen | Enlaces | BibTeX | Etiquetas: binary erasure channel, Block codes, Couplings, Decoding, Error analysis, finite length performance, finite-length performance, graph theory, Iterative decoding, low density parity check codes, multiedge protograph, parity check codes, spatially coupled LDPC codes, spatially-coupled LDPC codes, Steady-state
@inproceedings{Stinner2015,
title = {Finite-Length Performance of Multi-Edge Protograph-Based Spatially Coupled LDPC Codes},
author = {Markus Stinner and Pablo M Olmos},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7282583},
doi = {10.1109/ISIT.2015.7282583},
isbn = {978-1-4673-7704-1},
year = {2015},
date = {2015-06-01},
booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},
pages = {889--893},
publisher = {IEEE},
address = {Hong Kong},
abstract = {The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes over the binary erasure channel (BEC) is analyzed. Existing scaling laws are extended to arbitrary protograph base matrices that include puncturing patterns and multiple edges between nodes. A regular protograph-based SC-LDPC construction based on the (4; 8)-regular LDPC block code works well in the waterfall region compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-off. Scaling laws are also used for code design and to estimate the block length of a given SC-LDPC code ensemble to match the performance of some other code. Estimates on the performance degradation are developed if the chain length varies.},
keywords = {binary erasure channel, Block codes, Couplings, Decoding, Error analysis, finite length performance, finite-length performance, graph theory, Iterative decoding, low density parity check codes, multiedge protograph, parity check codes, spatially coupled LDPC codes, spatially-coupled LDPC codes, Steady-state},
pubstate = {published},
tppubtype = {inproceedings}
}
Vazquez-Vilar, Gonzalo; Martinez, Alfonso; i Fabregas, Albert Guillen
A derivation of the Cost-Constrained Sphere-Packing Exponent Proceedings Article
En: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 929–933, IEEE, Hong Kong, 2015, ISBN: 978-1-4673-7704-1.
Enlaces | BibTeX | Etiquetas: Channel Coding, channel-coding cost-constrained sphere-packing exp, continuous channel, continuous memoryless channel, cost constraint, error probability, hypothesis testing, Lead, Memoryless systems, Optimization, per-codeword cost constraint, reliability function, spherepacking exponent, Testing
@inproceedings{Vazquez-Vilar2015,
title = {A derivation of the Cost-Constrained Sphere-Packing Exponent},
author = {Gonzalo Vazquez-Vilar and Alfonso Martinez and Albert Guillen i Fabregas},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7282591},
doi = {10.1109/ISIT.2015.7282591},
isbn = {978-1-4673-7704-1},
year = {2015},
date = {2015-06-01},
booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},
pages = {929--933},
publisher = {IEEE},
address = {Hong Kong},
keywords = {Channel Coding, channel-coding cost-constrained sphere-packing exp, continuous channel, continuous memoryless channel, cost constraint, error probability, hypothesis testing, Lead, Memoryless systems, Optimization, per-codeword cost constraint, reliability function, spherepacking exponent, Testing},
pubstate = {published},
tppubtype = {inproceedings}
}
Read, Jesse; Martino, Luca; Olmos, Pablo M; Luengo, David
Scalable Multi-Output Label Prediction: From Classifier Chains to Classifier Trellises Artículo de revista
En: Pattern Recognition, vol. 48, no 6, pp. 2096–2106, 2015.
Resumen | Enlaces | BibTeX | Etiquetas: Bayesian networks, classifer chains, Journal, Multi-label classification, multi-output prediction, structured inference
@article{Read2015b,
title = {Scalable Multi-Output Label Prediction: From Classifier Chains to Classifier Trellises},
author = {Jesse Read and Luca Martino and Pablo M Olmos and David Luengo},
url = {http://www.sciencedirect.com/science/article/pii/S0031320315000084},
year = {2015},
date = {2015-06-01},
journal = {Pattern Recognition},
volume = {48},
number = {6},
pages = {2096--2106},
abstract = {Multi-output inference tasks, such as multi-label classification, have become increasingly important in recent years. A popular method for multi-label classification is classifier chains, in which the predictions of individual classifiers are cascaded along a chain, thus taking into account inter-label dependencies and improving the overall performance. Several varieties of classifier chain methods have been introduced, and many of them perform very competitively across a wide range of benchmark datasets. However, scalability limitations become apparent on larger datasets when modeling a fully cascaded chain. In particular, the methods' strategies for discovering and modeling a good chain structure constitutes a mayor computational bottleneck. In this paper, we present the classifier trellis (CT) method for scalable multi-label classification. We compare CT with several recently proposed classifier chain methods to show that it occupies an important niche: it is highly competitive on standard multi-label problems, yet it can also scale up to thousands or even tens of thousands of labels.},
keywords = {Bayesian networks, classifer chains, Journal, Multi-label classification, multi-output prediction, structured inference},
pubstate = {published},
tppubtype = {article}
}
Varando, Gherardo; Bielza, Concha; Larrañaga, Pedro
Decision functions for chain classifiers based on Bayesian networks for multi-label classification Artículo de revista
En: International Journal of Approximate Reasoning, 2015, ISSN: 0888613X.
Resumen | Enlaces | BibTeX | Etiquetas: CASI CAM CM, CIG UPM, Journal
@article{Varando2015a,
title = {Decision functions for chain classifiers based on Bayesian networks for multi-label classification},
author = {Gherardo Varando and Concha Bielza and Pedro Larra\~{n}aga},
url = {http://www.researchgate.net/publication/279069321_Decision_functions_for_chain_classifiers_based_on_Bayesian_networks_for_multi-label_classification http://cig.fi.upm.es/node/887},
doi = {10.1016/j.ijar.2015.06.006},
issn = {0888613X},
year = {2015},
date = {2015-06-01},
journal = {International Journal of Approximate Reasoning},
abstract = {Multi-label classification problems require each instance to be assigned a subset of a defined set of labels. This problem is equivalent to finding a multi-valued decision function that predicts a vector of binary classes. In this paper we study the decision boundaries of two widely used approaches for building multi-label classifiers, when Bayesian network-augmented naive Bayes classifiers are used as base models: Binary relevance method and chain classifiers. In particular extending previous single-label results to multi-label chain classifiers, we find polynomial expressions for the multi-valued decision functions associated with these methods. We prove upper boundings on the expressive power of both methods and we prove that chain classifiers provide a more expressive model than the binary relevance method Decision functions for chain classifiers based on Bayesian networks for multi-label classification. Available from: http://www.researchgate.net/publication/279069321_Decision_functions_for_chain_classifiers_based_on_Bayesian_networks_for_multi-label_classification [accessed Nov 15, 2015].},
keywords = {CASI CAM CM, CIG UPM, Journal},
pubstate = {published},
tppubtype = {article}
}
Olmos, Pablo M; Urbanke, Rudiger
A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes Artículo de revista
En: IEEE Transactions on Information Theory, vol. 61, no 6, pp. 3164–3184, 2015, ISSN: 0018-9448.
Resumen | Enlaces | BibTeX | Etiquetas: asymptotic analysis, asymptotic properties, binary erasure channel, Channel Coding, Codes on graphs, Couplings, Decoding, Differential equations, error probability, finite length performance, finite length spatially coupled code, finite-length code performance, finite-length performance, Iterative decoding, iterative decoding thresholds, Journal, parity check codes, Probability, SC-LDPC codes, scaling law, Sockets, spatially coupled LDPC codes, spatially-coupled LDPC codes
@article{Olmos2015bb,
title = {A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes},
author = {Pablo M Olmos and Rudiger Urbanke},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7086074},
doi = {10.1109/TIT.2015.2422816},
issn = {0018-9448},
year = {2015},
date = {2015-06-01},
journal = {IEEE Transactions on Information Theory},
volume = {61},
number = {6},
pages = {3164--3184},
abstract = {Spatially-coupled low-density parity-check (SC-LDPC) codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially coupled code ensembles when transmission takes place over the binary erasure channel. We discuss how the parameters of the scaling law are connected to fundamental quantities appearing in the asymptotic analysis of these ensembles and we verify that the predictions of the scaling law fit well to the data derived from simulations over a wide range of parameters. The ultimate goal of this line of research is to develop analytic tools for the design of SC-LDPC codes under practical constraints.},
keywords = {asymptotic analysis, asymptotic properties, binary erasure channel, Channel Coding, Codes on graphs, Couplings, Decoding, Differential equations, error probability, finite length performance, finite length spatially coupled code, finite-length code performance, finite-length performance, Iterative decoding, iterative decoding thresholds, Journal, parity check codes, Probability, SC-LDPC codes, scaling law, Sockets, spatially coupled LDPC codes, spatially-coupled LDPC codes},
pubstate = {published},
tppubtype = {article}
}
Elvira, Victor; Martino, Luca; Luengo, David; Corander, Jukka
A Gradient Adaptive Population Importance Sampler Proceedings Article
En: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4075–4079, IEEE, Brisbane, 2015, ISBN: 978-1-4673-6997-8.
Resumen | Enlaces | BibTeX | Etiquetas: adaptive extensions, adaptive importance sampler, Adaptive importance sampling, gradient adaptive population, gradient matrix, Hamiltonian Monte Carlo, Hessian matrices, Hessian matrix, learning (artificial intelligence), Machine learning, MC methods, Monte Carlo, Monte Carlo methods, population Monte Carlo (PMC), proposal densities, Signal processing, Sociology, statistics, target distribution
@inproceedings{Elvira2015a,
title = {A Gradient Adaptive Population Importance Sampler},
author = {Victor Elvira and Luca Martino and David Luengo and Jukka Corander},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7178737 http://www.tsc.uc3m.es/~velvira/papers/ICASSP2015_elvira.pdf},
doi = {10.1109/ICASSP.2015.7178737},
isbn = {978-1-4673-6997-8},
year = {2015},
date = {2015-04-01},
booktitle = {2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
pages = {4075--4079},
publisher = {IEEE},
address = {Brisbane},
abstract = {Monte Carlo (MC) methods are widely used in signal processing and machine learning. A well-known class of MC methods is composed of importance sampling and its adaptive extensions (e.g., population Monte Carlo). In this paper, we introduce an adaptive importance sampler using a population of proposal densities. The novel algorithm dynamically optimizes the cloud of proposals, adapting them using information about the gradient and Hessian matrix of the target distribution. Moreover, a new kind of interaction in the adaptation of the proposal densities is introduced, establishing a trade-off between attaining a good performance in terms of mean square error and robustness to initialization.},
keywords = {adaptive extensions, adaptive importance sampler, Adaptive importance sampling, gradient adaptive population, gradient matrix, Hamiltonian Monte Carlo, Hessian matrices, Hessian matrix, learning (artificial intelligence), Machine learning, MC methods, Monte Carlo, Monte Carlo methods, population Monte Carlo (PMC), proposal densities, Signal processing, Sociology, statistics, target distribution},
pubstate = {published},
tppubtype = {inproceedings}
}
Fernandez-Bes, Jesus; Elvira, Victor; Vaerenbergh, Steven Van
A Probabilistic Least-Mean-Squares Filter Proceedings Article
En: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 2199–2203, IEEE, Brisbane, 2015, ISBN: 978-1-4673-6997-8.
Resumen | Enlaces | BibTeX | Etiquetas: adaptable step size LMS algorithm, Adaptation models, adaptive filtering, Approximation algorithms, Bayesian machine learning techniques, efficient approximation algorithm, filtering theory, Least squares approximations, least-mean-squares, probabilistic least mean squares filter, Probabilistic logic, probabilisticmodels, Probability, Signal processing algorithms, Standards, state-space models
@inproceedings{Fernandez-Bes2015,
title = {A Probabilistic Least-Mean-Squares Filter},
author = {Jesus Fernandez-Bes and Victor Elvira and Steven Van Vaerenbergh},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7178361 http://www.tsc.uc3m.es/~velvira/papers/ICASSP2015_bes.pdf},
doi = {10.1109/ICASSP.2015.7178361},
isbn = {978-1-4673-6997-8},
year = {2015},
date = {2015-04-01},
booktitle = {2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
pages = {2199--2203},
publisher = {IEEE},
address = {Brisbane},
abstract = {We introduce a probabilistic approach to the LMS filter. By means of an efficient approximation, this approach provides an adaptable step-size LMS algorithm together with a measure of uncertainty about the estimation. In addition, the proposed approximation preserves the linear complexity of the standard LMS. Numerical results show the improved performance of the algorithm with respect to standard LMS and state-of-the-art algorithms with similar complexity. The goal of this work, therefore, is to open the door to bring somemore Bayesian machine learning techniques to adaptive filtering.},
keywords = {adaptable step size LMS algorithm, Adaptation models, adaptive filtering, Approximation algorithms, Bayesian machine learning techniques, efficient approximation algorithm, filtering theory, Least squares approximations, least-mean-squares, probabilistic least mean squares filter, Probabilistic logic, probabilisticmodels, Probability, Signal processing algorithms, Standards, state-space models},
pubstate = {published},
tppubtype = {inproceedings}
}
Luengo, David; Martino, Luca; Elvira, Victor; Bugallo, Monica F
Efficient Linear Combination of Partial Monte Carlo Estimators Proceedings Article
En: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4100–4104, IEEE, Brisbane, 2015, ISBN: 978-1-4673-6997-8.
Resumen | Enlaces | BibTeX | Etiquetas: covariance matrices, efficient linear combination, Estimation, fusion, Global estimator, global estimators, least mean squares methods, linear combination, minimum mean squared error estimators, Monte Carlo estimation, Monte Carlo methods, partial estimator, partial Monte Carlo estimators, Xenon
@inproceedings{Luengo2015bb,
title = {Efficient Linear Combination of Partial Monte Carlo Estimators},
author = {David Luengo and Luca Martino and Victor Elvira and Monica F Bugallo},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7178742 http://www.tsc.uc3m.es/~velvira/papers/ICASSP2015_luengo.pdf},
doi = {10.1109/ICASSP.2015.7178742},
isbn = {978-1-4673-6997-8},
year = {2015},
date = {2015-04-01},
booktitle = {2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
pages = {4100--4104},
publisher = {IEEE},
address = {Brisbane},
abstract = {In many practical scenarios, including those dealing with large data sets, calculating global estimators of unknown variables of interest becomes unfeasible. A common solution is obtaining partial estimators and combining them to approximate the global one. In this paper, we focus on minimum mean squared error (MMSE) estimators, introducing two efficient linear schemes for the fusion of partial estimators. The proposed approaches are valid for any type of partial estimators, although in the simulated scenarios we concentrate on the combination of Monte Carlo estimators due to the nature of the problem addressed. Numerical results show the good performance of the novel fusion methods with only a fraction of the cost of the asymptotically optimal solution.},
keywords = {covariance matrices, efficient linear combination, Estimation, fusion, Global estimator, global estimators, least mean squares methods, linear combination, minimum mean squared error estimators, Monte Carlo estimation, Monte Carlo methods, partial estimator, partial Monte Carlo estimators, Xenon},
pubstate = {published},
tppubtype = {inproceedings}
}
Nazabal, Alfredo; Artés-Rodríguez, Antonio
Discriminative spectral learning of hidden markov models for human activity recognition Proceedings Article
En: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1966–1970, IEEE, Brisbane, 2015, ISBN: 978-1-4673-6997-8.
Resumen | Enlaces | BibTeX | Etiquetas: Accuracy, Bayesian estimation, classify sequential data, Data models, Databases, Discriminative learning, discriminative spectral learning, Hidden Markov models, HMM parameters, Human activity recognition, learning (artificial intelligence), maximum likelihood, maximum likelihood estimation, ML, moment matching learning technique, Observable operator models, sensors, Spectral algorithm, spectral learning, Speech recognition, Training
@inproceedings{Nazabal2015,
title = {Discriminative spectral learning of hidden markov models for human activity recognition},
author = {Alfredo Nazabal and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7178314},
doi = {10.1109/ICASSP.2015.7178314},
isbn = {978-1-4673-6997-8},
year = {2015},
date = {2015-04-01},
booktitle = {2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
pages = {1966--1970},
publisher = {IEEE},
address = {Brisbane},
abstract = {Hidden Markov Models (HMMs) are one of the most important techniques to model and classify sequential data. Maximum Likelihood (ML) and (parametric and non-parametric) Bayesian estimation of the HMM parameters suffers from local maxima and in massive datasets they can be specially time consuming. In this paper, we extend the spectral learning of HMMs, a moment matching learning technique free from local maxima, to discriminative HMMs. The resulting method provides the posterior probabilities of the classes without explicitly determining the HMM parameters, and is able to deal with missing labels. We apply the method to Human Activity Recognition (HAR) using two different types of sensors: portable inertial sensors, and fixed, wireless binary sensor networks. Our algorithm outperforms the standard discriminative HMM learning in both complexity and accuracy.},
keywords = {Accuracy, Bayesian estimation, classify sequential data, Data models, Databases, Discriminative learning, discriminative spectral learning, Hidden Markov models, HMM parameters, Human activity recognition, learning (artificial intelligence), maximum likelihood, maximum likelihood estimation, ML, moment matching learning technique, Observable operator models, sensors, Spectral algorithm, spectral learning, Speech recognition, Training},
pubstate = {published},
tppubtype = {inproceedings}
}