2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)最新文献

筛选
英文 中文
Temporal filtering and oriented PCA neural networks for blind source separation 时域滤波与定向PCA神经网络的盲源分离
K. Diamantaras, Theophilos Papadimitriou
{"title":"Temporal filtering and oriented PCA neural networks for blind source separation","authors":"K. Diamantaras, Theophilos Papadimitriou","doi":"10.1109/NNSP.2003.1318036","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318036","url":null,"abstract":"PCA-related (principal component analysis) neural models have been shown to solve the instantaneous BSS (blind source separation) problem for temporally colored sources. In this paper we show that arbitrary temporal filtering combined with models associated to the extension of standard PCA known as oriented PCA (OPCA) provide a solution to the problem that is based on second order statistics and requires no prewhitening of the observation signals. Furthermore, the issue of the optimal temporal filter is addressed for filters of length 2 and 3 although the design of the universally optimal filter is still an open question. Earlier neural OPCA networks are used to demonstrate the validity of the method on artificially generated datasets.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121722429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Flexible multichannel blind deconvolution, an investigation 柔性多通道盲反褶积的研究
A. Tsoi, Liangsuo Ma
{"title":"Flexible multichannel blind deconvolution, an investigation","authors":"A. Tsoi, Liangsuo Ma","doi":"10.1109/NNSP.2003.1318034","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318034","url":null,"abstract":"In this paper, we consider the issue of devising a flexible nonlinear function for multichannel blind deconvolution. In particular, we consider the underlying assumption of the source probability density functions. We consider two cases, when the source probability density functions are assumed to be uni-modal, and multimodal respectively. In the unimodal case, there are two approaches: Pearson function and generalized exponential function. In the multimodal case, there are three approaches: mixture of Gaussian functions, mixture of Pearson functions, and mixture of generalized exponential functions. It is demonstrated through an illustrating example that the assumption on the source probability density functions gives rise to different performances of source separation algorithms for the multichannel blind deconvolution problem. Further it is observed that these performance differences are not large, indicating that the current formulation of multichannel blind deconvolution problems is robust with respect to the underlying assumption of source probability density functions. It is further speculated that one of the discriminating features among various source separation algorithms appears to be the relative computational efficiencies of various approximation schemes. In other words, the discriminating feature of various source separation algorithms based on assumptions on the source probability density function appears to be an implementation issue rather than one of a theoretical concern.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132867315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Blending of missile control modes with neural networks 导弹控制模式与神经网络的融合
J. Farges, P. Fabiani, S. L. Ménec
{"title":"Blending of missile control modes with neural networks","authors":"J. Farges, P. Fabiani, S. L. Ménec","doi":"10.1109/NNSP.2003.1318012","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318012","url":null,"abstract":"A solution using neural networks for the problem of the choice of the control mode of a missile is proposed and implemented. The test on 7000 interceptions shows that this approach makes it possible to reduce the number of failures (miss distance larger than 5 meters) compared to the use of expert rules.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128643840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fast and efficient sequential learning algorithms using direct-link RBF networks 基于直连RBF网络的快速高效的顺序学习算法
V. Asirvadam, S. McLoone, G. Irwin
{"title":"Fast and efficient sequential learning algorithms using direct-link RBF networks","authors":"V. Asirvadam, S. McLoone, G. Irwin","doi":"10.1109/NNSP.2003.1318020","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318020","url":null,"abstract":"Novel fast and efficient sequential learning algorithms are proposed for direct-link radial basis function (DRBF) networks. The dynamic DRBF network is trained using the recently proposed decomposed/parallel recursive Levenberg Marquardt (PRLM) algorithm by neglecting the interneuron weight interactions. The resulting sequential learning approach enables weights to be updated in an efficient parallel manner and facilitates a minimal update extension for real-time applications. Simulation results for two benchmark problems show the feasibility of the new training algorithms.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123661463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Improving independent component analysis performances by variable selection 通过变量选择提高独立成分分析性能
F. Vrins, J. Lee, M. Verleysen, V. Vigneron, C. Jutten
{"title":"Improving independent component analysis performances by variable selection","authors":"F. Vrins, J. Lee, M. Verleysen, V. Vigneron, C. Jutten","doi":"10.1109/NNSP.2003.1318035","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318035","url":null,"abstract":"Blind source separation (BSS) consists in recovering unobserved signals from observed mixtures of them. In most cases the whole set of mixtures is used for the separation, possibly after a dimension reduction by PCA. This paper aims to show that in many applications the quality of the separation can be improved by first selecting a subset of some mixtures among the available ones, possibly by an information content criterion, and performing PCA and BSS afterwards. The benefit of this procedure is shown on simulated electrocardiographic data by extracting the fetal electrocardiogram signal from mixtures recorded on the abdomen of a pregnant woman.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125120946","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Underdetermined blind separation of sparse sources with instantaneous and convolutive mixtures 瞬态和卷积混合稀疏源的欠定盲分离
D. Luengo, I. Santamaría, L. Vielva, C. Pantaleón
{"title":"Underdetermined blind separation of sparse sources with instantaneous and convolutive mixtures","authors":"D. Luengo, I. Santamaría, L. Vielva, C. Pantaleón","doi":"10.1109/NNSP.2003.1318027","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318027","url":null,"abstract":"We consider the underdetermined blind source separation problem with linear instantaneous and convolutive mixtures when the input signals are sparse, or have been rendered sparse. In the underdetermined case the problem requires solving three sub-problems: detecting the number of sources, estimating the mixing matrix, and finding an adequate inversion strategy to obtain the sources. This paper solves the first two problems. We assume that the number of sources is unknown, and estimate it by means of an information theoretic criterion (MDL). Then the mixing matrix is expressed in spheric coordinates and we estimate sequentially the angles and amplitudes of each column, and their order. The performance of the method is illustrated through simulations.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123953690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Recognition of musical instruments by generalized min-max classifiers 基于广义最小-最大分类器的乐器识别
G. Costantini, A. Rizzi, D. Casali
{"title":"Recognition of musical instruments by generalized min-max classifiers","authors":"G. Costantini, A. Rizzi, D. Casali","doi":"10.1109/NNSP.2003.1318055","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318055","url":null,"abstract":"The correct classification of single musical sources is a relevant aspect for the source separation task and the automatic transcription of polyphonic music. In this paper, we deal with a classification problem concerning the recognition of six different musical instruments: violin, clarinet, flute, oboe, saxophone and piano. A satisfactory solution of such a recognition problem depends mainly on both the preprocessing procedure (set of features extracted from row data) and the adopted classification system. As concerns feature extraction, a suitable signal preprocessing based on FFT, QFT (Q-constant frequency transform) and cepstrum coefficients are employed. We adopt min-max neurofuzzy networks as the classification model, both in their classical and generalized version. The synthesis of these classifiers is performed by the adaptive resolution training technique (ARC, PARC and GPARC algorithms), since it assures good performances and an excellent automation degree.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126386103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Icasso: software for investigating the reliability of ICA estimates by clustering and visualization Icasso:通过聚类和可视化来调查ICA估计可靠性的软件
J. Himberg, Aapo Hyvärinen
{"title":"Icasso: software for investigating the reliability of ICA estimates by clustering and visualization","authors":"J. Himberg, Aapo Hyvärinen","doi":"10.1109/NNSP.2003.1318025","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318025","url":null,"abstract":"A major problem in application of independent component analysis (ICA) is that the reliability of the estimated independent components is not known. Firstly, the finite sample size induces statistical errors in the estimation. Secondly, as real data never exactly follows the ICA model, the contrast function used in the estimation may have many local minima which are all equally good, or the practical algorithm may not always perform properly, for example getting stuck in local minima with strongly suboptimal values of the contrast function. We present an explorative visualization method for investigating the relations between estimates from FastICA. The algorithmic and statistical reliability is investigated by running the algorithm many times with different initial values or with differently bootstrapped data sets, respectively. Resulting estimates are compared by visualizing their clustering according to a suitable similarity measure. Reliable estimates correspond to tight clusters, and unreliable ones to points which do not belong to any such cluster. We have developed a software package called Icasso to implement these operations. We also present results of this method when applying Icasso on biomedical data.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124257052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 255
FPGA implementation of bidirectional associative memory using simultaneous perturbation 同时摄动双向联想存储器的FPGA实现
Y. Maeda, M. Wakamura
{"title":"FPGA implementation of bidirectional associative memory using simultaneous perturbation","authors":"Y. Maeda, M. Wakamura","doi":"10.1109/NNSP.2003.1318029","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318029","url":null,"abstract":"Recurrent neural networks have interesting properties and can handle dynamic information processing unlike the ordinary feedforward neural networks. Bidirectional associative memory (BAM) is a typical recurrent network. Ordinarily, weights of the BAM are determined by the Hebb's learning. In this paper, a recursive learning scheme for BAM is proposed and its hardware implementation is described. The learning scheme is applicable to analogue BAM as well. A simulation result and details of the implementation are shown.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129033668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blind signal separation by matching pursuit based grouping 基于分组匹配跟踪的盲信号分离
Y. Huang, R. Dony
{"title":"Blind signal separation by matching pursuit based grouping","authors":"Y. Huang, R. Dony","doi":"10.1109/NNSP.2003.1318038","DOIUrl":"https://doi.org/10.1109/NNSP.2003.1318038","url":null,"abstract":"This paper describes a novel matching pursuit based grouping approach for separating a speech signal from a mixture with non-Gaussian interference. At first, the mixture signal is decomposed into atoms by matching pursuit with a Gabor dictionary. Then a psychoacoustic based grouping algorithm is developed to cluster the atoms into groups to identify the atoms of a speech signal. These atoms are then used to reconstruct the desired speech signal. Simulations were performed on speech corrupted by factory noise and music. Preliminary results show that the proposed approach can remove almost all non-speech signal while the recovered speech signal possesses acceptable intelligibility.","PeriodicalId":315958,"journal":{"name":"2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127797682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信