INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706171
S. Pedduri
{"title":"Towards navigating mobile robot to an arbitary goal position and angle","authors":"S. Pedduri","doi":"10.1109/INTERACT.2010.5706171","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706171","url":null,"abstract":"Mobile robot navigation has been active area for research. Most of the existing mobile robot navigation methods consider a goal position in 2D C-Space which does not include the final facing angle. The final facing angle (called heading hence forth), becomes very crucial while navigating robot to many successive goal positions. This paper proposes a reactive method towards navigating a holonomic or non-holonomic mobile robot to reach a goal position with given heading. The algorithm proceeds in evaluating an optimization function over discretized dynamic linear and angular velocity ranges, and selecting appropriate velocities. The method extends the existing Dynamic Window approaches to incorporate an additional goal parameter i.e. the final heading angle. The novelty of the proposed method is in considering heading as angle in 3D C-Space, which enables robot to reach final heading angle. We provide simulation results for non-holonomic robot to validate the method.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114860968","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706187
D. Devi, V. Maheswari, P. Thambidurai
{"title":"Similarity search in Recent Biased time series databases using Vari-DWT and Polar wavelets","authors":"D. Devi, V. Maheswari, P. Thambidurai","doi":"10.1109/INTERACT.2010.5706187","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706187","url":null,"abstract":"A time series database is a collection of data that are generated in series as time goes on and constitutes a large portion of data stored in computers like stock-price movements, weather data, bio-medical measurements, video data etc., Two time sequences of same length are said to be similar if the Euclidean distance is less or equal to a given threshold. The main issue of similarity search in time series databases is to improve the search performance since time sequences are usually of high dimension. So it is important to reduce the search space for efficient processing of similarity search in large time series databases. Popular techniques for efficient retrieval of time sequences in time series databases are DFT, DWT, SVD, PAA, PCA, APCA etc., In this paper we explore the feasibility of using Vari-DWT and Polar wavelet with a comprehensive analysis of the two methods as matching functions which can improve the search performance in Recent-Biased time series databases. Vari-DWT is fast to compute and requires little storage for each sequence, It preserves Euclidean distance and recency and also allows good approximation with a subset of coefficients. But it shows poor performance for locally distributed time series data which are clustered around certain values since it uses averages to reduce the dimensionality of data. Polar wavelet uses polar coordinates which are not affected from averages and so can improve the search performance especially in locally distributed time series databases. Moreover, DWT has the limitation that it works best if the length of time series 2n otherwise it approximates the signal by adding 0 to the right side of the series to make the length to be 2n which distorts the original signal. Polar wavelet works with time sequences of any length without distorting the original signal. The effectiveness of Vari-DWT and Polar wavelets are evaluated empirically on real weather data and synthetic datasets.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129267144","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706144
K. Vasanth, S. Raj, S. Karthik, P. P. Mol
{"title":"Fpga implementation of optimized sorting network algorithm for median filters","authors":"K. Vasanth, S. Raj, S. Karthik, P. P. Mol","doi":"10.1109/INTERACT.2010.5706144","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706144","url":null,"abstract":"Median filters commonly used in image processing applications for the removal of impulse noise. Over the years so many median filters such as are separable median filters, recursive median filters, weighted median filters, max-median filters and multistage median filters were developed. Sorting networks are of major concern for real time hardware implementation of filters. Sorting is a computationally expensive operation as it consumes large area, speed and power. In this work, effective VLSI hardware implementation has been proposed as an economical solution for sorting networks in terms of area speed, power. The proposed work uses a new carry select comparator in the first section which uses compare and swap functions and its pipelined version in second section, thereby reducing the complexity of the sorting networks. The proposed Carry select comparator uses one half subractor, 7 full subractor, few multiplexers and inverters. The proposed algorithm will definitely overcome the problems by performing median calculation within 7 clock cycles. This work had been compared with existing carry select logic and its pipelined version occupies which occupies less area, consumes low power and works at 113.225 MHz for the device Devices XC2s100e–7tq144.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"324 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122711461","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706185
K. Nirmal, S. Ewards, K. Geetha
{"title":"Maximizing online security by providing a 3 factor authentication system to counter-attack 'Phishing'","authors":"K. Nirmal, S. Ewards, K. Geetha","doi":"10.1109/INTERACT.2010.5706185","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706185","url":null,"abstract":"Phishing is a kind of online security attack where the attacker creates a replica of an existing web page to fool users in order to hack their personal, financial, or password data. The statistics today reveal that the current Anti-Phishing system has failed to prevent Phishing completely. In this paper an Anti-Phishing algorithm is proposed which is termed as Phish-Secure. Phish-Secure use the concept of Image Similarity Detection so as to identify the exact site the user tends to visit. Phish-Secure is simple, secure and efficient. In terms of simplicity, Phish-Secure utilize a three factor authentication system which successfully detects and prevents all Phishing attacks. In terms of security, Phish-Secure can detect not only known but also unknown Phishing attacks. Phish-Secure identifies and verifies the destination address from the outbound packet which establishes the connection with the remote server, thereby verifying whether the user is connected to the server which he actually tends to connect. In terms of efficiency, Phish-Secure will integrate a system which performs an actual URL verification and the traditional Blacklisting technique, thus reducing the time taken to detect Phishing. Thus Phish-Secure will successfully counterattack Phishing","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131363983","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706208
Chanpreet Kaur, R. Mehra
{"title":"An FPGA implementation efficient equalizer for ISI removal in wireless applications","authors":"Chanpreet Kaur, R. Mehra","doi":"10.1109/INTERACT.2010.5706208","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706208","url":null,"abstract":"In telecommunication, Intersymbol interference (ISI) is caused by multipath propagation. The bandlimited frequency selective time dispersive channel distorts the transmitted signal, causing successive symbols to blur together. Therefore, the main objective of designing the transmitter and receiver is to minimize the effects of intersymbol interference, and thereby deliver the digital data to its destination with the smallest error rate possible. In this paper Adaptive Equalization technique is used to combat intersymbol interference. The proposed model is synthesized with ISE, simulated with Modelsim and implemented on Virtex2 based xc2v1500–5bg575 target device. The result shows that proposed model has the advantages of reduction in ISI using simple and less computational complex LMS algorithm along with enhanced performance in terms of speed, cost and area with existing results.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125196018","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706190
P. Nandhini, S. Roslin, N. Nandhitha
{"title":"A reversible encryption technique for storing weld piece related information during digital archiving of industrial radiographs","authors":"P. Nandhini, S. Roslin, N. Nandhitha","doi":"10.1109/INTERACT.2010.5706190","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706190","url":null,"abstract":"Archival of digital radiographs is the growing need in weld industries. However in addition to radiographs, the information about the weld piece must also be stored for future documentation. However the information about the radiographs may be confidential and should not be stored as such. Also matching the radiographs with the corresponding radiographs is also a major area of concern. Hence it necessitates an effective encryption technique that hides the information about the weld piece in the radiograph itself. The proposed technique involves hiding the nature of the weld defect in the radiographs. The paper also proposes an extraction technique to effectively extract the signature image.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125581697","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706188
A. M. Mahmood, M. Kuppa
{"title":"A composite splitting criterion using random sampling","authors":"A. M. Mahmood, M. Kuppa","doi":"10.1109/INTERACT.2010.5706188","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706188","url":null,"abstract":"The ever growing presence of data lead to a large number of proposed algorithms for classification and especially decision trees over the last few years. However, learning decision trees from large irrelevant datasets is quite different from learning small and moderate sized datasets. In practice, use of only small and moderate sized datasets is rare. Unfortunately, the most popular heuristic function gain ratio has a serious disadvantage towards dealing with large and irrelevant datasets. To tackle these issues, we design a new composite splitting criterion with random sampling approach. Our random sampling method depends on small random subset of attributes and it is computationally cheap to act on such a set in a reasonable time. The empirical and theoretical properties are validated by using 40 UCI datasets. The experimental result supports the efficacy of the proposed method in terms of tree size and accuracy.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129219525","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706174
R. Ramya
{"title":"Evolving bio-inspired robots for keep away soccer through genetic programming","authors":"R. Ramya","doi":"10.1109/INTERACT.2010.5706174","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706174","url":null,"abstract":"The social insects' behavior, especially the real ants' behavior inspired the computer scientists to solve a number of applications successfully. Based on this idea, this project study has made an attempt to investigate the effects on keep-away soccer, for evolving the various multiagent strategies necessary for its efficient functioning as a successful testbed. This is done through genetic programming by adopting some of the real ants' behavior. This work can be considered as a contribution to naturally inspired evolutionary techniques for solving creative problems.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121986244","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706179
B. N. Binoy, T. Keerthana, P. R. Barani, Abhinav Kaushik, Aswathy Sathees, S. Aswathy
{"title":"A GSM-based versatile Unmanned Ground Vehicle","authors":"B. N. Binoy, T. Keerthana, P. R. Barani, Abhinav Kaushik, Aswathy Sathees, S. Aswathy","doi":"10.1109/INTERACT.2010.5706179","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706179","url":null,"abstract":"Operations like radioactive waste handling, bomb disposal, surveillance, search and rescue are today performed mostly by humans at great risk to their own safety and well-being. In order to minimize direct human intervention in such operations, the design of a remotely operated versatile Unmanned Ground Vehicle (UGV) mounted with a robotic manipulator is presented in this paper. The robustness, range and security of the communication link between the remote base station and the robot, obstacle avoidance and the real time control of the robot are some of the major issues encountered while deploying such robots in the above scenarios. In this paper, the design of a versatile UGV which leverages the already existing GSM mobile telephony network to establish a longrange, secure, fast and reliable connection with the remote base station is presented. The UGV is also mounted with a robotic manipulator with four degrees of freedom with a gripper type end-effector, which can be used for grabbing objects and thus help in search and rescue type operations. The robot is equipped with IR sensors and camera for obstacle detection and avoidance. The camera is also used to send the visual information back to the base station in real-time, allowing accurate control of and monitoring over long distances.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122368304","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}
INTERACT-2010Pub Date : 2010-12-01DOI: 10.1109/INTERACT.2010.5706163
R. Sandesh, E. P. Kumar, N. Swetha
{"title":"SAR robo — New approach to robotics","authors":"R. Sandesh, E. P. Kumar, N. Swetha","doi":"10.1109/INTERACT.2010.5706163","DOIUrl":"https://doi.org/10.1109/INTERACT.2010.5706163","url":null,"abstract":"SAR robo signifies as Search and Rescue robo approach is being integrated with many degrees of freedom to achieve need based performances. The requirements of SAR is to perform task like Search and Rescue operations under critical situations like terrorists attack, Petroleum mining, bomb detections, exploring planets. Where the risk factor is high to the human system, under such circumstances a SAR robo will be very much useful to aggravate the man and material losses. Robo can be sent to the enemy place to get the information secretly as per instruction to trace the path.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121534757","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}