M. Zeinali, S. Saryazdi, Hossein Khodabakhshi Rafsanjani
In this paper we propose a new image denoising technique based on combination of nonlinear diffusion and bilateral filtering. The proposed algorithm uses Weighted Local Variance (WLV) of the residual image to determine the texture and fine details. These regions are denoised by bilateral filtering and then, are returned to the image denoised by P-M method. In fact, the WLV have a controlling role in amount of this combination. Denoising the residual image and adding it to the primary denoised image is the main novel idea of this paper. Experimental results confirm this image denoising approach is more efficient than nonlinear diffusion and the bilateral filtering while each algorithm accomplished separately.
本文提出了一种新的基于非线性扩散和双边滤波相结合的图像去噪技术。该算法利用残差图像的加权局部方差(Weighted Local Variance, WLV)来确定纹理和精细细节。这些区域通过双边滤波去噪，然后返回到用P-M方法去噪的图像。事实上，WLV在这种组合的数量上起着控制作用。对残差图像进行去噪，并将残差图像加入到主去噪图像中是本文的主要创新思想。实验结果表明，该图像去噪方法比非线性扩散和双边滤波分别进行去噪时效果更好。
{"title":"Image Denoising via Combination Anisotropic Diffusion and Bilateral Filtering","authors":"M. Zeinali, S. Saryazdi, Hossein Khodabakhshi Rafsanjani","doi":"10.1109/CICN.2011.88","DOIUrl":"https://doi.org/10.1109/CICN.2011.88","url":null,"abstract":"In this paper we propose a new image denoising technique based on combination of nonlinear diffusion and bilateral filtering. The proposed algorithm uses Weighted Local Variance (WLV) of the residual image to determine the texture and fine details. These regions are denoised by bilateral filtering and then, are returned to the image denoised by P-M method. In fact, the WLV have a controlling role in amount of this combination. Denoising the residual image and adding it to the primary denoised image is the main novel idea of this paper. Experimental results confirm this image denoising approach is more efficient than nonlinear diffusion and the bilateral filtering while each algorithm accomplished separately.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115783656","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}
Analyze some of the basic principles involved in the design of optical fiber based displacement sensor and to apply it to design a weight measurement system. Bifurcated optical fiber sensors can have many applications. Having high sensitivity to short distances, bifurcated optical fiber (Y-sensor) is well suited not only for control applications as position sensors, but also for gauging and surface assessment. In addition, they can be utilized as non contact pressure sensors if used in conjunction with reflective diaphragms moving in response to pressure. Y-sensor can also be applied as temperature transducer if used in conjunction with deformable bimetal sensors.
{"title":"Bifurcated Optical Fiber Sensor for Weight Measurement System","authors":"Praveen Kumar, S. Singh, P. Ojha","doi":"10.1109/CICN.2011.48","DOIUrl":"https://doi.org/10.1109/CICN.2011.48","url":null,"abstract":"Analyze some of the basic principles involved in the design of optical fiber based displacement sensor and to apply it to design a weight measurement system. Bifurcated optical fiber sensors can have many applications. Having high sensitivity to short distances, bifurcated optical fiber (Y-sensor) is well suited not only for control applications as position sensors, but also for gauging and surface assessment. In addition, they can be utilized as non contact pressure sensors if used in conjunction with reflective diaphragms moving in response to pressure. Y-sensor can also be applied as temperature transducer if used in conjunction with deformable bimetal sensors.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126895698","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}
This paper proposes a back stepping controller for the class of discrete-time nonlinear system in the presence of input nonlinearities like saturation and dead-zone. A robust adaptive neural network (NN) control is investigated for a general class of uncertain single-input-single-output (SISO) discrete-time nonlinear systems with unknown system dynamics and input nonlinearities i.e. combination of saturation and dead-zone. For input nonlinearities, discrete-time SISO nonlinear system in combination with back stepping and Lyapunov synthesis is proposed for adaptive neural network design with guaranteed stability. The actuator nonlinearities are assumed to be unknown and compensated by a pre compensator using Chebyshev neural network (CNN) and unknown nonlinear functions are also approximated by CNN. Weight update laws, based on Lyapunov theory are derived to make this scheme adaptive and the convergence properties are shown. Simulation results validate the effectiveness of proposed scheme.
{"title":"Adaptive Backstepping Control for a Class of Uncertain Discrete-Time Nonlinear Systems with Input Nonlinearities","authors":"V. Deolia, S. Purwar, T. Sharma","doi":"10.1109/CICN.2011.19","DOIUrl":"https://doi.org/10.1109/CICN.2011.19","url":null,"abstract":"This paper proposes a back stepping controller for the class of discrete-time nonlinear system in the presence of input nonlinearities like saturation and dead-zone. A robust adaptive neural network (NN) control is investigated for a general class of uncertain single-input-single-output (SISO) discrete-time nonlinear systems with unknown system dynamics and input nonlinearities i.e. combination of saturation and dead-zone. For input nonlinearities, discrete-time SISO nonlinear system in combination with back stepping and Lyapunov synthesis is proposed for adaptive neural network design with guaranteed stability. The actuator nonlinearities are assumed to be unknown and compensated by a pre compensator using Chebyshev neural network (CNN) and unknown nonlinear functions are also approximated by CNN. Weight update laws, based on Lyapunov theory are derived to make this scheme adaptive and the convergence properties are shown. Simulation results validate the effectiveness of proposed scheme.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166007","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}
In wavelength division multiplexed (WDM) optical networks, each wavelength conversion performed along the light path of the connection causes some signal-to-noise deterioration. There is therefore an upper bound (threshold) on the number of wavelength conversions that a signal can go through when it is switched optically from its source to its destination. Our test results have shown that the blocking performance of optical routing could deteriorate significantly under the impact of the conversion cascading constraint. In this paper, we review the negative impact of wavelength conversion cascading on the performance of all-optical routing and we examine the implications of the presence of the conversion cascading constraint on the validity of the performance results for two previously proposed routing protocols for optical networks.
{"title":"Implications of the Wavelnength Conversion Cascading Constraint on Two Optical Routing Algorithms","authors":"Bin Zhou, Xingbo Gao, M. Bassiouni","doi":"10.1109/CICN.2011.92","DOIUrl":"https://doi.org/10.1109/CICN.2011.92","url":null,"abstract":"In wavelength division multiplexed (WDM) optical networks, each wavelength conversion performed along the light path of the connection causes some signal-to-noise deterioration. There is therefore an upper bound (threshold) on the number of wavelength conversions that a signal can go through when it is switched optically from its source to its destination. Our test results have shown that the blocking performance of optical routing could deteriorate significantly under the impact of the conversion cascading constraint. In this paper, we review the negative impact of wavelength conversion cascading on the performance of all-optical routing and we examine the implications of the presence of the conversion cascading constraint on the validity of the performance results for two previously proposed routing protocols for optical networks.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126221513","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}
In most of the digital signal processing (DSP) applications the critical operations are the multiplication and accumulation. Real-time signal processing requires high speed and high throughput Multiplier-Accumulator (MAC) unit that consumes low power, which is always a key to achieve a high performance digital signal processing system. In this paper, design of MAC unit is proposed. The multiplier used inside the MAC unit is based on the Sutra "Urdhva Tiryagbhyam" (Vertically and Cross wise) which is one of the Sutras of Vedic mathematics. Vedic mathematics is mainly based on sixteen Sutras and was rediscovered in early twentieth century. In ancient India, this Sutra was traditionally used for decimal number multiplications within less time. The same concept is applied for multiplication of binary numbers to make it useful in the digital hardware. Here, the coding is done in VHDL and synthesis is done in Xilinx ISE series. The combinational delay obtained after synthesis is compared with the performance of the "Modified Booth Wallace Multiplier" and "High speed Vedic multiplier" presented by Ramesh Pushpangadam. Our proposed Vedic multiplier seems to have better performance.
{"title":"Vedic Mathematics Based Multiply Accumulate Unit","authors":"Devika Jaina, K. Sethi, Rutuparna Panda","doi":"10.1109/CICN.2011.167","DOIUrl":"https://doi.org/10.1109/CICN.2011.167","url":null,"abstract":"In most of the digital signal processing (DSP) applications the critical operations are the multiplication and accumulation. Real-time signal processing requires high speed and high throughput Multiplier-Accumulator (MAC) unit that consumes low power, which is always a key to achieve a high performance digital signal processing system. In this paper, design of MAC unit is proposed. The multiplier used inside the MAC unit is based on the Sutra \"Urdhva Tiryagbhyam\" (Vertically and Cross wise) which is one of the Sutras of Vedic mathematics. Vedic mathematics is mainly based on sixteen Sutras and was rediscovered in early twentieth century. In ancient India, this Sutra was traditionally used for decimal number multiplications within less time. The same concept is applied for multiplication of binary numbers to make it useful in the digital hardware. Here, the coding is done in VHDL and synthesis is done in Xilinx ISE series. The combinational delay obtained after synthesis is compared with the performance of the \"Modified Booth Wallace Multiplier\" and \"High speed Vedic multiplier\" presented by Ramesh Pushpangadam. Our proposed Vedic multiplier seems to have better performance.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125661667","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}
All optical WDM networks which are capable to provide multiple classes of services, we present survivable routing and wavelength assignment strategy. Different class of services are likely to be formed according to subscriber requests like bandwidth requirement, expected call holding time, average arrival rate of request etc. For such kind of multi class WDM networks where the survivability is an important issue, we propose a strategy which is capable to provide 100% protection to connection request and improved system performance. The proposed strategy (strategy 2) has been analyzed for multiclass traffic scenarios. Simulation results on different network topologies demonstrate that the performance of proposed strategy give satisfactory performance as compared to existing strategies (no protection and strategy 1) in terms of blocking probability using limited number of wavelengths with 100% survivability.
{"title":"Survivable Routing and Wavelength Assignment Strategy for Multiclass WDM Optical Networks","authors":"Uma Rathore Bhatt, S. Tokekar","doi":"10.1109/CICN.2011.155","DOIUrl":"https://doi.org/10.1109/CICN.2011.155","url":null,"abstract":"All optical WDM networks which are capable to provide multiple classes of services, we present survivable routing and wavelength assignment strategy. Different class of services are likely to be formed according to subscriber requests like bandwidth requirement, expected call holding time, average arrival rate of request etc. For such kind of multi class WDM networks where the survivability is an important issue, we propose a strategy which is capable to provide 100% protection to connection request and improved system performance. The proposed strategy (strategy 2) has been analyzed for multiclass traffic scenarios. Simulation results on different network topologies demonstrate that the performance of proposed strategy give satisfactory performance as compared to existing strategies (no protection and strategy 1) in terms of blocking probability using limited number of wavelengths with 100% survivability.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127431679","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}
In this paper, a robust stochastic algorithm called Particle Swarm Optimization (PSO) is used to optimize resonant frequency of circular microstrip patch antenna. A modified formula for resonant frequency is presented using PSO. The obtained results using particle swarm optimization has been compared with experimental and theoretical values of previous papers. The results were in good agreement with experimental value with an average error of 0.18%.
{"title":"Optimization of Resonant Frequency of Circular Patch Microstrip Antenna Using Particle Swarm Optimization","authors":"Saurabh Kumar, R. Kumar, B. Kanaujia","doi":"10.1109/CICN.2011.124","DOIUrl":"https://doi.org/10.1109/CICN.2011.124","url":null,"abstract":"In this paper, a robust stochastic algorithm called Particle Swarm Optimization (PSO) is used to optimize resonant frequency of circular microstrip patch antenna. A modified formula for resonant frequency is presented using PSO. The obtained results using particle swarm optimization has been compared with experimental and theoretical values of previous papers. The results were in good agreement with experimental value with an average error of 0.18%.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122335282","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}
In wireless sensor networks (WSNs), data aggregation techniques are used to collect the data sample at sink, generated by sensor nodes. Data aggregation for WSNs must address to the issues of WSNs like limited energy in battery powered sensor, and fast and efficient query response which is essential to network performance and maintenance. In TDMA protocol, during the data aggregation sensors nodes consume different energy in different radio states (transmitting, receiving, listening, sleeping, and being idle) and also consume energy for state transition from sleeping to wakeup. Our proposed Energy Efficient scheduling (EES) algorithm reduces state transitions of radio in sensor node there by reducing the energy consumption. Sensor node activity is scheduled so that in wakeup state reception and transmission activities are continuously performed by nodes before going in to sleep state. Our protocol also focuses on reducing co-channel interference and efficiently use of bandwidth.
{"title":"Energy Efficient Scheduling Algorithm with Interference Reduction for Wireless Sensor Networks","authors":"Sumit Kumar, Anshu Sharma, S. Raghuvanshi","doi":"10.1109/CICN.2011.69","DOIUrl":"https://doi.org/10.1109/CICN.2011.69","url":null,"abstract":"In wireless sensor networks (WSNs), data aggregation techniques are used to collect the data sample at sink, generated by sensor nodes. Data aggregation for WSNs must address to the issues of WSNs like limited energy in battery powered sensor, and fast and efficient query response which is essential to network performance and maintenance. In TDMA protocol, during the data aggregation sensors nodes consume different energy in different radio states (transmitting, receiving, listening, sleeping, and being idle) and also consume energy for state transition from sleeping to wakeup. Our proposed Energy Efficient scheduling (EES) algorithm reduces state transitions of radio in sensor node there by reducing the energy consumption. Sensor node activity is scheduled so that in wakeup state reception and transmission activities are continuously performed by nodes before going in to sleep state. Our protocol also focuses on reducing co-channel interference and efficiently use of bandwidth.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128422933","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}
A Gunn diode loaded stacked circular patch antenna is proposed and analyzed. It is found and threshold voltage of Gunn diode controls the performance of the antenna. Various tunable frequency bands are obtained by selecting suitable bias voltage while antenna topology remains unchanged. Antenna properties like return loss, in impedance, voltage standing-wave ratio (VSWR), bandwidth, etc., are calculated with the proposed model.
{"title":"Tunable Stacked Circular Patch Microstrip Antenna","authors":"S. Patil, B. Kanaujia","doi":"10.1109/CICN.2011.164","DOIUrl":"https://doi.org/10.1109/CICN.2011.164","url":null,"abstract":"A Gunn diode loaded stacked circular patch antenna is proposed and analyzed. It is found and threshold voltage of Gunn diode controls the performance of the antenna. Various tunable frequency bands are obtained by selecting suitable bias voltage while antenna topology remains unchanged. Antenna properties like return loss, in impedance, voltage standing-wave ratio (VSWR), bandwidth, etc., are calculated with the proposed model.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"9 14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133997259","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}
XCD Search-An XML Context-driven Search Engine answers both Keyword-based and Context-driven queries using stack-based sort merge algorithm. It performs well with all criteria of queries against XML trees, except queries submitted against a document, whose XML tree contains a parent node and child interior node, both having same Taxonomic Label and both have child/children data node(s) and/or attribute(s). In this paper we propose An Improved XML Context-driven Search Engine. It uses all the techniques used in XCD Search, in addition to new techniques that handle the type of XML trees mentioned above, which XCD Search does not handle well. We evaluated this system experimentally and compared with original version of XCD Search. The results showed remarkable improvement.
{"title":"Improving Search Quality of an XML Context-Driven Search Engine by Relabling of Canonical Trees","authors":"S. Bhagate","doi":"10.1109/CICN.2011.96","DOIUrl":"https://doi.org/10.1109/CICN.2011.96","url":null,"abstract":"XCD Search-An XML Context-driven Search Engine answers both Keyword-based and Context-driven queries using stack-based sort merge algorithm. It performs well with all criteria of queries against XML trees, except queries submitted against a document, whose XML tree contains a parent node and child interior node, both having same Taxonomic Label and both have child/children data node(s) and/or attribute(s). In this paper we propose An Improved XML Context-driven Search Engine. It uses all the techniques used in XCD Search, in addition to new techniques that handle the type of XML trees mentioned above, which XCD Search does not handle well. We evaluated this system experimentally and compared with original version of XCD Search. The results showed remarkable improvement.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132616490","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：