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

With the advancements in technology and growing popularity of facial photo editing in the social media landscape, tools such as face swapping and face morphing have become increasingly accessible to the general public. It opens up the possibilities for different kinds of face presentation attacks, which can be taken advantage of by impostors to gain unauthorized access of a biometric system. Moreover, the wide availability of 3D printers has caused a shift from print attacks to 3D mask attacks. With increasing types of attacks, it is necessary to come up with a generic and ubiquitous algorithm with a panoptic view of these attacks, and can detect a spoofed image irrespective of the method used. The key contribution of this paper is designing a deep learning based panoptic algorithm for detection of both digital and physical presentation attacks using Cross Asymmetric Loss Function (CALF). The performance is evaluated for digital and physical attacks in three scenarios: ubiquitous environment, individual databases, and cross-attack/cross-database. Experimental results showcase the superior performance of the proposed presentation attack detection algorithm. © 2019 IEEE.

World University root node

2019 International Conference on Biometrics, ICB 2019

Crafting A Panoptic Face Presentation Attack Detector

Biological Neurons show a very rich range of dynamic properties and working, whereas the neurons in Artifi cial Neural Networks though being a very crude approximation of these biological networks are nowhere near as versatile as the biological neurons. Besides this argument, there are many reasons like biologically implausible weight updating algorithm Back-propagation which refers to a notion of derivative/gradient of a neuron that is not biologically synonymous to neural networks. The main idea of this research is to use the power Dynamical System representation of a neuron for an e active synaptic weight update algorithm for developing a biologically plausible Spiking neural network algorithm. Proof of concept is shown empirically by showing that the proposed SNN architecture is able to learn image patterns reasonably well.

IIITD-Delhi

Synaptic weight update in Deep Spiking Neural Networks

Adversary detection tool

Bio-signals such as electroencephalogram (EEG) contain low activity regions often called B-noise and high activity regions called active potentials. The high activity regions are more important as compared to their counterpart. In addition, the signals are considerably sparse in the low activity regions. Thus a full n-bit conversion of low activity samples into digital domain increases readout power and reduces data acquisition rate of analog to digital converter (ADC). To alleviate these problems, a reconfigurable cyclic ADC is presented in this paper. Input range and conversion cycles of the proposed ADC are varied according to the samples of the neural signal. The high activity region samples are resolved using conventional n-bits, however, the low activity region is resolved using less number of bits. This saves readout power and also reduces the digital data content. The proposed ADC is designed and fabricated in UMC 180 nm CMOS technology. The ADC operates at a sampling rate of 200 kS/s and consumes 61.8 μW of power. The chip occupies an area of 0.031 mm2. Using reconfiguration, the power saving of 28.6% is achieved compared to the conventional n-bit full conversion. © 2019 IEEE.

Department of Electrical Engineering

BioCAS 2019 - Biomedical Circuits and Systems Conference, Proceedings

A reconfigurable cyclic ADC for biomedical applications

In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately. Motivated by the definitions of the directed variants of the classical Cutwidth and Pathwidth problems, we define Digraph Bandwidth as follows. Given a digraph D and an ordering σ of its vertices, the digraph bandwidth of σ with respect to D is equal to the maximum value of σ(v)−σ(u) over all arcs (u, v) of D going forward along σ (that is, when σ(u) &lt; σ(v)). The Digraph Bandwidth problem takes as input a digraph D and asks to output an ordering with the minimum digraph bandwidth. The undirected Bandwidth easily reduces to Digraph Bandwidth and thus, it immediately implies that Directed Bandwidth is NP-hard. While an O?(n!)1 time algorithm for the problem is trivial, the goal of this paper is to design algorithms for Digraph Bandwidth which have running times of the form 2O(n). In particular, we obtain the following results. Here, n and m denote the number of vertices and arcs of the input digraph D, respectively. Digraph Bandwidth can be solved in O?(3n · 2m) time. This result implies a 2O(n) time algorithm on sparse graphs, such as graphs of bounded average degree. Let G be the underlying undirected graph of the input digraph. If the treewidth of G is at most t, then Digraph Bandwidth can be solved in time O?(2n+(t+2) log n). This result implies a 2n+O(√n log n) algorithm for directed planar graphs and, in general, for the class of digraphs whose underlying undirected graph excludes some fixed graph H as a minor. Digraph Bandwidth can be solved in min{O∗(4n · bn), O∗(4n · 2b log b log n)} time, where b denotes the optimal digraph bandwidth of D. This allow us to deduce a 2O(n) algorithm in many cases, for example when b ≤ log2 n. n Finally, we give a (Single) Exponential Time Approximation Scheme for Digraph Bandwidth. In particular, we show that for any fixed real ε &gt; 0, we can find an ordering whose digraph bandwidth is at most (1 + ε) times the optimal digraph bandwidth, in time O∗(4n · (d4/εe)n). © Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, and Roohani Sharma; licensed under Creative Commons License CC-BY.

Leibniz International Proceedings in Informatics, LIPIcs

Exact and approximate digraph bandwidth

An input to a conflict-free variant of a classical problem Γ, called Conflict-Free Γ, consists of an instance I of Γ coupled with a graph H, called the conflict graph. A solution to Conflict-Free Γ in (I,H) is a solution to I in Γ, which is also an independent set in H. In this paper, we study conflict-free variants of Maximum Matching and Shortest Path, which we call Conflict-Free Matching (CF-Matching) and Conflict-Free Shortest Path (CF-SP), respectively. We show that both CF-Matching and CF-SP are W[1]-hard, when parameterized by the solution size. Moreover, W[1]-hardness for CF-Matching holds even when the input graph where we want to find a matching is itself a matching, and W[1]-hardness for CF-SP holds for conflict graph being a unit-interval graph. Next, we study these problems with restriction on the conflict graphs. We give FPT algorithms for CF-Matching when the conflict graph is chordal. Also, we give FPT algorithms for both CF-Matching and CF-SP, when the conflict graph is d-degenerate. Finally, we design FPT algorithms for variants of CF-Matching and CF-SP, where the conflicting conditions are given by a (representable) matroid. © Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, and Saket Saurabh.

Parameterized complexity of conflict-free matchings and paths

In the near future, one of the promising concepts which are going to change undoubtedly the whole automobile industry, vehicular networking, software industry, IT manufacturing industry, Industry, transportation sector, service provider, etc. is the Internet of Vehicles (IoV). It can have the capability to boost innovation in smart city applications(like intelligent transportation, smart health-care, smart environment etc). The IoV is a dynamic network system which allows data sharing between different entities like vehicles, their surrounding RSUs (Roadside Units), infrastructures, sensors, mobile devices, clouds, etc. It opened new opportunities in different services and applications to enhance road conditions, driver/passenger safety, transportation issues, non-safety applications, etc. However, ensuring Efficiency and security is one of the main challenges in an IoV scenario. In this paper, we introduce the new effective and efficient architecture for the next generation vehicular technologies for identify the inappropriateness of most existing work, and address the challenging issues of secure and efficient packet forwarding and energy efficient by proposing new effective and efficient scheme for VANETs using Internet of Vehicles and Mobile Femto Access Points. © 2019 IEEE.

IEEE Region 10 Annual International Conference, Proceedings/TENCON

Improving Throughput and Energy Efficiency in Vehicular Ad-Hoc Networks using Internet of Vehicles and Mobile Femto Access Points

Exponential growth in the field of Internet of Things (IoT) in recent times has resulted in generation of huge amount of sensory data on daily basis. In the context of smart building monitoring applications, the inherent heterogeneity and dynamics of the system along with a wide range of quality of service requirement for different running applications make it challenging for efficient data management. An offline analysis on huge amount of data suffering from noise and redundancy for learning inference would not be a good idea considering the huge overhead. In this work, we try to motivate the requirement of context adaptive sensing and in-network fusion of sensory data for smart building monitoring applications towards faster inference and thus efficient decision-making for automation. To the best of our knowledge, this work is the first to exploit in-network fusion in smart building monitoring systems. We justify our proposed scheme by deploying a campus-scale sensor network and performing an in-network data fusion using Kalman Filter and making the system context-adaptive. © 2019 IEEE.

2019 11th International Conference on Communication Systems and Networks, COMSNETS 2019

Significance of Adaptive Sensing for Smart Building Monitoring: A Practical Study

The vehicular ad-hoc network (VANET) is a significant platform for smart transportation in which vehicles and road-side-units (RSUs) publicly transmit important information with each other on the road. Thus, receivers should generally confirm the sender and data before considering obtained data. Therefore, researchers suggested different vehicular communication schemes to transfer data on the road, but most of these schemes are vulnerable to crucial security attacks, and they are not efficient for vehicular communications due to high computational cost and communication overhead. To overcome security and performance issues, we propose an effective vehicle-to-RSU data transmission scheme using the one-way hash function to exchange meaningful data securely. Further, we do security and performance analysis of the proposed method and do the comparison with other relevant communication schemes. Moreover, the suggested method resists to various security attacks, and it performs better in storage requirement, communication cost, experimental time, and energy consumption compared to other relevant data transmission methods. © 2019 Elsevier B.V.

Pervasive and Mobile Computing

Identity based proficient message verification scheme for vehicle users

The innovations in wireless communication technologies, cloud computing, connected vehicles, autonomous vehicles, the Internet of everything, etc. opened a way for the creation, development, advancement, and establishment of vehicular networks for emerging smart city applications. Among them, automated and connected vehicle technologies are among the most researched topics. The currently available concepts are only a fraction of what is being developed for the future. In connected vehicles, the Internet of Vehicles (IoVs) is a promising concept where cars or vehicles can use various communication technologies to communicate with the driver or other entities on the road. In this paper, we explore the future entities in a smart city to which a vehicle can communicate. Moreover, we investigate the importance of warning messages for reducing road transportation issues as IoVs already proved that it could reduce worldwide traffic issues, accident rates, transportation issues, etc. to a particular extent. In spite of several attractive features, ensuring security and lightweight property is one of the challenges in an IoV scenario. Therefore, we propose a Secure Authentication for Future Entities (SAFE) protocol, which uses cryptographic operations for enhancing security and preserving privacy. © 2019 IEEE.