In this work, a highly birefringent photonic crystal fiber with ultra low confinement loss using silica is proposed. The birefringence is achieved by introducing the asymmetry along the radial axis. The symmetric cladding structure results in very low confinement loss by limiting the light in the core region. The proposed design is analyzed and simulated using FDTD simulation software and the fiber shows high birefringence (0.0073) and ultra low confinement loss (0.003 dB/km) at 1.55μm wavelength, which makes the photonic crystal fiber endlessly single mode fiber and highly polarization maintaining.
{"title":"Highly Birefringent Polarization Maintaining Photonic Crystal Fiber with Ultralow Confinement Loss at 1.55µm Wavelength","authors":"R. Dhaka","doi":"10.1109/CICN.2014.78","DOIUrl":"https://doi.org/10.1109/CICN.2014.78","url":null,"abstract":"In this work, a highly birefringent photonic crystal fiber with ultra low confinement loss using silica is proposed. The birefringence is achieved by introducing the asymmetry along the radial axis. The symmetric cladding structure results in very low confinement loss by limiting the light in the core region. The proposed design is analyzed and simulated using FDTD simulation software and the fiber shows high birefringence (0.0073) and ultra low confinement loss (0.003 dB/km) at 1.55μm wavelength, which makes the photonic crystal fiber endlessly single mode fiber and highly polarization maintaining.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"317-319"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82312129","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}
S. S. Bte Shafi'ee, Chan Kheong Sann, Guan Yong Liang
The joint Viterbi detector/decoder (JVDD) is a recently proposed receiver scheme that does both detection and decoding on a single trellis rather than doing detection on a trellis and decoding on factor graph as in the conventional iterative detector today. The JVDD attempts to return minimum metric legal codeword (MMLC) that is the optimum decision over an AWGN/ISI channel. However in so doing, the computational complexity quickly becomes untenable. In order to manage the computational complexity, GDLD and GDPD codes have been proposed that specifically target the complexity issue of the JVDD. In this work we perform a more in-depth study on several of the codes' parameters on both the performance and the complexity of the JVDD.
{"title":"A Performance Study of the Joint Viterbi Detector Decoder (JVDD) with GDLD and GDPD Codes","authors":"S. S. Bte Shafi'ee, Chan Kheong Sann, Guan Yong Liang","doi":"10.1109/CICN.2014.83","DOIUrl":"https://doi.org/10.1109/CICN.2014.83","url":null,"abstract":"The joint Viterbi detector/decoder (JVDD) is a recently proposed receiver scheme that does both detection and decoding on a single trellis rather than doing detection on a trellis and decoding on factor graph as in the conventional iterative detector today. The JVDD attempts to return minimum metric legal codeword (MMLC) that is the optimum decision over an AWGN/ISI channel. However in so doing, the computational complexity quickly becomes untenable. In order to manage the computational complexity, GDLD and GDPD codes have been proposed that specifically target the complexity issue of the JVDD. In this work we perform a more in-depth study on several of the codes' parameters on both the performance and the complexity of the JVDD.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"3 1","pages":"339-343"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82316629","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}
Script identification from handwritten document images is an open document analysis problem especially for multilingual environment like India. To design the Optical Character Recognition (OCR) system for multi-script document pages, it is essential to recognize different scripts prior to employing an OCR engine of a particular script. The present work describes a texture based approach to word-level script identification from five handwritten scripts namely, Malayalam, Oriya, Tamil, Telugu and Roman. A 92-element feature vector has been designed in which 80 features consists of selected coefficients of Discrete Cosine Transform (DCT) and the remaining 12 features have been taken from the Moment invariants. Experimentations are conducted on a database consisting of 1000 word images of each script which are evaluated using multiple classifiers. The Multi Layer Perceptron (MLP) classifier is found to be a best choice for the said purpose which is then applied comprehensively using different cross validation folds and different epoch sizes. The average success rate for the present technique of word-level handwritten script identification is found to be 93.56% for 5-fold cross validation with epoch size 1000, which is quite encouraging.
{"title":"A Texture Based Approach to Word-Level Script Identification from Multi-script Handwritten Documents","authors":"P. Singh, Aparajita Khan, R. Sarkar, M. Nasipuri","doi":"10.1109/CICN.2014.60","DOIUrl":"https://doi.org/10.1109/CICN.2014.60","url":null,"abstract":"Script identification from handwritten document images is an open document analysis problem especially for multilingual environment like India. To design the Optical Character Recognition (OCR) system for multi-script document pages, it is essential to recognize different scripts prior to employing an OCR engine of a particular script. The present work describes a texture based approach to word-level script identification from five handwritten scripts namely, Malayalam, Oriya, Tamil, Telugu and Roman. A 92-element feature vector has been designed in which 80 features consists of selected coefficients of Discrete Cosine Transform (DCT) and the remaining 12 features have been taken from the Moment invariants. Experimentations are conducted on a database consisting of 1000 word images of each script which are evaluated using multiple classifiers. The Multi Layer Perceptron (MLP) classifier is found to be a best choice for the said purpose which is then applied comprehensively using different cross validation folds and different epoch sizes. The average success rate for the present technique of word-level handwritten script identification is found to be 93.56% for 5-fold cross validation with epoch size 1000, which is quite encouraging.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"17 1","pages":"228-232"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87139717","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 new algorithm is proposed for detecting human faces in color images and as well as for removing background from a single face color image. The proposed algorithm combines color histogram for skin color (in the HSV space), a threshold value of gray scale image to easily detect skin regions in a given image. Then, in order to reduce the number of non-face regions, we calculate the number of holes of these selected regions. If the value is less than a particular threshold, then the region is selected. Also, ratio of the height and width of the detected skin region is calculated to differentiate face and non-face regions. Finally, Weber Local Descriptor (WLD) is calculated for each selected regions and then, each regions are divided into equal size block and corresponding entropy values of each block are calculated and compared with training samples to get the Euclidian distance between them. If the distance value is in between a tested threshold values, then the region block is face, otherwise it is non-face. The proposed algorithm has been tested on various real images and its performance is quite satisfactory.
{"title":"Human Face Detection in Color Images Using HSV Color Histogram and WLD","authors":"J. Das, Hiranmoy Roy","doi":"10.1109/CICN.2014.54","DOIUrl":"https://doi.org/10.1109/CICN.2014.54","url":null,"abstract":"In this paper, a new algorithm is proposed for detecting human faces in color images and as well as for removing background from a single face color image. The proposed algorithm combines color histogram for skin color (in the HSV space), a threshold value of gray scale image to easily detect skin regions in a given image. Then, in order to reduce the number of non-face regions, we calculate the number of holes of these selected regions. If the value is less than a particular threshold, then the region is selected. Also, ratio of the height and width of the detected skin region is calculated to differentiate face and non-face regions. Finally, Weber Local Descriptor (WLD) is calculated for each selected regions and then, each regions are divided into equal size block and corresponding entropy values of each block are calculated and compared with training samples to get the Euclidian distance between them. If the distance value is in between a tested threshold values, then the region block is face, otherwise it is non-face. The proposed algorithm has been tested on various real images and its performance is quite satisfactory.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"44 1","pages":"198-202"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87977349","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}
The outage performance of decode-and-forward cognitive ratio opportunistic relay (DF CR-OR) systems is investigated over Rayleigh fading environments. We specially consider the case where the systems are impaired by the imperfect channel state information (CSI) between the secondary users and the primary user, and by the co-channel interference (CCI) at secondary relays and destination. We first obtain the exact closed-form expression to outage probability of cognitive systems by considering jointly the impact of the imperfect CSI and the CCI. Secondly, the presented simulation results show that the curves' slops of outage probability are same for all different CSI or CCI. This indicates that diversity order of the interested cognitive systems is not influenced by the imperfect CSI and the CCI. At the same time, the simulated results also show that the imperfect CSI and the CCI cause the very severe loss in system outage performance even if they do not result in the loss in diversity order.
{"title":"Outage Performance of Underlay Cognitive Decode-and-Forward Opportunistic Relaying with Imperfect Channel State Information and Co-channel Interference","authors":"Yuhua Ouyang, Ming Zhou, Xiangdong Jia","doi":"10.1109/CICN.2014.79","DOIUrl":"https://doi.org/10.1109/CICN.2014.79","url":null,"abstract":"The outage performance of decode-and-forward cognitive ratio opportunistic relay (DF CR-OR) systems is investigated over Rayleigh fading environments. We specially consider the case where the systems are impaired by the imperfect channel state information (CSI) between the secondary users and the primary user, and by the co-channel interference (CCI) at secondary relays and destination. We first obtain the exact closed-form expression to outage probability of cognitive systems by considering jointly the impact of the imperfect CSI and the CCI. Secondly, the presented simulation results show that the curves' slops of outage probability are same for all different CSI or CCI. This indicates that diversity order of the interested cognitive systems is not influenced by the imperfect CSI and the CCI. At the same time, the simulated results also show that the imperfect CSI and the CCI cause the very severe loss in system outage performance even if they do not result in the loss in diversity order.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"56 1","pages":"320-323"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86276591","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}
Holonomic Robots are advantageous over non holonomic robots as they provide control to all of its degrees of freedom. Autonomous navigation of holonomic robots is expensive as it requires many costly odometry sensors. In this paper, a novel approach is proposed for the application of PID algorithm for autonomous navigation by reducing the complexity of 3 wheel drive to 2 wheel drive. A comparison with algorithms involving three encoders is discussed. Our system employs two rotary encoders instead of three and a yaw-rate gyroscope. Equations for generation of coordinates in free space are derived and trajectory following is performed. The algorithm has been successfully tested using various paths and speeds and the implementation results are described here.
{"title":"Autonomous Navigation of 3 Wheel Robots Using Rotary Encoders and Gyroscope","authors":"Harshil Shah, Karan Mehta, S. Gandhi","doi":"10.1109/CICN.2014.244","DOIUrl":"https://doi.org/10.1109/CICN.2014.244","url":null,"abstract":"Holonomic Robots are advantageous over non holonomic robots as they provide control to all of its degrees of freedom. Autonomous navigation of holonomic robots is expensive as it requires many costly odometry sensors. In this paper, a novel approach is proposed for the application of PID algorithm for autonomous navigation by reducing the complexity of 3 wheel drive to 2 wheel drive. A comparison with algorithms involving three encoders is discussed. Our system employs two rotary encoders instead of three and a yaw-rate gyroscope. Equations for generation of coordinates in free space are derived and trajectory following is performed. The algorithm has been successfully tested using various paths and speeds and the implementation results are described here.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"148 1-3","pages":"1168-1172"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91471996","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}
When we have n control points on a 2D or 3D space, then using these control points different forms of surface can be constructed. In such case, the construction of a most meaningful surface over these points is the challenging task. The presented work, has defined a fitness function based on the distance and region specification so that only the valid control points and edges will be selected and will avoid the illegal and hidden edges and faces while forming the triangulation. In this work, control points are taken as the initial population for the mathematical process. The process is repeated for specific number of iterations. With each iteration, effective control points, edges and faces get selection.
{"title":"A Mathematical Model to Generate 3D Surface","authors":"Akash Devgun","doi":"10.1109/CICN.2014.259","DOIUrl":"https://doi.org/10.1109/CICN.2014.259","url":null,"abstract":"When we have n control points on a 2D or 3D space, then using these control points different forms of surface can be constructed. In such case, the construction of a most meaningful surface over these points is the challenging task. The presented work, has defined a fitness function based on the distance and region specification so that only the valid control points and edges will be selected and will avoid the illegal and hidden edges and faces while forming the triangulation. In this work, control points are taken as the initial population for the mathematical process. The process is repeated for specific number of iterations. With each iteration, effective control points, edges and faces get selection.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"132 1","pages":"1237-1242"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79640987","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 presents Seeker Optimization Algorithm (SOA) to the optimization of current excitation weights and uniform inter-element spacing for the optimal design of hyper beam forming of linear antenna arrays. Hyper beam forming is based on sum and difference beam patterns, each raised to the power of hyper beam exponent parameter for linear antenna arrays. In the SOA, the act of human searching capability and understanding are exploited for the purpose of optimization of the hyper beam pattern. In this algorithm, the search direction is based on empirical gradient by evaluating the response to the position changes and the step length is based on uncertainty reasoning by using a simple fuzzy rule. The simulation experiment is performed on 10-, 14-, and 20-element linear antenna arrays with an objective of obtaining maximum Side Lobe Level (SLL) reduction and much more improved first null beam width (FNBW) for SOA. Finally, the SOA based optimal hyper beam forming designs have proven to be superior in achieving the greatest reduction in SLL and much more improved FNBW, keeping the same value of hyper beam exponent.
{"title":"Seeker Optimization Algorithm for Beamforming of Linear Antenna Arrays","authors":"G. Ram, D. Mandal, R. Kar, S. P. Ghosal","doi":"10.1109/CICN.2014.34","DOIUrl":"https://doi.org/10.1109/CICN.2014.34","url":null,"abstract":"This paper presents Seeker Optimization Algorithm (SOA) to the optimization of current excitation weights and uniform inter-element spacing for the optimal design of hyper beam forming of linear antenna arrays. Hyper beam forming is based on sum and difference beam patterns, each raised to the power of hyper beam exponent parameter for linear antenna arrays. In the SOA, the act of human searching capability and understanding are exploited for the purpose of optimization of the hyper beam pattern. In this algorithm, the search direction is based on empirical gradient by evaluating the response to the position changes and the step length is based on uncertainty reasoning by using a simple fuzzy rule. The simulation experiment is performed on 10-, 14-, and 20-element linear antenna arrays with an objective of obtaining maximum Side Lobe Level (SLL) reduction and much more improved first null beam width (FNBW) for SOA. Finally, the SOA based optimal hyper beam forming designs have proven to be superior in achieving the greatest reduction in SLL and much more improved FNBW, keeping the same value of hyper beam exponent.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"5 1","pages":"102-106"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83567251","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 the future, the mobile station will comprise a wide range access technology (RAT) providing user with a flexible and efficient access to the multimedia service and high data rate communication. Although much work has been done for coexistence analysis between different systems base station (BS), most of them have not addressed the interference within multimode terminal. Hence, to fill this gap, this paper presents coexistence study of Wide Band Code Division Multiple Access (WCDMA) and Time Division Duplex Long term evolution (TDD-LTE) network in multi-mode terminal with multi-service provisioning. First, we introduce the system model for coexistence study and explain how deterministic analysis can be done within the terminal. And the interference evaluation model is based on the relation between reference sensitivity and signal noise ratio (SNR), which also is deduced in the paper. Then we provide the system simulation methodology and assumptions used in simulation, and show the simulation results with different system parameters. And we provide the minimum antenna isolation required for a health system operation.
{"title":"Coexistence Analysis between WCDMA and TD-LTE Systems in Multimode Terminals","authors":"Zhi-hui Zheng, Junfeng Wang, Xiao Peng, Cheng-lin Zhao","doi":"10.1109/CICN.2014.73","DOIUrl":"https://doi.org/10.1109/CICN.2014.73","url":null,"abstract":"In the future, the mobile station will comprise a wide range access technology (RAT) providing user with a flexible and efficient access to the multimedia service and high data rate communication. Although much work has been done for coexistence analysis between different systems base station (BS), most of them have not addressed the interference within multimode terminal. Hence, to fill this gap, this paper presents coexistence study of Wide Band Code Division Multiple Access (WCDMA) and Time Division Duplex Long term evolution (TDD-LTE) network in multi-mode terminal with multi-service provisioning. First, we introduce the system model for coexistence study and explain how deterministic analysis can be done within the terminal. And the interference evaluation model is based on the relation between reference sensitivity and signal noise ratio (SNR), which also is deduced in the paper. Then we provide the system simulation methodology and assumptions used in simulation, and show the simulation results with different system parameters. And we provide the minimum antenna isolation required for a health system operation.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"3 1","pages":"295-299"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89357683","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 evolutionary optimization based improved particle swarm optimization with wavelet mutation (IPSOWM) is used for the improvement of the radiation performance of time modulated linear antenna arrays. In this paper optimal side lobe reduction is achieved with optimized uniform inter-element spacing and optimal switching time sequence of each element. Real coded genetic algorithm (RGA) and conventional particle swarm optimization (PSO) is also used for comparison of results. The approach is illustrated through 32-element. Various results are presented to show the advantage of IPSOWM approach considering maximum side lobe reduction even amplitude excitation weight is uniform.
{"title":"Swarm Optimization Based Side Lobe Reduction in Time Modulated Linear Antenna Arrays","authors":"G. Ram, D. Mandal, R. Kar, S. P. Ghosal","doi":"10.1109/CICN.2014.231","DOIUrl":"https://doi.org/10.1109/CICN.2014.231","url":null,"abstract":"In this paper evolutionary optimization based improved particle swarm optimization with wavelet mutation (IPSOWM) is used for the improvement of the radiation performance of time modulated linear antenna arrays. In this paper optimal side lobe reduction is achieved with optimized uniform inter-element spacing and optimal switching time sequence of each element. Real coded genetic algorithm (RGA) and conventional particle swarm optimization (PSO) is also used for comparison of results. The approach is illustrated through 32-element. Various results are presented to show the advantage of IPSOWM approach considering maximum side lobe reduction even amplitude excitation weight is uniform.","PeriodicalId":6487,"journal":{"name":"2014 International Conference on Computational Intelligence and Communication Networks","volume":"49 1","pages":"1101-1105"},"PeriodicalIF":0.0,"publicationDate":"2014-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88096722","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
扫码关注我们
求助内容：
应助结果提醒方式：