D. Verma, Nimisha Garg, Neha Garg, Neha Mishra, G. Dosi
{"title":"Development of descriptors for natural feature identification on IRS LISS III images","authors":"D. Verma, Nimisha Garg, Neha Garg, Neha Mishra, G. Dosi","doi":"10.1109/ICM2CS.2010.5706718","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706718","url":null,"abstract":"CBIR is a technique which aims at retrieving images which are perceptually and semantically meaningful by making the best use of a single or combination of visual content descriptors. The application domain of this technique generally excludes satellite images, but this paper explores the usability of CBIR on satellite imagery obtained from well known Indian Remote Sensing (IRS LISS III sensor) satellite. One can ponder over the contribution of remotely sensed data towards diverse scientific and commercial purposes. Hence, it is reasonable to selectively identify and characterize the natural surface features, e.g., hills, rivers, trees, fields, forests and soils and recognise objects like aeroplane, oil tank, ships, etc. The interpretation and analysis of such features is a major step in transforming the remotely sensed data into information that is intelligible and usable. Object/region identification and search form challenging tasks in image interpretation which is itself a hot research area under the broad spectrum of CBIR. Computer-assisted search for an object can be done in an image by extracting one or more salient characteristics like shape, color, texture, and pattern. This paper presents a pixel by pixel search of exactly or relatively similar occurrences of the queried region/object considering a fusion of two prominent descriptors namely, texture and color as search criteria. The task has been done in a distributed fashion.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"44 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":"125640969","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}
M. Gupta, Akshara Pande, Rajwant Singh Rao, A. Tripathi
{"title":"Design Pattern Detection by normalized cross correlation","authors":"M. Gupta, Akshara Pande, Rajwant Singh Rao, A. Tripathi","doi":"10.1109/ICM2CS.2010.5706723","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706723","url":null,"abstract":"Design Pattern Detection has been documented so far in the literature. The knowledge of design Pattern existence in the program improves the program understanding and software maintenance. Design pattern is a technology for design reuse. Experts store their experiences in the form of design patterns. Reengineering done by novice users will be successful if a reliable design pattern mining exists. There are 23 design patterns defined by experts. Here we are taking the UML diagrams corresponding to design pattern and corresponding to source code. Our main aim is to find out whether a particular design pattern exists in system design (source code) or not. For this we have extracted the relationship graphs (consisting of nodes and edges), and then tried to detect the design pattern. In this paper we have applied normalized cross correlation and taking design pattern as a template tried to find out its existence in system design. Normalized cross correlation (NCC) has been used extensively for many machine vision applications. Normalized cross correlation has been commonly used to evaluate the degree of similarity or dissimilarity between two images.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"27 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":"114724936","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}
Rakesh Mohanty, H. Behera, S. Tripathy, B. Nayak, Ankit Agrawal, S. Mallick, S. Sourav
{"title":"Comparative performance analysis of proposed variants of list accessing algorithms using centralized cost model with doublylinked list","authors":"Rakesh Mohanty, H. Behera, S. Tripathy, B. Nayak, Ankit Agrawal, S. Mallick, S. Sourav","doi":"10.1109/ICM2CS.2010.5706719","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706719","url":null,"abstract":"For the list accessing problem, the standard cost model developed by Sleator and Tarjan[5] is most widely used for cost computation. In this paper, we have proposed a new effective cost model for the list accessing problem which uses doubly linked list as the data structure. We have proposed three new variants of MTF, TRANSPOSE and FC algorithms using our proposed cost model. Experimental analysis has been done for our proposed algorithms Move-To-Middle (MTM), Double Transpose (DT) and Double Frequency Count(DFC) for different dataset. For each algorithm, we have generated some input pattern where each of the algorithms performs optimally. We have made a comparative performance analysis of our proposed algorithms.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"360 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":"122782836","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}
{"title":"Image compression analysis using multistage vector quantization based on discrete wavelet transform","authors":"A. Brifcani, Jwan Najeeb Al-Bamerny","doi":"10.1109/ICM2CS.2010.5706717","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706717","url":null,"abstract":"A fundamental goal of digital image compression is to reduce the bit rate for transmission or data storage while maintaining an acceptable fidelity or image quality. In this study a proposed coding (compression) scheme for grey scale image by combining discrete wavelet transform (DWT), multistage vector quantization (MSVQ) and Huffman coding is presented. These combinations are utilized to take the advantages provided by all of them to get high compression ratio with acceptable recovered image quality in term of Peak Signal to Noise Ratio (PSNR) instead of using each method separately. First, the discrete wavelet transform is performed on the original image using bi-orthogonal 9/7 filter (bior4.4) resulting in number of sub-bands according to the decomposition level that can be one, two or three in the proposed scheme. Huffman coding applied on the approximation sub-band, and on the indices of the last level detail sub-bands that are vector quantized by two stages using LBG algorithm which forms the basis of most vector quantizer designs, other detail sub-bands set to zero if the decomposition level is greater than one to increase the compression ratio.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"60 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":"120961060","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}
{"title":"Implementation of data compression using Huffman coding","authors":"K. Babu, V. S. Kumar","doi":"10.1109/ICM2CS.2010.5706721","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706721","url":null,"abstract":"Huge data system applications require storage of large volumes of data set, and the number of such applications is constantly increasing as the use of computers extends to new disciplines. At the same time, the proliferation of communication networks is resulting in massive transfer of data over communication links. Compressing data to be stored or transmitted reduces storage and communication costs. When the amount of data to be transmitted is reduced, the effect is that of increasing the capacity of the communication channel. Here efficient method for decoding the compressed data is proposed. This paper aims toward the implementation of a high speed Huffman decoding system. This proposed model enhances the speed of decoding operation. The model is implemented using VHDL language, simulated on Active HDL 5.1, synthesized, placed and routed and floorplaned using Xilinx tools.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"263 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":"125809438","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}
{"title":"Performance evaluation of Mobile Ad hoc Network routing protocols under various security attacks","authors":"Yogesh Sharma, Amandeep Sharma, J. Sengupta","doi":"10.1109/ICM2CS.2010.5706730","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706730","url":null,"abstract":"Few characteristics of a Mobile Ad hoc Network, such as dynamic topology and shared wireless medium, pose various security challenges. This paper focuses on the performance investigation of reactive and proactive MANET routing protocols, namely, AODV and OLSR, under various the security attacks, where two types of attacks have been investigated. Network performance is evaluated in terms of end to end delay, retransmission attempts, network load and throughput, when a percentage of nodes misbehave. Simulation results show that under the passive attacks, proactive protocols perform well and under the active attacks, performance of reactive protocols is robust.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"26 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":"122098448","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}
{"title":"Automated knowledge engineering using rough set approach","authors":"B. K. Mishra, S. Bissoyi, S.K. Das","doi":"10.1109/ICM2CS.2010.5706711","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706711","url":null,"abstract":"Knowledge engineering refers to the building, maintaining and development of knowledge-based systems. It has a great deal in common with software engineering and is related to many computer science domains such as artificial intelligence, database, data mining, expert systems, decision support system and geographic information system. The main motto of rough sets is: “Let the data speak for themselves”. Rough sets are based theory of sets. Main applications of rough sets theory are attribute reduction, rule generation and prediction. This article outlines conceptualization and implementation of an intelligent system capable of extracting knowledge from databases.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"30 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":"125724066","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}
{"title":"Rough set based gene selection algorithm for microarray sample classification","authors":"Sushmita Paul, P. Maji","doi":"10.1109/ICM2CS.2010.5706710","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706710","url":null,"abstract":"Gene selection from microarray data is an important issue for gene expression based classification and to carry out a diagnostic test. In this regard, a rough set based gene selection algorithm is presented. It selects the set of genes by maximizing the relevance and significance of the genes, which are calculated based on the theory of rough sets. Using the predictive accuracy of K-nearest neighbor rule and support vector machine, the performance of the proposed algorithm, along with a comparison with other related methods is studied on five cancer and two arthritis microarray data sets. Promising performance was achieved by the proposed gene selection algorithm with relevant and significant genes from microarray data set in a reasonable time.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"68 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":"123497551","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}
{"title":"Synthesis and performance analysis of a Recurrent Fuzzy Multilayer Perceptron for speech recognition","authors":"Akshay Gupta","doi":"10.1109/ICM2CS.2010.5706713","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706713","url":null,"abstract":"A novel speech recognition method has been proposed which combines the capabilities of a Recurrent Fuzzy Multilayer Perceptron (MLP) to the existing Mel Frequency Cepstral Coefficients (MFCC) model, synthesized using JAVA. Performance analysis of the proposed recurrent fuzzy MLP relative to a speech recognition system has been shown using MATLAB. Owing to its short-term memory effect in addition to inherent neuro-fuzzy model advantages, the simulation results obtained were significantly better than offered by a crisp neural network.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"29 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":"123447293","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}
{"title":"An improved architecture for minimizing handover latency in MIPv6","authors":"Shilpy Gupta, S. Gambhir","doi":"10.1109/ICM2CS.2010.5706728","DOIUrl":"https://doi.org/10.1109/ICM2CS.2010.5706728","url":null,"abstract":"With the advent of mobile devices, the internet now undertook a huge and unexpected explosion of growth. The wireless mobile internet gives users access to the internet services while they are on the move. This mobility has been supported through the Internet Protocol known as Mobile IP. Mobile IP allows users with mobile devices to have continuous network connectivity to the internet without changing their IP addresses when moving from one network to another. While on move, the Mobile Node (MN) undergoes a handover process, in which the MN gets disconnected from one network and tries to connect to another network, i.e., New Access Router (NAR). The handover process involves various time-consuming procedures as Neighbor Discovery, Care-of-Address (CoA) configuration, Duplicate-Address-Detection (DAD), Binding Registration and Route Optimization. Various researches have been devoted to the acceleration of movement detection and registration. However, a time-consuming operation, i.e., duplicate-address detection (DAD), was overlooked by most studies. An improved architecture for minimizing the handover latency in MIPv6 is improved in this paper. The improved architecture suggests the removal of DAD procedure and configuration of a new CoA for the MN by the NAR. The result is evaluated on the basis of numerical analysis.","PeriodicalId":320437,"journal":{"name":"2010 International Conference on Methods and Models in Computer Science (ICM2CS-2010)","volume":"68 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":"121095421","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}