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.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.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.6844267
P. Prabhavathy, S. Bose
In this paper, we propose an efficient encoding for XML information dissemination scheme in mobile computing where conserving power and time is a critical task. We define a novel structure called Path Stream Group Level (PSGL) node for streaming XML data and selective download of XML document. A XML document may contain many elements with same name. But each element having same name with different XML tree path information can have various meaning in XML document. Therefore, our encoding scheme uses Location Path information of XML document to uniquely identify a node and groups its elements having same name and location path into PSGL node. Each PSGL node structure includes Level Number, Node Name, Location Path, Child Index, Sibling Index, Attribute Value List, Text Value List, Select Bit String (SBS) coding and SBS count. Level number helps in tuning into particular level of XML document tree where the result node of query or first predicate condition resides in Xpath expression for selective download of XML document. The indices and Value Lists helps in an efficient XML query processing. Thus PSGL encoding scheme exploits the XML document object model in terms of depth and level order tree traversals for XML parsing and streaming. Simple path query and twig pattern queries can be processed efficiently due to parent-child and siblings relationship coded in SBS coding.
{"title":"Path stream group level encoding: Efficient wireless XML streaming","authors":"P. Prabhavathy, S. Bose","doi":"10.1109/ICRTIT.2013.6844267","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844267","url":null,"abstract":"In this paper, we propose an efficient encoding for XML information dissemination scheme in mobile computing where conserving power and time is a critical task. We define a novel structure called Path Stream Group Level (PSGL) node for streaming XML data and selective download of XML document. A XML document may contain many elements with same name. But each element having same name with different XML tree path information can have various meaning in XML document. Therefore, our encoding scheme uses Location Path information of XML document to uniquely identify a node and groups its elements having same name and location path into PSGL node. Each PSGL node structure includes Level Number, Node Name, Location Path, Child Index, Sibling Index, Attribute Value List, Text Value List, Select Bit String (SBS) coding and SBS count. Level number helps in tuning into particular level of XML document tree where the result node of query or first predicate condition resides in Xpath expression for selective download of XML document. The indices and Value Lists helps in an efficient XML query processing. Thus PSGL encoding scheme exploits the XML document object model in terms of depth and level order tree traversals for XML parsing and streaming. Simple path query and twig pattern queries can be processed efficiently due to parent-child and siblings relationship coded in SBS coding.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"25 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":"128509381","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.6844239
B. Diwan, M. Sumalatha
In a mobile ad-hoc network (MANET), traditional mobile nodes (TMNs) are movable and can communicate with other TMNs through a wireless medium without any infrastructure network. MANET is focused in the field of applications such as military, disaster recovery situations where it is difficult to establish a fixed network. The network systems that schedule database transactions in MANET need to focus additional issues such as energy limitation and scheduling constraints. This paper proposes a solution for scheduling database transactions that reduces the number of transaction missing deadlines while balancing the energy consumption by the TMNs in the system. The proposed solution is setting up reasonable concurrency control when guaranteeing isolation. This paper then reports the simulation experiments that were conducted to evaluate the effectiveness of the proposed system in terms of number of transaction missing deadlines, total energy consumption and distribution of energy consumption among TMNs.
{"title":"Slack time scheduling for managing database transactions in mobile ad-hoc networks","authors":"B. Diwan, M. Sumalatha","doi":"10.1109/ICRTIT.2013.6844239","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844239","url":null,"abstract":"In a mobile ad-hoc network (MANET), traditional mobile nodes (TMNs) are movable and can communicate with other TMNs through a wireless medium without any infrastructure network. MANET is focused in the field of applications such as military, disaster recovery situations where it is difficult to establish a fixed network. The network systems that schedule database transactions in MANET need to focus additional issues such as energy limitation and scheduling constraints. This paper proposes a solution for scheduling database transactions that reduces the number of transaction missing deadlines while balancing the energy consumption by the TMNs in the system. The proposed solution is setting up reasonable concurrency control when guaranteeing isolation. This paper then reports the simulation experiments that were conducted to evaluate the effectiveness of the proposed system in terms of number of transaction missing deadlines, total energy consumption and distribution of energy consumption among TMNs.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"25 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":"121901826","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.6844219
S. Deivalakshmi, Rajasekharreddy Poreddy, P. Palanisamy, Souvik Malakar
Form processing is an essential operation in business and government organizations. In this digital arena, it is necessary to extract the information from the form documents and the Information extraction is useful in postal address extraction and forgery detection in bank cheques etc. This process can also recover the Unfilled-Form structure from a filled up form and can be used in retrieval of empty bank cheques and postal cards etc. This paper presents the method for information extraction and retrieval of unfilled form structure from filled-up form documents in two steps. First step deals with the detection of lines present in the form document along with starting and ending points of those lines and second step involves the extraction of character information present above these detected lines using mask processing.
{"title":"Information extraction and unfilled-form structure retrieval from filled-up forms","authors":"S. Deivalakshmi, Rajasekharreddy Poreddy, P. Palanisamy, Souvik Malakar","doi":"10.1109/ICRTIT.2013.6844219","DOIUrl":"https://doi.org/10.1109/ICRTIT.2013.6844219","url":null,"abstract":"Form processing is an essential operation in business and government organizations. In this digital arena, it is necessary to extract the information from the form documents and the Information extraction is useful in postal address extraction and forgery detection in bank cheques etc. This process can also recover the Unfilled-Form structure from a filled up form and can be used in retrieval of empty bank cheques and postal cards etc. This paper presents the method for information extraction and retrieval of unfilled form structure from filled-up form documents in two steps. First step deals with the detection of lines present in the form document along with starting and ending points of those lines and second step involves the extraction of character information present above these detected lines using mask processing.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"106 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":"114347561","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
扫码关注我们
求助内容：
应助结果提醒方式：