2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)最新文献

筛选
英文 中文
Inordinate Voice Based Examination System 基于异常语音的检测系统
Srishty Brajesh Choudhary, S. Marne
{"title":"Inordinate Voice Based Examination System","authors":"Srishty Brajesh Choudhary, S. Marne","doi":"10.1109/ICCUBEA.2017.8463703","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463703","url":null,"abstract":"To abates the use of papers, to alleviate human efforts and to ameliorate examination system we have ascertain this system. As traditional system has attenuated there was a need of developing compound system to cope with technological advancements, so the solution is to build such an inordinate system. Gamut of systems do exist in the market some use OCR to evaluate the answers, some use machine learning to analyze answers, some even make use of short text matching algorithms. Roster of the techniques in improving inordinate voice based examination system are having some performance issues to achieve mere accuracy, so this paper presents a novel technique for inordinate voice based examination system.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115100486","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}
引用次数: 0
A Syntactic Content-Based Recommender Based on combination of ACO and GA in large scholarly data 大型学术数据中基于蚁群算法和遗传算法结合的基于句法内容的推荐
Deepa D. Mandave, G. Pole
{"title":"A Syntactic Content-Based Recommender Based on combination of ACO and GA in large scholarly data","authors":"Deepa D. Mandave, G. Pole","doi":"10.1109/ICCUBEA.2017.8463950","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463950","url":null,"abstract":"The quantity of research papers or literature has been increasing continually which origins the explosion of information. The outcome of this fast data growth is large options provided to internet users when searching for a paper, product or service. These will results difficulty in building decisions to internet users. Thus, this generates need to select, order and efficiently deliver important information to mend the problem of information burden. Recommenders are crucial systems to avoid the information burden, by filtering the huge group of information and suggesting relevant data to the operator. Recommender schemes solve this matter via inspecting through large dimensions of generated dynamic information to supply users personalized matter. Plenty of recommendation systems are available with different accuracies. Enhancing the worth of recommendations is the most important dares for recommendation schemes. This paper offers an innovative recommender system termed a Syntactic Recommender which deploys an upgraded feature selection system that is combination of ACO-GA algorithms to raise the accuracy of recommendations in recommender system. This paper emphases on two fundamental concepts, first is performing and giving more exact object predictions to the operator and second is handling huge volume of data. The aim of this paper is offering recommendation outcomes based on user's request with accuracy and competency. We also realized that the outcomes of recommendation systems are correct.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116048741","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}
引用次数: 0
Secret Matrix Lifecycle Management for Compressive Sensing based Cryptographic Mechanisms 基于压缩感知的密码机制的秘密矩阵生命周期管理
Romeo Ayemele Djeujo, C. Ruland
{"title":"Secret Matrix Lifecycle Management for Compressive Sensing based Cryptographic Mechanisms","authors":"Romeo Ayemele Djeujo, C. Ruland","doi":"10.1109/ICCUBEA.2017.8463895","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463895","url":null,"abstract":"In Compressive Sensing (CS) -based cryptographic mechanisms, the measurement matrix is treated as a secret key, so that the encryption and/or the generation of authentication codes are performed during the compressed sampling process. Investigations on the complexity of the signal reconstruction without knowledge of the measurement matrix show that only key management is required to perform the above-mentioned cryptographic operations if the secret CS-matrix is used once for each signal. In standard cryptographic key management, only secret binary information is considered. In contrast, different secret measurement matrices may have different sizes, properties, and structures, depending on the characteristics of the input vector, the desired performance, the compressive sampling rate, and the expected reconstruction results. Therefore, an appropriate key management mechanism is required for secret CS-matrices. In this paper, the protection requirements and properties of the secret CS-matrix and its associated metadata are defined. Then, a high-level secret CS-matrix management architecture with the corresponding lifecycle are designed. The association between the secret measurement matrix, the associated metadata, and their management functions are discussed in our analysis.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117238628","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}
引用次数: 0
Effective Video Retrieval System using Adaptive Shot detection and feature vector algorithm 基于自适应镜头检测和特征向量算法的有效视频检索系统
S. Patel, V. Deodeshmukh
{"title":"Effective Video Retrieval System using Adaptive Shot detection and feature vector algorithm","authors":"S. Patel, V. Deodeshmukh","doi":"10.1109/ICCUBEA.2017.8463898","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463898","url":null,"abstract":"In current scenario roughly 100 million hours of videos are being uploaded on the internet (Viz. YouTube, Netflix, Dailymotion, Vimeo, Veoh, Metacafe, etc.) It becomes very difficult to extract a desired related video from such huge data set. Semantic/context based matching is fast but highly dependent on correct tag assigned to a video. On the other hand it is really difficult to apply and context based search on the video, because of large number of frames involved in a video. We have developed a novel video retrieval system, which can extract the desired videos from the large video data set. Algorithm consists of content based adaptive shot detection and feature vector extraction for each data set video. User can search any video in the data set by just giving a similar image as system input. We have achieved accuracy of 97.2% with blind trials and 100% accuracy in case of data base frame based search. Our algorithm also reduces the search time to roughly 0.3ms/video which is 100 times faster than reported search algorithms in literature. We expect our algorithm would fit in as an alternative to current video search algorithms and it can also act as image based video search along with existing technology of text based video search (e.g. YouTube)","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129872060","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}
引用次数: 2
Improve Information Rate in Thien and Lin's Image Secret Sharing Scheme Using Huffman Coding Technique 利用霍夫曼编码技术提高了Thien和Lin的图像秘密共享方案的信息率
Nehal Markandeya, Sonali D. Patil
{"title":"Improve Information Rate in Thien and Lin's Image Secret Sharing Scheme Using Huffman Coding Technique","authors":"Nehal Markandeya, Sonali D. Patil","doi":"10.1109/iccubea.2017.8463935","DOIUrl":"https://doi.org/10.1109/iccubea.2017.8463935","url":null,"abstract":"Shares in image secret sharing play a vital role. These image shares has size greater than or equal to size of original image, it require high bandwidth while transmission. Because of the excessive bandwidth requirements of image there is need to reduce the bandwidth of images. To reduce the size of image, Huffman compression coding techniques are used. By reducing the image share size in Thien and Lin's secret sharing scheme using Huffman coding technique leads to reduced bandwidth overhead. In proposed approach Huffman coding is applied on secret image before applying secret sharing. This approach helps to increase the compression ratio of share images by 14 % than existing system.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128645001","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}
引用次数: 0
Impact of Training and Testing Data Splits on Accuracy of Time Series Forecasting in Machine Learning 机器学习中训练和测试数据分割对时间序列预测精度的影响
Ramesh A. Medar, V. Rajpurohit, B. Rashmi
{"title":"Impact of Training and Testing Data Splits on Accuracy of Time Series Forecasting in Machine Learning","authors":"Ramesh A. Medar, V. Rajpurohit, B. Rashmi","doi":"10.1109/ICCUBEA.2017.8463779","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463779","url":null,"abstract":"Machine learning is the process of developing Artificial Intelligence in computers. Machine learning has the ability to make a computer perform some task without actually programming it and with minimal human efforts. Machine learning models are trained using appropriate learning algorithm and training data. Here the data is divided into two parts; Training and Testing data. The model will learn to perform a task using the training data and testing data is used to verify if the model works correctly. In this work a Machine learning model predicts weather parameters using Gaussian Process with RBF kernel. The basic aim is to analyse as to how the accuracy of prediction will vary with the different combinations of training and testing data. For this purpose experimentation is carried out with different combinations of training and testing data. The Mean Absolute Error is calculated by comparing the actual values from testing data set and predicted values from the model.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128740663","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}
引用次数: 25
Implementation of Video Stabilization Algorithm for Surveillance System 视频稳定算法在监控系统中的实现
Harshada Kawade, A. Deshpande
{"title":"Implementation of Video Stabilization Algorithm for Surveillance System","authors":"Harshada Kawade, A. Deshpande","doi":"10.1109/ICCUBEA.2017.8463700","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463700","url":null,"abstract":"Aerial video surveillance plays an important role in gathering the information for the public as well as military applications. Now-a-days cameras used for capturing video are of high quality, but because of the unintentional movement of cameras, the video gets unstabilized. The main aim of the video stabilization is to remove the unintentional motion and shakiness in the videos and preserve the desired motion. In this approach, speeded up robust features (SURF) and scale-invariant feature transform (SIFT) methods are used to detect and match the feature points of interest. The outliers and noise are removed using RANSAC, while affine transform is used to estimate the motion of the interest points. Finally, the video gets stabilized by compensating the global motion points obtained by the affine transform. These approaches for video stabilization show promising results in terms of Inter Transformation Fidelity (ITF) values for SURF and SIFT algorithms.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129638541","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}
引用次数: 0
Fragile Watermarking for Tamper Detection in RFID Tag using Arnold Transform 基于Arnold变换的RFID标签篡改检测脆弱水印
K. T. Patil, Deepali Patil, S. K. Narayankhedkar
{"title":"Fragile Watermarking for Tamper Detection in RFID Tag using Arnold Transform","authors":"K. T. Patil, Deepali Patil, S. K. Narayankhedkar","doi":"10.1109/ICCUBEA.2017.8463667","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463667","url":null,"abstract":"Tampering is one of the threats to RFID system in which adversaries alters the tag data to draw unethical benefit or to disrupt the normal functioning of the RFID enabled organization. Various methods of fragile watermarking based tamper detection exist to address the tag data tampering problem. We propose an enhanced method of tamper detection where secret key hiding is more secured due to use of Arnold Transform. Moreover, proposed method can detect tampering in SN field also, in addition to EM and OC field of the tag, which helps to avoid any pandemonium in the database.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122359715","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}
引用次数: 0
Secure & Efficient Routing Mechanisms in VANET Using CBDS 基于CBDS的VANET安全高效路由机制
S. Godse, P. Mahalle
{"title":"Secure & Efficient Routing Mechanisms in VANET Using CBDS","authors":"S. Godse, P. Mahalle","doi":"10.1109/iccubea.2017.8463722","DOIUrl":"https://doi.org/10.1109/iccubea.2017.8463722","url":null,"abstract":"Vehicular Adhoc Network (VANET) is adhoc network. In VANET topology is changing continuously due to the dynamic nature of the vehicles. Due to the open nature of VANET, It is vulnerable to black hole attack, Gray hole attacks, etc. In black hole attack malicious node that immediately replies to route requests by source nodes without having an active route to a specified destination and drop all the receiving data packets. The attack may cause major damage if two or more black hole nodes cooperate with each other to launch an attack. A novel Secure Routing mechanism With Hybrid Defense for mitigating collaborative black hole attacks and gray hole attacks in VANETs, referred to as ‘Co-operative Bait Detection Scheme’. It is a combination of Both Proactive & Reactive detection strategies. The CBDS scheme uses Reverse tracing technique to identify the malicious nodes. At a later stage, if the destination node detects a significant loss in data packets, the initial intrusion detection mechanism will be triggered again to identify malicious nodes. Proactive detection in CBDS scheme Consist of Two steps such as Initial Bait Phase and Reverse Tracing Step. Reactive Detection of proposed scheme uses a dynamic threshold algorithm to detect variants of black hole attacks.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130413360","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}
引用次数: 2
Implementation of Video Stabilization Algorithm Using Block Based Method 基于块的视频稳像算法的实现
Dipali P. Umrikar, S. Tade
{"title":"Implementation of Video Stabilization Algorithm Using Block Based Method","authors":"Dipali P. Umrikar, S. Tade","doi":"10.1109/ICCUBEA.2017.8463721","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2017.8463721","url":null,"abstract":"In many applications, video taken from hand held camera or whenever the video camera is mounted on moving platform such as, camera mounted on vehicle, camera used for humanoid robot, Unmanned Aerial Vehicle using camera in surveillance and tracking application captured video is typically jerky due to unwanted camera movements. Video stabilization is the process to remove unwanted shakes and jitters to give a visually pleasant video. This paper presents the digital video stabilization algorithm to satisfy unwanted jitters, shakes and it is based on Block based method. In this paper, we present a video stabilization algorithm using Block based method to rotational, translational camera motions. Motion estimation estimate the motion between frames and Motion Compensation removes unwanted camera motion using global transformation to generate stabilized video. This algorithm works efficiently and good performance obtained experimentally.","PeriodicalId":123739,"journal":{"name":"2017 International Conference on Computing, Communication, Control and Automation (ICCUBEA)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122957855","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书