Centre for Modelling, Simulation and Design

Permanent URI for this community

https://dspace.uohyd.ac.in/handle/1/58

Browse

Browsing Centre for Modelling, Simulation and Design by Author "Agarwal, Arun"
  • Item
    A hierarchical learning approach for finding multiple vehicle number plate under cluttered background
    ( 2016-01-01) Kirti, ; Rao, C. Raghavendra ; Wankar, Rajeev ; Agarwal, Arun
    Traffic control is one of the biggest problems faced by the surveillance department in every country. Manual surveillance supported by well-defined rules and effective equipment is a common solution to this problem. But, often traffic personnel fail to isolate and recognize the number plate and hence to penalize the owner of the vehicle who violated the traffic rules due to the speeding vehicle and mounting of number plates at arbitrary parts of the vehicle. Hence, his inability renders the traffic surveillance a challenging research area. The automatic vehicle number plate recognition system provides one of the solutions to this problem but constrained by various limitations. The most challenging aspect is to detect the number plates itself present in an image. The presence of multiple vehicle number plates and cluttered background makes our work different from earlier approaches. A single step process may not be able to detect all the number plates in an image, hence we propose Hierarchical Filtering (HF) approach which employs several transformation functions on the input image. The proposed HF models the characteristics of vehicle number plates and label them by fitting the Logistic Regression model. The proposed method is able to detect all the number plates present in an image but at the expense of some non-number plate regions in the form of a minimum bounding rectangle. The proposed model is tested on a wide range of inputs, and the results are profiled in terms of precision and recall measures.
  • Item
    A methodology for high availability of data for business continuity planning / disaster recovery in a grid using replication in a distributed database
    ( 2008-12-01) Chidambaram, J. ; Prabhu, C. S.R. ; Rao, P. A.Narasimha ; Wankar, Rajeev ; Aneesh, C. Sreevallabh ; Agarwal, Arun
    High Availability systems ensure nonstop service delivery despite natural calamities or any other disruptions, whatsoever. In a grid, High Availability can be achieved by offering services of a failed node from any other live node, if redundant storage of data and software of the failed node is made available on that live node. During replication of data in a grid for high availability, the techniques used in distributed databases can be exploited. Data replication can be achieved better by efficient data distribution across the various nodes in the grid. In this paper, a methodology for High Availability of data for Business Continuity Planning/Disaster Recovery (BCP/DR) in a grid environment is proposed, using some of the features of distributed query processing. With this approach OGSA-DQP (Open Grid Services Architecture -Distributed Query Processing) standard can be extended to OGSAHA for high availability.
  • Item
    A rough set based PCM for authorizing grid resources
    ( 2010-12-01) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM) [1]. HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). Further enhancement of HCM is done to make it suitable for dynamic environments [2]. However, HCM is not totally free from repetitions. Moreover, HCM is an expensive process in terms of decision tree size and memory consuming. In this paper, a new Rough Set based PCM is proposed which increases the efficiency of the authorization process and further reduces the redundancy. © 2010 IEEE.
  • Item
    A two phased service oriented Broker for replica selection in data grids
    ( 2013-01-01) Almuttairi, Rafah M. ; Wankar, Rajeev ; Negi, Atul ; Rao, C. R. ; Agarwal, Arun ; Buyya, Rajkumar
    Replica selection is one of the fundamental problems in Data Grid's environment. This work's concern is designing a Two phasedService Oriented Broker (2SOB) for replica selection. It is focused on investigating, selecting, modifying, and experimenting with some non-conventional approaches to be applied on the relevant selection techniques. The motivation of this work is to introduce a novel Service OrientedBroker for Replica Selection in Data Grid. The main characteristics of this 2SOB are: Scalability, Reliability, Availability, Efficiency and Ease of deployment. 2SOB consists of two phases; the first is a Coarse-grainphase, basically used for sifting replica sites that have low latency (uncongested network links) and distinguishing them from other replicas having a high latency (congested network links). Procedurally, this has been done using the association rules concept of the Data Mining approach. The second is a Fine-grainphase,used for extracting the replicas admissible for user requirements through applying Modified Minimum Cost and Delay Policy (MMCD). Both phases have accordingly been designed, simulated, coded, and then validated using real data from EU Data Grid.The first phase has thereby been applied on the real network data of CERN (February 2011). Experimentations compared with some other contemporary selection methods of different Brokers showed appreciable results. Using this proposed Broker it is possible to achieve an enhancement in the speed of executing Data Grid jobs through reducing the transfer time. © 2012 Elsevier B.V. All rights reserved.
  • Item
    Automatic gap identification towards efficient contour line reconstruction in topographic maps
    ( 2009-10-13) Sandhya, B. ; Agarwal, Arun ; Rao, C. Raghavendra ; Wankar, Rajeev
    Automatic extraction and vectorization of contour lines from color topographic maps is an important precursor to obtaining useful information for many vector based GIS applications. In this work, a novel hybridized algorithm is developed for reconstructing the extracted contour lines from color topographic map. The extraction of contour lines from a topographic map leads to broken contour lines due to inherent characteristics of the map, thus posing a challenging problem of identifying gaps and then filling them. This has been addressed by developing algorithms based on connected components, graph theory, Expectation Maximization (EM) and numerical methods. Our algorithm operates by isolating the segments of those contours which have gaps and achieves in reducing the complexity of the matching of such segments by employing the EM algorithm. We also present a new scheme of filling gaps present in thick contours without the application of thinning algorithms. © 2009 IEEE.
  • Item
    Concurrent HCM for authorizing grid resources
    ( 2012-03-08) Kaiiali, Mustafa ; Raghavendra Rao, Chillarige ; Wankar, Rajeev ; Agarwal, Arun
    Grid computing is concerned with a shared and coordinated use of heterogeneous resources, belongs to distributed virtual organizations to deliver nontrivial quality of services. In grids, security has a major concern. The heterogeneity, massiveness and dynamism of grid environments complicate and delay the authorization process. This brings out the need for a fast and scalable fine-grained access control (FGAC) mechanism to cater well to grid requirements. © 2012 Springer-Verlag.
  • Item
    Contour layer extraction from colour topographic map by feature selection approach
    ( 2011-09-01) Banda, Sandhya ; Agarwal, Arun ; Rao, C. Raghavedra ; Wankar, Rajeev
    Contour layer of topographic maps can provide useful information for many vector based GIS applications. A topographic map consists of various semantic layers of overlapping information, differentiated primarily based on colour. Hence, to extract the contour layer from a topomap, colour segmentation algorithms are employed. However due to scanning and inherent features of topomap, colour space selection which provides efficient segmentation results becomes essential. The method proposed uses PCA as feature selection approach to select the colour features of topomap. The clusters are further processed to map to the layers of topomap using spatial properties. © 2011 IEEE.
  • Item
    Design of a structured fine-grained access control mechanism for authorizing grid resources
    ( 2008-11-17) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    The heterogeneous and very dynamic nature of a grid environment demands a very scalable authorization system. This brings out the need for a fast fine-grained access control (FGAC) mechanism for grid resources to accomplish the required scalability. This paper is proposing a new method of storing and manipulating the resource's security policy in a way that enables authorization systems to avoid redundancy in security policy checking and to more rapidly specify which group of resources the authenticated user is authorized to access. Comparative study is made in a simulated environment. The proposed method can be integrated in the present authorization systems for better performance. © 2008 IEEE.
  • Item
    Design of concurrent utilities in Jackal: A software DSM implementation
    ( 2008-01-01) Nalla, Pradeep Kumar ; Wankar, Rajeev ; Agarwal, Arun
    A Distributed Shared Memory (DSM) system logically implements the shared-memory model on a physically distributed-memory system. Jackal is an open source [2] fine grained distributed shared memory implementation of the Java programming language. Java inherently supports parallel programming with the use of multi-threading. Jackal exploits this property and allows users to run multi-threaded programs unmodified on a distributed memory environment such as a cluster. Since the built-in language support for threads is insufficient for many programming tasks, Java-1.5 introduces concurrent utilities [4]. Concurrent utilities of Java are classes that are designed as building blocks in making concurrent classes or applications. These utilities provide reduce programming effort, increase performance, increase reliability, improve maintainability and increase productivity. In this work we implement a subset of these utilities in Jackal. © Springer-Verlag Berlin Heidelberg 2008.
  • Item
    Enhancing the hierarchical clustering mechanism of storing resources' security policies in a grid authorization system
    ( 2010-03-25) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources, which reduces the scalability and leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions and increases the scalability is the Hierarchical Clustering Mechanism (HCM) [1]. HCM outperforms the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). This paper enhances HCM to accommodate the dynamism of the grid and the same is demonstrated using new algorithms. © 2010 Springer.
  • Item
    Grid authorization graph
    ( 2013-06-11) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun ; Buyya, Rajkumar
    The heterogeneous and dynamic nature of a grid environment demands a scalable authorization system. This brings out the need for a fast fine-grained access control mechanism for authorizing grid resources. Existing grid authorization systems adopt inefficient mechanisms for storing resources' security policies. This leads to a large number of repetitions in checking security rules. One of the efficient mechanisms that handle these repetitions is the Hierarchical Clustering Mechanism (HCM). HCM reduces the redundancy in checking security rules compared to the Brute Force Approach (BFA) as well as the Primitive Clustering Mechanism (PCM). Further enhancement is done to HCM to increase the scalability of the authorization process. However, HCM is not totally free of repetitions and cannot easily describe the OR-based security policies. A novel Grid Authorization Graph (GAG) is proposed to overcome HCM limitations. GAG introduces special types of edges named "Correspondence Edge"/"Discrepancy Edge" which can be used to entirely eliminate the redundancy and handle the cases where a set of security rules are mutually exclusive. Comparative studies are made in a simulated environment using the Grid Authorization Simulator (GAS) developed by the authors. It simulates the authorization process of the existing mechanisms like BFA, PCM, HCM and the proposed novel GAG. It also enables a comparative analysis to be done between these approaches. © 2013 Elsevier B.V. All rights reserved.
  • Item
    Hand gesture segmentation from complex color-texture background image
    ( 2013-12-01) Verma, Vinay Kumar ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Gestures provide a rich, intuitive and natural form of interaction between human and other devices. In this paper an automatic hand gesture segmentation technique from the complex color-texture Image is developed for segmentation of hand gesture with less false positive rate(FPR). In this approach we propose a model for Skin Color Characterization and define a Potential of a Pixel (PoP) which are then used to segment the hand gesture. This new skin segmentation technique takes into account both the color-texture features for efficient segmentation. It is observed that the classifier is robust with respect to usage of hand and mode of hands like front or back side of hand. To evaluate the system the hand gesture images have been acquired from set of students under various complex background. The gesture segmentation technique has false positive rate of nearly 5.7% and true positive rate near to 98.93%. © 2013 Springer-Verlag.
  • Item
    iGEON: Networking the Indian geosciences community through GEON
    ( 2011-01-01) Subbarao, K. V. ; Agarwal, Arun ; Wankar, Rajeev ; Baru, Chaitanya
    We must be ever prepared to accept and experiment with new materials from all sources and determine what can be useful to us and take the fullest possible advantage of such materials. Sir C. V. Raman (1958) Geoinformatics: An Indian perspective We provide an overview of geoinformatics activities that are being coordinated by the University of Hyderabad, India via two research institutes at the University, viz. the University Center for Earth and Space Sciences (UCESS) and the Center for Modeling, Simulation, and Design (CMSD) (Agarwal, 2006). We also describe cyberinfrastructure-related activities undertaken as part of the iGEON-India project, which has been a collaboration with the GEON project in the USA, supported by a grant from the Indo-US Science and Technology Forum, IUSSTF (Agarwal et al., 2009). During the past 5 years or so, India has made great strides in mineral and other natural resource surveys using both direct and indirect (satellite-based remotely sensed data) techniques, leading to exploration and exploitation of both mineral and forest wealth, and improved data bases for weather prediction and disaster management. We recognize that wise utilization of our natural resources including, minerals, water, and forests, will be possible only through free and unfettered dissemination of accurate data and timely sharing of such information. Data relating to earth sciences are accumulating at an astonishing rate all over the world. Indeed, it has become impossible to keep pace with the growing tempo of new information from research publications.
  • Item
    Image processing tool for FAE cloud dynamics
    ( 2014-01-01) Roy, Mousumi ; Allam, Apparao ; Agarwal, Arun ; Wankar, Rajeev ; Chillarige, Raghavendra Rao
    Understanding the Fuel air explosive cloud characteristics is an important activity in FAE warhead designing. This paper develops and demonstrates the understanding of cloud dynamics through image processing methodology by analyzing the video. This paper develops apt ROI extraction method as well as models for cloud radius and height. This methodology is validated using one of the HEMRL (High Energy Materials Research Laboratory), Pune experimental data.
  • Item
    New efficient tree-building algorithms for creating HCM decision tree in a grid authorization system
    ( 2010-12-27) Kaiiali, Mustafa ; Wankar, Rajeev ; Rao, C. R. ; Agarwal, Arun
    Many existing grid authorization systems adopt an inefficient structure of storing security policies for the available resources. That leads to huge repetitions in checking security rules. One of the efficient mechanisms that handles these repetitions is the Hierarchical Clustering Mechanism (HCM). HCM reduces the redundancy in checking security rules compared to the Brute Force Approach as well as the Primitive Clustering Mechanism (PCM). However, HCM is not totally free from redundancy. In this paper, new HCM tree-building algorithms are proposed which further reduce the redundancy and increase the efficiency to a reasonable extent. © 2010 IEEE.
  • Item
    Seamless provision of cloud services using peer-to-peer (P2P) architecture
    ( 2012-03-08) Masne, Snehal ; Wankar, Rajeev ; Raghavendra Rao, Chillarige ; Agarwal, Arun
    Cloud computing involves highly variable resource requirement that demands high availability, scalability and performance. At times, single cloud service provider would be saturated or running out of resources and may be unable to provide the services to its client, resulting in poor scalability and reliability. It may tarnish the trust parameter of customer. In addition, there is huge investment in setting up a single scalable cloud, which in turn has many environmental impacts. In this work, we propose an architecture to inter-connect different clouds in P2P fashion to address the problems like efficiency bottleneck and single point of failure that are predominantly associated with traditional approaches. This idea gives access to much larger pools of resources/services. Each provider can maximize their profit by creating new collaborative services. These capabilities can be available and tradable through a service catalogue to support innovations and applications. © 2012 Springer-Verlag.