{"title":"Design and Evaluation of a Real-Time Speech Recognition System","authors":"S. Shruthi, G. Yashaswi, V. Shruti, J. Manikandan","doi":"10.1109/ICACCI.2018.8554921","DOIUrl":"https://doi.org/10.1109/ICACCI.2018.8554921","url":null,"abstract":"Real-time speech recognition systems are in huge demand due to the technological developments in the areas of humanoid robots, voice-based assistive systems, natural language processing, autonomous systems and many more. In this paper, design of a real-time speech recognition system using a novel reduced MFCC feature set and Relevance Vector Machine (RVM) classifier is proposed. The computation time required for each stage of the proposed real-time speech recognition system is analyzed and reported. The performance of proposed system is also evaluated by using Support Vector Machine (SVM) classifier. A maximum recognition accuracy of 99% and 98% is obtained on using SVM and RVM respectively for the proposed system.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132002839","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":"UVM Based Testbench Architecture for Coverage Driven Functional Verification of SPI Protocol","authors":"B. Vineeth, B. T. Sundari","doi":"10.1109/ICACCI.2018.8554919","DOIUrl":"https://doi.org/10.1109/ICACCI.2018.8554919","url":null,"abstract":"The scale and complexity of integrated circuit designs are ever expanding which makes the verification process increasingly difficult and progressively time consuming. This dictates the need for testbench architectures with generic verification components that are reusable and easily extendable across designs. The UVM can realize such testbench architectures with coverage driven verification environments useful for constrained random testing. This paper focus on the UVM based verification of SPI protocol according to the verification plan prepared after an exhaustive analysis of SPI functional specifications. The UVM testbench generates random vectors, drives the SPI module and compares the captured response with expected response using scoreboard mechanism to verify the SPI functionality. The testbench also validates the characteristic features of SPI by running appropriate test cases and reports coverage cumulatively at the end of each test. The simulation results are analyzed to evaluate the effectiveness of the proposed testbench.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131807047","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":"Security improvement in fingerprint authentication system using virtual biometric","authors":"A. AthiraRam, S. JyothisT.","doi":"10.1109/ICACCI.2015.7275900","DOIUrl":"https://doi.org/10.1109/ICACCI.2015.7275900","url":null,"abstract":"Fingerprint authentication system faces a problem of security of patterns stored in database. In the proposed system a virtual fingerprint is created and stored in database instead of a single fingerprint. Two different fingerprints are used here. From the first fingerprint orientation is estimated and from second fingerprint certain minutiae points are extracted. They both are mixed to create a template which is encrypted and used as a virtual biometric. The system gives low rate and provides no stored information needed to recreate the fingerprint patterns.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127090350","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":"Semi-automatic generation of accurate ground truth data in video sequences","authors":"G. F. Domínguez","doi":"10.1109/ICACCI.2014.6968309","DOIUrl":"https://doi.org/10.1109/ICACCI.2014.6968309","url":null,"abstract":"Generation of ground truth data from video sequences is still an intriguing problem in the Computer Vision community. The massive amount of data and the necessary effort for annotating this data make this task a challenging problem. In this paper we investigate the possibility of generating ground truth data in a semi-automatic way. Specifically, using the output of different algorithms, a new output based on robust statistics is generated. The proposed method uses results obtained from real data which is used for evaluation purposes. The generated output is proposed to be used as a basis of ground truth data reducing the necessary time for generating this data. The main contribution of this paper is to show that such methodology can be used to generate an initial ground truth data, which is accurate and reliable, in both ways semi-automatic and fast. Various results and analysis are presented to evaluate the performance of the proposed methodology. Obtained results suggest that generating ground truth data based on the output of different algorithms is possible alleviating the problem of annotating such data manually.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131785468","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":"A new fragile watermarking approach for tamper detection and recovery of document images","authors":"R. ChetanK., S. Nirmala","doi":"10.1109/ICACCI.2014.6968624","DOIUrl":"https://doi.org/10.1109/ICACCI.2014.6968624","url":null,"abstract":"In this paper, a fragile watermarking scheme is proposed for tamper detection and recovery of digital images. In this scheme, the source document image is divided into blocks of uniform size and a pseudo-random mapping of blocks is generated. For each block, a watermark consisting of authentication and recovery information is generated and embedded into the corresponding mapping block. The authentication data is formed using the Least Significant Bit (LSB) of each pixel value in the block. The recovery information consists of sub-sampled versions of two moment-preserving thresholds of the block. At the receiver side, the watermark is extracted from the corresponding mapping blocks for each block of the watermarked document image. A dual-option parity check method is applied on the authentication data in the extracted watermark to check whether the watermarked image block is tampered or not. If the image block is found to be tampered, the recovery information is extracted from the watermark. From the experimental results it is found that the average value of tamper detection rate and recovery rate for various types of intentional attacks on the document images corpus is 93.8% and 93.6% respectively. Further, the average Peak Signal to Noise Ratio (PSNR) of the recovered images is 61.24%. The comparative analysis reveals that the proposed scheme outperforms the existing system [16]. Keywords— Fragile Watermarking; thresholding; Tamper detection; Tamper recovery;","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121703269","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":"On the design of very sharp narrowband FIR filters by using IFIR technique with time-multiplexed subfilters","authors":"M. Jiménez, G. Jovanovic-Dolecek","doi":"10.1109/ICACCI.2013.6637489","DOIUrl":"https://doi.org/10.1109/ICACCI.2013.6637489","url":null,"abstract":"This paper presents an Interpolated Finite Impulse Response (IFIR) method to design narrowband FIR filters with very sharp transition band. The method is based on a multi-stage IFIR scheme, where a multiplierless model filter is used along with several interpolator filters that differ to each other only in their expansion factors. Sharpening technique is applied to the model filter to improve its magnitude characteristics. The Pipelining-Interleaving (PI) technique is applied to avoid the repetitive use of the model filter. Similarly, the folding technique is used to implement only once the arithmetic operations of the interpolators. As a result, the overall filter requires the implementation of fewer arithmetic operations in comparison with the direct design as well as with other similar approaches.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122844755","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":"Symmetric key based blocked oriented digital enveloping","authors":"S. Kandar, Nabarun Das, S. Barman","doi":"10.1145/2345396.2345577","DOIUrl":"https://doi.org/10.1145/2345396.2345577","url":null,"abstract":"Digital enveloping is the process of embedding information into a digital multimedia object which is used to protect information, and conceal secrets. In digital enveloping, concentration in given on the retrieval of the original data enveloped within another media. In this current work we have proposed a technique called block oriented digital enveloping where an image as secret is enveloped within another image. Here the cover image is divided into blocks and the blocks are chosen based on a pseudo random sequence generated by a symmetric key. For testing, the paper presents 2 types of bit replacing and performs various quality measures of the enveloped image.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115280038","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":"Inference of peer temperament in unstructured peer-to-peer networks by creating a virtual multi layer structure","authors":"G. Sreenu, P. Dhanya","doi":"10.1145/2345396.2345463","DOIUrl":"https://doi.org/10.1145/2345396.2345463","url":null,"abstract":"The innate exposure of P2P network to various types of attacks leads to increasing levels of vagueness and menace. Among the different security enforcing mechanisms trust management using reputation based methods plays a vital role. Various reputation models developed in history and recent times are mentioned. This paper suggests a reputation model for unstructured P2P network by creating a virtual multi layer network. The fundamental operation behind the Multilayer network is utility calculation and transmission of tags. This method will make the network to scale well for large number of peers. In addition to scalability other features includes effortless searching and reduction in unwanted use of system resources.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127529437","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":"Towards improving automatic image annotation using improvised fractal SMOTE approach","authors":"T. Sumadhi, Asst M Hemalatha, Prof, Head","doi":"10.1145/2345396.2345511","DOIUrl":"https://doi.org/10.1145/2345396.2345511","url":null,"abstract":"It is very much essential for the multimedia information organization to provide accurate and scalable solutions to map low-level perceptual features to high-level semantics. Therefore automatic and efficient annotation of images is needed for rapid content based retrieval and indexing; it alleviates the disadvantage of any manual annotation. The proposed system for pattern matching and annotation from large image databases has been given based on the combination of Fractal Transform and gentle AdaBoost algorithm. This technique involves two main stages in classification phase wherein first, we make use of gentle AdaBoost algorithm as it is best suited for object detection task and also has lower computational complexity. Next, a mathematical representation is associated to the images of the database, this representation is a set of function parameters resulting from a dedicated fractal interpolation scheme, and used as an index by a retrieval algorithm. Proposed algorithm works completely in the Fractal transform parameter space of both images and patterns, to obtain performances well-matched with an interactive search. In this paper, we also try to overcome the orientation, scaling and class imbalance problem in image annotation by choosing an over sampling method for learning the classifier. Experimental results of IFSMOTE shows higher prediction quality, and performs better than the classical SVM, SMOTE and FSMOTE.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114932659","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":"Active learning technique for biomedical named entity extraction","authors":"S. Saha, Asif Ekbal, Mridula Verma, Utpal Kumar Sikdar, Massimo Poesio","doi":"10.1145/2345396.2345532","DOIUrl":"https://doi.org/10.1145/2345396.2345532","url":null,"abstract":"One difficulty with machine learning for information extraction is the high cost of collecting labeled examples. Active Learning can make more efficient use of the learner's time by asking them to label only instances that are most useful for the trainer. In random sampling approach, unlabeled data is selected for annotation at random and thus can't yield the desired results. In contrast, active learning selects the useful data from a huge pool of unlabeled data for the classifier. The strategies used often classify the corpus tokens (or, data points) under wrong classes. The classifier is confused between two categories if the token is located near the margin. We develop a method for solving this problem and show that it favorably results in the increased performance. Our approach is based on the supervised machine learner, Conditional Random Field (CRF). The proposed approach is applied for solving the problem of named entity extraction from biomedical domain. Results show that proposed active learning based technique indeed improves the performance of the system.","PeriodicalId":290400,"journal":{"name":"International Conference on Advances in Computing, Communications and Informatics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115480661","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}