2014 International Conference on Communication and Signal Processing最新文献

筛选
英文 中文
Denoising of SAR images using Maximum Likelihood Estimation 基于极大似然估计的SAR图像去噪
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6949964
J. J. Nair, Bindhya Bhadran
{"title":"Denoising of SAR images using Maximum Likelihood Estimation","authors":"J. J. Nair, Bindhya Bhadran","doi":"10.1109/ICCSP.2014.6949964","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949964","url":null,"abstract":"Image denoising is an important problem in image processing because noise may interfere with visual interpretation. This may create problems in certain applications like classification problem, pattern matching, etc. This paper presents a new approach for image denoising in the case of speckle noise models. The proposed method is a modification of Non Local Means filter method using Maximum Likelihood Estimation. The Non Local Means algorithm performs a weighted average of the similar pixels. Here we introduce a method that performs weighted average on restricted local neighborhoods. More over the method performs weight calculation using Geman-McClure estimation function rather than the exponential function because of the fact that Geman-McClure estimator is better in preserving edge details than the exponential function. Experiments at various noise levels based on PSNR values and SSIM values show that the proposed method outperforms the existing methods and thereby increasing the accuracy of further processing for synthetic aperture radar (SAR) images.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127759713","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}
引用次数: 7
Light-particle interaction in underwater: A modified PSF 水下光粒子相互作用:改进的PSF
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6950110
Shatadal Ghosh, R. Ray, S. R. K. Vadali, S. N. Shome
{"title":"Light-particle interaction in underwater: A modified PSF","authors":"Shatadal Ghosh, R. Ray, S. R. K. Vadali, S. N. Shome","doi":"10.1109/ICCSP.2014.6950110","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950110","url":null,"abstract":"Scattering is an important aspect to be addressed in the field of underwater image processing. The phenomenon of scattering can be better understood by considering interaction of light ray and particle in the medium .Scattering is commonly approximated as a deterministic phenomenon. In the present work, we propose a probabilistic model based on light-particle interaction and provide a modified Point Spread Function (PSF). The PSF so obtained may be used to better explain a physical phenomenon (beam-particle interaction) in the underwater point source image.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126393993","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
Efficient CodeGuard mechanism against pollution attacks in interflow Network coding 针对互流网络编码中污染攻击的高效CodeGuard机制
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6950076
J. Krithiga, R. Porselvi
{"title":"Efficient CodeGuard mechanism against pollution attacks in interflow Network coding","authors":"J. Krithiga, R. Porselvi","doi":"10.1109/ICCSP.2014.6950076","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950076","url":null,"abstract":"The study of Network coding and the impact of data pollution attacks is done in wireless network . The main focus is on pollution attacks and defenses in interflow network coding systems. While most of the prior work is on detecting and filtering polluted packets in intraflow network coding systems. But we deal with an interflow coding systems. An additional goal is to identify and eliminate the attacker nodes quickly between 500-1sec of attack. The CodeGuard , a defense mechanism that combines proactive node attestation and reactive traceback identifies and eliminates the attacker nodes unequivocally. Analysis of CodeGuard proved that it is always able to identify and isolate at least one attacker node on every occurrence of a pollution attack. Experimental demonstration shows that Code Guard is able to identify attacker nodes quickly and restore system throughput to a high level, even in the presence of many attacker nodes, thus preserving the performance of the underlying interflow network coding system.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115923101","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
A novel edge detection and pattern recognition algorithm based on beamlet theory for a vision-based wheeled mobile robot 基于波束理论的视觉轮式移动机器人边缘检测与模式识别新算法
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6950041
S. Soumya, V. Geethapriya, S. Shankar Bharathi
{"title":"A novel edge detection and pattern recognition algorithm based on beamlet theory for a vision-based wheeled mobile robot","authors":"S. Soumya, V. Geethapriya, S. Shankar Bharathi","doi":"10.1109/ICCSP.2014.6950041","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950041","url":null,"abstract":"Number of strategies have been deployed to make Wheeled Mobile Robots (WMRs) independent or with limited dependence on human assistance/intervention. In order to enhance their mobility, improvements have been made in their pattern recognition and path planning strategies. Vision-based approach is preferred over stereopsis-based, laser-range finders and GPS-based approaches on account of higher resolution and longer ranges. Vision-Based Wheeled Mobile Robot (VB-WMR) uses an active vision system where the observer is in motion. The goal of this project is to provide a novel algorithm aimed to detect and recognize direction indicators on sign boards placed on the course of the WMR. Here visual processing is devoted to noting the salient components like the edges of patterns on sign boards rather than processing the entire image. The proposed algorithm is based on the beamlet theory, which retains directional information besides the location and scale and performs well under noisy conditions. The developed algorithm in MATLAB is later to be incorporated with the VB-WMR.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131365291","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 unidirectional data-flow model for cloud data security with user involvement during data transit 一个单向数据流模型,用于在数据传输过程中用户参与的云数据安全
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6949883
Bhargav J. Bhatkalkar, Ramegowda
{"title":"A unidirectional data-flow model for cloud data security with user involvement during data transit","authors":"Bhargav J. Bhatkalkar, Ramegowda","doi":"10.1109/ICCSP.2014.6949883","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949883","url":null,"abstract":"Traditional computational models are rapidly shifting from a centralized computing to a distributed computing paradigm. As a result of this shift, the buzz of cloud computing is heard everywhere these days. The main concern in cloud computing environment is providing security to the user data. Often user data is moved back and forth between Cloud Service Vendor (CSV) and Cloud Service User (CSU). The degree of trust of CSU in CSV varies when it comes to the sensitivity of data. A CSU may or may not trust the CSV. In the latter case, the CSU may be interested to use the security service provided by a Third-Party (TP) like a Certification Authority to whom both the CSU and CSV may trust. Once again here, the CSU may or may not even trust the TP based on the supremacy of the data. In order to provide a flexible and secure management of CSUs data, the proposed model explicitly considers the degree of trust possessed by the CSU in both CSV and TP. The movement of CSU data within the premises of CSV is also strictly controlled with the involvement of CSU so that the data is not moved arbitrarily without the consent of CSU. Majority of the flow of data among entities in the proposed model is kept unidirectional to block the reverse transmission of sensitive information and also to block the return path to shield the secure data source from hidden viruses, Trojans, malicious instructions or other intrusion attempts. The security mechanisms suggested for realization of the proposed model are widely accepted and practically proven. The proposed data security model ensures privacy and security of the data both at CSV side and CSU side.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131366271","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
Spur reduction technique for fractional-N frequency synthesizer with MASH 1-1-1-1 Sigma Delta modulator 带MASH -1-1-1 σ δ调制器的分数n频率合成器的杂散抑制技术
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6949973
V. Tamilselvan, Maran Ponnambalam, P. Chandramani
{"title":"Spur reduction technique for fractional-N frequency synthesizer with MASH 1-1-1-1 Sigma Delta modulator","authors":"V. Tamilselvan, Maran Ponnambalam, P. Chandramani","doi":"10.1109/ICCSP.2014.6949973","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949973","url":null,"abstract":"A fourth order MASH Sigma Delta modulator based fractional-N frequency synthesizer was designed and validated as a Matlab/Simulink macro- model. Use of MASH achieves a better noise shaping for the frequencies generated by the synthesizer. With a reference frequency of 20MHz, the fractional-N frequency synthesizer achieves a synthesized frequency range of 200MHz to 220MHz with 2 MHz resolution. The macro-model has a gain margin of 6.02dB and a phase margin of 39.7°, ensuring the stability of the closed loop system with settling time of 3.32μ sec. Spurs that were introduced by the fractional feedback and reference input are removed through notch type Comb filter.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132459223","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
Performance analysis of MPC in synchronous OCDMA system 同步OCDMA系统中MPC的性能分析
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6949860
A. Pragathi, S. Prince
{"title":"Performance analysis of MPC in synchronous OCDMA system","authors":"A. Pragathi, S. Prince","doi":"10.1109/ICCSP.2014.6949860","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949860","url":null,"abstract":"Prime codes are a family of optical address codes that are suitable for optical fiber code division multiple access (OCDMA) systems using all-optical processing. Incoherent optical signal processing is used for generation of prime codes (PC) and modified prime codes (MPC). Prime codes are developed for an optical fiber network using (asynchronous) code division multiple access (CDMA). Prime codes are then modified to fit a synchronous transmission format which can accommodate a larger number of subscribers and more simultaneous users than CDMA. Bit error rate (BER) performance comparison of CDMA and synchronous code division multiple access (S/CDMA) have been made using Gaussian approximation technique.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130451046","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
An analysis for MC- DS CDMA using optimized coding technique 基于优化编码技术的MC- DS CDMA分析
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6950155
U. Sivaraju, P. Vedasundravinayagam, V. Nagarajan
{"title":"An analysis for MC- DS CDMA using optimized coding technique","authors":"U. Sivaraju, P. Vedasundravinayagam, V. Nagarajan","doi":"10.1109/ICCSP.2014.6950155","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950155","url":null,"abstract":"This paper addresses Concatenation coding scheme for Multicarrier Direct Sequence Code Division Multiple Access (MC DS CDMA). It is to support high capacity & utilizing less power among all sub channels. While using Multicarrier Code Division Multiple Access (MC CDMA), it only spreads codes in frequency domain, but main disadvantage is no code orthogonality. MC DS CDMA Signal is generated by serial-to-parallel converting the data symbols into N sub streams and applying Direct Sequence Code Division Multiple Access (DS-CDMA) on each individual sub-stream. It spreads both in Time and Frequency domain (TF Domain). MC-DS CDMA has the highest degrees of freedom in the family of CDMA schemes that can be beneficially exploited during the system design and reconfiguration procedures. A Concatenation Code concept is proposed to analyze and develop the MC-DS-CDMA. In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code. It gives solution to the problem of finding a code that has both exponentially decreasing error probabilities with increasing block length polynomial-time decoding.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133910698","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
Burstification threat in Optical Burst Switched Networks 光突发交换网络中的突发威胁
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6949804
T. Fernandez, K. Brabagaran, N. Sreenath
{"title":"Burstification threat in Optical Burst Switched Networks","authors":"T. Fernandez, K. Brabagaran, N. Sreenath","doi":"10.1109/ICCSP.2014.6949804","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6949804","url":null,"abstract":"Optical Burst Switching, an efficient core networking architecture, suffers from various security vulnerabilities. This paper proposes the Burstification threat and summarizes other potential threats for optical nodes.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130865848","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
Non stationary signal prediction using TVAR model 基于TVAR模型的非平稳信号预测
2014 International Conference on Communication and Signal Processing Pub Date : 2014-04-03 DOI: 10.1109/ICCSP.2014.6950136
G. Ravi Shankar Reddy, R. Rao
{"title":"Non stationary signal prediction using TVAR model","authors":"G. Ravi Shankar Reddy, R. Rao","doi":"10.1109/ICCSP.2014.6950136","DOIUrl":"https://doi.org/10.1109/ICCSP.2014.6950136","url":null,"abstract":"In this paper Time-varying Auto Regressive (TVAR) model based approach for non stationary signal prediction in noisy environment is presented. Covariance method is applied for least square estimation of time-varying autoregressive parameters. In TVAR modeling approach, the time-varying parameters are expressed as a linear combination of constants multiplied by basis functions. In this paper, the TVAR parameters are expanded by a low-order discrete cosine basis. The order determination of TVAR model is addressed by means of the maximum likelihood estimation (MLE) algorithm. The experimental results are presented for prediction of Discrete AM, Discrete FM, Discrete AM-FM signals.","PeriodicalId":149965,"journal":{"name":"2014 International Conference on Communication and Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133593317","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
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学术官方微信