Abstract

This paper explores the effectiveness of statistical language model ( SLM ) and dictionary based methods for detec- tion and correction of errors in Indic OCR output. In SLM , we use unicode level ngrams for building the language model. We compare its performance with akshara level ngrams and find that akshara level ngrams perform better in detecting the errors when compared to unicode level ngrams. We experimentally analyze the performance of Indic OCR post-processing using dictionary method, compare the performance with English and analyze the reasons for the under-performance in Indic scripts. We use four major Indian languages for our experiments, namely Hindi, Gurumukhi, Telugu and Malayalam.

Abstract

The power of ConvNets has been demonstrated in a wide variety of vision tasks including pose estimation. But they often produce absurdly erroneous predictions in videos due to unusual poses, challenging illumination, blur, self-occlusions etc. These erroneous predictions can be re- fined by leveraging previous and future predictions as the temporal smoothness constrain in the videos. In this paper, we present a generic approach for pose correction in videos using sequence learning that makes minimal assumptions on the sequence structure. The proposed model is generic, fast and surpasses the state-of-the-art on benchmark datasets. We use a generic pose estimator for initial pose estimates, which are further refined using our method. The proposed architecture uses Long Short-Term Memory ( LSTM ) encoder- decoder model to encode the temporal context and refine the estimations. We show 3.7% gain over the baseline Yang & Ramanan ( YR ) [1] and 2.07% gain over Spatial Fusion Network ( SFN ) [2] on a new challenging YouTube Pose Subset dataset [3]. Keywords-Pose estimation; sequence to sequence learnin

Abstract

We look at the problem of developing a compact and accurate model for gesture recognition from videos in a deep-learning framework. Towards this we propose a joint 3DCNN-LSTM model that is end-to-end trainable and is shown to be better suited to capture the dynamic information in actions. The solution achieves close to state-of-the-art accuracy on the ChaLearn dataset, with only half the model size. We also explore ways to derive a much more compact representation in a knowledge distillation framework followed by model compression. The final model is less than 1 MB in size, which is less than one hundredth of our initial model, with a drop of 7% in accuracy, and is suitable for real-time gesture recognition on mobile devices.

Abstract

We will present our work on controlling nuclear and electronic motion in molecules using laser pulses designed using Optimal control theory (OCT). The control problem is formulated as the maximization of cost functional made of an objective function along with the constraints on the field fluence. The objective function has the prescribed dynamical goals. A detailed analysis of the optimal pulse reveals complex path-ways to arrive at seemingly simple goals. We have used OCT to obtain infrared laser pulses for the selective vibrational excitation of several different systems, from a simple diatomic to triatomic systems located in complex molecular environments. Controlled initiation of intramolecular H-transfer in malonaldehyde using ultrashort uv-laser pulses through an optically bright electronic excited state as a mediator will be discussed. Finally, our attempts to control the quantum dynamics of N-H photodissociation of pyrrole via a counterintuitive coupling of electronic states using uv-laser pulses will be discussed.

Abstract

A first principles quantum dynamics study of N–H photodissociation of pyrrole on the coupled electronic states is carried out with the aid of an optimally designed UV-laser pulse. A new photodissociation path, as compared to the conventional barrier crossing on the state, opens up upon electronic transitions under the influence of pump-dump laser pulses, which efficiently populate both the dissociation channels. The interplay of electronic transitions due both to vibronic coupling and the laser pulse is observed in the control mechanism and discussed in detail. The proposed control mechanism seems to be robust, and not discussed in the literature so far, and is expected to trigger future experiments on the photochemistry of molecules of chemical and biological importance. The design of the optimal pulses and their application to enhance the overall dissociation probability is carried out within the framework of optimal control theory. The quantum dynamics of the system in the presence of pulse is treated by solving the time-dependent Schr ̈ odinger equation in the semi-classical dipole approximation

Abstract

Optimal initiation of quantum dynamics of N-H photodissociation of pyrrole on the S0- 1πσ∗( 1A2) coupled electronic states by UV-laser pulses in an effort to guide the subsequent dynamics to dissociation limits is studied theoretically. Specifically, the task of designing optimal laser pulses that act on initial vibrational states of the system for an effective UV-photodissociation is considered by employing optimal control theory. The associated control mechanism(s) for the initial state dependent photodissociation dynamics of pyrrole in the presence of control pulses is examined and discussed in detail. The initial conditions determine implicitly the variation in the dissociation probabilities for the two channels, upon interaction with the field. The optimal pulse corresponds to the objective fixed as maximization of overall reactive flux subject to constraints of reasonable fluence and quantum dynamics. The simple optimal pulses obtained by the use of genetic algorithm based optimization are worth an experimental implementation given the experimental relevance of πσ∗-photochemistry in recent times.

Abstract

There are numerous situations when a service requester wishes to expertsourcea series of identical but non-trivial tasks from a pool of experts so as to achieve an assured accuracy level for each task, in a cost optimal way. The experts available are typically heterogeneous with unknown but fixed qualities and different service costs. The service costs are usually private to the experts and the experts could be strategic about their costs. The problem is to select for each task an optimal subset of experts so that the outcome obtained after aggregating the opinions from the selected experts guarantees a target level of accuracy. The problem is a challenging one even in a non-strategic setting since the accuracy of an aggregated outcome depends on unknown qualities. We develop a novel multi-armed bandit (MAB) mechanism for solving this problem. First, we propose a framework, Assured Accuracy Bandit (AAB)framework, which leads to a MAB algorithm, Constrained Confidence Bound for Non-Strategic Setting (CCB-NS). We derive an upper bound on the number of time steps this algorithm chooses a sub-optimal set, which depends on the target accuracy and true qualities. A more challenging situation arises when the requester not only has to learn the qualities of the experts but has to elicit their true service costs as well. We modify the CCB-NS algorithm to obtain an adaptive exploration separated algorithm Constrained Confidence Bound for Strategic Setting (CCB-S). The CCB-S algorithm produces an ex-post monotone allocation rule that can then be transformed into an ex-post incentive compatible and ex-post individually rational mechanism. This mechanism learns the qualities of the experts and guarantees a given target accuracy level in a cost optimal way. We also provide a lower bound on the number of times any algorithm must select a sub-optimal set and we see that the lower bound matches our upper bound up to a constant factor. We provide insights on a practical implementation of this framework through an illustrative example and demonstrate the efficacy of our algorithms through simulations

Abstract

The Cooperative Target Observation (CTO) problem has been of great interest in the multi-agents and robotics literature due to the problem being at the core of a number of applications including surveillance. In CTO problem, the observer agents attempt to maximize the collective time during which each moving target is being observed by at least one observer in the area of interest. However, most of the prior works for the CTO problem consider the targets movement to be Randomized. Given our focus on surveillance domain, we modify this assumption to make the targets strategic and present two target strategies namely Straight-line strategy and Controlled Randomization strategy. We then modify the observer strategy proposed in the literature based on the K-means algorithm to introduce five variants and provide experimental validation. In surveillance domain, it is often reasonable to assume that the observers may themselves be a subject of observation for a variety of purposes by unknown adversaries whose model may not be known. Randomizing the observers actions can help to make their target observation strategy less predictable. As the fifth variant, we therefore introduce Adjustable Randomization into the best performing observer strategy where the observer can adjust the expected loss in reward due to randomization depending on the situation.

Abstract

The popularity of digital currencies, especially cryptocurrencies, has been continuously growing since the appearance of Bitcoin. Bitcoin’s security lies in a proof-of-work scheme, which requires high computational resources at the miners. Despite advances in mobile technology, existing cryptocurrencies cannot be maintained by mobile devices due to their low processing capabilities. Mobile devices can only accommodate mobile applications (wallets) that allow users to exchange credits of cryptocurrencies. In this work, we propose LocalCoin, an alternative cryptocurrency that requires minimal computational resources, produces low data traffic and works with off-the-shelf mobile devices. LocalCoin replaces the computational hardness that is at the root of Bitcoin’s security with the social hardness of ensuring that all witnesses to a transaction are colluders. Localcoin features (i) a lightweight proof-of-work scheme and (ii) a distributed blockchain. We analyze LocalCoin for double spending for passive and active attacks and prove that under the assumption of sufficient number of users and properly selected tuning parameters the probability of double spending is close to zero. Extensive simulations on real mobility traces, realistic urban settings, and random geometric graphs show that the probability of success of one transaction converges to 1 and the probability of the success of a double spending attempt converges to 0.

Abstract

High-speed serial communication protocols are widely used in modern communication systems. High-speed serial protocols enable bandwidth scalability and system cost reduction. Full duplex serial communication involves a bi-directional data transfer from the link partners. A simplex communication channel enables one-way data transmission from one link partner to the other. Simplex channels are used in systems where uni-directional data transfer is required, for example a display device. Simplex channels further reduce the overall system cost. Initializing the simplex communication channel is challenging because of the lack of a back channel to communicate the link status from the receiver to the transmitter. Most of the protocols include a simplex sideband channel to communicate the link status. A sideband channel adds to the overall system cost. In this paper, the authors have discussed about a novel initialization methodology to initialize the high-speed simplex communication link to achieve 2x saving in logic area and 1.5x increase in latency.