发布求助
文献互助 智能选刊 最新文献

2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.最新文献

筛选
英文 中文
A space-time FIR equalizer training algorithm for MIMO-OFDM systems MIMO-OFDM系统的空时FIR均衡器训练算法
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458520
Taiwen Tang, R. Heath
{"title":"A space-time FIR equalizer training algorithm for MIMO-OFDM systems","authors":"Taiwen Tang, R. Heath","doi":"10.1109/SPCOM.2004.1458520","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458520","url":null,"abstract":"In this paper, we propose several new direct training-based methods for FIR space-time equalizer design in multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems employing spatial multiplexing. We propose a two-stage receiver structure consisting of an initial space-time equalization for suppressing the co-channel interference (CCI), shortening the channel, and mitigating asynchronicity followed by parallel equalization and detection in the frequency domain. The coefficients of the equalizers and the shortened post-equalization channel response are jointly derived from the training data of the desired users under various constraints. Simulations show that training based methods have good error rate performance and are robust to MIMO co-channel interference.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"692 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132682703","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
Registration and mosaicing for images obtained from UAV 无人机图像的配准与拼接
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458385
J. Majumdar, S. Vinay, S. Selvi
{"title":"Registration and mosaicing for images obtained from UAV","authors":"J. Majumdar, S. Vinay, S. Selvi","doi":"10.1109/SPCOM.2004.1458385","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458385","url":null,"abstract":"Image registration is a fundamental topic in image processing and has a wide variety of applications in computer vision. It is the process of matching two or more images taken at different times from different sensors or from different viewpoints, so that the matched coordinate points in the two images correspond to the same physical region of the scene being imaged. Typically Image registration is required in remote sensing (multi spectral classification, image fusion, environmental monitoring, change detection, Image Mosaicing, Weather forecasting) in medicine, in cartography and in computer vision (target localization, automatic quality control). In this paper, a feature based image registration technique is introduced for mosaicing the sequence of UAV images. First, features are extracted using corner detectors and transformation parameters are computed using a discrete randomized approach. Then blending of images is carried out in a tree-based approach. Finally, results of merging for some sequence of UAV images are shown.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128669286","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
Epileptic detection using artificial neural networks 用人工神经网络检测癫痫
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458414
V. Srinivasan, C. Eswaran, N. Sriraam
{"title":"Epileptic detection using artificial neural networks","authors":"V. Srinivasan, C. Eswaran, N. Sriraam","doi":"10.1109/SPCOM.2004.1458414","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458414","url":null,"abstract":"For the diagnosis of epilepsy, electroencephalogram (EEG) signal plays an important role. EEG recordings of an epileptic patient obtained from 'ambulatory recording systems' contain a large volume of EEG data. A time consuming analysis of the entire length of EEG data by an expert is required to detect the epileptic activity. This paper discusses an automated diagnostic method using artificial neural networks for the detection of epilepsy. Experimental results obtained with four different types of neural networks, namely, multi-layer perceptron, Elman network, probabilistic neural network and learning vector quantization is presented. It is found that the Elman network performs better than the other three neural networks. It is also shown that the performance of the Elman network with a single attribute as the input is almost identical to that of the recently reported LAMSTAR network, which uses two attributes as inputs.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128075640","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
Functional MRI activation signal detection using the periodicity transform 基于周期性变换的功能性MRI激活信号检测
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458369
A. V. Deshmukh, V. Shivhare, R. S. Parihar, Vikram M. Gadre, D. P. Patkar, S. Shah, S. Pungavkar
{"title":"Functional MRI activation signal detection using the periodicity transform","authors":"A. V. Deshmukh, V. Shivhare, R. S. Parihar, Vikram M. Gadre, D. P. Patkar, S. Shah, S. Pungavkar","doi":"10.1109/SPCOM.2004.1458369","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458369","url":null,"abstract":"A key challenge in functional magnetic resonance imaging (fMRI) is the detection of activation areas in the brain. We introduce a new method of fMRI signal detection, using an approach termed the periodicity transform. the technique is based on temporal data analysis. A search for periodicity is carried out in the fMRI time series data. The method is applicable to block design experiments. In the block paradigm, the stimulus period is known and it is possible to use this information for searching periodicities in the time series data. We present the results for the periodicity detection in the time series of the simulated phantom as well as clinical fMRI data from the finger tapping experiment. No assumptions have been made about the amplitude and frequency of the activation signal. The algorithm extracts arbitrary harmonics at the periodicity defined by the stimulus function.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133069039","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 temporal error concealment algorithm based on structural alignment for packet video 基于结构对齐的分组视频时序错误隐藏算法
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458428
A. Bopardikar, O. I. Hillestad, A. Perkis
{"title":"A temporal error concealment algorithm based on structural alignment for packet video","authors":"A. Bopardikar, O. I. Hillestad, A. Perkis","doi":"10.1109/SPCOM.2004.1458428","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458428","url":null,"abstract":"With rapid growth of packet switched communication using the IP protocol, concealment of packet-loss related distortions in multimedia communications assumes great importance. This paper proposes a novel temporal concealment algorithm to conceal packet-loss related distortion in video transmission. The algorithm uses the previous frame (assumed to be error-free) to conceal the distortion in the present frame. It is based on the insight that the spatial region around the area in the previous frame that yields the best concealment will in general be highly correlated with the corresponding area around the region to be concealed in the present frame. We implement the proposed algorithm for a MPEG-2 based packet-loss scenario and compare its performance with prevalent algorithms based on boundary matching. The proposed algorithm effects better concealment as compared to these algorithms. In particular, it exhibits a superior ability to align edges. With its low computation complexity, this algorithm can find application in real-time concealment of packet-loss related artifacts in streaming video.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133195703","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
Enhanced intrusion detection algorithm for NTP based routing protocol for wireless ad hoc networks 无线自组织网络中基于NTP路由协议的改进入侵检测算法
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1080/03772063.2005.11416415
S. Radha, S. Rajkumar, A. Sathish Vimalraj, N. Rama Subramanium
{"title":"Enhanced intrusion detection algorithm for NTP based routing protocol for wireless ad hoc networks","authors":"S. Radha, S. Rajkumar, A. Sathish Vimalraj, N. Rama Subramanium","doi":"10.1080/03772063.2005.11416415","DOIUrl":"https://doi.org/10.1080/03772063.2005.11416415","url":null,"abstract":"In this paper, we propose a unanimous & distributed-intrusion detection model for mobile ad hoc networks. The MANETS are particularly vulnerable to intrusion, as they operate in the open medium and use co-operative strategies for network communications. This paper is mainly to identify the misbehaviors caused by some malicious node for reactive routing protocol; mainly node transition probability (NTP) based routing, and eliminates them from the network. The co-operative Intrusion Detection Model and the Intrusion Response Model along with independent intrusion detection model are implemented, to accomplish the above-mentioned assignment. In contrast to the previously proposed intrusion detection models for ad hoc networks, we implement an efficient and bandwidth-conscious framework that takes into distributed nature of ad hoc wireless network management and decision policies.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133539753","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
Complementary code keying in optical access network in presence of inband crosstalk 带内串扰存在下光接入网的互补码键控
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458356
K. Kumar, B. Ray, S. Sen, S. Charkrabarti
{"title":"Complementary code keying in optical access network in presence of inband crosstalk","authors":"K. Kumar, B. Ray, S. Sen, S. Charkrabarti","doi":"10.1109/SPCOM.2004.1458356","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458356","url":null,"abstract":"In this paper we propose the use of complementary code keying (CCK) modulation scheme in optical access network (OAN). CCK codewords possess very good orthogonal properties and they provide performance enhancement in presence of inband crosstalk, which is an important source of impairment in an OAN environment. We have used the worst-case scenario for evaluating the performance of CCK based scheme. We have compared CCK scheme against the uncoded case and a conventional scheme of forward error correction (FEC) using Reed Solomon (255,239) coding and have observed the performance advantage of CCK in combating inband crosstalk.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116797946","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
Cooperative multi-hop relaying over fading channels 衰落信道上的合作多跳中继
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458395
M.S. Pavan Kumar, R. Bhattacharjee, P. Herhold, G. Fettweis
{"title":"Cooperative multi-hop relaying over fading channels","authors":"M.S. Pavan Kumar, R. Bhattacharjee, P. Herhold, G. Fettweis","doi":"10.1109/SPCOM.2004.1458395","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458395","url":null,"abstract":"Cooperative diversity in wireless multi-hop networks is emerging as an attractive new way to increase throughput for certain scenarios, reduce energy requirements and provide resistance to channel fading effects. In this paper the performance of multi-hop networks employing cooperative relaying in a generalized Rician fading channel has been investigated and the optimum number of hops necessary for enhanced performance has been determined. Two new relaying schemes, namely, cooperative amplify-and-forward with combining solely at the destination (Coop/spl I.bar/AF/spl I.bar/DC) and adaptive decode-and-forward with combining at all intermediate nodes (Coop/spl I.bar/AdDF/spl I.bar/EC) have been proposed in this paper and performance of these schemes have been compared with that of direct transmission and conventional relaying.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125717575","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
Progressive image transmission using symmetric residue pyramids 采用对称残数金字塔的渐进图像传输
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458374
I. Rishabh, K.M. Nema, S. Rakshit
{"title":"Progressive image transmission using symmetric residue pyramids","authors":"I. Rishabh, K.M. Nema, S. Rakshit","doi":"10.1109/SPCOM.2004.1458374","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458374","url":null,"abstract":"Progressive image transmission (PIT) using Burt-Laplacian pyramids is an efficient way to transmit images on unreliable communication networks. Advantage of using pyramids is that this method is able to display a coarser view of the entire image without aliasing artifacts, even when transmission is unexpectedly truncated. Burt-Laplacian pyramid encoding gives acceptable results so long as the rate is above 1 bpp. The performance, however, deteriorates for very low rates where it ends up giving high distortion. We present the usage of pyramids for progressive transmission of images that gives significant improvement in the perceptual quality of the progressively transmitted images when the rate is well below 1 bpp.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124765259","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
Shared mixture GMM classifier 共享混合型GMM分级机
2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04. Pub Date : 2004-12-11 DOI: 10.1109/SPCOM.2004.1458505
A. Krishna, T. Sreenivas
{"title":"Shared mixture GMM classifier","authors":"A. Krishna, T. Sreenivas","doi":"10.1109/SPCOM.2004.1458505","DOIUrl":"https://doi.org/10.1109/SPCOM.2004.1458505","url":null,"abstract":"In this paper, we propose the shared mixture GMM classifier. Mixtures of a GMM which represent areas in the feature space must have very less overlap across classes for best performance. If not, patterns of a class belonging to regions of overlap score high likelihoods with not only the mixture of its own class, but also that mixture of another class thereby making a high contribution to the likelihood score with respect to the other class model. We propose a computational method of determining if such mixtures exist and using an automatic method of determining such mixtures based on discriminability between classes, we propose choosing the mixtures for each GMM from the set of all mixtures of all GMMs. Mixtures that have significant overlap with other classes get shared between the contending classes. Weights are based on cluster-class membership matrix defined in the paper. We have compared the performance of this shared mixture GMM with a conventional GMM, for a 14 class music instrument recognition task. The new model performs competitively compared to the conventional GMM, and outperforms it when there is lesser training data.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129080020","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学术文献互助群
群 号：604180095
Book学术官方微信