Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)最新文献

筛选
英文 中文
An improved Sum-Of-Sinusoids based simulation model for Rayleigh fading channel 一种改进的基于正弦和的瑞利衰落信道仿真模型
Mohit K. Sharma, R. Nath
{"title":"An improved Sum-Of-Sinusoids based simulation model for Rayleigh fading channel","authors":"Mohit K. Sharma, R. Nath","doi":"10.1109/C3IT.2015.7060189","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060189","url":null,"abstract":"In multipath propagation scenario, Rayleigh fading is commonly modeled by Sum-Of-Sinusoid simulators. Many simulation models have been proposed in this direction, with Clarke's model as the reference model which was later simplified by Jake's model, which could not maintain the wide-sense stationary characteristics. Then an improved model was proposed by Pop and Beaulieu which was further modified by Zheng and Xiao. In this paper, we have considered that the probability of angle of arrival of received signal is not same in the entire range but is assumed high between -π/2 to π/2 and is assigned small value in the remaining ranges -π to -π/2 and π/2 to π. However in each segment the angle of arrival of received signal is considered to have uniform probability distribution function. This proposed probability distribution for the angle of arrival seems to be more realistic in some practical scenario. The autocorrelation, probability density function and power spectral density of the fading envelop is in close agreement with the mathematical model proposed by Clark.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132617474","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}
引用次数: 4
Registration of multi-focus images by combining global and local transformation models 结合全局和局部变换模型的多焦点图像配准
I. De, B. Chanda
{"title":"Registration of multi-focus images by combining global and local transformation models","authors":"I. De, B. Chanda","doi":"10.1109/C3IT.2015.7060106","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060106","url":null,"abstract":"Image registration is a necessary pre-requisite for multi-focus image fusion because before fusion the constituent images must be positioned properly with respect to a common coordinate system. A two-step registration method is proposed in this work. In first step, a global translation is determined by maximizing the mutual information of the source and the reference images and then it is applied on the source image. In second step, a block-wise local scaling is applied on the translated source image. The global and local transformations constitute a hybrid technique which is iterated to obtain the optimal result. Proposed method is easy to implement, requires no manual intervention and gives good results. Results obtained by the method on different sets of multi-focus images are provided with. Performance of the system is also evaluated and is compared with two different methods.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"263 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132700176","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
Page-level script identification from multi-script handwritten documents 多脚本手写文档的页面级脚本标识
P. Singh, S. Dalal, R. Sarkar, M. Nasipuri
{"title":"Page-level script identification from multi-script handwritten documents","authors":"P. Singh, S. Dalal, R. Sarkar, M. Nasipuri","doi":"10.1109/C3IT.2015.7060113","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060113","url":null,"abstract":"Script identification has long been the forerunner of many Optical Character Recognition (OCR) processes in a multi-lingual document environment. Script identification has numerous applications in the field of document image analysis, such as document sorting, indexing, retrieval and translation, etc. In this paper, we have developed a page-level script identification technique for handwritten documents using the texture features. The texture features are extracted from the document pages based on the Gray Level Co-occurrence Matrix (GLCM). The proposed technique has been evaluated on four scripts namely, Bangla, Devnagari, Telugu, and Roman using multiple classifiers. Based on their identification accuracies, it is observed that Multi Layer Perceptron (MLP) classifier performs the best. The experimental results demonstrate the effectiveness of the GLCM features in identification of handwritten scripts. Experiments are conducted on a total of 120 document pages and the overall accuracy of the system is found to be 91.48%. Though the system is evaluated on limited dataset, considering the complexities of the scripts, the result can be assumed satisfactory.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129089561","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}
引用次数: 21
Frequent pattern generation in association rule mining using weighted support 基于加权支持的关联规则挖掘频繁模式生成
Subrata Bose, Subrata Datta
{"title":"Frequent pattern generation in association rule mining using weighted support","authors":"Subrata Bose, Subrata Datta","doi":"10.1109/C3IT.2015.7060207","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060207","url":null,"abstract":"Determination of frequent sets from a large database is the key to Association Rule mining from the point view of efficiency of algorithms to scale up and discovering frequent sets which lead to useful association rules. Some of the existing methods have either very low or very high pruning, which is the cause of generation of larger or lesser number of frequent patterns. In this paper we have adopted a balanced approach for frequent pattern selection. Our proposed measure weighted support considers association and dissociation among items as well as the impact of null transactions on them for frequent set generation. Impact of increasing itemset size on weighted support gives rise to variable threshold The experimental results obtained after implementation of the proposed algorithm justify the approach.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123286238","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}
引用次数: 12
A new clustered load balancing approach for distributed systems 分布式系统的一种新的集群负载平衡方法
Moumita Chatterjee, S. Setua
{"title":"A new clustered load balancing approach for distributed systems","authors":"Moumita Chatterjee, S. Setua","doi":"10.1109/C3IT.2015.7060188","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060188","url":null,"abstract":"A distributed system consists of several autonomous nodes, where some of the nodes may be overloaded due to a large number of job arrivals while others nodes are idle without any processing. Load Balancing is used for effectively distributing the load among the nodes. Centralized load balancing schemes are not scalable as the load balancing decision depends on a central server. In contrast fully distributed schemes are scalable but they do not produce a balanced load distribution as they use local information. In this paper we propose a clustered load balancing policy for a heterogeneous distributed computing system. Our algorithm estimates different system parameters like CPU Utilization, Memory Utilization, CPU Queue length, and Response time of the system to decide the workload of each node. The proposed strategy privileges local load balancing over global load balancing and thus reduces communication over global network. Simulation results show that the proposed algorithm performs well.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124984830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Facial landmark detection using FAST Corner Detector of UGC-DDMC Face Database of Tripura tribes Tripura部落UGC-DDMC人脸数据库FAST角点检测器的人脸地标检测
Tumpa Dey, Tamojay Deb
{"title":"Facial landmark detection using FAST Corner Detector of UGC-DDMC Face Database of Tripura tribes","authors":"Tumpa Dey, Tamojay Deb","doi":"10.1109/C3IT.2015.7060195","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060195","url":null,"abstract":"We have performed facial landmark detection of visible face images and studied the performance of Features from Accelerated Segment Test (FAST) Corner Detector technique on IRIS Face Database and newly created UGC-DDMC Face Database to justify the design approach of the face database. This paper describes detection of the facial landmarks of UGC-DDMC face database which includes left eye corners, right eye corners, left eyebrows, right eyebrows, lip corners, nostrils. It consists of two parts: In first part, a morphological opening operation is used to estimate the background. Then create a more uniform background by subtract the background image from original image. In the second part, the facial landmarks had been detected using Fast corner detector technique. The Fast corner detector works on the corner response function (CRF), which is computed as a minimum change of intensity over all possible direction. The Fast corner detector is significantly faster to compute than other algorithms. The experiment has been done over the UGC-DDMC Face Database of Tribes of, which is being developed by IT Department of Dasaratha Deb Memorial College, Khowai, Tripura. In our Experiment initially we used 108 Facial images with different pose from the UGC-DDMC Face Database and 110 images from IRIS Database. Performance results for ntIS database is 100% and UGC-DDMC Database is 74%. It has been seen that algorithmic performance is high with low threshold value and with higher values if shows good performance. Fiducial points obtained during this process will be useful for any feature based Face recognition process. Thus, we can justify the design process of the UGC-DDMC Face Database.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114615120","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
Load balanced multicast routing protocol for wireless mobile ad-hoc network 无线移动自组网负载均衡组播路由协议
A. Yadav, S. Tripathi
{"title":"Load balanced multicast routing protocol for wireless mobile ad-hoc network","authors":"A. Yadav, S. Tripathi","doi":"10.1109/C3IT.2015.7060215","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060215","url":null,"abstract":"A Mobile Ad hoc NETwork (MANET) is an interconnected of mobile nodes without any fixed base station in the network. Due to the high mobility of nodes, the network topology of MANETs changes very fast, making it more difficult during data transmission of data packet from source node to destination node. Because mobile nodes have limited battery power, it is therefore very important to use energy in a MANET efficiently. Due to the dynamic topology and limited resources of mobile nodes, the routing scheme in MANETs presents important challenges. In this study, load balancing multicast routing protocol (LBMRP) for MANETs is proposed. In the proposed scheme, all mobile nodes are randomly classified into three types, group-1, group-2 and group-3. To achieve the load balance, three multicast trees (TREE-1 for group-1, TREE-2 for group-2 and TREE-3 for group-3) are constructed. Simulation results show that the proposed LBMRP scheme outperforms multicast ad hoc on-demand distance vector routing protocol (MAODV), reliability of the multicast ad hoc on demand distance vector (RMAODV) and Parallel multiple nearly-disjoint trees multicast routing (Parallel MNTMR) schemes.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122611383","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}
引用次数: 10
Design of structured irregular LDPC codes from structured regular LDPC codes 由结构化规则LDPC码设计结构化不规则LDPC码
V. Kulkarni, K. J. Sankar
{"title":"Design of structured irregular LDPC codes from structured regular LDPC codes","authors":"V. Kulkarni, K. J. Sankar","doi":"10.1109/C3IT.2015.7060128","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060128","url":null,"abstract":"Irregular Low-Density Parity-Check (LDPC) codes exhibit a performance extremely close to the Shannon capacity formula. In this paper, we presented a method of developing structured irregular LDPC codes from structured regular LDPC codes. The design is based on the expansion of the column-weight two LDPC codes. We used our proposed technique of developing a column-weight two structured regular LDPC codes based on Gray code representations and adapted the expansion method proposed in literature to convert regular codes into irregular ones, and it is noticed that there is an improvement in obtained code rates using the proposed technique. It is also found that encoding process is simpler and requires less memory.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125201658","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
Characteristics of a planar metal antenna in vicinity of human head at 900 MHz and 1800 MHz 900兆赫和1800兆赫人类头部附近平面金属天线的特性
S. Mondal, P. Sarkar
{"title":"Characteristics of a planar metal antenna in vicinity of human head at 900 MHz and 1800 MHz","authors":"S. Mondal, P. Sarkar","doi":"10.1109/C3IT.2015.7060205","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060205","url":null,"abstract":"In this paper a parametric study on characteristics of a planar metal antenna in vicinity of a homogenous human head at 900 MHz and 1800 MHz are carried out. Initially the planar metal antenna is designed at 900 MHz and 1800 MHz. The impedance and radiation characteristics of these antennas are shown in free space and in proximity of a human head. Also Specific Absorption Rate (SAR) for different distances of the antenna from head are evaluated and compared.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115950240","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
Setting initial population for synthesizing time-modulated antenna arrays with fast convergence of DE 基于DE快速收敛的时调天线阵列初始种群设置
Ananya Mukherjee, S. Mandai, Bharath Raia Nenavath, Mukesh Kumar
{"title":"Setting initial population for synthesizing time-modulated antenna arrays with fast convergence of DE","authors":"Ananya Mukherjee, S. Mandai, Bharath Raia Nenavath, Mukesh Kumar","doi":"10.1109/C3IT.2015.7060216","DOIUrl":"https://doi.org/10.1109/C3IT.2015.7060216","url":null,"abstract":"Synthesis of low side lobe power pattern with controlled harmonic radiation in time-modulated antenna arrays (TMAA) is a population based, stochastic optimization method. Due to the random nature, the initial population of such method greatly influences the convergence characteristics of the optimization tools. In this paper, a study on the effect of the convergence characteristics of the differential evolution (DE) due to different initial population has been observed and the initial population that provides fast convergence for synthesizing TMAAs is provided.","PeriodicalId":402311,"journal":{"name":"Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)","volume":"37 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121252507","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学术文献互助群
群 号:481959085
Book学术官方微信