2012
Leiva-Murillo, Jose M; Artés-Rodríguez, Antonio
Algorithms for Maximum-Likelihood Bandwidth Selection in Kernel Density Estimators Artículo de revista
En: Pattern Recognition Letters, vol. 33, no 13, pp. 1717–1724, 2012, ISSN: 01678655.
Resumen | Enlaces | BibTeX | Etiquetas: Kernel density estimation, Multivariate density modeling, Pattern recognition
@article{Leiva-Murillo2012,
title = {Algorithms for Maximum-Likelihood Bandwidth Selection in Kernel Density Estimators},
author = {Jose M Leiva-Murillo and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://www.tsc.uc3m.es/~antonio/papers/P45_2012_Algorithms for Maximum Likelihood Bandwidth Selection in Kernel Density Estimators.pdf
http://www.sciencedirect.com/science/article/pii/S0167865512001948},
issn = {01678655},
year = {2012},
date = {2012-01-01},
journal = {Pattern Recognition Letters},
volume = {33},
number = {13},
pages = {1717--1724},
publisher = {Elsevier Science Inc.},
abstract = {In machine learning and statistics, kernel density estimators are rarely used on multivariate data due to the difficulty of finding an appropriate kernel bandwidth to overcome overfitting. However, the recent advances on information-theoretic learning have revived the interest on these models. With this motivation, in this paper we revisit the classical statistical problem of data-driven bandwidth selection by cross-validation maximum likelihood for Gaussian kernels. We find a solution to the optimization problem under both the spherical and the general case where a full covariance matrix is considered for the kernel. The fixed-point algorithms proposed in this paper obtain the maximum likelihood bandwidth in few iterations, without performing an exhaustive bandwidth search, which is unfeasible in the multivariate case. The convergence of the methods proposed is proved. A set of classification experiments are performed to prove the usefulness of the obtained models in pattern recognition.},
keywords = {Kernel density estimation, Multivariate density modeling, Pattern recognition},
pubstate = {published},
tppubtype = {article}
}
Maiz, Cristina S; Molanes-Lopez, Elisa M; Miguez, Joaquin; Djuric, Petar M
A Particle Filtering Scheme for Processing Time Series Corrupted by Outliers Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 60, no 9, pp. 4611–4627, 2012, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: Kalman filters, Mathematical model, nonlinear state space model, Outlier detection, prediction theory, predictive distribution, Probability density function, State-space methods, state-space models, statistical distributions, Target tracking, time serie processing, Vectors, Yttrium
@article{Maiz2012,
title = {A Particle Filtering Scheme for Processing Time Series Corrupted by Outliers},
author = {Cristina S Maiz and Elisa M Molanes-Lopez and Joaquin Miguez and Petar M Djuric},
url = {http://www.tsc.uc3m.es/~jmiguez/papers/P34_2012_A Particle Filtering Scheme for Processing Time Series Corrupted by Outliers.pdf http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6203606},
issn = {1053-587X},
year = {2012},
date = {2012-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {60},
number = {9},
pages = {4611--4627},
abstract = {The literature in engineering and statistics is abounding in techniques for detecting and properly processing anomalous observations in the data. Most of these techniques have been developed in the framework of static models and it is only in recent years that we have seen attempts that address the presence of outliers in nonlinear time series. For a target tracking problem described by a nonlinear state-space model, we propose the online detection of outliers by including an outlier detection step within the standard particle filtering algorithm. The outlier detection step is implemented by a test involving a statistic of the predictive distribution of the observations, such as a concentration measure or an extreme upper quantile. We also provide asymptotic results about the convergence of the particle approximations of the predictive distribution (and its statistics) and assess the performance of the resulting algorithms by computer simulations of target tracking problems with signal power observations.},
keywords = {Kalman filters, Mathematical model, nonlinear state space model, Outlier detection, prediction theory, predictive distribution, Probability density function, State-space methods, state-space models, statistical distributions, Target tracking, time serie processing, Vectors, Yttrium},
pubstate = {published},
tppubtype = {article}
}
Cruz-Roldan, Fernando; Dominguez-Jimenez, María Elena; Vidal, Gabriela Sansigre; Amo-Lopez, Pedro; Blanco-Velasco, Manuel; Bravo-Santos, Ángel M
On the Use of Discrete Cosine Transforms for Multicarrier Communications Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 60, no 11, pp. 6085–6090, 2012, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas: broadband networks, carrier frequency offset, Carrier-frequency offset (CFO), CFO, channel equalization, computer simulations, Convolution, Data communication, data symbol, DCT, DFT, discrete cosine transform (DCT), discrete cosine transform domain, Discrete cosine transforms, discrete Fourier transforms, discrete multitone modulation (DMT), discrete trigonometric domain, element-by-element multiplication, equalisers, equivalent channel impulse response, linear convolution, mobile broadband wireless communication, mobile radio, Modulation, multicarrier communications, multicarrier data transmission, multicarrier modulation (MCM), multicarrier transceiver, OFDM, orthogonal frequency-division multiplexing (OFDM), Receivers, Redundancy, subcarrier equalizers, symmetric convolution-multiplication property, symmetric redundancy, time-domain analysis, transient response, transmission channel
@article{Cruz-Roldan2012,
title = {On the Use of Discrete Cosine Transforms for Multicarrier Communications},
author = {Fernando Cruz-Roldan and Mar\'{i}a Elena Dominguez-Jimenez and Gabriela Sansigre Vidal and Pedro Amo-Lopez and Manuel Blanco-Velasco and \'{A}ngel M Bravo-Santos},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6252068},
issn = {1053-587X},
year = {2012},
date = {2012-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {60},
number = {11},
pages = {6085--6090},
abstract = {In this correspondence, the conditions to use any kind of discrete cosine transform (DCT) for multicarrier data transmission are derived. The symmetric convolution-multiplication property of each DCT implies that when symmetric convolution is performed in the time domain, an element-by-element multiplication is performed in the corresponding discrete trigonometric domain. Therefore, appending symmetric redundancy (as prefix and suffix) into each data symbol to be transmitted, and also enforcing symmetry for the equivalent channel impulse response, the linear convolution performed in the transmission channel becomes a symmetric convolution in those samples of interest. Furthermore, the channel equalization can be carried out by means of a bank of scalars in the corresponding discrete cosine transform domain. The expressions for obtaining the value of each scalar corresponding to these one-tap per subcarrier equalizers are presented. This study is completed with several computer simulations in mobile broadband wireless communication scenarios, considering the presence of carrier frequency offset (CFO). The obtained results indicate that the proposed systems outperform the standardized ones based on the DFT.},
keywords = {broadband networks, carrier frequency offset, Carrier-frequency offset (CFO), CFO, channel equalization, computer simulations, Convolution, Data communication, data symbol, DCT, DFT, discrete cosine transform (DCT), discrete cosine transform domain, Discrete cosine transforms, discrete Fourier transforms, discrete multitone modulation (DMT), discrete trigonometric domain, element-by-element multiplication, equalisers, equivalent channel impulse response, linear convolution, mobile broadband wireless communication, mobile radio, Modulation, multicarrier communications, multicarrier data transmission, multicarrier modulation (MCM), multicarrier transceiver, OFDM, orthogonal frequency-division multiplexing (OFDM), Receivers, Redundancy, subcarrier equalizers, symmetric convolution-multiplication property, symmetric redundancy, time-domain analysis, transient response, transmission channel},
pubstate = {published},
tppubtype = {article}
}
Leiva-Murillo, Jose M; Artés-Rodríguez, Antonio
Information-Theoretic Linear Feature Extraction Based on Kernel Density Estimators: A Review Artículo de revista
En: IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), vol. 42, no 6, pp. 1180–1189, 2012, ISSN: 1094-6977.
Resumen | Enlaces | BibTeX | Etiquetas: Bandwidth, Density, detection theory, Entropy, Estimation, Feature extraction, Feature extraction (FE), information theoretic linear feature extraction, information theory, information-theoretic learning (ITL), Kernel, Kernel density estimation, kernel density estimators, Machine learning
@article{Leiva-Murillo2012a,
title = {Information-Theoretic Linear Feature Extraction Based on Kernel Density Estimators: A Review},
author = {Jose M Leiva-Murillo and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://www.tsc.uc3m.es/~antonio/papers/P44_2012_Information Theoretic Linear Feature Extraction Based on Kernel Density Estimators A Review.pdf http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6185689},
issn = {1094-6977},
year = {2012},
date = {2012-01-01},
journal = {IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)},
volume = {42},
number = {6},
pages = {1180--1189},
abstract = {In this paper, we provide a unified study of the application of kernel density estimators to supervised linear feature extraction by means of criteria inspired by information and detection theory. We enrich this study by the incorporation of two novel criteria to the study, i.e., the mutual information and the likelihood ratio test, and perform both a theoretical and an experimental comparison between the new methods and other ones previously described in the literature. The impact of the bandwidth selection of the density estimator in the classification performance is discussed. Some theoretical results that bound classification performance as a function or mutual information are also compiled. A set of experiments on different real-world datasets allows us to perform an empirical comparison of the methods, in terms of both accuracy and computational complexity. We show the suitability of these methods to determine the dimension of the subspace that contains the discriminative information.},
keywords = {Bandwidth, Density, detection theory, Entropy, Estimation, Feature extraction, Feature extraction (FE), information theoretic linear feature extraction, information theory, information-theoretic learning (ITL), Kernel, Kernel density estimation, kernel density estimators, Machine learning},
pubstate = {published},
tppubtype = {article}
}
Luengo, David; Monzon, Sandra; Artés-Rodríguez, Antonio
Novel Fast Random Search Clustering Algorithm for Mixing Matrix Identification in MIMO Linear Blind Inverse Problems with Sparse Inputs Artículo de revista
En: Neurocomputing, vol. 87, pp. 62–78, 2012.
Resumen | Enlaces | BibTeX | Etiquetas: Line orientation clustering, Linear blind inverse problems, MIMO systems, Neyman–Pearson hypothesis test, Sparse signals
@article{Luengo2012b,
title = {Novel Fast Random Search Clustering Algorithm for Mixing Matrix Identification in MIMO Linear Blind Inverse Problems with Sparse Inputs},
author = {David Luengo and Sandra Monzon and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://www.tsc.uc3m.es/~antonio/papers/P43_2012_Novel Fast Random Search Clustering Algorithm for Mixing Matrix Identification in MIMO Linear Blind Inverse Problems with Sparse Inputs.pdf
http://www.sciencedirect.com/science/article/pii/S0925231212000744},
year = {2012},
date = {2012-01-01},
journal = {Neurocomputing},
volume = {87},
pages = {62--78},
abstract = {In this paper we propose a novel fast random search clustering (RSC) algorithm for mixing matrix identification in multiple input multiple output (MIMO) linear blind inverse problems with sparse inputs. The proposed approach is based on the clustering of the observations around the directions given by the columns of the mixing matrix that occurs typically for sparse inputs. Exploiting this fact, the RSC algorithm proceeds by parameterizing the mixing matrix using hyperspherical coordinates, randomly selecting candidate basis vectors (i.e. clustering directions) from the observations, and accepting or rejecting them according to a binary hypothesis test based on the Neyman\textendashPearson criterion. The RSC algorithm is not tailored to any specific distribution for the sources, can deal with an arbitrary number of inputs and outputs (thus solving the difficult under-determined problem), and is applicable to both instantaneous and convolutive mixtures. Extensive simulations for synthetic and real data with different number of inputs and outputs, data size, sparsity factors of the inputs and signal to noise ratios confirm the good performance of the proposed approach under moderate/high signal to noise ratios.},
keywords = {Line orientation clustering, Linear blind inverse problems, MIMO systems, Neyman\textendashPearson hypothesis test, Sparse signals},
pubstate = {published},
tppubtype = {article}
}
Oquendo, Maria A; Baca-García, Enrique; Artés-Rodríguez, Antonio; Perez-Cruz, Fernando; Galfalvy, H C; Blasco-Fontecilla, Hilario; Madigan, D; Duan, N
Machine Learning and Data Mining: Strategies for Hypothesis Generation Artículo de revista
En: Molecular psychiatry, vol. 17, no 10, pp. 956–959, 2012, ISSN: 1476-5578.
Resumen | Enlaces | BibTeX | Etiquetas: Artificial Intelligence, Biological, Data Mining, Humans, Mental Disorders, Mental Disorders: diagnosis, Mental Disorders: therapy, Models
@article{Oquendo2012,
title = {Machine Learning and Data Mining: Strategies for Hypothesis Generation},
author = {Maria A Oquendo and Enrique Baca-Garc\'{i}a and Antonio Art\'{e}s-Rodr\'{i}guez and Fernando Perez-Cruz and H C Galfalvy and Hilario Blasco-Fontecilla and D Madigan and N Duan},
url = {http://www.ncbi.nlm.nih.gov/pubmed/22230882},
issn = {1476-5578},
year = {2012},
date = {2012-01-01},
journal = {Molecular psychiatry},
volume = {17},
number = {10},
pages = {956--959},
abstract = {Strategies for generating knowledge in medicine have included observation of associations in clinical or research settings and more recently, development of pathophysiological models based on molecular biology. Although critically important, they limit hypothesis generation to an incremental pace. Machine learning and data mining are alternative approaches to identifying new vistas to pursue, as is already evident in the literature. In concert with these analytic strategies, novel approaches to data collection can enhance the hypothesis pipeline as well. In data farming, data are obtained in an \'{o}rganic' way, in the sense that it is entered by patients themselves and available for harvesting. In contrast, in evidence farming (EF), it is the provider who enters medical data about individual patients. EF differs from regular electronic medical record systems because frontline providers can use it to learn from their own past experience. In addition to the possibility of generating large databases with farming approaches, it is likely that we can further harness the power of large data sets collected using either farming or more standard techniques through implementation of data-mining and machine-learning strategies. Exploiting large databases to develop new hypotheses regarding neurobiological and genetic underpinnings of psychiatric illness is useful in itself, but also affords the opportunity to identify novel mechanisms to be targeted in drug discovery and development.},
keywords = {Artificial Intelligence, Biological, Data Mining, Humans, Mental Disorders, Mental Disorders: diagnosis, Mental Disorders: therapy, Models},
pubstate = {published},
tppubtype = {article}
}
Reyes-Guerrero, J C; Murillo-Fuentes, Juan Jose; Olmos, Pablo M
Remote Detection of Interfered Downlinks in Wireless Cellular Systems Artículo de revista
En: Transactions on Emerging Telecommunications Technologies, vol. 23, no 5, pp. 444–453, 2012, ISSN: 21613915.
Resumen | Enlaces | BibTeX | Etiquetas:
@article{Reyes-Guerrero2012,
title = {Remote Detection of Interfered Downlinks in Wireless Cellular Systems},
author = {J C Reyes-Guerrero and Juan Jose Murillo-Fuentes and Pablo M Olmos},
url = {http://doi.wiley.com/10.1002/ett.2501},
issn = {21613915},
year = {2012},
date = {2012-01-01},
journal = {Transactions on Emerging Telecommunications Technologies},
volume = {23},
number = {5},
pages = {444--453},
abstract = {This work provides a novel technological solution to jamming in wireless systems, particularly to remotely detect interfered communications in a cellular network. The new system is focused on the detection of a failure in a link between a base station and a fixed wireless terminal located in a residential or business area. It has an important impact in security systems based on wireless terminals to transmit an alarm to a central station. In these systems, non-authorised people can prevent the transmission of the alarm by using a short-range jammer. The main advantage of this proposal is that it is non-intrusive; that is, no modification is needed in the base station, and no protocol modification is performed in the terminal. The detection is implemented in an external unit developed on a software-defined radio platform. The novel system proposed is valid for any cellular system and operator. In this work, we focus on its implementation in the GSM/GPRS system to illustrate its benefits and outline the method for Universal Mobile Telecommunications System. We describe the results of some experiments where the system successfully detects the presence of a short-range jammer in a real scenario.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Olmos, Pablo M; Salamanca, Luis; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
On the Design of LDPC-Convolutional Ensembles Using the TEP Decoder Artículo de revista
En: IEEE Communications Letters, vol. 16, no 5, pp. 726–729, 2012, ISSN: 1089-7798.
Resumen | Enlaces | BibTeX | Etiquetas: belief propagation decoding, binary erasure channel, channel capacity, Complexity theory, convolutional codes, convolutional LDPC codes, Decoding, design, Error analysis, finite-length analysis, Iterative decoding, LDPC-convolutional ensemble design, LDPCC code decoding, low-density parity-check convolutional code, parity check codes, tree-expectation propagation decoder, tree-structured expectation propagation, window-sliding scheme
@article{Olmos2012b,
title = {On the Design of LDPC-Convolutional Ensembles Using the TEP Decoder},
author = {Pablo M Olmos and Luis Salamanca and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6168872},
issn = {1089-7798},
year = {2012},
date = {2012-01-01},
journal = {IEEE Communications Letters},
volume = {16},
number = {5},
pages = {726--729},
abstract = {Low-density parity-check convolutional (LDPCC) codes asymptotically achieve channel capacity under belief propagation (BP) decoding. In this paper, we decode LDPCC codes using the Tree-Expectation Propagation (TEP) decoder, recently proposed as an alternative decoding method to the BP algorithm for the binary erasure channel (BEC). We show that, for LDPCC codes, the TEP decoder improves the BP solution with a comparable complexity or, alternatively, it allows using shorter codes to achieve similar error rates. We also propose a window-sliding scheme for the TEP decoder to reduce the decoding latency.},
keywords = {belief propagation decoding, binary erasure channel, channel capacity, Complexity theory, convolutional codes, convolutional LDPC codes, Decoding, design, Error analysis, finite-length analysis, Iterative decoding, LDPC-convolutional ensemble design, LDPCC code decoding, low-density parity-check convolutional code, parity check codes, tree-expectation propagation decoder, tree-structured expectation propagation, window-sliding scheme},
pubstate = {published},
tppubtype = {article}
}
Luengo, David; Martino, Luca
Efficient Random Variable Generation: Ratio of Uniforms and Polar Rejection Sampling Artículo de revista
En: Electronics Letters, vol. 48, no 6, pp. 326–327, 2012, ISSN: 00135194.
Resumen | Enlaces | BibTeX | Etiquetas:
@article{Luengo2012bb,
title = {Efficient Random Variable Generation: Ratio of Uniforms and Polar Rejection Sampling},
author = {David Luengo and Luca Martino},
url = {http://digital-library.theiet.org/content/journals/10.1049/el.2012.0206},
issn = {00135194},
year = {2012},
date = {2012-01-01},
journal = {Electronics Letters},
volume = {48},
number = {6},
pages = {326--327},
abstract = {Monte Carlo techniques, which require the generation of samples from some target density, are often the only alternative for performing Bayesian inference. Two classic sampling techniques to draw independent samples are the ratio of uniforms (RoU) and rejection sampling (RS). An efficient sampling algorithm is proposed combining the RoU and polar RS (i.e. RS inside a sector of a circle using polar coordinates). Its efficiency is shown in drawing samples from truncated Cauchy and Gaussian random variables, which have many important applications in signal processing and communications.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Read, Jesse; Bifet, Albert; Pfahringer, Bernhard; Holmes, Geoff
Batch-Incremental versus Instance-Incremental Learning in Dynamic and Evolving Data Proceedings Article
En: The Eleventh International Symposium on Intelligent Data Analysis (IDA 2012)., Helsinki, 2012.
BibTeX | Etiquetas:
@inproceedings{Read2012b,
title = {Batch-Incremental versus Instance-Incremental Learning in Dynamic and Evolving Data},
author = {Jesse Read and Albert Bifet and Bernhard Pfahringer and Geoff Holmes},
year = {2012},
date = {2012-01-01},
booktitle = {The Eleventh International Symposium on Intelligent Data Analysis (IDA 2012).},
address = {Helsinki},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Luengo, David; Martino, Luca
Almost rejectionless sampling from Nakagami-m distributions (m≥1) Artículo de revista
En: Electronics Letters, vol. 48, no 24, pp. 1559–1561, 2012, ISSN: 0013-5194.
Resumen | Enlaces | BibTeX | Etiquetas:
@article{Luengo2012ab,
title = {Almost rejectionless sampling from Nakagami-m distributions (m≥1)},
author = {David Luengo and Luca Martino},
url = {http://digital-library.theiet.org/content/view.action?itemId=http://iet.metastore.ingenta.com/content/journals/10.1049/el.2012.3513\&view=\&itemType=http://pub2web.metastore.ingenta.com/ns/Article?itemId=http://iet.metastore.ingenta.com/content/journals/10.1049/el.2012.3513\&view=\&itemType=http://pub2web.metastore.ingenta.com/ns/Article},
issn = {0013-5194},
year = {2012},
date = {2012-01-01},
journal = {Electronics Letters},
volume = {48},
number = {24},
pages = {1559--1561},
publisher = {IET Digital Library},
abstract = {The Nakagami-textitm distribution is widely used for the simulation of fading channels in wireless communications. A novel, simple and extremely efficient acceptance-rejection algorithm is introduced for the generation of independent Nakagami-textitm random variables. The proposed method uses another Nakagami density with a half-integer value of the fading parameter},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
López-Castromán, Jorge; Leiva-Murillo, Jose M; Blasco-Fontecilla, Hilario; Garcia-Nieto, R; Morant-Ginestar, C; Blanco, Carlos; Artés-Rodríguez, Antonio; Baca-García, Enrique
P-1266 - Dimensional Schizophrenia: not an Easy Transition Artículo de revista
En: European Psychiatry, vol. 27, pp. 1, 2012.
Resumen | Enlaces | BibTeX | Etiquetas:
@article{Lopez-Castroman2012,
title = {P-1266 - Dimensional Schizophrenia: not an Easy Transition},
author = {Jorge L\'{o}pez-Castrom\'{a}n and Jose M Leiva-Murillo and Hilario Blasco-Fontecilla and R Garcia-Nieto and C Morant-Ginestar and Carlos Blanco and Antonio Art\'{e}s-Rodr\'{i}guez and Enrique Baca-Garc\'{i}a},
url = {http://www.sciencedirect.com/science/article/pii/S0924933812754330},
year = {2012},
date = {2012-01-01},
journal = {European Psychiatry},
volume = {27},
pages = {1},
abstract = {Recently, several authors have argued in favor of extending the less common clinical phenotype of schizophrenia to a vulnerability phenotype of schizophrenia in the general population. It has been proposed that high levels in any of four different symptom dimensions (affective, psychosis, negative and cognitive) would lead to clinical assessment, identification of correlated symptoms in other dimensions and finally, the diagnosis of schizophrenia. Being so, we would expect to find such a dimensional pattern in the previous diagnoses of schizophrenic patients. We examined previous contacts of a large cohort of patients diagnosed, according to the International Classification of Diseases (ICD-10), with schizophrenia (n=26,163) in public mental health centers of Madrid (Spain) from 1980 to 2008. Of those patients, 56.7% received another diagnosis prior to schizophrenia. Non-schizophrenia diagnoses within the category of ‘schizophrenia, schizotypal and delusional disorders’ were common (F2; 40.0%). The other most frequent prior diagnoses were ‘neurotic, stress-related and somatoform disorders’ (F4; 47.3%), ‘mood disorders’ (F3; 41.4%), and ‘disorders of adult personality and behavior’ (F6; 20.8%). We then examined the probability of progression to schizophrenia, considering also time proximity. The strongest associations were between several F2 spectrum diagnoses with schizophrenia. However, some affective disorders (F3x) were also linked with schizophrenia but anxiety (F4) or personality disorders (F6) were not. Our findings support two of the previously described dimensions (psychotic, affective) in the development of schizophrenia. Several limitations of the dimensional model will be discussed in view of these findings.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
2011
Vazquez-Vilar, Gonzalo; López-Valcarce, Roberto; Sala, Josep
Multiantenna spectrum sensing exploiting spectral a priori information Artículo de revista
En: IEEE Transactions on Wireless Communications, vol. 10, no 12, pp. 4345-4355, 2011, ISSN: 1536-1276.
@article{twc11,
title = {Multiantenna spectrum sensing exploiting spectral a priori information},
author = {Gonzalo Vazquez-Vilar and Roberto L\'{o}pez-Valcarce and Josep Sala},
doi = {10.1109/TWC.2011.101211.110665},
issn = {1536-1276},
year = {2011},
date = {2011-12-01},
journal = {IEEE Transactions on Wireless Communications},
volume = {10},
number = {12},
pages = {4345-4355},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Vazquez-Vilar, Gonzalo; López-Valcarce, Roberto
Spectrum sensing exploiting guard bands and weak channels Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 59, no 12, pp. 6045-6057, 2011, ISSN: 1053-587X.
@article{tsp11,
title = {Spectrum sensing exploiting guard bands and weak channels},
author = {Gonzalo Vazquez-Vilar and Roberto L\'{o}pez-Valcarce},
doi = {10.1109/TSP.2011.2167615},
issn = {1053-587X},
year = {2011},
date = {2011-12-01},
journal = {IEEE Transactions on Signal Processing},
volume = {59},
number = {12},
pages = {6045-6057},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Vazquez-Vilar, Gonzalo; Ramirez, David; López-Valcarce, Roberto; Via, Javier; Santamaria, Ignacio
Spatial rank estimation in Cognitive Radio Networks with uncalibrated multiple antennas Proceedings Article
En: 4th International Conference on Cognitive Radio and Advanced Spectrum Management (CogART 2011), Barcelona, Spain, 2011, (Invited).
BibTeX | Etiquetas:
@inproceedings{cogart2011,
title = {Spatial rank estimation in Cognitive Radio Networks with uncalibrated multiple antennas},
author = {Gonzalo Vazquez-Vilar and David Ramirez and Roberto L\'{o}pez-Valcarce and Javier Via and Ignacio Santamaria},
year = {2011},
date = {2011-10-01},
booktitle = {4th International Conference on Cognitive Radio and Advanced Spectrum Management (CogART 2011)},
address = {Barcelona, Spain},
note = {Invited},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Ramirez, David; Vazquez-Vilar, Gonzalo; Lopez-Valcarce, Roberto; Via, Javier; Santamaria, Ignacio
Detection of rank-P Signals in Cognitive Radio Networks With Uncalibrated Multiple Antennas Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 59, no 8, pp. 3764-3774, 2011, ISSN: 1053-587X.
@article{ramirez11,
title = {Detection of rank-P Signals in Cognitive Radio Networks With Uncalibrated Multiple Antennas},
author = {David Ramirez and Gonzalo Vazquez-Vilar and Roberto Lopez-Valcarce and Javier Via and Ignacio Santamaria},
doi = {10.1109/TSP.2011.2146779},
issn = {1053-587X},
year = {2011},
date = {2011-08-01},
journal = {IEEE Transactions on Signal Processing},
volume = {59},
number = {8},
pages = {3764-3774},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Campo, Adria Tauste; Vazquez-Vilar, Gonzalo; i Fàbregas, Albert Guillén; Martinez, Alfonso
Random-Coding Joint Source-Channel Bounds Proceedings Article
En: 2011 IEEE International Symposium on Information Theory (ISIT 2011), Saint Petersburg, Russia, 2011.
BibTeX | Etiquetas:
@inproceedings{isit2011,
title = {Random-Coding Joint Source-Channel Bounds},
author = {Adria Tauste Campo and Gonzalo Vazquez-Vilar and Albert Guill\'{e}n i F\`{a}bregas and Alfonso Martinez},
year = {2011},
date = {2011-07-01},
booktitle = {2011 IEEE International Symposium on Information Theory (ISIT 2011)},
address = {Saint Petersburg, Russia},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Vazquez-Vilar, Gonzalo; López-Valcarce, Roberto; Pandharipande, Ashish
Detection diversity of multiantenna spectrum sensors Proceedings Article
En: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2011), Prague, Czech Republic, 2011.
BibTeX | Etiquetas:
@inproceedings{iccasp2011a,
title = {Detection diversity of multiantenna spectrum sensors},
author = {Gonzalo Vazquez-Vilar and Roberto L\'{o}pez-Valcarce and Ashish Pandharipande},
year = {2011},
date = {2011-05-01},
booktitle = {2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2011)},
address = {Prague, Czech Republic},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Ramirez, David; Vazquez-Vilar, Gonzalo; López-Valcarce, Roberto; Via, Javier; Santamaria, Ignacio
Multiantenna Detection under Noise uncertainty and primary user's spatial structure Proceedings Article
En: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2011), Prague, Czech Republic, 2011.
BibTeX | Etiquetas:
@inproceedings{iccasp2011b,
title = {Multiantenna Detection under Noise uncertainty and primary user's spatial structure},
author = {David Ramirez and Gonzalo Vazquez-Vilar and Roberto L\'{o}pez-Valcarce and Javier Via and Ignacio Santamaria},
year = {2011},
date = {2011-05-01},
booktitle = {2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2011)},
address = {Prague, Czech Republic},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Salamanca, Luis; Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
Reduced Complexity MAP Decoder for LDPC Codes over the BEC Using Tree-Structure Expectation Propagation Proceedings Article
En: Information Theory and Applications (ITA), San Diego, 2011.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Salamanca2011,
title = {Reduced Complexity MAP Decoder for LDPC Codes over the BEC Using Tree-Structure Expectation Propagation},
author = {Luis Salamanca and Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
url = {http://www.researchgate.net/publication/236006584_Reduced_Complexity_MAP_decoder_for_LDPC_codes_over_the_BEC_using_Tree-Structure_Expectation_Propagation},
year = {2011},
date = {2011-01-01},
booktitle = {Information Theory and Applications (ITA)},
address = {San Diego},
abstract = {In this paper, we propose an algorithm that achieves the MAP solution to decode LDPC codes over the binary erasure channel (BEC). This algorithm, denoted as generalized tree-structured expectation propagation (GTEP), extends the idea of our previous work: the TEP decoder. Both proposals borrow from the tree-structured expectation propagation algorithm, which imposes a tree-like approximation over the original graphical model. However, whereas the TEP decoder only considers up to degree two check nodes, the proposed GTEP modifies the graph by eliminating a check node of any degree and merging this information with the remaining graph. The decoder builds a tree graph of relations between the erased variable nodes with respect to some parent variables. The GTEP algorithm upon completion either provides the unique MAP solution or a tree graph in which the number of parent nodes indicates the multiplicity of the MAP solution. This algorithm can be easily described for the BEC, and it can be cast as a generalized peeling decoder. The GTEP decoder can look for checks nodes of minimum degree to be eliminated first, optimizing the complexity of the decoder. Furthermore, this procedure yields an upper bound for the complexity of the MAP decoder. We include an analysis of the computational complexity of this novel decoder to show that it is a function of the erasure value of the channel, the length of the codeword and the ensemble of the code. We illustrate the proposed algorithm with regular codes, which do not present error floors and achieve capacity when the number of ones per column increases.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Balasingam, Balakumar; Bolic, Miodrag; Djuric, Petar M; Miguez, Joaquin
Efficient Distributed Resampling for Particle Filters Proceedings Article
En: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3772–3775, IEEE, Prague, 2011, ISSN: 1520-6149.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, Copper, Covariance matrix, distributed resampling, Markov processes, Probability density function, Sequential Monte-Carlo methods, Signal processing, Signal processing algorithms
@inproceedings{Balasingam2011,
title = {Efficient Distributed Resampling for Particle Filters},
author = {Balakumar Balasingam and Miodrag Bolic and Petar M Djuric and Joaquin Miguez},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5947172},
issn = {1520-6149},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
pages = {3772--3775},
publisher = {IEEE},
address = {Prague},
abstract = {In particle filtering, resampling is the only step that cannot be fully parallelized. Recently, we have proposed algorithms for distributed resampling implemented on architectures with concurrent processing elements (PEs). The objective of distributed resampling is to reduce the communication among the PEs while not compromising the performance of the particle filter. An additional objective for implementation is to reduce the communication among the PEs. In this paper, we report an improved version of the distributed resampling algorithm that optimally selects the particles for communication between the PEs of the distributed scheme. Computer simulations are provided that demonstrate the improved performance of the proposed algorithm.},
keywords = {Approximation algorithms, Copper, Covariance matrix, distributed resampling, Markov processes, Probability density function, Sequential Monte-Carlo methods, Signal processing, Signal processing algorithms},
pubstate = {published},
tppubtype = {inproceedings}
}
Ruiz, Francisco J R; Perez-Cruz, Fernando
Zero-Error Codes for the Noisy-Typewriter Channel Proceedings Article
En: 2011 IEEE Information Theory Workshop, pp. 495–497, IEEE, Paraty, 2011, ISBN: 978-1-4577-0437-6.
Resumen | Enlaces | BibTeX | Etiquetas: channel capacity, Channel Coding, Equations, Linear code, Noise measurement, noisy-typewriter channel, nontrivial codes, nonzero zero-error rate, odd-letter noisy-typewriter channels, Upper bound, Vectors, zero-error capacity, zero-error codes
@inproceedings{Ruiz2011,
title = {Zero-Error Codes for the Noisy-Typewriter Channel},
author = {Francisco J R Ruiz and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6089510},
isbn = {978-1-4577-0437-6},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE Information Theory Workshop},
pages = {495--497},
publisher = {IEEE},
address = {Paraty},
abstract = {In this paper, we propose nontrivial codes that achieve a non-zero zero-error rate for several odd-letter noisy-typewriter channels. Some of these codes (specifically, those which are defined for a number of letters of the channel of the form 2n + 1) achieve the best-known lower bound on the zero-error capacity. We build the codes using linear codes over rings, as we do not require the multiplicative inverse to build the codes.},
keywords = {channel capacity, Channel Coding, Equations, Linear code, Noise measurement, noisy-typewriter channel, nontrivial codes, nonzero zero-error rate, odd-letter noisy-typewriter channels, Upper bound, Vectors, zero-error capacity, zero-error codes},
pubstate = {published},
tppubtype = {inproceedings}
}
Koch, Tobias; Lapidoth, Amos
Asymmetric Quantizers are Better at Low SNR Proceedings Article
En: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 2592–2596, IEEE, St. Petersburg, 2011, ISSN: 2157-8095.
Resumen | Enlaces | BibTeX | Etiquetas: asymmetric one-bit quantizer, asymmetric signal constellations, channel capacity, Channel Coding, Constellation diagram, Decoding, discrete-time average-power-limited Gaussian chann, Gaussian channels, quantization, Signal to noise ratio, signal-to-noise ratio, SNR, spread spectrum communication, spread-spectrum communications, ultra wideband communication, ultrawideband communications, Upper bound
@inproceedings{Koch2011,
title = {Asymmetric Quantizers are Better at Low SNR},
author = {Tobias Koch and Amos Lapidoth},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6034037},
issn = {2157-8095},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE International Symposium on Information Theory Proceedings},
pages = {2592--2596},
publisher = {IEEE},
address = {St. Petersburg},
abstract = {We study the behavior of channel capacity when a one-bit quantizer is employed at the output of the discrete-time average-power-limited Gaussian channel. We focus on the low signal-to-noise ratio regime, where communication at very low spectral efficiencies takes place, as in Spread-Spectrum and Ultra-Wideband communications. It is well known that, in this regime, a symmetric one-bit quantizer reduces capacity by 2/$pi$, which translates to a power loss of approximately two decibels. Here we show that if an asymmetric one-bit quantizer is employed, and if asymmetric signal constellations are used, then these two decibels can be recovered in full.},
keywords = {asymmetric one-bit quantizer, asymmetric signal constellations, channel capacity, Channel Coding, Constellation diagram, Decoding, discrete-time average-power-limited Gaussian chann, Gaussian channels, quantization, Signal to noise ratio, signal-to-noise ratio, SNR, spread spectrum communication, spread-spectrum communications, ultra wideband communication, ultrawideband communications, Upper bound},
pubstate = {published},
tppubtype = {inproceedings}
}
Olmos, Pablo M; Urbanke, Rudiger
Scaling Behavior of Convolutional LDPC Ensembles over the BEC Proceedings Article
En: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 1816–1820, IEEE, Saint Petersburg, 2011, ISSN: 2157-8095.
Resumen | Enlaces | BibTeX | Etiquetas: BEC, binary codes, binary erasure channel, Bit error rate, convolutional codes, convolutional LDPC ensembles, coupled sparse graph codes, Couplings, Decoding, error probability, Iterative decoding, parity check codes, scaling behavior
@inproceedings{Olmos2011,
title = {Scaling Behavior of Convolutional LDPC Ensembles over the BEC},
author = {Pablo M Olmos and Rudiger Urbanke},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6033863},
issn = {2157-8095},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE International Symposium on Information Theory Proceedings},
pages = {1816--1820},
publisher = {IEEE},
address = {Saint Petersburg},
abstract = {We study the scaling behavior of coupled sparse graph codes over the binary erasure channel. In particular, let 2L+1 be the length of the coupled chain, let M be the number of variables in each of the 2L+1 local copies, let ℓ be the number of iterations, let Pb denote the bit error probability, and let ∈ denote the channel parameter. We are interested in how these quantities scale when we let the blocklength (2L + 1)M tend to infinity. Based on empirical evidence we show that the threshold saturation phenomenon is rather stable with respect to the scaling of the various parameters and we formulate some general rules of thumb which can serve as a guide for the design of coding systems based on coupled graphs.},
keywords = {BEC, binary codes, binary erasure channel, Bit error rate, convolutional codes, convolutional LDPC ensembles, coupled sparse graph codes, Couplings, Decoding, error probability, Iterative decoding, parity check codes, scaling behavior},
pubstate = {published},
tppubtype = {inproceedings}
}
Taborda, Camilo G; Perez-Cruz, Fernando
Information Theory Concepts and their Relationship with the Bregman Loss Functions Proceedings Article
En: Workshop on Topics in Information Theory and Communications (WTITC’11), Porto, 2011.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Taborda2011,
title = {Information Theory Concepts and their Relationship with the Bregman Loss Functions},
author = {Camilo G Taborda and Fernando Perez-Cruz},
url = {http://www.it.pt/auto_temp_web_page_preview.asp?id=961},
year = {2011},
date = {2011-01-01},
booktitle = {Workshop on Topics in Information Theory and Communications (WTITC’11)},
address = {Porto},
abstract = {Among the past eight years the information theory has become interested in the exploration of links between the information and estimation theory. The best known results show how the mean square error and the mutual information between two random variables (input and output) over a Gaussian channel can be related. Similar results illustrate that, for the Poisson channel, exists different loss functions that can be associated with information theory concepts such as the mutual information and the relative entropy. The talk is oriented in the following way; initially we analyzed different properties that share the mean square error and its counterparts for the Poisson channel. Some results obtained early by the research community can be seen as consequences of the behavior of the analyzed loss functions. In addition, we present a broader version of the results obtained previously for both channels, we also establish the behavior of the mutual information between two random variables when the conditional distribution of the channel comes from the exponential family. One of the main issues explored along the talk is determining in which cases the loss function involved in the behavior of the mutual information corresponds to a Bregman Loss Function, situation that enable us to establish geometrical properties of the found relations},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Goparaju, S; Calderbank, A R; Carson, W R; Rodrigues, Miguel R D; Perez-Cruz, Fernando
When to Add Another Dimension when Communicating over MIMO Channels Proceedings Article
En: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3100–3103, IEEE, Prague, 2011, ISSN: 1520-6149.
Resumen | Enlaces | BibTeX | Etiquetas: divide and conquer approach, divide and conquer methods, error probability, error rate, error statistics, Gaussian channels, Lattices, Manganese, MIMO, MIMO channel, MIMO communication, multiple input multiple output Gaussian channel, Mutual information, optimal power allocation, power allocation, power constraint, receive filter, Resource management, Signal to noise ratio, signal-to-noise ratio, transmit filter, Upper bound
@inproceedings{Goparaju2011,
title = {When to Add Another Dimension when Communicating over MIMO Channels},
author = {S Goparaju and A R Calderbank and W R Carson and Miguel R D Rodrigues and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5946351},
issn = {1520-6149},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)},
pages = {3100--3103},
publisher = {IEEE},
address = {Prague},
abstract = {This paper introduces a divide and conquer approach to the design of transmit and receive filters for communication over a Multiple Input Multiple Output (MIMO) Gaussian channel subject to an average power constraint. It involves conversion to a set of parallel scalar channels, possibly with very different gains, followed by coding per sub-channel (i.e. over time) rather than coding across sub-channels (i.e. over time and space). The loss in performance is negligible at high signal-to-noise ratio (SNR) and not significant at medium SNR. The advantages are reduction in signal processing complexity and greater insight into the SNR thresholds at which a channel is first allocated power. This insight is a consequence of formulating the optimal power allocation in terms of an upper bound on error rate that is determined by parameters of the input lattice such as the minimum distance and kissing number. The resulting thresholds are given explicitly in terms of these lattice parameters. By contrast, when the optimization problem is phrased in terms of maximizing mutual information, the solution is mercury waterfilling, and the thresholds are implicit.},
keywords = {divide and conquer approach, divide and conquer methods, error probability, error rate, error statistics, Gaussian channels, Lattices, Manganese, MIMO, MIMO channel, MIMO communication, multiple input multiple output Gaussian channel, Mutual information, optimal power allocation, power allocation, power constraint, receive filter, Resource management, Signal to noise ratio, signal-to-noise ratio, transmit filter, Upper bound},
pubstate = {published},
tppubtype = {inproceedings}
}
Leiva-Murillo, Jose M; Artés-Rodríguez, Antonio; Baca-García, Enrique
Visualization and Prediction of Disease Interactions with Continuous-Time Hidden Markov Models Proceedings Article
En: NIPS 2011 Workshop on Personalized Medicine., Sierra Nevada, 2011.
Resumen | Enlaces | BibTeX | Etiquetas: Computational, Information-Theoretic Learning with Statistics, Theory & Algorithms
@inproceedings{Leiva-Murillo2011,
title = {Visualization and Prediction of Disease Interactions with Continuous-Time Hidden Markov Models},
author = {Jose M Leiva-Murillo and Antonio Art\'{e}s-Rodr\'{i}guez and Enrique Baca-Garc\'{i}a},
url = {http://eprints.pascal-network.org/archive/00009110/},
year = {2011},
date = {2011-01-01},
booktitle = {NIPS 2011 Workshop on Personalized Medicine.},
address = {Sierra Nevada},
abstract = {This paper describes a method for discovering disease relationships and the evolution of diseases from medical records. The method makes use of continuous-time Markov chain models that overcome some drawbacks of the more widely used discrete-time chain models. The model addresses uncertainty in the diagnoses, possible diagnosis errors and the existence of multiple alternative diagnoses in the records. A set of experiments, performed on a dataset of psychiatric medical records, shows the capability of the model to visualize maps of comorbidity and causal interactions among diseases as well as to perform predictions of future evolution of diseases.},
keywords = {Computational, Information-Theoretic Learning with Statistics, Theory \& Algorithms},
pubstate = {published},
tppubtype = {inproceedings}
}
Olmos, Pablo M; Salamanca, Luis; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
An Application of Tree-Structured Expectation Propagation for Channel Decoding Proceedings Article
En: Neural Information Processing Systems Foundation (NIPS), Granada, 2011.
@inproceedings{Olmos2011a,
title = {An Application of Tree-Structured Expectation Propagation for Channel Decoding},
author = {Pablo M Olmos and Luis Salamanca and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
year = {2011},
date = {2011-01-01},
booktitle = {Neural Information Processing Systems Foundation (NIPS)},
address = {Granada},
abstract = {We show an application of a tree structure for approximate inference in graphical models using the expectation propagation algorithm. These approximations are typically used over graphs with short-range cycles. We demonstrate that these approximations also help in sparse graphs with long-range loops, as the ones used in coding theory to approach channel capacity. For asymptotically large sparse graph, the expectation propagation algorithm together with the tree structure yields a completely disconnected approximation to the graphical model but, for for finite-length practical sparse graphs, the tree structure approximation to the code graph provides accurate estimates for the marginal of each variable. Furthermore, we propose a new method for constructing the tree structure on the fly that might be more amenable for sparse graphs with general factors.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
Capacity Achieving LDPC Ensembles for the TEP Decoder in Erasure Channels Proceedings Article
En: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 2398–2402, IEEE, St. Petersburg, 2011, ISSN: 2157-8095.
Resumen | Enlaces | BibTeX | Etiquetas: BP threshold, Complexity theory, Decoding, Differential equations, erasure channels, fixed-rate code, Iterative decoding, LDPC, low-density parity-check codes, MAP capacity, MAP threshold, optimisation, Optimization, optimization problem, parity check codes, TEP decoder, tree-expectation propagation decoder
@inproceedings{Olmos2011b,
title = {Capacity Achieving LDPC Ensembles for the TEP Decoder in Erasure Channels},
author = {Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6033993},
issn = {2157-8095},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE International Symposium on Information Theory Proceedings},
pages = {2398--2402},
publisher = {IEEE},
address = {St. Petersburg},
abstract = {In this work we address the design of degree distributions (DD) of low-density parity-check (LDPC) codes for the tree-expectation propagation (TEP) decoder. The optimization problem to find distributions to maximize the TEP decoding threshold for a fixed-rate code can not be analytically solved. We derive a simplified optimization problem that can be easily solved since it is based in the analytic expressions of the peeling decoder. Two kinds of solutions are obtained from this problem: we either design LDPC ensembles for which the BP threshold equals the MAP threshold or we get LDPC ensembles for which the TEP threshold outperforms the BP threshold, even achieving the MAP capacity in some cases. Hence, we proved that there exist ensembles for which the MAP solution can be obtained with linear complexity even though the BP threshold does not achieve the MAP threshold.},
keywords = {BP threshold, Complexity theory, Decoding, Differential equations, erasure channels, fixed-rate code, Iterative decoding, LDPC, low-density parity-check codes, MAP capacity, MAP threshold, optimisation, Optimization, optimization problem, parity check codes, TEP decoder, tree-expectation propagation decoder},
pubstate = {published},
tppubtype = {inproceedings}
}
Asyhari, Taufiq A; Koch, Tobias; i Fàbregas, Albert Guillén
Nearest Neighbour Decoding and Pilot-Aided Channel Estimation in Stationary Gaussian Flat-Fading Channels Proceedings Article
En: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 2786–2790, IEEE, St. Petersburg, 2011, ISSN: 2157-8095.
Resumen | Enlaces | BibTeX | Etiquetas: Channel estimation, Decoding, Fading, fading channels, Gaussian channels, MIMO, MIMO communication, MISO, multiple-input multiple-output, nearest neighbour decoding, noncoherent multiple-input single-output, pilot-aided channel estimation, Receiving antennas, Signal to noise ratio, signal-to-noise ratio, SNR, stationary Gaussian flat-fading channels, Wireless communication
@inproceedings{Asyhari2011,
title = {Nearest Neighbour Decoding and Pilot-Aided Channel Estimation in Stationary Gaussian Flat-Fading Channels},
author = {Taufiq A Asyhari and Tobias Koch and Albert Guill\'{e}n i F\`{a}bregas},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6034081},
issn = {2157-8095},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE International Symposium on Information Theory Proceedings},
pages = {2786--2790},
publisher = {IEEE},
address = {St. Petersburg},
abstract = {We study the information rates of non-coherent, stationary, Gaussian, multiple-input multiple-output (MIMO) flat-fading channels that are achievable with nearest neighbour decoding and pilot-aided channel estimation. In particular, we analyse the behaviour of these achievable rates in the limit as the signal-to-noise ratio (SNR) tends to infinity. We demonstrate that nearest neighbour decoding and pilot-aided channel estimation achieves the capacity pre-log-which is defined as the limiting ratio of the capacity to the logarithm of SNR as the SNR tends to infinity-of non-coherent multiple-input single-output (MISO) flat-fading channels, and it achieves the best so far known lower bound on the capacity pre-log of non-coherent MIMO flat-fading channels.},
keywords = {Channel estimation, Decoding, Fading, fading channels, Gaussian channels, MIMO, MIMO communication, MISO, multiple-input multiple-output, nearest neighbour decoding, noncoherent multiple-input single-output, pilot-aided channel estimation, Receiving antennas, Signal to noise ratio, signal-to-noise ratio, SNR, stationary Gaussian flat-fading channels, Wireless communication},
pubstate = {published},
tppubtype = {inproceedings}
}
Maiz, Cristina S; Miguez, Joaquin
On the Optimization of Transportation Routes with Multiple Destinations in Random Networks Proceedings Article
En: 2011 IEEE Statistical Signal Processing Workshop (SSP), pp. 349–352, IEEE, Nice, 2011, ISBN: 978-1-4577-0569-4.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, communication networks, Estimation, graph theory, Histograms, intelligent transportation, Monte Carlo algorithm, Monte Carlo methods, multiple destinations, optimisation, Optimization, random networks, route optimization, routing, Sequential Monte Carlo, Signal processing algorithms, stochastic graph, Stochastic processes, telecommunication network routing, time-varying graph, transportation routes
@inproceedings{Maiz2011,
title = {On the Optimization of Transportation Routes with Multiple Destinations in Random Networks},
author = {Cristina S Maiz and Joaquin Miguez},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5967701},
isbn = {978-1-4577-0569-4},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE Statistical Signal Processing Workshop (SSP)},
pages = {349--352},
publisher = {IEEE},
address = {Nice},
abstract = {Various practical problems in transportation research and routing in communication networks can be reduced to the computation of the best path that traverses a certain graph and visits a set of D specified destination nodes. Simple versions of this problem have received attention in the literature. Optimal solutions exist for the cases in which (a) D \>; 1 and the graph is deterministic or (b) D = 1 and the graph is stochastic (and possibly time-dependent). Here, we address the general problem in which both D \>; 1 and the costs of the edges in the graph are stochastic and time-varying. We tackle this complex global optimization problem by first converting it into an equivalent estimation problem and then computing a numerical solution using a sequential Monte Carlo algorithm. The advantage of the proposed technique over some standard methods (devised for graphs with time-invariant statistics) is illustrated by way of computer simulations.},
keywords = {Approximation algorithms, communication networks, Estimation, graph theory, Histograms, intelligent transportation, Monte Carlo algorithm, Monte Carlo methods, multiple destinations, optimisation, Optimization, random networks, route optimization, routing, Sequential Monte Carlo, Signal processing algorithms, stochastic graph, Stochastic processes, telecommunication network routing, time-varying graph, transportation routes},
pubstate = {published},
tppubtype = {inproceedings}
}
Salamanca, Luis; Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
MAP Decoding for LDPC Codes over the Binary Erasure Channel Proceedings Article
En: 2011 IEEE Information Theory Workshop, pp. 145–149, IEEE, Paraty, 2011, ISBN: 978-1-4577-0437-6.
Resumen | Enlaces | BibTeX | Etiquetas: binary erasure channel, Channel Coding, computational complexity, Decoding, generalized peeling decoder, generalized tree-structured expectation propagatio, graphical models, Iterative decoding, LDPC codes, MAP decoding, MAP decoding algorithm, Maximum likelihood decoding, parity check codes, TEP decoder, tree graph theory, Tree graphs, tree-structured expectation propagation, trees (mathematics)
@inproceedings{Salamanca2011a,
title = {MAP Decoding for LDPC Codes over the Binary Erasure Channel},
author = {Luis Salamanca and Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6089364},
isbn = {978-1-4577-0437-6},
year = {2011},
date = {2011-01-01},
booktitle = {2011 IEEE Information Theory Workshop},
pages = {145--149},
publisher = {IEEE},
address = {Paraty},
abstract = {In this paper, we propose a decoding algorithm for LDPC codes that achieves the MAP solution over the BEC. This algorithm, denoted as generalized tree-structured expectation propagation (GTEP), extends the idea of our previous work, the TEP decoder. The GTEP modifies the graph by eliminating a check node of any degree and merging this information with the remaining graph. The GTEP decoder upon completion either provides the unique MAP solution or a tree graph in which the number of parent nodes indicates the multiplicity of the MAP solution. This algorithm can be easily described for the BEC, and it can be cast as a generalized peeling decoder. The GTEP naturally optimizes the complexity of the decoder, by looking for checks nodes of minimum degree to be eliminated first.},
keywords = {binary erasure channel, Channel Coding, computational complexity, Decoding, generalized peeling decoder, generalized tree-structured expectation propagatio, graphical models, Iterative decoding, LDPC codes, MAP decoding, MAP decoding algorithm, Maximum likelihood decoding, parity check codes, TEP decoder, tree graph theory, Tree graphs, tree-structured expectation propagation, trees (mathematics)},
pubstate = {published},
tppubtype = {inproceedings}
}
Achutegui, Katrin; Miguez, Joaquin
A Parallel Resampling Scheme and its Application to Distributed Particle Filtering in Wireless Networks Proceedings Article
En: 2011 4th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), pp. 81–84, IEEE, San Juan, 2011, ISBN: 978-1-4577-2105-2.
Resumen | Enlaces | BibTeX | Etiquetas: Approximation algorithms, Approximation methods, Artificial neural networks, distributed resampling, DRNA technique, Markov processes, nonproportional allocation algorithm, parallel resampling scheme, PF, quantization, Signal processing, Vectors, Wireless sensor network, Wireless Sensor Networks, WSN
@inproceedings{Achutegui2011,
title = {A Parallel Resampling Scheme and its Application to Distributed Particle Filtering in Wireless Networks},
author = {Katrin Achutegui and Joaquin Miguez},
url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6136051},
isbn = {978-1-4577-2105-2},
year = {2011},
date = {2011-01-01},
booktitle = {2011 4th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)},
pages = {81--84},
publisher = {IEEE},
address = {San Juan},
abstract = {We address the design of a particle filter (PF) that can be implemented in a distributed manner over a network of wireless sensor nodes, each of them collecting their own local data. This is a problem that has received considerable attention lately and several methods based on consensus, the transmission of likelihood information, the truncation and/or the quantization of data have been proposed. However, all existing schemes suffer from limitations related either to the amount of required communications among the nodes or the accuracy of the filter outputs. In this work we propose a novel distributed PF that is built around the distributed resampling with non-proportional allocation (DRNA) algorithm. This scheme guarantees the properness of the particle approximations produced by the filter and has been shown to be both efficient and accurate when compared with centralized PFs. The standard DRNA technique, however, places stringent demands on the communications among nodes that turn out impractical for a typical wireless sensor network (WSN). In this paper we investigate how to reduce this communication load by using (i) a random model for the spread of data over the WSN and (ii) methods that enable the out-of-sequence processing of sensor observations. A simple numerical illustration of the performance of the new algorithm compared with a centralized PF is provided.},
keywords = {Approximation algorithms, Approximation methods, Artificial neural networks, distributed resampling, DRNA technique, Markov processes, nonproportional allocation algorithm, parallel resampling scheme, PF, quantization, Signal processing, Vectors, Wireless sensor network, Wireless Sensor Networks, WSN},
pubstate = {published},
tppubtype = {inproceedings}
}
Asyhari, Taufiq A; Koch, Tobias; i Fabregas, Albert Guillen
Nearest Neighbour Decoding with Pilot-Assisted Channel Estimation for Fading Multiple-Access Channels Proceedings Article
En: 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1686–1693, IEEE, Allerton, 2011, ISBN: 978-1-4577-1818-2.
Resumen | Enlaces | BibTeX | Etiquetas: Channel estimation, Decoding, Fading, fading channels, fading multiple-access channels, MIMO, MIMO communication, multi-access systems, multiple-input multiple-output channel, nearest-neighbour decoding, noncoherent MIMO fading MAC channel, pilot-assisted channel estimation, Receiving antennas, Signal to noise ratio, signal-to-noise ratio, Time division multiple access, Vectors
@inproceedings{Asyhari2011a,
title = {Nearest Neighbour Decoding with Pilot-Assisted Channel Estimation for Fading Multiple-Access Channels},
author = {Taufiq A Asyhari and Tobias Koch and Albert Guillen i Fabregas},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6120371},
isbn = {978-1-4577-1818-2},
year = {2011},
date = {2011-01-01},
booktitle = {2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
pages = {1686--1693},
publisher = {IEEE},
address = {Allerton},
abstract = {This paper studies a noncoherent multiple-input multiple-output (MIMO) fading multiple-access channel (MAC). The rate region that is achievable with nearest neighbour decoding and pilot-assisted channel estimation is analysed and the corresponding pre-log region, defined as the limiting ratio of the rate region to the logarithm of the signal-to-noise ratio (SNR) as the SNR tends to infinity, is determined.},
keywords = {Channel estimation, Decoding, Fading, fading channels, fading multiple-access channels, MIMO, MIMO communication, multi-access systems, multiple-input multiple-output channel, nearest-neighbour decoding, noncoherent MIMO fading MAC channel, pilot-assisted channel estimation, Receiving antennas, Signal to noise ratio, signal-to-noise ratio, Time division multiple access, Vectors},
pubstate = {published},
tppubtype = {inproceedings}
}
Ruiz, Francisco J R; Perez-Cruz, Fernando
Zero-Error Codes for the Noisy-Typewriter Channel Proceedings Article
En: Summer Research Institute (SuRi), Lausanne, 2011.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Ruiz2011a,
title = {Zero-Error Codes for the Noisy-Typewriter Channel},
author = {Francisco J R Ruiz and Fernando Perez-Cruz},
url = {http://suri.epfl.ch/past/2011},
year = {2011},
date = {2011-01-01},
booktitle = {Summer Research Institute (SuRi)},
address = {Lausanne},
abstract = {In this paper we propose nontrivial codes that achieve a non-zero zero-error rate for several odd-letter noisy-typewriter channels. Some of these codes (specifically those which are defined for a number of letters of the channel of the form 2^n+1) achieve the best-known lower bound on the zero-error capacity. We build the codes using linear codes over rings as we do not require the multiplicative inverse to build the codes.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Shan, Gong; Artés-Rodríguez, Antonio
Fast Background Elimination in Fluorescence Microbiology Images: Comparison of Four Algorithms Proceedings Article
En: 7th Artificial Intelligence Applications and Innovations Conference, pp. 285 – 290, Corfú, 2011.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Shan2011,
title = {Fast Background Elimination in Fluorescence Microbiology Images: Comparison of Four Algorithms},
author = {Gong Shan and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://link.springer.com/chapter/10.1007/978-3-642-23960-1_34},
year = {2011},
date = {2011-01-01},
booktitle = {7th Artificial Intelligence Applications and Innovations Conference},
pages = {285 -- 290},
address = {Corf\'{u}},
abstract = {In this work, we investigate a fast background elimination front-end of an automatic bacilli detection system. This background eliminating system consists of a feature descriptor followed by a linear-SVMs classifier. Four state-of-the-art feature extraction algorithms are analyzed and modified. Extensive experiments have been made on real sputum fluorescence images and the results reveal that 96.92% of the background content can be correctly removed from one image with an acceptable computational complexity.},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Koblents, Eugenia; Miguez, Joaquin
A Population Monte Carlo Method for Bayesian Inference and its Application to Stochastic Kinetic Models Proceedings Article
En: EUSIPCO 2011, Barcelona, 2011.
Resumen | Enlaces | BibTeX | Etiquetas:
@inproceedings{Koblents2011,
title = {A Population Monte Carlo Method for Bayesian Inference and its Application to Stochastic Kinetic Models},
author = {Eugenia Koblents and Joaquin Miguez},
url = {http://www.eurasip.org/Proceedings/Eusipco/Eusipco2011/papers/1569427761.pdf},
year = {2011},
date = {2011-01-01},
booktitle = {EUSIPCO 2011},
address = {Barcelona},
abstract = {We introduce an extension of the population Monte Carlo (PMC) methodology to address the problem of Bayesian in- ference in high dimensional models. Specifically, we intro- duce a technique for the selection and update of importance functions based on the construction of Gaussian Bayesian networks. The structure of the latter graphical model en- ables a sequential sampling procedure that requires draw- ing only from unidimensional conditional distributions an d leads to very efficient PMC algorithms. In order to illus- trate the potential of the new technique we have consid- ered the estimation of rate parameters in stochastic kineti c models (SKMs). SKMs are multivariate systems that model molecular interactions in biological and chemical problem s. We present some numerical results based on a simple SKM known as predator-prey mode},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Vazquez, Manuel A; Miguez, Joaquin
A Per-Survivor Processing Receiver for MIMO Transmission Systems With One Unknown Channel Order Per Output Artículo de revista
En: IEEE Transactions on Vehicular Technology, vol. 60, no 9, pp. 4415–4426, 2011, ISSN: 0018-9545.
Resumen | Enlaces | BibTeX | Etiquetas: Channel estimation, communication channel, Complexity theory, dynamic programming, frequency-selective MIMO channel, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channel impulse response coefficient, MIMO communication, MIMO transmission system, multipath channels, mutiple-input–multiple-output (MIMO), per-survivor processing receiver, Receiving antennas, Signal processing algorithms, time-selective MIMO channel, Transmitting antennas, Viterbi algorithm
@article{Vazquez2011,
title = {A Per-Survivor Processing Receiver for MIMO Transmission Systems With One Unknown Channel Order Per Output},
author = {Manuel A Vazquez and Joaquin Miguez},
url = {http://www.tsc.uc3m.es/~jmiguez/papers/P31_2011_A Per-Survivor Processing Receiver for MIMO Transmission Systems With One Unknown Channel Order Per Output.pdf http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6032763},
issn = {0018-9545},
year = {2011},
date = {2011-01-01},
journal = {IEEE Transactions on Vehicular Technology},
volume = {60},
number = {9},
pages = {4415--4426},
abstract = {The order of a communications channel is the length of its impulse response. Recently, several works have tackled the problem of estimating the order of a frequency-selective multiple-input-multiple-output (MIMO) channel. However, all of them consider a single order, despite the fact that a MIMO channel comprises several subchannels (specifically, as many as the number of inputs times the number of outputs), each one possibly with its own order. In this paper, we introduce an algorithm for maximum-likelihood sequence detection (MLSD) in frequency- and time-selective MIMO channels that incorporates full estimation of the MIMO channel impulse response (CIR) coefficients, including one channel order per output. Simulation results following the analytical derivation of the algorithm suggest that the proposed receiver can achieve significant improvements in performance when transmitting through a MIMO channel that effectively comprises subchannels of different lengths.},
keywords = {Channel estimation, communication channel, Complexity theory, dynamic programming, frequency-selective MIMO channel, frequency-selective multiple-input multiple-output, maximum likelihood detection, maximum likelihood sequence detection, maximum likelihood sequence estimation, MIMO, MIMO channel impulse response coefficient, MIMO communication, MIMO transmission system, multipath channels, mutiple-input\textendashmultiple-output (MIMO), per-survivor processing receiver, Receiving antennas, Signal processing algorithms, time-selective MIMO channel, Transmitting antennas, Viterbi algorithm},
pubstate = {published},
tppubtype = {article}
}
Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando
Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes Artículo de revista
En: IEEE Communications Letters, vol. 15, no 2, pp. 235–237, 2011, ISSN: 1089-7798.
Resumen | Enlaces | BibTeX | Etiquetas: belief propagation decoder, BP algorithm, BP decoder, code graph, communication complexity, computational complexity, Decoding, finite-length analysis, finite-length low-density parity-check code, LDPC code, LDPC decoding, parity check codes, radiowave propagation, stopping set, TEP algorithm, TEP decoder, tree-structured expectation propagation
@article{Olmos2011c,
title = {Tree-Structured Expectation Propagation for Decoding Finite-Length LDPC Codes},
author = {Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5682215},
issn = {1089-7798},
year = {2011},
date = {2011-01-01},
journal = {IEEE Communications Letters},
volume = {15},
number = {2},
pages = {235--237},
abstract = {In this paper, we propose Tree-structured Expectation Propagation (TEP) algorithm to decode finite-length Low-Density Parity-Check (LDPC) codes. The TEP decoder is able to continue decoding once the standard Belief Propagation (BP) decoder fails, presenting the same computational complexity as the BP decoder. The BP algorithm is dominated by the presence of stopping sets (SSs) in the code graph. We show that the TEP decoder, without previous knowledge of the graph, naturally avoids some fairly common SSs. This results in a significant improvement in the system performance.},
keywords = {belief propagation decoder, BP algorithm, BP decoder, code graph, communication complexity, computational complexity, Decoding, finite-length analysis, finite-length low-density parity-check code, LDPC code, LDPC decoding, parity check codes, radiowave propagation, stopping set, TEP algorithm, TEP decoder, tree-structured expectation propagation},
pubstate = {published},
tppubtype = {article}
}
Asheghan, Mohammad Mostafa; Miguez, Joaquin; Hamidi-Beheshti, Mohammad Taghi; Tavazoei, Mohammad Saleh
Robust Outer Synchronization between two Complex Networks with Fractional Order Dynamics Artículo de revista
En: Chaos (Woodbury, N.Y.), vol. 21, no 3, pp. 033121, 2011, ISSN: 1089-7682.
Resumen | Enlaces | BibTeX | Etiquetas:
@article{Asheghan2011,
title = {Robust Outer Synchronization between two Complex Networks with Fractional Order Dynamics},
author = {Mohammad Mostafa Asheghan and Joaquin Miguez and Mohammad Taghi Hamidi-Beheshti and Mohammad Saleh Tavazoei},
url = {http://www.tsc.uc3m.es/~jmiguez/papers/P32_2011_Robust Outer Synchronization between two Complex Networks with Fractional Order Dynamics.pdf
http://scitation.aip.org/content/aip/journal/chaos/21/3/10.1063/1.3629986},
issn = {1089-7682},
year = {2011},
date = {2011-01-01},
journal = {Chaos (Woodbury, N.Y.)},
volume = {21},
number = {3},
pages = {033121},
publisher = {AIP Publishing},
abstract = {Synchronization between two coupled complex networks with fractional-order dynamics, hereafter referred to as outer synchronization, is investigated in this work. In particular, we consider two systems consisting of interconnected nodes. The state variables of each node evolve with time according to a set of (possibly nonlinear and chaotic) fractional-order differential equations. One of the networks plays the role of a master system and drives the second network by way of an open-plus-closed-loop (OPCL) scheme. Starting from a simple analysis of the synchronization error and a basic lemma on the eigenvalues of matrices resulting from Kronecker products, we establish various sets of conditions for outer synchronization, i.e., for ensuring that the errors between the state variables of the master and response systems can asymptotically vanish with time. Then, we address the problem of robust outer synchronization, i.e., how to guarantee that the states of the nodes converge to common values when the parameters of the master and response networks are not identical, but present some perturbations. Assuming that these perturbations are bounded, we also find conditions for outer synchronization, this time given in terms of sets of linear matrix inequalities (LMIs). Most of the analytical results in this paper are valid both for fractional-order and integer-order dynamics. The assumptions on the inner (coupling) structure of the networks are mild, involving, at most, symmetry and diffusivity. The analytical results are complemented with numerical examples. In particular, we show examples of generalized and robust outer synchronization for networks whose nodes are governed by fractional-order Lorenz dynamics.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Delgado-Gómez, David; Aguado, David; Lopez-Castroman, Jorge; Santacruz, Carlos; Artés-Rodríguez, Antonio
Improving Sale Performance Prediction Using Support Vector Machines Artículo de revista
En: Expert Systems with Applications, vol. 38, no 5, pp. 5129–5132, 2011.
Resumen | Enlaces | BibTeX | Etiquetas: Recruitment process, Sale performance prediction, Support vector machines
@article{Delgado-Gomez2011a,
title = {Improving Sale Performance Prediction Using Support Vector Machines},
author = {David Delgado-G\'{o}mez and David Aguado and Jorge Lopez-Castroman and Carlos Santacruz and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://www.tsc.uc3m.es/~antonio/papers/P41_2011_Improving Sale Performance Prediction Using Support Vector Machines.pdf
http://www.sciencedirect.com/science/article/pii/S0957417410011322},
year = {2011},
date = {2011-01-01},
journal = {Expert Systems with Applications},
volume = {38},
number = {5},
pages = {5129--5132},
abstract = {In this article, an expert system based on support vector machines is developed to predict the sale performance of some insurance company candidates. The system predicts the performance of these candidates based on some scores, which are measurements of cognitive characteristics, personality, selling skills and biodata. An experiment is conducted to compare the accuracy of the proposed system with respect to previously reported systems which use discriminant functions or decision trees. Results show that the proposed system is able to improve the accuracy of a baseline linear discriminant based system by more than 10% and that also exceeds the state of the art systems by almost 5%. The proposed approach can help to reduce considerably the direct and indirect expenses of the companies.},
keywords = {Recruitment process, Sale performance prediction, Support vector machines},
pubstate = {published},
tppubtype = {article}
}
Delgado-Gómez, David; Blasco-Fontecilla, Hilario; Alegria, AnaLucia A; Legido-Gil, Teresa; Artés-Rodríguez, Antonio; Baca-García, Enrique
Improving the Accuracy of Suicide Attempter Classification Artículo de revista
En: Artificial Intelligence in Medicine, vol. 52, no 3, pp. 165–168, 2011.
Resumen | Enlaces | BibTeX | Etiquetas: Barratt’s impulsiveness scale, Boosting, International personality disorder evaluation scre, Suicide prediction, Support vector machines
@article{Delgado-Gomez2011b,
title = {Improving the Accuracy of Suicide Attempter Classification},
author = {David Delgado-G\'{o}mez and Hilario Blasco-Fontecilla and AnaLucia A Alegria and Teresa Legido-Gil and Antonio Art\'{e}s-Rodr\'{i}guez and Enrique Baca-Garc\'{i}a},
url = {http://www.sciencedirect.com/science/article/pii/S0933365711000595},
year = {2011},
date = {2011-01-01},
journal = {Artificial Intelligence in Medicine},
volume = {52},
number = {3},
pages = {165--168},
abstract = {OBJECTIVE Psychometrical questionnaires such as the Barrat’s impulsiveness scale version 11 (BIS-11) have been used in the assessment of suicidal behavior. Traditionally, BIS-11 items have been considered as equally valuable but this might not be true. The main objective of this article is to test the discriminative ability of the BIS-11 and the international personality disorder evaluation screening questionnaire (IPDE-SQ) to predict suicide attempter (SA) status using different classification techniques. In addition, we examine the discriminative capacity of individual items from both scales. MATERIALS AND METHODS Two experiments aimed at evaluating the accuracy of different classification techniques were conducted. The answers of 879 individuals (345 SA, 384 healthy blood donors, and 150 psychiatric inpatients) to the BIS-11 and IPDE-SQ were used to compare the classification performance of two techniques that have successfully been applied in pattern recognition issues, Boosting and support vector machines (SVM) with respect to linear discriminant analysis, Fisher linear discriminant analysis, and the traditional psychometrical approach. RESULTS The most discriminative BIS-11 and IPDE-SQ items are “I am self controlled” (Item 6) and “I often feel empty inside” (item 40), respectively. The SVM classification accuracy was 76.71% for the BIS-11 and 80.26% for the IPDE-SQ. CONCLUSIONS The IPDE-SQ items have better discriminative abilities than the BIS-11 items for classifying SA. Moreover, IPDE-SQ is able to obtain better SA and non-SA classification results than the BIS-11. In addition, SVM outperformed the other classification techniques in both questionnaires.},
keywords = {Barratt’s impulsiveness scale, Boosting, International personality disorder evaluation scre, Suicide prediction, Support vector machines},
pubstate = {published},
tppubtype = {article}
}
Miguez, Joaquin; Crisan, Dan; Djuric, Petar M
On the Convergence of Two Sequential Monte Carlo Methods for Maximum a Posteriori Sequence Estimation and Stochastic Global Optimization Artículo de revista
En: Statistics and Computing, vol. 23, no 1, pp. 91–107, 2011, ISSN: 0960-3174.
Resumen | Enlaces | BibTeX | Etiquetas: Global optimization, MAP sequence estimation, Sequential Monte Carlo, State space models
@article{Miguez2011,
title = {On the Convergence of Two Sequential Monte Carlo Methods for Maximum a Posteriori Sequence Estimation and Stochastic Global Optimization},
author = {Joaquin Miguez and Dan Crisan and Petar M Djuric},
url = {http://www.researchgate.net/publication/225447686_On_the_convergence_of_two_sequential_Monte_Carlo_methods_for_maximum_a_posteriori_sequence_estimation_and_stochastic_global_optimization},
issn = {0960-3174},
year = {2011},
date = {2011-01-01},
journal = {Statistics and Computing},
volume = {23},
number = {1},
pages = {91--107},
abstract = {This paper addresses the problem of maximum a posteriori (MAP) sequence estimation in general state-space models. We consider two algorithms based on the sequential Monte Carlo (SMC) methodology (also known as particle filtering). We prove that they produce approximations of the MAP estimator and that they converge almost surely. We also derive a lower bound for the number of particles that are needed to achieve a given approximation accuracy. In the last part of the paper, we investigate the application of particle filtering and MAP estimation to the global optimization of a class of (possibly non-convex and possibly non-differentiable) cost functions. In particular, we show how to convert the cost-minimization problem into one of MAP sequence estimation for a state-space model that is “matched” to the cost of interest. We provide examples that illustrate the application of the methodology as well as numerical results.},
keywords = {Global optimization, MAP sequence estimation, Sequential Monte Carlo, State space models},
pubstate = {published},
tppubtype = {article}
}
Lopez-Castroman, Jorge; Perez-Rodriguez, Mercedes M; Jaussent, Isabelle; Alegria, AnaLucia A; Artés-Rodríguez, Antonio; Freed, Peter; Guillaume, Sébastien; Jollant, Fabrice; Leiva-Murillo, Jose M; Malafosse, Alain; Oquendo, Maria A; de Prado-Cumplido, Mario; Saiz-Ruiz, Jeronimo; Baca-García, Enrique; Courtet, Philippe
Distinguishing the Relevant Features of Frequent Suicide Attempters Artículo de revista
En: Journal of psychiatric research, vol. 45, no 5, pp. 619–625, 2011, ISSN: 1879-1379.
Resumen | Enlaces | BibTeX | Etiquetas: Adult, Attempted, Attempted: psychology, Attempted: statistics & numerical data, Female, France, Humans, Interview, Male, Middle Aged, Prevalence, Probability, Psychiatric Status Rating Scales, Psychological, Risk Factors, ROC Curve, Spain, Suicide
@article{Lopez-Castroman2011,
title = {Distinguishing the Relevant Features of Frequent Suicide Attempters},
author = {Jorge Lopez-Castroman and Mercedes M Perez-Rodriguez and Isabelle Jaussent and AnaLucia A Alegria and Antonio Art\'{e}s-Rodr\'{i}guez and Peter Freed and S\'{e}bastien Guillaume and Fabrice Jollant and Jose M Leiva-Murillo and Alain Malafosse and Maria A Oquendo and Mario de Prado-Cumplido and Jeronimo Saiz-Ruiz and Enrique Baca-Garc\'{i}a and Philippe Courtet},
url = {http://www.tsc.uc3m.es/~antonio/papers/P39_2011_Distinguishing the Relevant Features of Frequent Suicide Attempters.pdf
http://www.ncbi.nlm.nih.gov/pubmed/21055768},
issn = {1879-1379},
year = {2011},
date = {2011-01-01},
journal = {Journal of psychiatric research},
volume = {45},
number = {5},
pages = {619--625},
abstract = {BACKGROUND: In spite of the high prevalence of suicide behaviours and the magnitude of the resultant burden, little is known about why individuals reattempt. We aim to investigate the relationships between clinical risk factors and the repetition of suicidal attempts. METHODS: 1349 suicide attempters were consecutively recruited in the Emergency Room (ER) of two academic hospitals in France and Spain. Patients were extensively assessed and demographic and clinical data obtained. Data mining was used to determine the minimal number of variables that blinded the rest in relation to the number of suicide attempts. Using this set, a probabilistic graph ranking relationships with the target variable was constructed. RESULTS: The most common diagnoses among suicide attempters were affective disorders, followed by anxiety disorders. Risk of frequent suicide attempt was highest among middle-aged subjects, and diminished progressively with advancing age of onset at first attempt. Anxiety disorders significantly increased the risk of presenting frequent suicide attempts. Pathway analysis also indicated that frequent suicide attempts were linked to greater odds for alcohol and substance abuse disorders and more intensive treatment. CONCLUSIONS: Novel statistical methods found several clinical features that were associated with a history of frequent suicide attempts. The identified pathways may promote new hypothesis-driven studies of suicide attempts and preventive strategies.},
keywords = {Adult, Attempted, Attempted: psychology, Attempted: statistics \& numerical data, Female, France, Humans, Interview, Male, Middle Aged, Prevalence, Probability, Psychiatric Status Rating Scales, Psychological, Risk Factors, ROC Curve, Spain, Suicide},
pubstate = {published},
tppubtype = {article}
}
Tuia, D; Verrelst, J; Alonso, L; Perez-Cruz, Fernando; Camps-Valls, Gustavo
Multioutput Support Vector Regression for Remote Sensing Biophysical Parameter Estimation Artículo de revista
En: IEEE Geoscience and Remote Sensing Letters, vol. 8, no 4, pp. 804–808, 2011, ISSN: 1545-598X.
Resumen | Enlaces | BibTeX | Etiquetas: Biological system modeling, Biomedical imaging, Biophysical parameter estimation, chlorophyll content estimation, Estimation, fractional vegetation cover, geophysical image processing, hyperspectral compact high-resolution imaging spec, image resolution, leaf area index, model inversion, multioutput support vector regression method, nonparametric biophysical parameter estimation, Parameter estimation, regression, regression analysis, Remote sensing, remote sensing biophysical parameter estimation, remote sensing image, single-output support vector regression method, spectrometers, Support vector machines, support vector regression (SVR), Vegetation mapping
@article{Tuia2011,
title = {Multioutput Support Vector Regression for Remote Sensing Biophysical Parameter Estimation},
author = {D Tuia and J Verrelst and L Alonso and Fernando Perez-Cruz and Gustavo Camps-Valls},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5735189},
issn = {1545-598X},
year = {2011},
date = {2011-01-01},
journal = {IEEE Geoscience and Remote Sensing Letters},
volume = {8},
number = {4},
pages = {804--808},
abstract = {This letter proposes a multioutput support vector regression (M-SVR) method for the simultaneous estimation of different biophysical parameters from remote sensing images. General retrieval problems require multioutput (and potentially nonlinear) regression methods. M-SVR extends the single-output SVR to multiple outputs maintaining the advantages of a sparse and compact solution by using an $epsilon$-insensitive cost function. The proposed M-SVR is evaluated in the estimation of chlorophyll content, leaf area index and fractional vegetation cover from a hyperspectral compact high-resolution imaging spectrometer images. The achieved improvement with respect to the single-output regression approach suggests that M-SVR can be considered a convenient alternative for nonparametric biophysical parameter estimation and model inversion.},
keywords = {Biological system modeling, Biomedical imaging, Biophysical parameter estimation, chlorophyll content estimation, Estimation, fractional vegetation cover, geophysical image processing, hyperspectral compact high-resolution imaging spec, image resolution, leaf area index, model inversion, multioutput support vector regression method, nonparametric biophysical parameter estimation, Parameter estimation, regression, regression analysis, Remote sensing, remote sensing biophysical parameter estimation, remote sensing image, single-output support vector regression method, spectrometers, Support vector machines, support vector regression (SVR), Vegetation mapping},
pubstate = {published},
tppubtype = {article}
}
Santiago-Mozos, Ricardo; Perez-Cruz, Fernando; Artés-Rodríguez, Antonio
Extended Input Space Support Vector Machine Artículo de revista
En: IEEE transactions on neural networks / a publication of the IEEE Neural Networks Council, vol. 22, no 1, pp. 158–163, 2011, ISSN: 1941-0093.
Resumen | Enlaces | BibTeX | Etiquetas: Algorithms, Artificial Intelligence, Automated, Automated: standards, Computer Simulation, Computer Simulation: standards, Neural Networks (Computer), Pattern recognition, Problem Solving, Software Design, Software Validation
@article{Santiago-Mozos2011,
title = {Extended Input Space Support Vector Machine},
author = {Ricardo Santiago-Mozos and Fernando Perez-Cruz and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://www.tsc.uc3m.es/~antonio/papers/P38_2011_Extended Input Space Support Vector Machine.pdf
http://www.ncbi.nlm.nih.gov/pubmed/21095866},
issn = {1941-0093},
year = {2011},
date = {2011-01-01},
journal = {IEEE transactions on neural networks / a publication of the IEEE Neural Networks Council},
volume = {22},
number = {1},
pages = {158--163},
abstract = {In some applications, the probability of error of a given classifier is too high for its practical application, but we are allowed to gather more independent test samples from the same class to reduce the probability of error of the final decision. From the point of view of hypothesis testing, the solution is given by the Neyman-Pearson lemma. However, there is no equivalent result to the Neyman-Pearson lemma when the likelihoods are unknown, and we are given a training dataset. In this brief, we explore two alternatives. First, we combine the soft (probabilistic) outputs of a given classifier to produce a consensus labeling for K test samples. In the second approach, we build a new classifier that directly computes the label for K test samples. For this second approach, we need to define an extended input space training set and incorporate the known symmetries in the classifier. This latter approach gives more accurate results, as it only requires an accurate classification boundary, while the former needs an accurate posterior probability estimate for the whole input space. We illustrate our results with well-known databases.},
keywords = {Algorithms, Artificial Intelligence, Automated, Automated: standards, Computer Simulation, Computer Simulation: standards, Neural Networks (Computer), Pattern recognition, Problem Solving, Software Design, Software Validation},
pubstate = {published},
tppubtype = {article}
}
Plata-Chaves, Jorge; Lazaro, Marcelino
Closed-Form Error Exponent for the Neyman–Pearson Fusion of Dependent Local Decisions in a One-Dimensional Sensor Network Artículo de revista
En: IEEE Transactions on Signal Processing, vol. 59, no 3, pp. 1239–1254, 2011, ISSN: 1053-587X.
Resumen | Enlaces | BibTeX | Etiquetas:
@article{Plata-Chaves2011b,
title = {Closed-Form Error Exponent for the Neyman\textendashPearson Fusion of Dependent Local Decisions in a One-Dimensional Sensor Network},
author = {Jorge Plata-Chaves and Marcelino Lazaro},
url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5654602},
issn = {1053-587X},
year = {2011},
date = {2011-01-01},
journal = {IEEE Transactions on Signal Processing},
volume = {59},
number = {3},
pages = {1239--1254},
abstract = {We consider a distributed detection system formed by a large number of local detectors and a data fusion center that performs a Neyman-Pearson fusion of the binary quantizations of the sensor observations. In the analyzed two-stage detection system the local decisions are taken with no kind of cooperation among the devices and they are transmitted to the fusion center over an error free parallel access channel. In addition, the sensors are randomly deployed along a straight line, and the corresponding sensor spacings are drawn independently from a common probability density function (pdf). For both hypothesis, H0 and H1, depending on the correlation structure of the observed phenomenon the local decisions might be dependent. In the case of being dependent, their correlation structure is modelled with a one-dimensional Markov random field with nearest neighbor dependency and binary state space. Under this scenario, we first derive a closed-form error exponent for the Neyman-Pearson fusion of the local decisions when the involved data fusion center only knows the distribution of the sensor spacings. Second, based on a single parameter that captures the mean correlation strength among the local decisions, some analytical properties of the error exponent are investigated. Finally, we develop a physical model for the conditional probabilities of the Markov random fields that might be present under each hypothesis. Using this model we characterize the error exponent for two well-known models of the sensor spacing: i) equispaced sensors with failures, and ii) exponentially spaced sensors with failures.},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
Barbosa, J L; Luengo, David
Distributed Target Detection in Centralized Wireless Sensor Networks with Communication Constraints Proceedings Article
En: 19th European Signal Processing Conference (EUSIPCO), Barcelona, 2011.
BibTeX | Etiquetas:
@inproceedings{Barbosa2011,
title = {Distributed Target Detection in Centralized Wireless Sensor Networks with Communication Constraints},
author = {J L Barbosa and David Luengo},
year = {2011},
date = {2011-01-01},
booktitle = {19th European Signal Processing Conference (EUSIPCO)},
address = {Barcelona},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Crisan, Dan; Miguez, Joaquin
Particle Aproximation of the Filtering Density and Its Derivates in General State. Space Models Proceedings Article
En: Bayesian Inference and Stochastic Processes (BISP 7), Getafe, 2011.
BibTeX | Etiquetas:
@inproceedings{Crisan2011,
title = {Particle Aproximation of the Filtering Density and Its Derivates in General State. Space Models},
author = {Dan Crisan and Joaquin Miguez},
year = {2011},
date = {2011-01-01},
booktitle = {Bayesian Inference and Stochastic Processes (BISP 7)},
address = {Getafe},
keywords = {},
pubstate = {published},
tppubtype = {inproceedings}
}
Plata-Chaves, Jorge; Lazaro, Marcelino; Artés-Rodríguez, Antonio
Optimal Neyman-Pearson Fusion in Two-Dimensional Densor Networks with Serial Architecture and Dependent Observations Proceedings Article
En: Information Fusion (FUSION), 2011 Proceedings of the 14th International Conference on, pp. 1–6, Chicago, 2011, ISBN: 978-1-4577-0267-9.
Resumen | Enlaces | BibTeX | Etiquetas: Bayesian methods, binary distributed detection problem, decision theory, dependent observations, Joints, local decision rule, Measurement uncertainty, Network topology, Neyman-Pearson criterion, optimal Neyman-Pearson fusion, optimum distributed detection, Parallel architectures, Performance evaluation, Probability density function, sensor dependent observations, sensor fusion, serial architecture, serial network topology, two-dimensional sensor networks, Wireless Sensor Networks
@inproceedings{Plata-Chaves2011bb,
title = {Optimal Neyman-Pearson Fusion in Two-Dimensional Densor Networks with Serial Architecture and Dependent Observations},
author = {Jorge Plata-Chaves and Marcelino Lazaro and Antonio Art\'{e}s-Rodr\'{i}guez},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5977545\&searchWithin%3Dartes+rodriguez%26sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A5977431%29},
isbn = {978-1-4577-0267-9},
year = {2011},
date = {2011-01-01},
booktitle = {Information Fusion (FUSION), 2011 Proceedings of the 14th International Conference on},
pages = {1--6},
address = {Chicago},
abstract = {In this correspondence, we consider a sensor network with serial architecture. When solving a binary distributed detection problem where the sensor observations are dependent under each one of the two possible hypothesis, each fusion stage of the network applies a local decision rule. We assume that, based on the information available at each fusion stage, the decision rules provide a binary message regarding the presence or absence of an event of interest. Under this scenario and under a Neyman-Pearson formulation, we derive the optimal decision rules associated with each fusion stage. As it happens when the sensor observations are independent, we are able to show that, under the Neyman-Pearson criterion, the optimal fusion rules of a serial configuration with dependent observations also match optimal Neyman-Pearson tests.},
keywords = {Bayesian methods, binary distributed detection problem, decision theory, dependent observations, Joints, local decision rule, Measurement uncertainty, Network topology, Neyman-Pearson criterion, optimal Neyman-Pearson fusion, optimum distributed detection, Parallel architectures, Performance evaluation, Probability density function, sensor dependent observations, sensor fusion, serial architecture, serial network topology, two-dimensional sensor networks, Wireless Sensor Networks},
pubstate = {published},
tppubtype = {inproceedings}
}