Department of Computer Science & Engineering

&ldquo;IIT Jodhpur is committed to impart quality education to facilitate the creation of qualified, competent and responsible human resources to meet the emerging technological challenges of the world. It is working towards creating an equitable learning platform that is positive, accessible and effective in the face of the modern societal and scientific advancements.

Flexibility in curriculum, in all its academic programs, encompassing elements of teaching, research, creativity, innovation and entrepreneurship is the most unique feature of IIT Jodhpur. The Department of Science and Technology (DST), under the National Mission on Cyber Physical Systems, has identified IIT Jodhpur as a Technology &amp; Innovation Hub in the area of Augmented Reality and Virtual Reality. The institute has also been nominated as the coordinator for the Jodhpur City and Knowledge Cluster by the Office of Principal Scientific Adviser, Government of India.

The sprawling 852-acre IIT Jodhpur campus is a majestic tribute to the deep-rooted diverse cultural heritage of the region. The campus is an architectural masterpiece, which is slated to become an international exemplar of sustainability with net-zero energy, and advanced water and waste management strategies.&rdquo;

IIT Jodhpur

An inter-vehicle communication (IVC) systems has the potential to increase the safety, efficiency and comfort of everyday road travel in VANETs. In this paper we proposed a efficient Vehicle-to-Vehicle(V2V) communication protocol for avoid the collisions in VANETs. This protocol reduces the number of road accidents by providing early warnings messages and it also reduces the latency in delivering emergency warnings messages in various road situations in VANETs. We have given simulations results for the proposed protocol reducing latency in delivering emergency warnings messages and efficient bandwidth usage in stressful road scenarios in VANETs because we use the vehicle-to-vehicle communication concept. © 2014 IEEE.

World University root node

2014 Recent Advances in Engineering and Computational Sciences, RAECS 2014

Efficient vehicle to vehicle communication protocol for VANETs

The lifetime of a sensor network is influenced by the efficient utilization of the resource constrained sensor nodes. The tree-based data gathering offers good quality of service (QoS) for the running applications. However, data gathering at the sink reduces the network lifetime due to a fast failure of highly loaded nodes. Loss of connectivity and sensing coverage affect the performance of the applications that demand critical QoS. In this paper, a data gathering tree management scheme has been proposed to deal with arbitrary node failures in delay-sensitive sensor networks. A load-balanced distributed BFS tree construction procedure has been introduced for an efficient data gathering. Based on the initial tree construction, a tree maintenance scheme and an application message handler have been designed to ensure the reliable delivery of the application messages. The correctness of the proposed scheme has been verified both theoretically and with the help of simulation. The proposed scheme offers low overhead, enhanced network lifetime and good QoS in terms of delay and reliability of the application messages. © 2014, Springer Science+Business Media New York.

International Journal of Wireless Information Networks

Topology Management Ensuring Reliability in Delay Sensitive Sensor Networks with Arbitrary Node Failures

With increasing amount of information (video, text) being available today, it has become non-trivial to develop techniques to categorize documents into contextually meaningful classes. The information as available in the documents is composed of sequence of events termed as patterns. It is evident to know the important trends as observed from patterns that are emerging over a specific time period and space. For identifying the patterns, we must focus on semantic meaning of documents. Tracing such patterns in videos or texts manually is a time-consuming, cumbersome or an impossible task. So, in this paper we have devised an unsupervised trend discovery approach that detects and correlates event patterns from videos temporally as well as spatially. We begin by building our own document collection on the basis of contextual meaning of documents. This helps in associating an input video with another video or text documents on the basis of their semantic meaning. This approach helps in accumulating variety of information that is scattered over the web thus providing relatively complete information about the video. The highly correlated words are grouped in a topic using Latent Dirichlet Allocation (LDA). To identify topics an E-MOWL based ontology is used. This event ontology helps in discovering associations and relations between the various events. With this kind of representation, the users can infer different concepts as emerged over time. For identifying the various spatial patterns that exist corresponding to an event in a document, we have utilized geographic ontology (Geoontology). We establish validity of our approach using experimental results. © 2014 IEEE.

Proceedings - 2014 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT 2014

Detecting and correlating video-based event patterns: An ontology driven approach

Unlike traditional multimedia content, content generated on social media platforms such as YouTube, Flickr etc are usually annotated with rich set of social tags such as keywords, textual description, category information, author's profile etc. In this paper we investigate the use of such social tag information for visual diversification of image search results in Flickr. We model search result diversity as an instance of the p-dispersion problem where the objective is to choose p out of n given points, so that the minimum distance between any pair of chosen points is maximized. The distance metric used in the p-dispersion problem is learnt from the data itself by combining candidate similarity measures as defined on the social tags. We demonstrate the effectiveness of our proposed method on a real-world data set. © 2014 IEEE.

Proceedings - International Conference on Pattern Recognition

Identifying diverse set of images in flickr

The paper presents a novel framework for large class, binary pattern classification problem by learning-based combination of multiple features. In particular, class of binary patterns including characters/primitives and symbols has been considered in the scope of this work. We demonstrate novel binary multiple kernel learning-based classification architecture for applications including such problems for fast and efficient performance. The character/primitive classification problem primarily concentrates on Gujarati and Bangla character recognition from the analytical and experimental context. A novel feature representation scheme for symbols images is introduced containing the necessary elastic and non-elastic deformation invariance properties. The experimental efficacy of proposed framework for symbol classification has been demonstrated on two public data sets. © 2014, Springer-Verlag Berlin Heidelberg.

International Journal on Document Analysis and Recognition

Feature combination for binary pattern classification

Cryptography is the backbone for the security systems. The main challenge in use of the Cryptosystems is maintaining the confidentiality of the cryptographic key. A Cryptosystem which encrypts the data using biometric features improves the security of the data and overcomes the problems of key management and key confidentiality. Fuzzy Vault Scheme proposed by Juels and Sudan [1] binds the secret key and the biometric template, so that extraction of the secret without the biometric data is infeasible. Physical signature is a biometric that is widely accepted and is used for proving the authenticity of a person in legal documents, bank transactions etc. Electronic devices such as digital tablets capture azimuth, altitude and pressure along with x any y coordinates at fixed time interval. This paper describes a robust online signature based cryptosystem to hide the secret by binding it with invariant online signature templates. The invariant templates of the signature are derived from artificial neural network based classifier. The entire signature is divided into fixed number of time slices. Important features are extracted based on the consistency of the feature in the slices of the genuine signature. Binary back propagation based neural network for each feature, each subset of slices for a user is trained by a weighted back propagation algorithm. The decisions of these networks are combined using AdaBoost algorithm. The proposed scheme is highly robust as it works well for all kinds of signatures and is independent of the number of zero crossing and high curvature points in the signature trajectory. © 2014 IEEE.

Proceedings of International Conference on Frontiers in Handwriting Recognition, ICFHR

A Robust Online Signature Based Cryptosystem

Approximate nearest neighbor (ANN) search provides computationally viable option for retrieval from large document collection. Hashing based techniques are widely regarded as most efficient methods for ANN based retrieval. It has been established that by combination of multiple features in a multiple kernel learning setup can significantly improve the effectiveness of hash codes. The paper presents a novel image indexing method based on multiple kernel learning, which combines multiple features by combinatorial optimization of time and search complexity. The framework is built upon distance based hashing, where the existing kernel distance based hashing formulation adopts linear combination of kernels in tune with optimum search accuracy. In this direction, a novel multiobjective formulation for optimizing the search time as well as accuracy is proposed which is subsequently solved in Genetic algorithm based solution framework for obtaining the pareto-optimal solutions. We have performed extensive experimental evaluation of proposed concepts on different datasets showing improvement in comparison with the existing methods. © 2014 IEEE.

Design of multi-kernel distance based hashing with multiple objectives for image indexing

In this paper a novel method to address the problem of enhancement and binarization of historic inscription images is presented. Inscription images in general have no distinction between the text layer and background layer due to absence of color difference and possess highly correlated signals and noise. The proposed technique provides a suitable method to separate the text layer from the historic inscription images by considering the problem as blind source separation which aims to calculate the independent components from a linear mixture of source signals, by maximizing a contrast function based on higher order cumulants. Further, the results are compared with existing ICA based techniques like NGFICA and Fast-ICA. Copyright 2014 ACM.

ACM International Conference Proceeding Series

Digitization of historic inscription images using cumulants based simultaneous blind source extraction

This paper introduces the challenge of cross spectral periocular matching. The proposed algorithm utilizes neural network for learning the variabilities caused by two different spectrums. Two neural networks are first trained on each spectrum individually and then combined such that, by using the cross spectral training data, they jointly learn the cross spectral variability. To evaluate the performance, a cross spectral periocular database is prepared that contains images pertaining to visible night vision and near infrared spectrums. The proposed combined neural network architecture, on the cross spectral database, shows improved performance compared to existing feature descriptors and cross domain algorithms. © 2014 IEEE.

2014 IEEE International Conference on Image Processing, ICIP 2014

On cross spectral periocular recognition

Biometric systems encounter variability in data that influence capture, treatment, and u-sage of a biometric sample. It is imperative to first analyze the data and incorporate this understanding within the recognition system, making assessment of biometric quality an important aspect of biometrics. Though several interpretations and definitions of quality exist, sometimes of a conflicting nature, a holistic definition of quality is indistinct. This paper presents a survey of different concepts and interpretations of biometric quality so that a clear picture of the current state and future directions can be presented. Several factors that cause different types of degradations of biometric samples, including image features that attribute to the effects of these degradations, are discussed. Evaluation schemes are presented to test the performance of quality metrics for various applications. A survey of the features, strengths, and limitations of existing quality assessment techniques in fingerprint, iris, and face biometric are also presented. Finally, a representative set of quality metrics from these three modalities are evaluated on a multimodal database consisting of 2D images, to understand their behavior with respect to match scores obtained from the state-of-the-art recognition systems. The analysis of the characteristic function of quality and match scores shows that a careful selection of complimentary set of quality metrics can provide more benefit to various applications of biometric quality. © 2014, Bharadwaj et al.; licensee Springer.