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

We are proposing a self deploying mobile sensor network which is empowered with event based relocation of redundant sensors for enhancing the quality of event sensing. Energy efficient Cell quorum based protocol is used for communication between event location and redundant sensors. Computationally light cascaded reorganization of sensor is suggested for relocation of sensors. The proposed method provides good coverage as it dynamically relocates the sensors either for avoiding coverage hole or for improving the quality of event sensing.

World University root node

Fulltext

International Journal on Smart Sensing and Intelligent Systems

Self organizing sensor network to enhance event coverage

Preservation of intangible cultural heritage, such as music and dance, requires encoding of background knowledge together with digitized records of the performances. We present an ontology-based approach for designing a cultural heritage repository for that purpose. Since dance and music are recorded in multimedia format, we use Multimedia Web Ontology Language (MOWL) to encode the domain knowledge. We propose an architectural framework that includes a method to construct the ontology with a labeled set of training data and use of the ontology to automatically annotate new instances of digital heritage artifacts. The annotations enable creation of a semantic navigation environment in a cultural heritage repository. We have demonstrated the efficacy of our approach by constructing an ontology for the cultural heritage domain of Indian classical dance, and have developed a browsing application for semantic access to the heritage collection of Indian dance videos. © 2011 ACM.

Journal on Computing and Cultural Heritage

Nrityakosha: Preserving the intangible heritage of indian classical dance

In this paper, we propose a novel framework for segmentation of documents with complex layouts. The document segmentation is performed by combination of clustering and conditional random fields (CRF) based modeling. The bottom-up approach for segmentation assigns each pixel to a cluster plane based on color intensity. A CRF based discriminative model is learned to extract the local neighborhood information in different cluster/color planes. The final category assignment is done by a top-level CRF based on the semantic correlation learned across clusters. The proposed framework has been extensively tested on multi-colored document images with text overlapping graphics/image. © 2011 IEEE.

Proceedings of the International Conference on Document Analysis and Recognition, ICDAR

A CRF based scheme for overlapping multi-colored text graphics separation

Simultaneous latent fingerprints are clusters of friction ridge impressions deposited concurrently in a crime scene. The analysis of these impressions is a complex task to infer individualization, exclusion or categorize as inconclusive. The problem is further compounded when distinctive features in each latent fingerprint in the cluster are of varying quality or none of the fingerprint has the requisite number of features to reliably arrive at a conclusion. Recently, SWGFAST (Scientific Working Group on Friction Ridge Analysis, Study and Technology) proposed a draft standard for simultaneous impression examination. The approach is manual and requires known reference ten-print for comparing with an unknown simultaneous latent fingerprint. This paper proposes a semi-automatic approach to process and analyze simultaneous latent fingerprints. The proposed algorithm demonstrates that comparisons can be made from a database of ten-prints for a more comprehensive search instead of the time consuming manual approach used by latent fingerprint examiners. The algorithm was implemented using several soft computing and classification approaches and the performance was compared using the simultaneous latent fingerprint database. The results show that 2ν-SVM with RBF kernel gave the best results both in terms of time and accuracy. © 2010 Elsevier B.V. All rights reserved.

Applied Soft Computing Journal

Simultaneous latent fingerprint recognition

This research presents a forensics application of matching two latent fingerprints. In crime scene settings, it is often required to match multiple latent fingerprints. Unlike matching latent with inked or live fingerprints, this research problem is very challenging and requires proper analysis and attention. The contribution of this paper is three fold: (i) a comparative analysis of existing algorithms is presented for this application, (ii) fusion and context switching frameworks are presented to improve the identification performance, and (iii) a multi-latent fingerprint database is prepared. The experiments highlight the need for improved feature extraction and processing methods and exhibit large scope of improvement in this important research problem. © 2011 IEEE.

2011 International Joint Conference on Biometrics, IJCB 2011

On matching latent to latent fingerprints

Low cost Radio Frequency IDentification (RFID) tags are increasingly being deployed in various practical applications these days. Security analysis of the way these tags are used in an application is a must for successful adoption of the RFID technology. Depending on the requirements of the particular application, security demands on these tags cover some or all of the aspects such as privacy, untraceability and authentication. As a result of increasing deployment of RFID tags, many works on RFID protocols and their security analysis have appeared in the literature in the past few years. Although most protocol proposals also provide some justification for the claimed security properties of these protocols, independent third party evaluation has often revealed weaknesses in these protocols. In this work, we present a third party security evaluation of a recently proposed Lightweight Mutual Authentication Protocol (LMAP ++). Mutual authentication protocols are an important class of protocols for RFID applications. In these protocols, the reader and the tag of an RFID system run an interactive game to authenticate themselves to each other. In this work, we present traceability and desynchronization attacks against the protocol LMAP ++. First we show that LMAP ++ does not satisfy the security notion of traceability as defined in the model proposed by Jules and Weis. Using the ideas of this traceability attack, next we show that LMAP ++ also suffers from a desynchronization attack. The presented attacks have low complexities and high success probabilities. To the best of our knowledge, this the first attack on the LMAP ++ protocol. © 2011 ICITST.

2011 International Conference for Internet Technology and Secured Transactions, ICITST 2011

Security analysis of LMAP ++, an RFID authentication protocol

Segmentation of cursive handwriting is one of the most challenging problems in the area of handwritten character recognition. In this paper, we propose a novel approach towards character segmentation in a handwritten document. It is based on the vertex characterization of outer isothetic polygonal covers so that each cover corresponds to a particular word or part of a word. The proposed method has the potential to segment skewed text without deskewing them. Experiment is done on several Bangla handwritings of different individuals. The average success rate is 96.04%. This method can be considered as a significant preprocessing step towards the development of a handwritten Bangla OCR system. © 2011 IEEE.

Proceedings - 2011 3rd National Conference on Computer Vision, Pattern Recognition, Image Processing and Graphics, NCVPRIPG 2011

Character segmentation of handwritten Bangla text by vertex characterization of isothetic covers

Programmable Cellular Automata (PCA) employs some control signals on a Cellular Automata(CA) structure. Programmable Cellular Automata were successfully applied for simulation of biological systems, physical systems and recently to design parallel and distributed algorithms for solving task density and synchronization problems. In this paper PCA is applied to develop cryptography algorithms. This paper deals with the cryptography for a parallel AES encryption algorithm based on programmable cellular automata. This proposed algorithm based on symmetric key systems. © 2011 Springer-Verlag.

Communications in Computer and Information Science

A parallel AES encryption algorithm based on PCA

A reliable broadcast demands that each data packet forwarded from the source node is received by all other nodes in the network without any loss. A flooding based Broadcast scheme incurs significant overhead due to explosion of packets in the network. So an efficient way of routing packets in order to broadcast saves the energy of resource constrained sensor nodes. The delivery of broadcast packets at each node in correct sequence is also crucial for certain applications. In this paper a tree based broadcast mechanism is proposed that constructs a spanning tree out of all nodes in the network rooted at the source of the broadcast. The broadcast tree eventually becomes a Breadth-First Search(BFS) tree where each node maintains the shortest path to the root. So packets routed through the shortest paths reduce transmission delay and packet loss. BFS tree based broadcast saves the battery power at each node by reducing the number of packet transmissions. The proposed scheme for broadcast is also crash tolerant. Each node computes a maintenance plan during the broadcast tree construction for future requirement. If a node dies, all the nodes in neighborhood repairs the tree locally within constant round of message transmissions. Each broadcast packet is assured to be delivered at each node without redundancy and maintaining the correct order. © 2011 IEEE.

2011 2nd International Conference on Computer and Communication Technology, ICCCT-2011

A reliable and total order tree based broadcast in wireless sensor network

Given a part of a document image taken with any camera at an arbitrary orientation and sometimes farfrom- perfect illumination, an important problem is to match this query image to the corresponding full image from a document database. We propose a novel multi-resolution robust methodology for the same. The method combines information from independent sources of measurement in a probabilistic framework. The proposed method is invariant to a large range of distortions, illumination changes, and is relatively resilient to noise and unmodelled objects present as clutter. To the best of our knowledge, no related work address all these issues. © 2011 IEEE.