Mayank Agarwal, Mahendra Mehra, Renuka Pawar, D. Shah
Virtual Keyboard authentication has helped users to protect their username and passwords from being captured by key loggers, spyware and malicious bots. However Virtual Keyboard still suffers from numerous other fallacies that an attacker can take advantage of. These include click based screenshot capturing, over the shoulder spoofing and co-ordinate position noting. To overcome these drawbacks, we have designed a virtual keyboard that is generated dynamically each time the user access the web site. Also after each click event of the user the arrangement of the keys of the virtual keyboard are shuffled. The position of the keys is hidden so that a user standing behind may not be able to see the pressed key. Our proposed approach makes the usage of virtual keyboard even more secure for users and makes it tougher for malware programs to capture authentication details.
{"title":"Secure authentication using dynamic virtual keyboard layout","authors":"Mayank Agarwal, Mahendra Mehra, Renuka Pawar, D. Shah","doi":"10.1145/1980022.1980087","DOIUrl":"https://doi.org/10.1145/1980022.1980087","url":null,"abstract":"Virtual Keyboard authentication has helped users to protect their username and passwords from being captured by key loggers, spyware and malicious bots. However Virtual Keyboard still suffers from numerous other fallacies that an attacker can take advantage of. These include click based screenshot capturing, over the shoulder spoofing and co-ordinate position noting. To overcome these drawbacks, we have designed a virtual keyboard that is generated dynamically each time the user access the web site. Also after each click event of the user the arrangement of the keys of the virtual keyboard are shuffled. The position of the keys is hidden so that a user standing behind may not be able to see the pressed key. Our proposed approach makes the usage of virtual keyboard even more secure for users and makes it tougher for malware programs to capture authentication details.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116047473","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}
Road extraction in urban areas from high resolution satellite images helps in creating a database of a city and in cartography. The extraction results are intended to be used for updating a road database. The high dimensionality of aerial and satellite imagery presents a challenge to the human analysis based on the traditional classification algorithms using statistical assumptions. Artificial Neural Networks (ANNs) on the other hand may represent a valuable alternative approach for land cover mapping for such highly dimensional imagery. The urban areas contain roads of different shapes, sizes and lengths. In this paper, the extraction algorithm performs edge detection, morphological reconstruction, feature extraction and classification. The road features are classified using ANNs.
{"title":"Extraction of road network from high resolution satellite images using ANN","authors":"R. Mangala, S. Bhirud","doi":"10.1145/1980022.1980215","DOIUrl":"https://doi.org/10.1145/1980022.1980215","url":null,"abstract":"Road extraction in urban areas from high resolution satellite images helps in creating a database of a city and in cartography. The extraction results are intended to be used for updating a road database. The high dimensionality of aerial and satellite imagery presents a challenge to the human analysis based on the traditional classification algorithms using statistical assumptions. Artificial Neural Networks (ANNs) on the other hand may represent a valuable alternative approach for land cover mapping for such highly dimensional imagery. The urban areas contain roads of different shapes, sizes and lengths. In this paper, the extraction algorithm performs edge detection, morphological reconstruction, feature extraction and classification. The road features are classified using ANNs.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121325021","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}
Iris recognition has become a popular research in recent years due to its reliability and nearly perfect recognition rates. Iris recognition system has three main stages: Image preprocessing, Feature extraction and Template matching. In the preprocessing stage, iris segmentation is critical to the success of subsequent feature extraction and template matching stages. Most recent algorithm on template matching proposed by Libor Masek shows an improvement of 3.6 % over existing algorithm like Hamming Distance. This paper addresses for improvement to Libor Masek algorithm of Template matching method for Iris Recognition. The method evaluates on iris images taken from the CASIA iris image database version 1.0 and version 3. Experimental results show that the proposed approach has more efficient than to Libor Masek in terms of Template matching Time of about 99%, Creation of template is of about 10 % and False Rejection Ratio (FRR) is of about 10 %.
{"title":"Improvement to libor masek algorithm of template matching method for iris recognition","authors":"S. B. Kulkarni, R. Hegadi, U. Kulkarni","doi":"10.1145/1980022.1980303","DOIUrl":"https://doi.org/10.1145/1980022.1980303","url":null,"abstract":"Iris recognition has become a popular research in recent years due to its reliability and nearly perfect recognition rates. Iris recognition system has three main stages: Image preprocessing, Feature extraction and Template matching. In the preprocessing stage, iris segmentation is critical to the success of subsequent feature extraction and template matching stages. Most recent algorithm on template matching proposed by Libor Masek shows an improvement of 3.6 % over existing algorithm like Hamming Distance. This paper addresses for improvement to Libor Masek algorithm of Template matching method for Iris Recognition. The method evaluates on iris images taken from the CASIA iris image database version 1.0 and version 3. Experimental results show that the proposed approach has more efficient than to Libor Masek in terms of Template matching Time of about 99%, Creation of template is of about 10 % and False Rejection Ratio (FRR) is of about 10 %.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126632303","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}
For improving spatial reuse in a cellular network, consider augmenting it with wireless ad hoc connectivity. The coverage area of each base-station is reduced and the users that are within the area relay traffic to nodes outside the area; these users further relay data to more distant users within the cell. The resulting network is referred to as a Hybrid network. While this approach can result in shorter range higher-rate links and improved spatial reuse which, together favor a capacity increase, it relies on multi-hop forwarding which is detrimental to the overall capacity. The objective in this work is to evaluate the impact of these conflicting factors on the capacity of the hybrid network and determine if this capacity is higher than that of the original cellular network. Formally defined the capacity of the network as the maximum possible downlink throughput under the conditions of max-min fairness.
{"title":"Hybrid cellular adhoc network","authors":"S. Bukkawar, N. S. Killarikar","doi":"10.1145/1980022.1980200","DOIUrl":"https://doi.org/10.1145/1980022.1980200","url":null,"abstract":"For improving spatial reuse in a cellular network, consider augmenting it with wireless ad hoc connectivity. The coverage area of each base-station is reduced and the users that are within the area relay traffic to nodes outside the area; these users further relay data to more distant users within the cell. The resulting network is referred to as a Hybrid network. While this approach can result in shorter range higher-rate links and improved spatial reuse which, together favor a capacity increase, it relies on multi-hop forwarding which is detrimental to the overall capacity. The objective in this work is to evaluate the impact of these conflicting factors on the capacity of the hybrid network and determine if this capacity is higher than that of the original cellular network. Formally defined the capacity of the network as the maximum possible downlink throughput under the conditions of max-min fairness.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678229","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}
Power and Bandwidth are scarce resources in cellular communication. The limited radio spectrum is becoming scarcer with an increasing growth in cellular users and the new services offered by the advancement in cellular communication. Optimum utilization of limited bandwidth; in cellular communication is an important research topic, in which the main challenge lies in allocating a channel to the new caller in the system. Channel allocation problem is known to be NP hard. Various channel allocation schemes are available, out of which Dynamic Channel Allocation using Particle Swarm Optimization technique is implemented in this paper. The velocity update function is modified by introducing dynamically varying inertia and its effects are studied. This efficient allocation scheme will help in improving the efficiency of the system, by allocating the channels to the newly arrived call at a faster rate. The simulation is performed on well known bench mark problem. The results of which show that, we obtain the optimum solution at a faster rate and low values of call rejected ratio.
{"title":"Resource management in cellular communication using particle swarm optimization","authors":"G. Mundada, B. Chaudhari, P. Lohiya","doi":"10.1145/1980022.1980105","DOIUrl":"https://doi.org/10.1145/1980022.1980105","url":null,"abstract":"Power and Bandwidth are scarce resources in cellular communication. The limited radio spectrum is becoming scarcer with an increasing growth in cellular users and the new services offered by the advancement in cellular communication. Optimum utilization of limited bandwidth; in cellular communication is an important research topic, in which the main challenge lies in allocating a channel to the new caller in the system. Channel allocation problem is known to be NP hard. Various channel allocation schemes are available, out of which Dynamic Channel Allocation using Particle Swarm Optimization technique is implemented in this paper. The velocity update function is modified by introducing dynamically varying inertia and its effects are studied. This efficient allocation scheme will help in improving the efficiency of the system, by allocating the channels to the newly arrived call at a faster rate. The simulation is performed on well known bench mark problem. The results of which show that, we obtain the optimum solution at a faster rate and low values of call rejected ratio.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126346214","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}
Currently, the most effective standard used for data exchange over the Internet is the eXtensible Markup Language (XML). The greatest strength of XML is, it can represent many different kinds of information from diverse sources including structured and semi-structured documents. Because of the widespread adoption of XML, the ability to intelligently query XML data sources becomes increasingly important This paper describes a query language called XQuery, which is designed to use the structure of XML intelligently and can express queries across all the kinds of data sources.
{"title":"A survey of XQuery: an XML query language","authors":"T. Mujawar","doi":"10.1145/1980022.1980146","DOIUrl":"https://doi.org/10.1145/1980022.1980146","url":null,"abstract":"Currently, the most effective standard used for data exchange over the Internet is the eXtensible Markup Language (XML). The greatest strength of XML is, it can represent many different kinds of information from diverse sources including structured and semi-structured documents. Because of the widespread adoption of XML, the ability to intelligently query XML data sources becomes increasingly important This paper describes a query language called XQuery, which is designed to use the structure of XML intelligently and can express queries across all the kinds of data sources.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127801193","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, evaluates the performance of two ad-hoc multicast routing protocols under varying traffic, density and mobility conditions. We observe that a large fraction of the traffic is being carried on the Internet today by TCP. Thus internet traffic has inherently different characteristics than CBR traffic, which is commonly used traffic type for evaluating MANET routing protocols performance. Previous efforts to evaluate performance of TCP and CBR in tree-based multicast routing protocol (MAODV) are done. But these tree based protocols face lot of problem like single path property, vulnerable to high mobility and large group, single point of failure which are removed in mesh-based multicast routing protocol like ODMRP, ADMR etc. It is observe that mesh based protocol are robust enough and performance of CBR is more in mesh based protocol as compare to TCP.
{"title":"Comparing the performance of TCP and CBR in tree-based and mesh-based ad-hoc multicast routing protocol","authors":"V. V. Mandhare, P. Vikhe, N. S. Nehe","doi":"10.1145/1980022.1980201","DOIUrl":"https://doi.org/10.1145/1980022.1980201","url":null,"abstract":"This paper, evaluates the performance of two ad-hoc multicast routing protocols under varying traffic, density and mobility conditions. We observe that a large fraction of the traffic is being carried on the Internet today by TCP. Thus internet traffic has inherently different characteristics than CBR traffic, which is commonly used traffic type for evaluating MANET routing protocols performance. Previous efforts to evaluate performance of TCP and CBR in tree-based multicast routing protocol (MAODV) are done. But these tree based protocols face lot of problem like single path property, vulnerable to high mobility and large group, single point of failure which are removed in mesh-based multicast routing protocol like ODMRP, ADMR etc. It is observe that mesh based protocol are robust enough and performance of CBR is more in mesh based protocol as compare to TCP.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127744532","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 objective of segmentation of medical image is to extract and characterize anatomical structures from the images. Segmentation of medical is quiet difficult task because most images contain large noise. Canny operator has decent anti-noise ability. However Edge based canny operator is not consecutive and applying the canny operator on total image make reduces the performance of the system. In this paper, a new method of segmentation by the integration of 2D Otsu method with Canny edge detector and Region Growing is proposed. Here the first the low pass filter to reduce the noise and then Otsu thresholding method is used to extract the region of interest. In this system, Region Growing and Edge detection algorithm are executed parallel. This parallel executing system is used to get the edge map of image. This system is used to identify the Brain tumor. It is also used for Bone Fracture identification and Classification of Blood Cells. Experiments have shown that this system gives best segmentation results for brain tumor identification.
{"title":"Medical image segmentation for brain tumor detection","authors":"D. Gaikwad, P. Abhang, P. Bedekar","doi":"10.1145/1980022.1980035","DOIUrl":"https://doi.org/10.1145/1980022.1980035","url":null,"abstract":"The objective of segmentation of medical image is to extract and characterize anatomical structures from the images. Segmentation of medical is quiet difficult task because most images contain large noise. Canny operator has decent anti-noise ability. However Edge based canny operator is not consecutive and applying the canny operator on total image make reduces the performance of the system. In this paper, a new method of segmentation by the integration of 2D Otsu method with Canny edge detector and Region Growing is proposed. Here the first the low pass filter to reduce the noise and then Otsu thresholding method is used to extract the region of interest. In this system, Region Growing and Edge detection algorithm are executed parallel. This parallel executing system is used to get the edge map of image. This system is used to identify the Brain tumor. It is also used for Bone Fracture identification and Classification of Blood Cells. Experiments have shown that this system gives best segmentation results for brain tumor identification.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128966314","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 emergence of mobile computing provides the ability to access information at any time and place. Ubiquitous data access is the base of mobile computing and connectivity. Organizing and accessing massive amount of data on wireless communication networks in order to provide fast and low power access to users equipped with wireless devices is a new challenge to the data management and telecommunication communities. This paper provides a brief introduction to mobile database architecture, and enlist important issues related to management of data on move which could be available everywhere. The use of wireless communication makes the data availability the most important problem here especially for location dependent data. It further states the problem associated with Location dependent data in caching, cache invalidation and cache replacement.
{"title":"Ubiquitous information management system","authors":"M. Bhelotkar, U. Pawar","doi":"10.1145/1980022.1980144","DOIUrl":"https://doi.org/10.1145/1980022.1980144","url":null,"abstract":"The emergence of mobile computing provides the ability to access information at any time and place. Ubiquitous data access is the base of mobile computing and connectivity. Organizing and accessing massive amount of data on wireless communication networks in order to provide fast and low power access to users equipped with wireless devices is a new challenge to the data management and telecommunication communities.\u0000 This paper provides a brief introduction to mobile database architecture, and enlist important issues related to management of data on move which could be available everywhere. The use of wireless communication makes the data availability the most important problem here especially for location dependent data. It further states the problem associated with Location dependent data in caching, cache invalidation and cache replacement.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127489779","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}
Hyperspectral imagery provides richer information about materials than multispectral imagery. The new larger data volumes from hyperspectral sensors present a challenge for traditional processing techniques. Principal component analysis (PCA) has been the technique of choice for dimension reduction. Spectral data reduction and estimation using wavelet filter bank with perfect reconstruction can be considered for better results.
{"title":"Reduction and estimation of hyperspectral imagery using dual tree wavelet filter bank analysis with an orthogonal subspace projection approach","authors":"S. Swamy, B. Patel","doi":"10.1145/1980022.1980228","DOIUrl":"https://doi.org/10.1145/1980022.1980228","url":null,"abstract":"Hyperspectral imagery provides richer information about materials than multispectral imagery. The new larger data volumes from hyperspectral sensors present a challenge for traditional processing techniques. Principal component analysis (PCA) has been the technique of choice for dimension reduction. Spectral data reduction and estimation using wavelet filter bank with perfect reconstruction can be considered for better results.","PeriodicalId":197580,"journal":{"name":"International Conference & Workshop on Emerging Trends in Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129023750","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
扫码关注我们
求助内容：
应助结果提醒方式：