{"title":"Performance comparison of edge detection algorithms for satellite images using bigdata platform spark","authors":"Tapan Sharma, Vinod Shokeen, Sunil Mathur","doi":"10.1109/IICIP.2016.7975342","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975342","url":null,"abstract":"Edge Detection has been a vital step in the field of image processing. It is used to identify the breaks in depth, surface orientation or changes in the brightness. It is one of the most vital steps for object detection in the image. In today's big data world, it becomes crucial to know the different algorithms that can run faster in order to deal with the fast generating data. To process the large volume of data big data platforms like Hadoop are being leveraged. In this paper we have implemented different edge detection algorithms such as Canny Edge, Sobel operator and Laplacian of Gaussian on Apache Spark. We have executed our implementations on remote sensing images residing on HDFS and then compared the statistical performance and scalability of all these algorithms for different set of images.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121509487","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":"Analysis and modeling of a safety critical system using Petri-Net model","authors":"Karanjeet, S. Rath","doi":"10.1109/IICIP.2016.7975330","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975330","url":null,"abstract":"In this paper, a case study on Nuclear Power Plant (NPP) has been considered and modeled using Petri-Nets to identify the occurrence of various hazards in the system. PN based modeling framework provides a flexible graphical representation which allows a qualitative analysis of safe and unsafe states of system; and a quantitative analysis of reachability graph that in turn guides to an effective safety analysis. The graphical analysis is supported by empirical verification too. These results can be used by the designer to re-design the system to improve the aspect of safety.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121579005","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":"N-gram approach for a URL similarity measure","authors":"Neetu Singh, Narendra S. Chaudhari","doi":"10.1109/IICIP.2016.7975313","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975313","url":null,"abstract":"This work addresses the problem of URL topic classification by making use of the text of Uniform Resource Locators (URLs). We have introduced a method for classifying the web pages into topics by extending the Jaccard distance measure and using the n-gram approach. We have also compared our method with the best performing known distance measures for Boolean data in the literature i.e. Jaccard, Dice and Cosine distance measures. The proposed method achieves a significant reduction of 3–7% in the misclassification error rate of the URLs over the Jaccard, Dice and Cosine distance measures.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126496947","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":"Determination of noise variances for optimality of Kalman filter","authors":"M. Priyadarshini, A. Sahoo","doi":"10.1109/IICIP.2016.7975364","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975364","url":null,"abstract":"The Kalman filter estimates unknown states optimally provided process noise covariance and measurement noise covariance should be known to the filter before operation of the filter. But some cases are there where these two covariances are not known. In those cases it is required to suitably choose the values of those parameters. If unreliable values of these parameters are taken then Kalman filter may diverge. Here Particle Swarm Optimization (PSO) technique is used for determination of those parameters when both are unknown and those parameters are used in Kalman filter for tracking of an object moving with constant acceleration model.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121815087","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":"Investigative evaluation for obtaining a more explicit QoS data measurement for LTE system","authors":"Sohaib Bhat, Amayika Kakati, Shalini Sah","doi":"10.1109/IICIP.2016.7975371","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975371","url":null,"abstract":"This paper explains the performance of voice over LTE system using different voice codec. LTE is the third generation partnership program 3GPP communication system which is wireless in nature and is also the first IP based system. VoLTE (Voice over LTE) is expected to be deployed in the near future for providing voice services. It's ability to reach high throughput is promising in both downlink and uplink so for ensuring that a good QoS is experienced by user, an efficient end-to-end model is required. There is also an increasing need for much higher data capacity as a result of smartphone industry growth. In this paper a 10×10 square kilometer campus is taken and by using OPNET modeler software different voice codec scenarios are simulated and their influences are seen on the LTE parameters like throughput, average jitter, end to end delay and MOS values which in turn helps to obtain an efficient voice service over the LTE system with little or no hitch.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134345607","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}
Nasir Fareed Shah, Amritanjali, Shefali Gautam, D. Gosain
{"title":"EERA: Energy efficient reliable routing algorithm for WSN","authors":"Nasir Fareed Shah, Amritanjali, Shefali Gautam, D. Gosain","doi":"10.1109/IICIP.2016.7975384","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975384","url":null,"abstract":"The area of wireless sensor network (WSN) being alluring among community of researchers finding it to be diverse for instance defence security, civilian applications & medical research. Issues of routing in WSN for the sake of usability in computationally constrained and resource constrained micro sensors are complex. Aforementioned coercion hinder line-up of conventional networking system devised for categorical ad-hoc sensor networks. Routing algorithms or protocols being devised for wireless sensor applications need to be candid, and shall upgrade endurance of the Wireless Sensor Network. We proposed a cinch, smart, and adaptive algorithm that assures upgraded endurance of the network. The affirmed protocol or algorithm being set side by side along other ad hoc & sensor network routing protocols. It's being perceived that affirmed protocol has much adaptive cluster maintenance, smart energy consumption mechanism, strong endurance of transmission energy, modified latency and enhanced throughput. The proposed protocol has set good benchmark in consuming transmission energy, maintaining active clusters, and efficiently utilizing network resources like bandwidth etc.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133717580","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":"Generating word clusters by graph clustering based on hearst patterns","authors":"Gaurav Saxena, Manraj Singh Grover, Shampa Chakervarty","doi":"10.1109/IICIP.2016.7975372","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975372","url":null,"abstract":"The process of clustering similar words is crucial for a broad range of applications such as text classification and word sense disambiguation. Several approaches for deriving word similarity have been proposed. Some, like latent semantic analysis, are derived from the distributional hypothesis. Others extract relationships between terms by drawing upon predefined linguistic patterns. In this work, we propose an innovative approach which combines the essence of both these approaches. In the first phase, our algorithm generates a graphical model of terms and their interrelations with the help of special lexico-syntactic patterns called Hearst Patterns. We then apply a graph clustering technique to find semantically related words.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116764401","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}
A. Shukla, Thingbaijam Rajkumari Chanu, S. Rawat, K. Ray, P. Singh
{"title":"Broadband stair shaped micro strip patch antenna for C-band applications","authors":"A. Shukla, Thingbaijam Rajkumari Chanu, S. Rawat, K. Ray, P. Singh","doi":"10.1109/IICIP.2016.7975343","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975343","url":null,"abstract":"In this work a stair shaped microstrip patch antenna which operates in C band with impedance bandwidth of 79.68% (4.087 GHz to 9.739 GHz) has been proposed. The conventional rectangular patch is modified into staircase, thus reducing the area and the ground plane has been reduced into an ‘L’ shaped ground. The proposed antenna offers average gain of 4 dBi over the entire operating bandwidth. The geometry and simulation results are discussed in this paper","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"67 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123250401","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":"High throughput adaptive block FIR filter using distributed arithmetic","authors":"Amrita Tiwari, Prashant Kumar, Manish Tiwari","doi":"10.1109/IICIP.2016.7975385","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975385","url":null,"abstract":"High throughput is the crucial parameter of the adaptive filters. Here, we present an adaptive block finite impulse response (FIR) filter with high throughput using the concept of distributed arithmetic (DA). In the proposed work, block processing is applied to the adaptive filters that has helped in improving the throughput. In this paper, computation of partial products of filter output takes place in 1 clock cycle unlike clock cycles equivalent to coefficient size(B) required by previous structures. Here B parallel DA based look-up tables (LUT) are used in order to reduce the clock cycles. This parallel structure helps in increasing the throughput by 9.11 times from the existing structure. Input matrix required for computing the output of filter and weight increment vector have minimum registers. Memory reuse approach is exploited while designing registers for generation of required input samples.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115935895","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":"Inducing factors for search engine optimization techniques: A comparative analysis","authors":"Surbhi Chhabra, R. Mittal, D. Sarkar","doi":"10.1109/IICIP.2016.7975341","DOIUrl":"https://doi.org/10.1109/IICIP.2016.7975341","url":null,"abstract":"Today, web is used in virtually all the spheres of daily life. Internet is a worldwide storehouse of information. Internet searcher is a data recovery framework that has different site information stored in it. The web index records No. of times the URL accessed; it goes to the web URL to recover its meta data and indicates page mistakes. The web searcher is at first sustained with URLs of various destinations and stores this data in its database. Then the web searcher licenses customers to look for particular data. SEO matches the content with the content given in the URLs reinforced in the database. When client taps on the connections the website page with all its information is displayed. In this paper a comparative analysis of several SEO techniques has been done based on some inducing factors like N gram indices, Key word & link optimization. The analysis shows that crawling & fetching is the best method because of faster and efficient retrieval of data from search engine.","PeriodicalId":220344,"journal":{"name":"2016 1st India International Conference on Information Processing (IICIP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114919720","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}