Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844257
C. M. Shyamasree, Sheena Anees
Security is the important criteria relevant to information in transit as well as in storage. This paper proposes a highly secure method to hide the secret messages to prevent unauthorized access. The proposed method works in three levels. Single level of encryption and two levels of steganography are used. First level makes use of a DNA based playfair encryption. Second level hides the encrypted secret file in a randomly generated DNA sequence. In the third level, embedded DNA is hidden in an audio file. The main objective of the proposed method is that no one could be able to find the existence of the secret file.
{"title":"Highly secure DNA-based audio steganography","authors":"C. M. Shyamasree, Sheena Anees","doi":"10.1109/ICRTIT.2013.6844257","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844257","url":null,"abstract":"Security is the important criteria relevant to information in transit as well as in storage. This paper proposes a highly secure method to hide the secret messages to prevent unauthorized access. The proposed method works in three levels. Single level of encryption and two levels of steganography are used. First level makes use of a DNA based playfair encryption. Second level hides the encrypted secret file in a randomly generated DNA sequence. In the third level, embedded DNA is hidden in an audio file. The main objective of the proposed method is that no one could be able to find the existence of the secret file.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130727641","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844229
Aman Kumar, R. K. Sunkaria
Non-uniform filter banks (NUFBs) are being preferred because it divides the signal into unequal bands. Among perfect reconstruction (PR) and Nearly Perfect Reconstruction (NPR) filter banks, the later is preferred since the filter banks can be realized with minimal complexity. In this paper, a prototype filter is designed using the windowing techniques and the pass-band edge frequency (ωp) is optimized using the linear optimization technique for the design of a near perfect reconstructed filter bank. Among the different windowing techniques, Kaiser and dolph-chebyshev windows have been considered. The performance of the filter banks for each of these windowing techniques was measured in terms of Peak Reconstruction Error (PRE). These techniques are being applied on an Electro Cardio Gram (ECG) signal and their respective results are also being discussed.
{"title":"Design of prototype filter using windowing and linear optimization technique for the non-uniform filter banks","authors":"Aman Kumar, R. K. Sunkaria","doi":"10.1109/ICRTIT.2013.6844229","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844229","url":null,"abstract":"Non-uniform filter banks (NUFBs) are being preferred because it divides the signal into unequal bands. Among perfect reconstruction (PR) and Nearly Perfect Reconstruction (NPR) filter banks, the later is preferred since the filter banks can be realized with minimal complexity. In this paper, a prototype filter is designed using the windowing techniques and the pass-band edge frequency (ωp) is optimized using the linear optimization technique for the design of a near perfect reconstructed filter bank. Among the different windowing techniques, Kaiser and dolph-chebyshev windows have been considered. The performance of the filter banks for each of these windowing techniques was measured in terms of Peak Reconstruction Error (PRE). These techniques are being applied on an Electro Cardio Gram (ECG) signal and their respective results are also being discussed.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134229164","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844191
S. Ramesh, R. Indira, R. Praveen, P. G. Kumar
The Wireless and the Mobile Networks appear to provide a wide range of applications. Following these, the Mobile Ad hoc Networks (MANET) aid in wide development of many applications. The achievement of the real world applications are attained through effective routing. The Intermittently Connected Mobile Ad hoc Network (ICMANET) is a sparse network where a full connectivity is never possible. ICMANET is a disconnected MANET and is also a Delay Tolerant Network (DTN) that sustains for higher delays. The routing in a disseminated network is a difficult task. A new routing scheme called A-Routing (AR) is been proposed with a motto of achieving optimal result in delivering the data packet towards the destined node. A-Routing is proposed with the basis of Ant Colony Optimization technique (ACO). The routing in ICMNAET is done by means of Ant routing protocol. This paper enchants a novel routing methodology for data transmission in ICMANET.
{"title":"A-Routing for intermittently connected mobile ad hoc networks","authors":"S. Ramesh, R. Indira, R. Praveen, P. G. Kumar","doi":"10.1109/ICRTIT.2013.6844191","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844191","url":null,"abstract":"The Wireless and the Mobile Networks appear to provide a wide range of applications. Following these, the Mobile Ad hoc Networks (MANET) aid in wide development of many applications. The achievement of the real world applications are attained through effective routing. The Intermittently Connected Mobile Ad hoc Network (ICMANET) is a sparse network where a full connectivity is never possible. ICMANET is a disconnected MANET and is also a Delay Tolerant Network (DTN) that sustains for higher delays. The routing in a disseminated network is a difficult task. A new routing scheme called A-Routing (AR) is been proposed with a motto of achieving optimal result in delivering the data packet towards the destined node. A-Routing is proposed with the basis of Ant Colony Optimization technique (ACO). The routing in ICMNAET is done by means of Ant routing protocol. This paper enchants a novel routing methodology for data transmission in ICMANET.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133304801","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844273
Bharti Sharma, P. Neelakanta, V. Aalo, D. De Groff
RF channel characterization in forging conceivable short-range wireless links in nano-through femto-cells applications of WLAN/WPAN in long term evolution (LTE) context is considered. Relevant next-generation wireless-based indoor services are required to support multi-gigabit information transfer rates. As such, the associated electromagnetic (EM) spectral needs warrant accommodating almost unlimited wireless channels each shouldering enormous bandwidth. Relevant wireless transport requirements can be met with the span of EM spectra that currently remain unclaimed and unregulated. They exist as prospective resources in the frontiers of mm-wave range (spanning 30 GHz to terahertz band). Addressed in this study thereof is the feasibility of conceiving “inferential prototypes” of RF channel-models in the 30+ GHz through THz spectrum of indoor ambient by judiciously sharing the “similarity” of details pertinent to already existing (known) “models” of traditional, lower-side EM spectrum, (namely, VLF through micro-/mm-wave); and, an approach based on the principle of similitude due to Edgar Buckingham is invoked toward model-to-(inferential) prototype transformations. Examples on indoor path-loss estimation for line-of-sight (LoS) case is presented for the spectral range of interest and the efficacy of the proposal is outlined.
{"title":"Indoor RF-channel characterization of nano-through femto-cell ambient at millimeter-wave/THz frequencies in LTE contexts","authors":"Bharti Sharma, P. Neelakanta, V. Aalo, D. De Groff","doi":"10.1109/ICRTIT.2013.6844273","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844273","url":null,"abstract":"RF channel characterization in forging conceivable short-range wireless links in nano-through femto-cells applications of WLAN/WPAN in long term evolution (LTE) context is considered. Relevant next-generation wireless-based indoor services are required to support multi-gigabit information transfer rates. As such, the associated electromagnetic (EM) spectral needs warrant accommodating almost unlimited wireless channels each shouldering enormous bandwidth. Relevant wireless transport requirements can be met with the span of EM spectra that currently remain unclaimed and unregulated. They exist as prospective resources in the frontiers of mm-wave range (spanning 30 GHz to terahertz band). Addressed in this study thereof is the feasibility of conceiving “inferential prototypes” of RF channel-models in the 30+ GHz through THz spectrum of indoor ambient by judiciously sharing the “similarity” of details pertinent to already existing (known) “models” of traditional, lower-side EM spectrum, (namely, VLF through micro-/mm-wave); and, an approach based on the principle of similitude due to Edgar Buckingham is invoked toward model-to-(inferential) prototype transformations. Examples on indoor path-loss estimation for line-of-sight (LoS) case is presented for the spectral range of interest and the efficacy of the proposal is outlined.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133854205","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844249
V. Vaishnavi, M. Saritha, R. S. Milton
We can determine whether two texts are paraphrases of each other by finding out the extent to which the texts are similar. The typical lexical matching technique works by matching the sequence of tokens between the texts to recognize paraphrases, and fails when different words are used to convey the same meaning. We can improve this simple method by combining lexical with syntactic or semantic representations of the input texts. The present work makes use of syntactical information in the texts and computes the similarity between them using word similarity measures based on WordNet and lexical databases. The texts are converted into a unified semantic structural model through which the semantic similarity of the texts is obtained. An approach is presented to assess the semantic similarity and the results of applying this approach is evaluated using the Microsoft Research Paraphrase (MSRP) Corpus.
{"title":"Paraphrase identification in short texts using grammar patterns","authors":"V. Vaishnavi, M. Saritha, R. S. Milton","doi":"10.1109/ICRTIT.2013.6844249","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844249","url":null,"abstract":"We can determine whether two texts are paraphrases of each other by finding out the extent to which the texts are similar. The typical lexical matching technique works by matching the sequence of tokens between the texts to recognize paraphrases, and fails when different words are used to convey the same meaning. We can improve this simple method by combining lexical with syntactic or semantic representations of the input texts. The present work makes use of syntactical information in the texts and computes the similarity between them using word similarity measures based on WordNet and lexical databases. The texts are converted into a unified semantic structural model through which the semantic similarity of the texts is obtained. An approach is presented to assess the semantic similarity and the results of applying this approach is evaluated using the Microsoft Research Paraphrase (MSRP) Corpus.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114712036","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844236
Shivendra Mishra, A. Bhattacharjya
In this paper, we propose and implement a combined approach for identification of a given unknown sample of cipher text. In the first part of system, cipher text samples are generated randomly using different cipher algorithms. In the second part; the system analyses sample through a) Block Length/stream Detection b) Entropy/Reoccurrence Analysis c) Dictionary and Decision tree based approach. All these blocks analyzethe sample simultaneously. The block length/stream detection is done through counting the block length and by comparing to known sample's patterns. Whereas, the Entropy/reoccurrence analysis and Dictionary-Decision tree based approaches are done through the large data set characterization. At last, in the third part; the different block results are compared and result is generated. Finally, we analyze the system with unknown ciphertext samplesof AES, DES and Blow Fish, which is generated in random fashion and given as input to the system.
{"title":"Pattern analysis of cipher text: A combined approach","authors":"Shivendra Mishra, A. Bhattacharjya","doi":"10.1109/ICRTIT.2013.6844236","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844236","url":null,"abstract":"In this paper, we propose and implement a combined approach for identification of a given unknown sample of cipher text. In the first part of system, cipher text samples are generated randomly using different cipher algorithms. In the second part; the system analyses sample through a) Block Length/stream Detection b) Entropy/Reoccurrence Analysis c) Dictionary and Decision tree based approach. All these blocks analyzethe sample simultaneously. The block length/stream detection is done through counting the block length and by comparing to known sample's patterns. Whereas, the Entropy/reoccurrence analysis and Dictionary-Decision tree based approaches are done through the large data set characterization. At last, in the third part; the different block results are compared and result is generated. Finally, we analyze the system with unknown ciphertext samplesof AES, DES and Blow Fish, which is generated in random fashion and given as input to the system.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124376795","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844175
K. Saruladha, E. Thirumagal, G. Aghila
As the syntax based information retrieval yields very low precision, the researchers are moving to the semantic based information retrieval. The great challenge of the information retrieval system is to retrieve the related relevant information from the heterogeneous web resources. This paper aims for the retrieval of the relevant geo-spatial concepts from the geo-spatial ontology which aids application in quality testing of water and flood prediction. In the geo-spatial concept space, the retrieval of relevant geo-spatial concepts depends on the distance separating the two geo-spatial concepts and the context of the concepts. Research in geo-spatial information retrieval has used either the semantic distance between the geo-spatial concepts or the context of the concepts for computing the relevancy. This paper proposes HCC (Hybrid Conceptual Context) algorithm which aims at retrieving relevant geo-spatial concepts by considering both the semantic distance and the context on which the concepts occur in the geo-spatial space. This work computes the semantic similarity by measuring the semantic distance using Euclidean and Manhattan distance measure. This computation is carried out in two steps such as retrieval of semantically similar geo-spatial concepts and the retrieval of context dependent geo-spatial concepts. Semantic similarity computation in HCC algorithm retrieves contextually and semantically similar relevant geo-spatial concepts using Euclidean distance and Manhattan distance measures. Experiments have been done using Ordnance Survey Master Map datasource and geo-spatial ontology. The precision and recall show Manhattan based semantic similarity computation improves relevancy by 10%.
{"title":"Hybrid semantic similarity distance measures using conceptual contexts for geospatial information retrieval","authors":"K. Saruladha, E. Thirumagal, G. Aghila","doi":"10.1109/ICRTIT.2013.6844175","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844175","url":null,"abstract":"As the syntax based information retrieval yields very low precision, the researchers are moving to the semantic based information retrieval. The great challenge of the information retrieval system is to retrieve the related relevant information from the heterogeneous web resources. This paper aims for the retrieval of the relevant geo-spatial concepts from the geo-spatial ontology which aids application in quality testing of water and flood prediction. In the geo-spatial concept space, the retrieval of relevant geo-spatial concepts depends on the distance separating the two geo-spatial concepts and the context of the concepts. Research in geo-spatial information retrieval has used either the semantic distance between the geo-spatial concepts or the context of the concepts for computing the relevancy. This paper proposes HCC (Hybrid Conceptual Context) algorithm which aims at retrieving relevant geo-spatial concepts by considering both the semantic distance and the context on which the concepts occur in the geo-spatial space. This work computes the semantic similarity by measuring the semantic distance using Euclidean and Manhattan distance measure. This computation is carried out in two steps such as retrieval of semantically similar geo-spatial concepts and the retrieval of context dependent geo-spatial concepts. Semantic similarity computation in HCC algorithm retrieves contextually and semantically similar relevant geo-spatial concepts using Euclidean distance and Manhattan distance measures. Experiments have been done using Ordnance Survey Master Map datasource and geo-spatial ontology. The precision and recall show Manhattan based semantic similarity computation improves relevancy by 10%.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114594229","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844276
A. El-Aziz, A. Kannan
XML has been widely adopted for information exchange across various networks due to flexibility providing common syntax for messaging systems. XML documents may contain private information that cannot be shared by all user communities. Therefore, XML Security has a great importance to the overall security of the distributed systems. In this paper, we provide a comprehensive tutorial on XML security standards. The presented standards include XML signature and XML encryption. We describe how to create and verify XML signature and how to encrypt and decrypt XML data. This paper should serve as a roadmap for future research and basis for further exploration of relevant scientific literature and standard specifications.
{"title":"A comprehensive presentation to XML signature and encryption","authors":"A. El-Aziz, A. Kannan","doi":"10.1109/ICRTIT.2013.6844276","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844276","url":null,"abstract":"XML has been widely adopted for information exchange across various networks due to flexibility providing common syntax for messaging systems. XML documents may contain private information that cannot be shared by all user communities. Therefore, XML Security has a great importance to the overall security of the distributed systems. In this paper, we provide a comprehensive tutorial on XML security standards. The presented standards include XML signature and XML encryption. We describe how to create and verify XML signature and how to encrypt and decrypt XML data. This paper should serve as a roadmap for future research and basis for further exploration of relevant scientific literature and standard specifications.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116569204","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844280
R. Bharadwaj, J. Deepak, M. Baranitharan, V. Vaidehi
This paper proposes an improved traffic control system by having dynamic time limits at the traffic signal intersections. The proposed system uses sensors to find the traffic conditions to dynamically control the traffic. Prevailing static traffic control system may block emergency vehicles such as ambulance due to traffic congestion. The proposed Efficient Dynamic Traffic Control System (EDTCS) has Traffic Control Unit (TCU), Monitor Unit (MU) and Road Side Unit (RSU). RSU contains RFID reader which reads the unique RFID code for an emergency vehicle and send it to MU. MU uses sensors such as proximity switch and RFID tags to get the count of normal and emergency vehicles respectively and sensed information is sent to TCU. TCU receives the count of normal and emergency vehicles and changes the signal dynamically by comparing the count obtained from different lanes. The proposed EDTCS saves travel time and gives a special priority to emergency vehicles like ambulance.
{"title":"Efficient dynamic traffic control system using wireless sensor networks","authors":"R. Bharadwaj, J. Deepak, M. Baranitharan, V. Vaidehi","doi":"10.1109/ICRTIT.2013.6844280","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844280","url":null,"abstract":"This paper proposes an improved traffic control system by having dynamic time limits at the traffic signal intersections. The proposed system uses sensors to find the traffic conditions to dynamically control the traffic. Prevailing static traffic control system may block emergency vehicles such as ambulance due to traffic congestion. The proposed Efficient Dynamic Traffic Control System (EDTCS) has Traffic Control Unit (TCU), Monitor Unit (MU) and Road Side Unit (RSU). RSU contains RFID reader which reads the unique RFID code for an emergency vehicle and send it to MU. MU uses sensors such as proximity switch and RFID tags to get the count of normal and emergency vehicles respectively and sensed information is sent to TCU. TCU receives the count of normal and emergency vehicles and changes the signal dynamically by comparing the count obtained from different lanes. The proposed EDTCS saves travel time and gives a special priority to emergency vehicles like ambulance.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"1991 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518179","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}
Pub Date : 2013-07-25DOI: 10.1109/ICRTIT.2013.6844259
N. Sivasankari, M. Malleswaran
Global Positioning System (GPS) and Inertial Navigation System (INS) data can be integrated to provide a reliable navigation. This paper presents an approach of solving GPS/INS data integration problem, without the need of modeling the characteristics of GPS and INS sensors. Use of Artificial Intelligence (AI) techniques for an intelligent navigation system has been developed as an alternative to the conventional Kalman filter approach, in which it is mandatory to model the entire system. Many AI techniques have been implemented for the same, in which the use of ANFIS instead of neural networks and fuzzy logic has been widely implemented. In this paper Memetic optimization on ANFIS (MANFIS) has been proposed which outperforms Genetically optimized ANFIS (GANFIS).
全球定位系统(GPS)和惯性导航系统(INS)数据可以集成以提供可靠的导航。本文提出了一种不需要对GPS和INS传感器特性建模的情况下，解决GPS/INS数据集成问题的方法。人工智能(AI)技术在智能导航系统中的应用已经发展成为传统卡尔曼滤波方法的替代方案，在传统的卡尔曼滤波方法中，必须对整个系统建模。许多人工智能技术已经为此实现，其中使用ANFIS代替神经网络和模糊逻辑已被广泛实现。本文提出了一种优于遗传优化ANFIS的Memetic optimization on ANFIS (MANFIS)。
{"title":"Evolutionary optimization in ANFIS for intelligent navigation system","authors":"N. Sivasankari, M. Malleswaran","doi":"10.1109/ICRTIT.2013.6844259","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844259","url":null,"abstract":"Global Positioning System (GPS) and Inertial Navigation System (INS) data can be integrated to provide a reliable navigation. This paper presents an approach of solving GPS/INS data integration problem, without the need of modeling the characteristics of GPS and INS sensors. Use of Artificial Intelligence (AI) techniques for an intelligent navigation system has been developed as an alternative to the conventional Kalman filter approach, in which it is mandatory to model the entire system. Many AI techniques have been implemented for the same, in which the use of ANFIS instead of neural networks and fuzzy logic has been widely implemented. In this paper Memetic optimization on ANFIS (MANFIS) has been proposed which outperforms Genetically optimized ANFIS (GANFIS).","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114245303","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
扫码关注我们
求助内容：
应助结果提醒方式：