International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003最新文献

筛选
英文 中文
Solving convex quadratic programming problems by an modified neural network with exponential convergence 用指数收敛的改进神经网络求解凸二次规划问题
Youshen Xia, G. Feng
{"title":"Solving convex quadratic programming problems by an modified neural network with exponential convergence","authors":"Youshen Xia, G. Feng","doi":"10.1109/ICNNSP.2003.1279271","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1279271","url":null,"abstract":"This paper presents using a modified neural network with exponential convergence to solve strictly quadratic programming problems with general linear constraints. It is shown that the proposed neural network is globally convergent to a unique optimal solution within a finite time. Compared with the existing the primal-dual neural network and the dual neural network for solving such problems, the proposed neural network has a low complexity for implementation and can be guaranteed to have a exponential convergence rate.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130688868","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
Passive tracking based on data association with information fusion of multi-feature and multi-target 基于多特征、多目标信息融合的数据关联被动跟踪
Wang Jie-gui, Luo Jing-qing, Lv Jiu-ming
{"title":"Passive tracking based on data association with information fusion of multi-feature and multi-target","authors":"Wang Jie-gui, Luo Jing-qing, Lv Jiu-ming","doi":"10.1109/ICNNSP.2003.1279367","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1279367","url":null,"abstract":"A new data association algorithm based on information fusion of multi-feature and multi-target in passive tracking is proposed in this paper. It uses more features of the target such as the frequency, PRI, while the traditional algorithms only use the features directly correlative with the target state such as DOA, TOA. Based on the information fusion of multiple features with DS evidence theory, the decision of synthetic data association of all the targets is made. With the help of computer simulations, it is proven that the proposed algorithm is superior to the NN method and the expanded NN method.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133451196","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}
引用次数: 9
Model selection for support vector machines using an asynchronous parallel evolution strategy 基于异步并行进化策略的支持向量机模型选择
T. Runarsson, S. Sigurdsson
{"title":"Model selection for support vector machines using an asynchronous parallel evolution strategy","authors":"T. Runarsson, S. Sigurdsson","doi":"10.1109/ICNNSP.2003.1279319","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1279319","url":null,"abstract":"The application of a parallel evolutionary algorithm (ES) to model selection for support vector machines is examined. The problem of model selection is a computationally intense non-convex optimization problem. For this reason a parallel search strategy is desirable. A new non-blocking asynchronous ES is developed for this task. The algorithm is tested on five standard test sets optimizing a number of heuristic bounds on the expected generalization error.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115408493","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
A novel joint estimator of direction-of-arrival and time-delay for multiple source localization 一种新的多源定位的到达方向和时延联合估计方法
Hongfeng Qin, Jianguo Huang, Qunfei Zhang
{"title":"A novel joint estimator of direction-of-arrival and time-delay for multiple source localization","authors":"Hongfeng Qin, Jianguo Huang, Qunfei Zhang","doi":"10.1109/ICNNSP.2003.1281108","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1281108","url":null,"abstract":"Source localization is one of the important topics in signal processing, in which a key problem is to jointly estimate direction-of-arrival (DOA) and time-delay for multiple sources. In this paper, a novel and efficient algorithm of joint DOA and time-delay estimation (named as ESPRIT-TDF algorithm) is proposed. Based on constructing two special types of covariance matrixes for two identical subarrays, both DOA and time-delay can be estimated simultaneously via rotational invariance technique and high-resolution time-delay frequency (TDF) technique. This algorithm is not only easy to be implemented with low computation but also suitable for multiple source localization where the non-minimum phase signal is frequently employed. Computer simulations and experiments in water tank are conducted to show the improved performance in precision and resolution by using the ESPRIT-TDF algorithm.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115691107","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}
引用次数: 5
Impulse force based ART network with GA optimization 基于冲力的ART网络遗传算法优化
Hui Liu, Yue Liu, Jian Liu, Bofeng Zhang, Gengfeng Wu
{"title":"Impulse force based ART network with GA optimization","authors":"Hui Liu, Yue Liu, Jian Liu, Bofeng Zhang, Gengfeng Wu","doi":"10.1109/ICNNSP.2003.1279320","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1279320","url":null,"abstract":"The different effects of input attributes on category results in supervised ART (adaptive resonance theory) network is quite important during the predictive stage in the application that was ignored by the traditional researches. In fact, some of the attributes have larger effect than the others on category results, but, even for the experts in that field, it is difficult to evaluate the effect. In this paper we present a novel supervised ART network namely impulse force based ART (IFART) network. It enhances the prediction accuracy of the supervised ART network by using genetic algorithm optimized impulsive forces on attributes. Then some experiments on benchmark data sets are given to show its good performance.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115693110","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}
引用次数: 11
Fourth-order cyclic cumulant TLS-ESPRIT algorithm to estimate direction of cyclostationary coherent sources 四阶循环累积量TLS-ESPRIT算法估计周期平稳相干源方向
Hong Jiang, Shuxun Wang
{"title":"Fourth-order cyclic cumulant TLS-ESPRIT algorithm to estimate direction of cyclostationary coherent sources","authors":"Hong Jiang, Shuxun Wang","doi":"10.1109/ICNNSP.2003.1281117","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1281117","url":null,"abstract":"In this paper, considering that most signals exhibit cyclostationarity and coherent sources caused by multipath propagation are often encountered in a variety of wireless communication systems, we propose a direction-finding algorithm based on cyclic cumulants to extract the desired non-Gaussian cyclostationary coherent sources by designing a fourth-order cyclic cumulant matrix and using TLS-ESPRIT algorithm. To coherent sources, a 'de-correlating' method is exploited in our cyclic cumulant matrix model. Simulation results show that not only does the approach possess signal-selectivity capability but can effectively suppress additive stationary noise and Gaussian noise in environments where the spatial characteristics of noise are unknown, even when the noise shares the same cycle frequency as the signals of interests (SOI's). Moreover, under a lower signal to noise ratio (SNR) and a smaller sampling number, it has ability to detect and resolve more coherent and incoherent sources using fewer sensors.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124122425","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
Non-uniform light field compression: a geometry-based method for image processing 非均匀光场压缩:一种基于几何的图像处理方法
W. Wendong, Yin Baocai, Kong Ddehui
{"title":"Non-uniform light field compression: a geometry-based method for image processing","authors":"W. Wendong, Yin Baocai, Kong Ddehui","doi":"10.1109/ICNNSP.2003.1281051","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1281051","url":null,"abstract":"A geometry-based image compression method-non-uniform light field compression is proposed by combining bi-triangle-based surface light field partition and non-uniform factoring of light field matrix, through which a four orders magnitude compression ratio can be achieved. Starting from dense images captured from vantage points, the codec resample these original data and partition the resampled data over bi-triangle. Then the codec arrange these partitioned light field data into 2D matrices and approximate the matrices through factoring them into non-uniform textures. Finally the codec group these textures into tiles and further compress these textures using ordinary still image compression techniques. Novel image can be rendered in real-time through texture mapping. In this paper we illustrate the compression efficiency and rendering performance through dense images captured in real scene.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124203425","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
A wavelet constrained POCS supperresolution algorithm for high resolution image reconstruction from video sequence 基于小波约束的POCS超分辨率视频序列图像重建算法
B. Tian, J. T. Hsu, Qiang Liu, Ching-Chung Li, R. Sclabassi, Mingui Sun
{"title":"A wavelet constrained POCS supperresolution algorithm for high resolution image reconstruction from video sequence","authors":"B. Tian, J. T. Hsu, Qiang Liu, Ching-Chung Li, R. Sclabassi, Mingui Sun","doi":"10.1109/ICNNSP.2003.1281101","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1281101","url":null,"abstract":"Research interest in multi-frame supperresolution has risen substantially in recent years. Most methods developed deal with operations working directly in the image domain. This paper presents a wavelet-domain superresolution method based on the projection on to convex set (POCS) technique. An iterative procedure is utilized to extract information hidden in a group of video frames to update the wavelet coefficients. Since these coefficients correspond to the high frequency information in the spatial domain, the extracted fine features from other frames augment the individual low-resolution image to a superresolution image. The effectiveness of the algorithm is demonstrated by experimental results.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124381946","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}
引用次数: 6
Lagrange constrained neural network-based approach to hyperspectral remote sensing image classification 基于拉格朗日约束神经网络的高光谱遥感图像分类方法
Q. Du, H. Szu, J. Buss
{"title":"Lagrange constrained neural network-based approach to hyperspectral remote sensing image classification","authors":"Q. Du, H. Szu, J. Buss","doi":"10.1109/ICNNSP.2003.1279263","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1279263","url":null,"abstract":"Lagrange constrained neural network (LCNN) was an unsupervised technique that can simultaneously estimate the endmembers and their abundance fractions in a remotely sensed image without any prior information. The network outputs corresponded to the estimated abundance fraction images (AFI), which displayed the distribution of the endmember materials in an image scene. Two constraints were universally imposed to the network outputs, one was the sum-to-one constraint and the other was the non-negativity constraint. One more data-specific constraint was to minimize the Lagrange linear estimation error vector E = /spl lambda/(As - x). Together they described the thermodynamics equilibrium of the Earth open system in the incoming and outgoing radiation fields. Thus, we adopted the thermodynamic Helmholtz free energy and seek the maximum value of a contrast function for the most likelihood solution. When such an LCNN was applied to hyperspectral remotely sensed images, the number of AFIs was equal to the number of bands because of its unbiased and unsupervised structure. So the resulting AFIs might be highly correlated and visually similar. A two-stage post-processing approach could be followed to facilitate the data assessment.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124576985","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}
引用次数: 1
An information retrieval system based on automatic query expansion and Hopfield network 基于自动查询扩展和Hopfield网络的信息检索系统
Xiao Sheng, Minghu Jiang
{"title":"An information retrieval system based on automatic query expansion and Hopfield network","authors":"Xiao Sheng, Minghu Jiang","doi":"10.1109/ICNNSP.2003.1281192","DOIUrl":"https://doi.org/10.1109/ICNNSP.2003.1281192","url":null,"abstract":"Automatic query expansion technique has been extensively used in a variety of information retrieval (IR) systems as a means of solving the problems of information overload and word mismatch. Based on the technique and Hopfield network, we propose a new IR model, called LCA-ANN model. With the heuristic function of Hopfield network, the new model is more precise in query expansion compared with other current models and can therefore enhance the performance greatly.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124588305","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
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学术文献互助群
群 号:604180095
Book学术官方微信