2012 Third International Conference on Emerging Applications of Information Technology最新文献

筛选
英文 中文
Detection of ECG characteristic features using slope thresholding and relative magnitude comparison 利用斜率阈值和相对幅度比较检测心电特征
D. Sadhukhan, M. Mitra
{"title":"Detection of ECG characteristic features using slope thresholding and relative magnitude comparison","authors":"D. Sadhukhan, M. Mitra","doi":"10.1109/EAIT.2012.6407876","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407876","url":null,"abstract":"The paper proposes a simple and efficient algorithm for automatic detection of the characteristic points (Q, R, S, T, P peaks and onset and offset points) from a single lead digital ECG data. The squared double difference signal of the ECG data is used to localize the QRS regions and the significant peak in the QRS regions are detected by relative magnitude comparison and peak intervals are processed according to some criteria to ensure accuracy of detection. Next the other peaks in the QRS region are detected with respect to the significant peak to make the algorithm adaptive to different QRS morphologies. The T wave features are then detected by magnitude and slope threshold based search on selected windows. The performance of the algorithm is tested on 12-lead ECG data from the PTB diagnostic ECG database, and a high detection sensitivity of 99.8% is detected.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039593","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}
引用次数: 19
Brain tumor detection from MR images: Image processing, slicing and PCA based reconstruction 从MR图像中检测脑肿瘤:图像处理、切片和基于PCA的重建
R. Bhattacharjee, M. Chakraborty
{"title":"Brain tumor detection from MR images: Image processing, slicing and PCA based reconstruction","authors":"R. Bhattacharjee, M. Chakraborty","doi":"10.1109/EAIT.2012.6407871","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407871","url":null,"abstract":"In this paper, a novel algorithm is developed to feature out tumor from diseased brain Magnetic Resonance (MR) images. In this work, based on a study of quality parameter comparison of two filters, adaptive median filter is selected for de-noising the images. Image slicing and identification of significant planes are done. Logical operations are applied on selected slices to obtain the processed image showing the tumor region. A novel image reconstruction algorithm is developed based on the application of Principal Components Analysis (PCA). This reconstruction algorithm is applied on original raw images as well as on the processed images. Results of this work confirm the sole efficiency of the developed image processing algorithm to detect brain tumor. For this work randomly chosen 20 normal brain MR images and 20 brain tumor MR images are considered. Also in this work, statistical significance testing is carried out to justify the uniformity of population means of the processed output. Finally normal and processed outputs are compared.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131076570","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}
引用次数: 19
Comprehensive testing methodology for the operational National Grid Computing infrastructure — GARUDA 国家网格计算基础设施的综合测试方法
N. Mangala, A. Jacob, Prahlada Rao B.B., S. Chattopadhyay
{"title":"Comprehensive testing methodology for the operational National Grid Computing infrastructure — GARUDA","authors":"N. Mangala, A. Jacob, Prahlada Rao B.B., S. Chattopadhyay","doi":"10.1109/EAIT.2012.6407878","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407878","url":null,"abstract":"Grid computing is a collaborative e-infrastructure to solve large multidisciplinary problems having interrelated demands of data, compute, scientific instruments and increased importance of collaboration. Grid is a distributed system which enables sharing, selection, and aggregation of heterogeneous geographically distributed autonomous resources dynamically depending on their availability, capability, performance, and users QoS requirements. Validating such a vast system has additional complexities of heterogeneity, multiple administrative policies, and issues of multi-layer software interactions. GARUDA is the Indian National Grid Computing Initiative connecting over 65 partnering institutes across 30 cities of India and aggregating over 70TF-15TB Compute-Storage power. The authors present the software engineering challenges and validation methodologies for GARUDA, to make it a production level grid. Integrated validation of GARUDA through Application testing, Health Monitoring, Middleware-Software testing, Performance benchmarking and Stress testing are described.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"80 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114038425","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
A transport protocol for congestion avoidance in Wireless Sensor Networks using cluster-based single-hop-tree topology 一种基于集群的单跳树拓扑的无线传感器网络拥塞避免传输协议
A. Chatterjee, A. Mukhopadhyay, D. Mukherjee
{"title":"A transport protocol for congestion avoidance in Wireless Sensor Networks using cluster-based single-hop-tree topology","authors":"A. Chatterjee, A. Mukhopadhyay, D. Mukherjee","doi":"10.1109/EAIT.2012.6407982","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407982","url":null,"abstract":"This paper proposes a transport protocol using cluster-based single hop tree topology for congestion avoidance in Wireless Sensor Networks (WSNs) under noisy environments. In this model, a WSN is divided into several clusters containing varied density of sensors according to the accuracy desired where a sensor as the head of one cluster is a child node of some other cluster so that the entire network is arranged in a tree topology with the root node as the sink. A sensor senses and measures predefined set of parameters from the noisy environment to transmit these to other sensors of the cluster. Each sensor continues to update its stored data integrating the parameter values received from other sensors till these converges to the estimated true value. The cluster heads transmit the received data to their corresponding parent nodes hop-by-hop until these reach the sink node. Simulation results show that a rapid convergence coupled with the cluster-tree topology, leads to congestion avoidance and energy minimization in the WSN. Analysis reveals that this protocol scheme is suitable for both continuous and event based monitoring in noisy environment and can be made adaptive to the changing requirements.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123077925","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}
引用次数: 9
Holistic recognition of handwritten Tamil words 泰米尔语手写文字的整体识别
Thadchanamoorthy Subramaniam, U. Pal, H. Premaretne, N. Kodikara
{"title":"Holistic recognition of handwritten Tamil words","authors":"Thadchanamoorthy Subramaniam, U. Pal, H. Premaretne, N. Kodikara","doi":"10.1109/EAIT.2012.6407887","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407887","url":null,"abstract":"In this paper, we describe a writer independent method for recognizing offline unconstrained handwritten Tamil words/strings. Touching and overlapping are main bottleneck of handwriting recognition and to overcome this, we adopted a holistic approach here. To handle various handwritings of different individuals, at first, some pieces of preprocessing work are done on an input word. Next, Gabor based features are computed on the processed word. These Gabor features along with other geometric features of the word image are then fed to an SVM classifier for recognition. In our experimental study, we have used 4270 samples (collected from the class of 217 country names) written in Tamil and obtained 86.36% recognition rate.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115410899","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
Fuzzy min-max neural network for satellite infrared image clustering 模糊最小-最大神经网络用于卫星红外图像聚类
B. Goswami, G. Bhandari, S. Goswami
{"title":"Fuzzy min-max neural network for satellite infrared image clustering","authors":"B. Goswami, G. Bhandari, S. Goswami","doi":"10.1109/EAIT.2012.6407913","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407913","url":null,"abstract":"The process of estimation of precipitation from satellite images begins with the detection and identification of convective clouds. Clustering of the satellite infrared images is required in order to estimate the cloud cover area. In this paper a neuro-fuzzy technique in the form of unsupervised fuzzy minmax clustering neural (FMMCN) network has been implemented for clustering satellite infrared image. Each cluster is in the form of an n-dimensional hyperbox defined by minimum and maximum points and a fuzzy membership function. FMMCN suits this application area because it is completely unsupervised and hence, unlabeled data can be used with it. Also the number of clusters is not required to be mentioned at the beginning as it is calculated dynamically.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122874755","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}
引用次数: 9
Evolutionary algorithms and cellular automata towards image reconstruction 图像重建的进化算法和元胞自动机
F. Seredyński, J. Skaruz
{"title":"Evolutionary algorithms and cellular automata towards image reconstruction","authors":"F. Seredyński, J. Skaruz","doi":"10.1109/EAIT.2012.6407924","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407924","url":null,"abstract":"In the paper we present a new approach based on evolutionary algorithms and cellular automata to the image reconstruction problem. Two-dimensional, nine state cellular automata with Moore neighbourhood perform reconstruction of an image presenting a human face. Large space of automata rules is searched through efficiently by a genetic algotihm (GA), which finds a good quality rule. Experimental results present that obtained rule allows to reconstruct an image with even 70% damaged pixels. Moreover, we also show that a rule found in the genetic evolution process can be applied to the reconstruction of images of the same class but not presented during the evolutionary process.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"42 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120868317","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
Realization of orthogonal codes in optical information processing 正交码在光信息处理中的实现
G. Maity, S. Maity
{"title":"Realization of orthogonal codes in optical information processing","authors":"G. Maity, S. Maity","doi":"10.1109/EAIT.2012.6407930","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407930","url":null,"abstract":"Spread spectrum (SS) has proven to be an efficient transmission scheme due to its antijamming and interference reduction capability. In multiuser environment, users are assigned distinguishable unique codes with low cross correlation (CC) values among each other. Walsh-Hadamard codes are an important class of spreading codes that allow construction of long sequences with desired cross correlation values. Optical realization of Walsh-Hadamard codes becomes important for optical code division multiple access (CDMA). Design needs the use of nonlinear optics capable of handling multivalued signal. To this aim, this paper proposes an all-optical design of Walsh-Hadamard codes that exploit the polarization properties of light.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121259384","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
Reversible image watermarking using modified difference expansion 采用改进差分展开的可逆图像水印
H. Maity, S. Maity
{"title":"Reversible image watermarking using modified difference expansion","authors":"H. Maity, S. Maity","doi":"10.1109/EAIT.2012.6407936","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407936","url":null,"abstract":"Reversible watermarking (RW) using difference expansion (DE) is quite popular to embed data followed by recovery of the original image. According to this algorithm, the least significant bit (LSB) of inter-pixel differences (between a pair of neighboring pixel) is used to embed watermark data. In the existing DE based works, a large part of the embedding space is used by auxiliary embedding information; hence, effective payload is sacrificed. To this aim, a modification in DE is proposed here that not only increases embedding space but also makes an improvement in imperceptibility and security of the hidden data. Simulation results show an improvement of 2.29 dB in visual quality and 0.002605 in security (Kullback-Leibler distance) measure at 0.49 bpp watermark payload.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130330785","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
IIR system identification using Particle Swarm Optimization with Improved Inertia Weight approach 基于改进惯性权重的粒子群算法的IIR系统辨识
S. Saha, D. Mandal, R. Kar, M. Saha, S. Ghoshal
{"title":"IIR system identification using Particle Swarm Optimization with Improved Inertia Weight approach","authors":"S. Saha, D. Mandal, R. Kar, M. Saha, S. Ghoshal","doi":"10.1109/EAIT.2012.6407858","DOIUrl":"https://doi.org/10.1109/EAIT.2012.6407858","url":null,"abstract":"In this paper a modified version of swarm intelligence technique called Particle Swarm Optimization with Improved Inertia Weight (PSOIIW) approach is applied to IIR adaptive system identification problem. The proposed technique PSOIIW performs a structured randomized search of an unknown parameter within a multidimensional search space by manipulating a swarm of particles to converge to an optimal solution. In this technique iteration based inertia weight is calculated individually for each particle that results in better search within the multidimensional search space. The exploration and exploitation of entire search space can be handled efficiently with the proposed PSOIIW along with the benefits of overcoming the premature convergence and stagnation problems. The simulation results justify the optimization efficacy of the proposed PSOIIW over RGA and PSO.","PeriodicalId":194103,"journal":{"name":"2012 Third International Conference on Emerging Applications of Information Technology","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131771676","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学术官方微信