2015 IEEE International Advance Computing Conference (IACC)最新文献_第2页

Recommender system based on Hierarchical Clustering algorithm Chameleon 基于分层聚类算法的变色龙推荐系统

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154856

Utkarsh Gupta, Nagamma Patil

引用次数: 27

Validation of real time complex algorithms using fault model analyses 基于故障模型分析的实时复杂算法验证

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154794

S. B. Sumeeth, J. Jayanthi, Manju Nanda, A. Avinash

引用次数: 0

Energy-efficient approximate 2D Gaussian smoothing filter for error tolerant applications 用于容错应用的节能近似二维高斯平滑滤波器

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154815

S. Kaushik, N. Kumar

引用次数: 6

Model for improving relevant Feature Extraction for Opinion Summarization 改进意见摘要相关特征提取的模型

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154660

Ashwini Rao, K. Shah

引用次数: 8

Signature verification using Java - Python for small computational devices 签名验证使用Java - Python为小型计算设备

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154788

Savita Choudhary, Siddanth Kaul, Shridhar Mishra, J. B. Arun

引用次数: 0

Robust and dynamic image zero watermarking using hessian laplace detector and logistic map 基于hessian拉普拉斯检测器和logistic映射的鲁棒动态图像零水印

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154841

M. Dhoka, A. Patki

{"title":"Robust and dynamic image zero watermarking using hessian laplace detector and logistic map","authors":"M. Dhoka, A. Patki","doi":"10.1109/IADCC.2015.7154841","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154841","url":null,"abstract":"In this digital world due to rapid growth in image processing technology and internet, Piracy of the images is becoming more and more serious problem. In order to prohibit such piracy, watermarking is widely used approach. In conventional watermarking, watermark is inserted in host image by modifying its original information. This approach creates a trade-off between robustness and imperceptibility. To overcome this, zero watermarking is used. In this process instead of embedding watermark, it is created using host image and original watermark of ownership identification. Zero Watermarking does not alter original information of the image and provides perfect imperceptibility. In this paper we are proposing a robust and dynamic zero watermarking using Hessian Laplace Detector and Logistic map. Here, Feature points of host image are detected using Hessian Laplace detector and used along with original watermark of ownership identity for constructing zero-watermark. Finally constructed zero-watermark is scrambled using Logistic map to improve its security before storing it into database. Our dynamic approach lets original watermark size to be solely decided by total number of detected feature points and all pixels of original watermark to be used for creating zero-watermark. We have compared our algorithm with previous work and got better reconstruction of original watermark under noise, filtering, compression, translation and cropping attacks.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123647083","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}

引用次数: 4

On the optimization of key revocation schemes for network telemetry data distribution 网络遥测数据分发密钥撤销方案的优化研究

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154765

Bhanu Prakash Gopularam, N. Nalini

{"title":"On the optimization of key revocation schemes for network telemetry data distribution","authors":"Bhanu Prakash Gopularam, N. Nalini","doi":"10.1109/IADCC.2015.7154765","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154765","url":null,"abstract":"Consider a cloud deployment where the organizational network pertaining to a tenant having routers, switches sharing network telemetry data on regular basis. Among different ways of managing networks flow-based network monitoring is most sought after approach because of accuracy and economies of scale. In the event of host compromise the device credentials are revoked thereby disabling its ability to read future communications. Broadcast Encryption techniques having strong key revocation mechanism can be used in this context. Waters et. al [?] is one the broadcast encryption schemes which facilitate efficient sharing using small size keys and the related Attribute-Based Encryption scheme uses dual encryption technique and is capable of handling non-monotonous access structure again with small keys. In this paper we experiment with broadcast encryption and attribute based encryotion schemes with real-time network telemetry data and provide detailed analysis of performace. Though the original scheme provides smaller keys, few changes to the algorithm improves the performance and efficiency and makes it acceptable for large scale usage. We found the optimized scheme is 20% more performant than inital scheme.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"863 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114216240","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

Bi-modal Image segmentation by active shape model 基于主动形状模型的双峰图像分割

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154683

Prashant A. Athavale, P. Puttaswamy

引用次数: 0

Establishment of equivalence between two degraded document images 两个退化文档图像之间等效性的建立

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154826

Muralidhara Mallur, P. Nagabhushan, S. D. Gowda

{"title":"Establishment of equivalence between two degraded document images","authors":"Muralidhara Mallur, P. Nagabhushan, S. D. Gowda","doi":"10.1109/IADCC.2015.7154826","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154826","url":null,"abstract":"With the advent of Information Technology, large volume of hardcopy documents are being scanned and stored as document images. Due to the age of source document, quality of the ink and recurring photo copies of same source, the document images generated are degraded in quality. Degraded document images obtained from different sources are stored in different places depending on the requirement of images for various purposes. This leads to storage of multiple copies of same document image with variations in degradation. Establishment of equivalence between two degraded document images using Optical Character Recognizer (OCR) is not possible as OCR fails to recognize the characters in degraded conditions. In this paper, a novel approach has been proposed to establish equivalence between two degraded document images based on layout and content structure. Through projection profile, the number of components and the occurrence of components in the document images are compared correspondingly to establish layout equivalence. The components at paragraph level are compared based on foreground density and entropy quantifier to establish content structure equivalence. The efficacy of the proposed model is tested over variety of degraded document images.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125474319","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

Parameters tuning of OLSR routing protocol with metaheuristic algorithm for VANET 基于VANET元启发式算法的OLSR路由协议参数调优

2015 IEEE International Advance Computing Conference (IACC) Pub Date : 2015-06-12 DOI: 10.1109/IADCC.2015.7154894

Anusha Bandi, B. Chandrashekhar

{"title":"Parameters tuning of OLSR routing protocol with metaheuristic algorithm for VANET","authors":"Anusha Bandi, B. Chandrashekhar","doi":"10.1109/IADCC.2015.7154894","DOIUrl":"https://doi.org/10.1109/IADCC.2015.7154894","url":null,"abstract":"Vehicular Adhoc Network provides ability to wirelessly communicate between vehicles. Network fragmentations and frequent topology changes (Mobility of the nodes) and limited coverage of Wi-Fi, are issues in VANET, that arise due to absence of central manager entity. Because of these reasons, routing the packets within the network is difficult task. Hence, provisioning an adept routing strategy is vital for the deployment of VANETs. The optimized link state routing is a well-known mobile adhoc network routing protocol. In this paper, we are proposing an optimization strategy to fine-tune few parameters by configuring the OLSR protocol using metaheuristic method. We considered some of the quality parameters such as packet delivery ratio, latency, throughput and fitness value for fine tuning OSLR protocol. Then we made Comparison of genetic algorithm, particle swarm optimization algorithm by using QoS parameters. We implemented our work on Red Hat Enterprise Linux 6 platform. And results are shown by simulations using VanetMobiSim and NS2 simulators; the fine-tuned OSLR protocol behaves better than the original routing protocol with intelligence and optimization configuration.","PeriodicalId":123908,"journal":{"name":"2015 IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125699005","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}

引用次数: 9