Brain-computer interfaces (BCIs) aim to provide a non-muscular channel to communicate with the external world through the use of the brain Electroencephalograph (EEG) activity. A crucial step in such an operation is brain signal processing methods. BCI systems use EEG as it is practical, noninvasive, cheap and has real time capability imaging technology. BCI's efficiency is dependent on brain signal processing methods which classify brain signal patterns accurately in various tasks. The presence of artifacts in raw EEG signal makes it necessary to preprocess the signal for feature extraction. This paper presents a BCI system preprocessing and extracting features from EEG signals through the use of Walsh Hadamard Transform (WHT). Signal classification is done using Bagging techniques.
{"title":"Bagging of EEG Signals for Brain Computer Interface","authors":"K. Akilandeswari, G. M. Nasira","doi":"10.1109/WCCCT.2014.42","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.42","url":null,"abstract":"Brain-computer interfaces (BCIs) aim to provide a non-muscular channel to communicate with the external world through the use of the brain Electroencephalograph (EEG) activity. A crucial step in such an operation is brain signal processing methods. BCI systems use EEG as it is practical, noninvasive, cheap and has real time capability imaging technology. BCI's efficiency is dependent on brain signal processing methods which classify brain signal patterns accurately in various tasks. The presence of artifacts in raw EEG signal makes it necessary to preprocess the signal for feature extraction. This paper presents a BCI system preprocessing and extracting features from EEG signals through the use of Walsh Hadamard Transform (WHT). Signal classification is done using Bagging techniques.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"111 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115760928","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 demonstrates a method for the detection and extraction of features like optic disc and macula from the retinal images. Digital fundus images are becoming popular for the diagnosis of ophthalmic pathologies. Due to this, there is an increasing possibility of applying digital image processing techniques and methods in these images to m the make the diagnosis more easier. In this paper first bit plane separation is done to the pre-processed retinal image. To carry the vital information of the location of optic disc and macula are found by bit plane 0 and bit plane 1. The exact boundary is identified by applying mathematical morphology. The proposed algorithm is simple and has been evaluated on the images collected from a reputed eye hospital. An accuracy of 91% was obtained in extracting the optic disc and macula from the retinal image.
{"title":"Identification of Retinal Image Features Using Bitplane Separation and Mathematical Morphology","authors":"R. Radha, B. Lakshman","doi":"10.1109/WCCCT.2014.44","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.44","url":null,"abstract":"This paper demonstrates a method for the detection and extraction of features like optic disc and macula from the retinal images. Digital fundus images are becoming popular for the diagnosis of ophthalmic pathologies. Due to this, there is an increasing possibility of applying digital image processing techniques and methods in these images to m the make the diagnosis more easier. In this paper first bit plane separation is done to the pre-processed retinal image. To carry the vital information of the location of optic disc and macula are found by bit plane 0 and bit plane 1. The exact boundary is identified by applying mathematical morphology. The proposed algorithm is simple and has been evaluated on the images collected from a reputed eye hospital. An accuracy of 91% was obtained in extracting the optic disc and macula from the retinal image.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125823715","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}
Security is one of the most important issues in all the fields, wireless sensor networks is not an exception to this. Security in sensor networks can be achieved by data confidentiality, authentication, freshness, and integrity. One of the main mechanisms used for this purpose is encryption and decryption but due to resource constraints of the sensor nodes these mechanism may affect their performance and increase the computational complexity of the nodes. This paper aims to provide a simple secure protocol for providing an efficient secure system with low computational complexity and efficient resource utilization in wireless sensor networks.
{"title":"Simple Secure Protocol for Wireless Sensor Networks","authors":"B. Manjuprasad, A. Dharani","doi":"10.1109/WCCCT.2014.6","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.6","url":null,"abstract":"Security is one of the most important issues in all the fields, wireless sensor networks is not an exception to this. Security in sensor networks can be achieved by data confidentiality, authentication, freshness, and integrity. One of the main mechanisms used for this purpose is encryption and decryption but due to resource constraints of the sensor nodes these mechanism may affect their performance and increase the computational complexity of the nodes. This paper aims to provide a simple secure protocol for providing an efficient secure system with low computational complexity and efficient resource utilization in wireless sensor networks.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125836248","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 describes an approach for dendroclimatology. Image processing techniques and mathematical models are applied for identifying rings in a tree rings image. Analysing the tree rings pattern is a method of dating the tree, known as dendrochronology. But still the methods have to be improved for better performance. The past climatic changes are recorded in the growth of tree rings. The study of climatic changes in the rings is known as dendroclimatology. The density of tree rings is used to identify the past climate and estimate future also. This paper gives an approach for measuring the distance between two rings which helps for detecting the climate.
{"title":"An Approach for Dendroclimatology Using Image Processing Techniques","authors":"P. Sundari, S. B. R. Kumar","doi":"10.1109/WCCCT.2014.30","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.30","url":null,"abstract":"This paper describes an approach for dendroclimatology. Image processing techniques and mathematical models are applied for identifying rings in a tree rings image. Analysing the tree rings pattern is a method of dating the tree, known as dendrochronology. But still the methods have to be improved for better performance. The past climatic changes are recorded in the growth of tree rings. The study of climatic changes in the rings is known as dendroclimatology. The density of tree rings is used to identify the past climate and estimate future also. This paper gives an approach for measuring the distance between two rings which helps for detecting the climate.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126930874","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}
Online shopping is an e-commerce model that enables the customers to buy and vend any products over the internet. There are ubiquitous Web Pages that act as a third party dealer who intercede the buyer and the seller. This makes E-shopping customers to deviate from optimal shopping. A customer who seek to buy a product through e-shopping gives a visit to each site to ensure correct pricing and effective delivery. Each customer desires to buy a product from the consummate dealer, which is very tedious and time consuming. Thus to enhance online shopping, a new Dealer Identity in Online Shopping (DIOS) middleware architecture using complex event processing is designed. The time consumption in online shopping is reduced by the analysis of performance factors. The main intention of DIOS system is to provide the paramount dealers for proficient shopping. DIOS Middleware architecture redeems the optimal dealers to client by means of available criteria's like reputation and feedback. By the use of complex event processing, products pricings are serene from various dealer. The feedbacks parameters like cash on delivery, communications of the dealer, popularity, trustworthiness, quality of the product and delivery time, are unruffled from each buyer. On the basis of DIOS system, the optimal dealer is sorted out when pricing, feedback criteria and reputation parameters are met utterly.
{"title":"DIOS Middleware Architecture for the Identification of Performance Factors in E-Shopping With Complex Event Processing","authors":"V. Anitha, S. Karthikeyan, V. K. Kaliappan","doi":"10.1109/WCCCT.2014.49","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.49","url":null,"abstract":"Online shopping is an e-commerce model that enables the customers to buy and vend any products over the internet. There are ubiquitous Web Pages that act as a third party dealer who intercede the buyer and the seller. This makes E-shopping customers to deviate from optimal shopping. A customer who seek to buy a product through e-shopping gives a visit to each site to ensure correct pricing and effective delivery. Each customer desires to buy a product from the consummate dealer, which is very tedious and time consuming. Thus to enhance online shopping, a new Dealer Identity in Online Shopping (DIOS) middleware architecture using complex event processing is designed. The time consumption in online shopping is reduced by the analysis of performance factors. The main intention of DIOS system is to provide the paramount dealers for proficient shopping. DIOS Middleware architecture redeems the optimal dealers to client by means of available criteria's like reputation and feedback. By the use of complex event processing, products pricings are serene from various dealer. The feedbacks parameters like cash on delivery, communications of the dealer, popularity, trustworthiness, quality of the product and delivery time, are unruffled from each buyer. On the basis of DIOS system, the optimal dealer is sorted out when pricing, feedback criteria and reputation parameters are met utterly.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115956203","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. Vairachilai, M. Kavithadevi, G Gnanajeyaraman Rajaram
Confidential information exchange electronically in a secure way becomes very important in the age of computers. A newly proposed public key crypto method based on Chebyshev polynomials [16] recommend a new approach to data encryption. This paper provides an overview of three major types of public key cryptosystems mainly Diffie-Hellman Key Exchange Algorithm, the RSA Cryptosystem, the ElGamal Encryption Method and their implementation using Chebyshev Polynomials. During the past decade, there has been tremendous interest world-wide image encryption which is based on edge detail. In this method the image divided into two, one is the image contains edges and another is the image without edges, and encrypt the both images using encryption algorithm. The encrypted images are complex for intruder to decode, so it provides a high level of security.
{"title":"Public Key Cryptosystems Using Chebyshev Polynomials Based on Edge Information","authors":"S. Vairachilai, M. Kavithadevi, G Gnanajeyaraman Rajaram","doi":"10.1109/WCCCT.2014.21","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.21","url":null,"abstract":"Confidential information exchange electronically in a secure way becomes very important in the age of computers. A newly proposed public key crypto method based on Chebyshev polynomials [16] recommend a new approach to data encryption. This paper provides an overview of three major types of public key cryptosystems mainly Diffie-Hellman Key Exchange Algorithm, the RSA Cryptosystem, the ElGamal Encryption Method and their implementation using Chebyshev Polynomials. During the past decade, there has been tremendous interest world-wide image encryption which is based on edge detail. In this method the image divided into two, one is the image contains edges and another is the image without edges, and encrypt the both images using encryption algorithm. The encrypted images are complex for intruder to decode, so it provides a high level of security.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"08 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120972087","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}
Extracting useful information from dataset measuring in gigabytes and tetra bytes is a real challenge for data miners. Clustering algorithm have the problem of scalability while dealing with big data. The problem can be handled using parallel algorithm by executing them along with input data on high performance computer. The problem with graph based application requires much time for computation. PIC is an algorithm that is simple, fast, relatively scalable which requires the data and its associated matrix to fit in memory and this becomes infeasible for big data applications. Scalability has been increased using p-PIC and this paper focus on exploring different parallelization strategies for minimizing and compelling communication cost. The algorithm works on with a parallel framework MapReduce. P-PIC algorithm deals with Hadoop cloud a parallel store and computing platform implementing p-PIC using Hadoop framework.
{"title":"Parallel Processing of Big Data Using Power Iteration Clustering over MapReduce","authors":"D. Jayalatchumy, P. Thambidurai, A. A. Vasumathi","doi":"10.1109/WCCCT.2014.16","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.16","url":null,"abstract":"Extracting useful information from dataset measuring in gigabytes and tetra bytes is a real challenge for data miners. Clustering algorithm have the problem of scalability while dealing with big data. The problem can be handled using parallel algorithm by executing them along with input data on high performance computer. The problem with graph based application requires much time for computation. PIC is an algorithm that is simple, fast, relatively scalable which requires the data and its associated matrix to fit in memory and this becomes infeasible for big data applications. Scalability has been increased using p-PIC and this paper focus on exploring different parallelization strategies for minimizing and compelling communication cost. The algorithm works on with a parallel framework MapReduce. P-PIC algorithm deals with Hadoop cloud a parallel store and computing platform implementing p-PIC using Hadoop framework.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133023764","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}
There are software solutions for automating most of the processes and functionalities associated with the automation and management of a variety of our living environments such as homes, buildings, apartments, offices, manufacturing plants, hospitals, etc. Smarter services, systems and networks collectively play a very compelling role in visualizing and establishing next-generation personal as well as professional environments. However there are several notable challenges in implementing smarter networks which aid in crafting people-centric and adaptive applications and services. One among them is the network path optimization requirement. There are several methods and mechanisms in place for optimizing network path identification. The current approaches need to improve to suit for smarter buildings networks to live up to their expectations. In this paper, we have taken up the popular and proven Dijkstra algorithm and come out with a much-improved algorithm for realizing the much-anticipated flexibility and controllability in network path identification and optimization.
{"title":"Identification of Multiple Paths in Smarter Buildings Networks","authors":"S. Rajaraajeswari, R. Selvarani, P. Raj","doi":"10.1109/WCCCT.2014.38","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.38","url":null,"abstract":"There are software solutions for automating most of the processes and functionalities associated with the automation and management of a variety of our living environments such as homes, buildings, apartments, offices, manufacturing plants, hospitals, etc. Smarter services, systems and networks collectively play a very compelling role in visualizing and establishing next-generation personal as well as professional environments. However there are several notable challenges in implementing smarter networks which aid in crafting people-centric and adaptive applications and services. One among them is the network path optimization requirement. There are several methods and mechanisms in place for optimizing network path identification. The current approaches need to improve to suit for smarter buildings networks to live up to their expectations. In this paper, we have taken up the popular and proven Dijkstra algorithm and come out with a much-improved algorithm for realizing the much-anticipated flexibility and controllability in network path identification and optimization.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129521040","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 investigates the various training algorithm with Multi-Layer Perceptron Feed Forward Neural Network (MLPFFNN) and identify the best training algorithm for Indian Stock Exchange Market especially for BSE100 and NIFTY MIDCAP50. The forecasting accuracy is analyzed and measured with reference to an Indian stock market index such as Bombay Stock Exchange (BSE) and NIFTY MIDCAP50 in this study and it is found that the best training algorithm is Levenberg-Marquardt. All Training algorithms uses the 1-5-1 MLPFFNN architecture and its various parameter such as epochs, learning rate, etc are studied and the results are tabulated for the data division ratio 60%, 20% and 20% which represents training, validating and testing for all training algorithm.
{"title":"Performance Analysis of MLPFF Neural Network Back Propagation Training Algorithms for Time Series Data","authors":"D. A. Kumar, T. Yu, K. Huarng","doi":"10.1109/WCCCT.2014.47","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.47","url":null,"abstract":"This paper investigates the various training algorithm with Multi-Layer Perceptron Feed Forward Neural Network (MLPFFNN) and identify the best training algorithm for Indian Stock Exchange Market especially for BSE100 and NIFTY MIDCAP50. The forecasting accuracy is analyzed and measured with reference to an Indian stock market index such as Bombay Stock Exchange (BSE) and NIFTY MIDCAP50 in this study and it is found that the best training algorithm is Levenberg-Marquardt. All Training algorithms uses the 1-5-1 MLPFFNN architecture and its various parameter such as epochs, learning rate, etc are studied and the results are tabulated for the data division ratio 60%, 20% and 20% which represents training, validating and testing for all training algorithm.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125378296","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 result of various routing protocol of mobile ad-hoc networks use the concept of Euclidean space. Such approaches of this system will avail the mobile nodes position from previously used distance which measures static and dynamic mobile node positioning. The number of security issues increase when node position is known in advance. To put forth this, our strategy is to defect such security breaches using PSO and make an effective IDS. The simulated result portrays DREAM protocol to shoot out Sybil attack that replicates mobile id within the boundary. Our assumption is that the mobile boundary has the account of mobile node and its neighbor with their distance measurement taken from routing protocol. The usage of PSO provides fitness value that tends to identify the mobile node neighbor within the boundary and thus enhances secure zone for ad-hoc transmission.
{"title":"Secure Localized Node Positioning in Mobile Ad-Hoc Networks Using PSO","authors":"V. Subburaj, K. Chitra","doi":"10.1109/WCCCT.2014.29","DOIUrl":"https://doi.org/10.1109/WCCCT.2014.29","url":null,"abstract":"The result of various routing protocol of mobile ad-hoc networks use the concept of Euclidean space. Such approaches of this system will avail the mobile nodes position from previously used distance which measures static and dynamic mobile node positioning. The number of security issues increase when node position is known in advance. To put forth this, our strategy is to defect such security breaches using PSO and make an effective IDS. The simulated result portrays DREAM protocol to shoot out Sybil attack that replicates mobile id within the boundary. Our assumption is that the mobile boundary has the account of mobile node and its neighbor with their distance measurement taken from routing protocol. The usage of PSO provides fitness value that tends to identify the mobile node neighbor within the boundary and thus enhances secure zone for ad-hoc transmission.","PeriodicalId":421793,"journal":{"name":"2014 World Congress on Computing and Communication Technologies","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124338467","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
扫码关注我们
求助内容：
应助结果提醒方式：