{"title":"A High Capacity Framework for Reversible Information Embedding in Medical Images","authors":"Shifa Showkat, S. A. Parah","doi":"10.1109/PDGC.2018.8745737","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745737","url":null,"abstract":"In this paper, a scheme of reversible data hiding (RDH) with increased capacity for medical images has been presented. The proposed method focusses on increasing the medical image's visual quality and simultaneously improving the payload. This algorithm presents a block based approach and modifies only pixels in a given range and not in the entire image. The histogram of each individual block is generated with the objective of computing the peak value i.e. the value with highest frequency of occurrence. For medical images, an additional preprocessing step is first done to make computation simpler. Stego-image is formed by embedding particular values of secret data bits in a pre-determined range. The cover-image is recovered in its original form by concatenating a location tag to the stego-image. Peak Signal to Noise Ratio (PSNR), Structural Similarity Index Matrix (SSIM) and capacity are the metrics that assess the visual quality, structural similarity and payload. Since the process of embedding of data is done only in particular pixels of a defined range, the proposed idea results in increased payload with less distortion.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016546","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":"Performance Evaluation and Future Scope of Image Secret Sharing Schemes","authors":"Aaqib Anjum Reshi, S. A. Parah","doi":"10.1109/PDGC.2018.8745872","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745872","url":null,"abstract":"Image secret sharing (ISS) has seen an immense growth in modern day world due to excess internet usability along with growing insecurity due to advanced attacks from the hackers. Secret sharing methods play a very important part in visual cryptography(VC) which began with introduction of “(k, n) threshold” scheme introduced by Shamir and Blakeley in 1979. In this scheme a secret is divided/encoded into ‘n’ shares or meaningless noisy images. The message to be hidden can only be constructed by stacking (combining with some logic) up at least ‘k’ number of shares/transparencies. Various advancements have happened in ISS with introduction of the “(k, n) threshold” based scheme to images. It has led to development of new schemes like probability based ISS, extended ISS, ISS using Cloud, and progressive ISS with perfect reconstruction capability or perfect data retrieval capability etc. These techniques are judged using the parameters like security robustness, pixel expansion and contrast of retrieved image. The ISS schemes can be made more robust and secure by integrating various features like introducing progressive ISS feature with Cloud and further increasing data payload by increasing ability to embed more data without decreasing the security and quality of retrieved original secret data. In this paper different ISS schemes have been surveyed and compared taking into consideration security, pixel expansion and contrast loss along with future scope of these techniques and application areas have also been discussed to get the scope of future research in the area.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125617007","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":"Machine Learning Based Performance Evaluation System Based On Multi-Categorial Factors","authors":"K. Sethi, Ankit Gupta, V. Jaiswal","doi":"10.1109/PDGC.2018.8745781","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745781","url":null,"abstract":"Educational data mining is a focus of research reformed every growing year. The valuable data retrieved from various mining techniques are applied and implemented according to their own visions and objectives for developing specific technical systems to discover configurations and patterns from educational statistics. The performance evaluation of student model with advantage of behavioural (interactive) features is projected in this study paper and predicts student grade and level. The learner's interactions are directly connected with the category of feature. Few classification algorithms like Artificial Neural Network (ANN) and lib SVM are applied to analyze the impact of these categories on learners' academic performances. Results reflect the vigorous relationship between student's behaviour and his academic accomplishments. It raises the better results were observed with dissimilar classification methods involving interactive features while comparing classification accuracy with the identical data and eliminating such features.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126607999","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":"SPIHT based dual watermarking technique in NSCT domain","authors":"C. Kumar, Ashutosh Kumar Singh, Pardeep Kumar","doi":"10.1109/PDGC.2018.8745789","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745789","url":null,"abstract":"This paper presents a dual watermarking scheme to improve the performance of discrete wavelet transforms (RDWT), non sub-sampled contourlet transform (NSCT)and singular value decomposition (SVD) based method. The method uses RDWT, NSCT, SVD and set partitioning in hierarchical tree (SPIHT) to provide better robustness, security, embedding capacity etc. In proposed scheme, the text watermark is embedded inside logo watermark to generatea dual watermark image. Further, dual watermark is embedded inside cover Lena image to produce watermarked image. Experimental results clearly revealed better performance of our technique against various attacks. Performance shows that this proposed method is more robust as compared to previous method.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129991684","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 Review on Data locality in Hadoop MapReduce","authors":"Anil Sharma, Gurwinder Singh","doi":"10.1109/PDGC.2018.8745928","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745928","url":null,"abstract":"MapReduce has emerged as a strong model for processing parallel and distributed data for huge datasets. Hadoop an open source implementation of MapReduce has approved MapReduce widely. Hadoop fragments the input file into number of data blocks to allocate them to various DataNodes in cluster. Hadoop must provide effective scheduling to process these data blocks in efficient way. One of the issues that play vital role in efficient processing of MapReduce is Data Locality which is caused due to overhead of network. Data locality is equipped for moving the computation adjacent to the data where it dwells. It is a key resource in distributed environment which influences the tasks accomplishing time. The issues which troubles data locality are cluster and network load, resource sharing, cluster environment, size of data blocks, number of mappers and reducers. This paper aims to review various algorithms that are aware of data locality in scheduling, along with their strengths and weaknesses.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128674423","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}
F. Muchtar, P. Singh, Y. Kumar, Asma Hanee Ariffin, S. I. Fadilah, M. N. Yusoff
{"title":"ToMRobot: A Low-Cost Robot for MANET Testbed","authors":"F. Muchtar, P. Singh, Y. Kumar, Asma Hanee Ariffin, S. I. Fadilah, M. N. Yusoff","doi":"10.1109/PDGC.2018.8745838","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745838","url":null,"abstract":"It has been identified from literature that affordability is the main constraint faced by the majority of MANET (Mobile Ad-hoc Network) researchers which sees them forgoing implementing real world experimental studies that are costlier, in favour of opting for cheaper simulation tools instead. While simulation tools provide a simple and inexpensive method to gain an understanding of algorithms and protocols in MANET research, its reliability and accuracy in representing real systems and contexts are critically limited. Thus, this paper unveils the ToMRobot, created with low budget using ordinary remote control (RC) car coupled with a few low cost electronic components, to serve as a fully functional MANET testbed. Provided in this paper are practical knowhow to model and produce ToMRobot from scratch specifically targeted to facilitate less technical savvy MANET researchers. Despite being really economical, significantly inexpensive to create, highly customizable with flexible option that allows researchers to upgrade by utilizing components such as Arduino and Cubieboard2 from technologies that can be sourced from open hardware, ToMRobot still maintains all aspects of MANET rudimentary structures. It is hoped that the guidelines contained within this paper will help MANET researchers to build robots that can be used in their future MANET testbeds, which will in turn ultimately increase the number of MANET researchers who choose testbeds as their evaluation tool.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133334576","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 Secure Lightweight Data Aggregation scheme for Cloud assisted IoT","authors":"Aishwarya Tripathi, S. Pasupuleti","doi":"10.1109/PDGC.2018.8745850","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745850","url":null,"abstract":"In recent years, cloud assisted IoT has emerged as a revolutionary paradigm enabling the seamless connection of IoT devices to the cloud through the Internet. This new paradigm helps the resource constrained IoT devices to get the benefit of cloud's elastic storage capabilities for storing of their data. However, at the same time it is challenging to ensure low latency, reduced network bandwidth consumption, scalability and energy efficient requirements of different IoT devices while transferring data to the cloud. Hence, to address these issues, fog computing was brought forward as an interplay between the cloud and the IoT. The fog computing is a powerful, decentralized architecture that collects data from IoT devices and transfers it to the cloud. While, fog computing enables us to address some of the issues discussed above, the security and privacy of data still remains to be a major concern. In this paper, we propose a secure lightweight data aggregation scheme for cloud assisted IoT devices based on ElGamal encryption and identity-based signature scheme. The security analysis highlights that our proposed scheme is secure as it prevents the possibility of injection of any kind of false data and keeps a check on data leakages. The performance analysis verifies the efficiency of our scheme against the prevalent schemes.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133617251","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":"Design of Concurrent Ciphertext Policy-Attribute Based Encryption Library for Multilevel Access of Encrypted Data","authors":"Shardha Porwal, S. Mittal","doi":"10.1109/PDGC.2018.8745795","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745795","url":null,"abstract":"Ciphertext Policy-Attribute Based Encryption (CP-ABE) is a public key encryption system that provides a flexible solution for sharing data files securely and publicly. As compared to conventional encryption CP-ABE generates single encrypted file that can be decrypted by anyone posing right attribute levels. In this paper, we have transformed legacy CP-ABE library to Object Oriented (OO) approach for enhancing the functionality of Ciphertext Policy-Attribute Based Encryption. CP-ABE has been further implemented as Multithreaded - Ciphertext Policy - Attribute Based Encryption (OOM-CP-ABE) for concurrency. Scope of parallelization in encryption and decryption operations has been exploited to obtain more efficient encryption and decryption. A case study for multilevel accessing of shared data files in a software company has been implemented to demonstrate the usefulness of implemented library. Experimental simulations demonstrate improved performance of proposed OOM-CP-ABE scheme to provide real time data encryption and decryption services as compared to legacy CP-ABE and OO-CP-ABE approaches.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133297174","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":"Channel Performance Evaluation of Wireless Communication Networks","authors":"Rashmeet, Amit Gupta, R. Goyal","doi":"10.1109/PDGC.2018.8745938","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745938","url":null,"abstract":"Wireless networks have gained tremendous popularity in recent years. Optical wireless technology is an alternative to RF wireless as it offers large capacity, high data rates, larger bandwidth, a license free spectrum and fast deployment. Optical wireless communication uses optical beams to transmit data in free space. In this paper, an overview on wireless networks, the need of optical wireless networks, applications, advantages, disadvantages, comparison between RF wireless and optical communication are discussed. In wireless networks the channel used is an atmosphere or free space which is not an ideal channel for communication as it is affected by various environmental factors like rain, fog, haze, smoke etc. This paper also discusses various losses like atmospheric absorption, scattering, atmospheric turbulence and geometric losses, its mitigation techniques, the first mile problem and Pointing Acquisition and Tracking (PAT).","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129423276","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":"Appraisal of Pre-processing Techniques for Automated Detection of Diabetic Retinopathy","authors":"C. Bhardwaj, Shruti Jain, M. Sood","doi":"10.1109/PDGC.2018.8745964","DOIUrl":"https://doi.org/10.1109/PDGC.2018.8745964","url":null,"abstract":"Retinopathy is a retinal vascular disease caused by abnormal blood flow that damages the retina and it accounts for 5% of blindness worldwide. There are different causes of Retinopathy as retinopathy of prematurity, diabetic retinopathy and hypertensive retinopathy; this paper mainly focuses on pre-processing techniques employed for the detection of diabetic retinopathy. In this work, literatures reporting different methods for automated diabetic retinopathy detection in color images of retina are analyzed for their strength and shortcoming. Extensive techniques for retinal image screening have been published so far thus this paper presents the evaluation of these methods on a common database of image screening. Different image pre-processing techniques are implemented on fundus images and their performance is compared using performance metrics like mean square error, peak signal to noise ratio and root mean square error. Pre-processing steps used in this work can also be applied to other images of interest to identify and recognize the objects in an image.","PeriodicalId":303401,"journal":{"name":"2018 Fifth International Conference on Parallel, Distributed and Grid Computing (PDGC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129978097","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}