Abstract

We present a neural rendering framework for simultane- ous view synthesis and appearance editing of a scene from multi-view images captured under known environment il- lumination. Existing approaches either achieve view syn- thesis alone or view synthesis along with relighting, with- out direct control over the scene’s appearance. Our ap- proach explicitly disentangles the appearance and learns a lighting representation that is independent of it. Specif- ically, we independently estimate the BRDF and use it to learn a lighting-only representation of the scene. Such dis- entanglement allows our approach to generalize to arbi- trary changes in appearance while performing view synthe- sis. We show results of editing the appearance of a real scene, demonstrating that our approach produces plausible appearance editing. The performance of our view synthesis approach is demonstrated to be at par with state-of-the-art approaches on both real and synthetic data

Abstract

e present a neural rendering framework for simultaneous view synthesis and appearance editing of a scene with known envi- ronmental illumination captured using a mobile camera. Existing approaches either achieve view synthesis alone or view synthesis along with relighting, without control over the scene’s appearance. Our approach explicitly disentangles the appearance and learns a lighting representation that is independent of it. Specifically, we jointly learn the scene appearance and a lighting-only represen- tation of the scene. Such disentanglement allows our approach to generalize to arbitrary changes in appearance while performing view synthesis. We show results of editing the appearance of real scenes in interesting and non-trivial ways. The performance of our view synthesis approach is on par with state-of-the-art approaches on both real and synthetic data.

Abstract

Aspect extraction is not a well-explored topic in Hindi, with only one corpus having been developed for the task. In this paper, we dis- cuss the merits of the existing corpus in terms of quality, size, sparsity, and performance in aspect extraction tasks using established mod- els. To provide a better baseline corpus for aspect extraction, we translate the SemEval 2014 aspect-based sentiment analysis dataset and annotate the aspects in that data. We provide rigorous guidelines and a replicable methodology for this task. We quantitatively evaluate the translations and annotations us- ing inter-annotator agreement scores. We also evaluate our dataset using state-of-the-art neu- ral aspect extraction models in both monolin- gual and multilingual settings and show that the models perform far better on our corpus than on the existing Hindi dataset. With this, we establish our corpus as the gold-standard aspect extraction dataset in Hindi

Abstract

In this paper, we describe our submissions for LoResMT Shared Task @MT Summit 2021 Con- ference. We built statistical translation systems in each direction for English ⇐⇒ Marathi lan- guage pair. This paper outlines initial baseline experiments with various tokenization schemes to train models. Using optimal tokenization scheme we create synthetic data and further train augmented dataset to create more statistical models. Also, we reorder English to match Marathi syntax to further train another set of baseline and data augmented models using various tok- enization schemes. We report configuration of the submitted systems and results produced by them

Abstract

Modeling person interactions with their surroundings has proven to be effective for recognizing and localizing human actions in videos. While most recent works focus on learning short term interactions, in this work, we consider long-term person interactions and jointly localize actions of multiple actors over an entire video shot. We construct a graph with nodes that correspond to keyframe actor instances and connect them with two edge types. Spatial edges connect actors within a keyframe, and temporal edges connect multiple instances of the same actor over a video shot. We propose a Graph Neural Network that explicitly models spatial and temporal states for each person instance and learns to effectively combine information from both modalities to make predictions at the same time. We conduct experiments on the AVA dataset and show that our graph-based model provides consistent improvements over several video descriptors, achieving state-of-the-art performance without any fine-tuning.

Abstract

Vision-and-language navigation (VLN) aims to enable embodied agents to navigate in realistic environments us- ing natural language instructions. Given the scarcity of domain-specific training data and the high diversity of im- age and language inputs, the generalization of VLN agents to unseen environments remains challenging. Recent meth- ods explore pretraining to improve generalization, however, the use of generic image-caption datasets or existing small- scale VLN environments is suboptimal and results in limited improvements. In this work, we introduce BnB1, a large- scale and diverse in-domain VLN dataset. We first col- lect image-caption (IC) pairs from hundreds of thousands of listings from online rental marketplaces. Using IC pairs we next propose automatic strategies to generate millions of VLN path-instruction (PI) pairs. We further propose a shuffling loss that improves the learning of temporal or- der inside PI pairs. We use BnB to pretrain our Airbert2 model that can be adapted to discriminative and genera- tive settings and show that it outperforms state of the art for Room-to-Room (R2R) navigation and Remote Referring Ex- pression (REVERIE) benchmarks. Moreover, our in-domain pretraining significantly increases performance on a chal- lenging few-shot VLN evaluation, where we train the model only on VLN instructions from a few houses

Abstract

The visual world naturally exhibits an imbalance in the number of object or scene instances resulting in a long-tailed distribution. This imbalance poses significant challenges for classification models based on deep learning. Oversampling instances of the tail classes attempts to solve this imbalance. However, the limited visual diver- sity results in a network with poor representation ability. A simple counter to this is decoupling the representation and classifier net- works and using oversampling only to train the classifier. In this paper, instead of repeatedly re-sampling the same im- age (and thereby features), we explore a direction that attempts to generate meaningful features by estimating the tail category’s distribution. Inspired by ideas from recent work on few-shot learn- ing [ 53], we create calibrated distributions to sample additional features that are subsequently used to train the classifier. Through several experiments on the CIFAR-100-LT (long-tail) dataset with varying imbalance factors and on mini-ImageNet-LT (long-tail), we show the efficacy of our approach and establish a new state-of- the-art. We also present a qualitative analysis of generated features using t-SNE visualizations and analyze the nearest neighbors used to calibrate the tail class distributions. Our code is available at https://github.com/rahulvigneswaran/TailCalibX.

Abstract

Facilitating the discovery of drugs by combining diverse compounds is becoming prevalent, especially for treating complex diseases like cancers and HIV. A drug is a chemi- cal compound structure and any sub-structure of a chemical compound is designated as a fragment. A chemical compound or a fragment can be modeled as a graph structure. Given a set of chemical compounds and their corresponding large set of fragments modeled as graph structures, we address the problem of identifying potential combinations of diverse chemical compounds, which cover a certain percentage of the set of fragments. In this regard, the key contributions of this work are three-fold: First, we introduce the notion of Graph Transactional Coverage Patterns (GTCPs) for any given graph transactional dataset. Second, we propose an efficient model and framework for extracting GTCPs from a given graph transactional dataset. Third, we conduct an extensive performance study using three real datasets to demonstrate that it is indeed feasible to efficiently extract GTCPs using our proposed GTCP-extraction framework. We also demonstrate the effectiveness of the GTCP-extraction framework through a case study in computer-aided drug design. Index Terms—Graph mining, Graph transactions, Coverage patterns, Drug discovery

Abstract

Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there exists an explicit d O(1) - variate and degree d polynomial Pd ∈ VNP such that if any depth four circuit C of bounded formal degree d which computes a polynomial of bounded individual degree O(1), that is functionally equivalent to Pd, then C must have size 2 Ω(√ d log d) . The motivation for their work comes from Boolean Circuit Complexity. Based on a characterization for ACC0 circuits by Yao [FOCS, 1985] and Beigel and Tarui [CC, 1994], Forbes, Kumar and Saptharishi [CCC, 2016] observed that functions in ACC0 can also be computed by algebraic Σ∧ΣΠ circuits (i.e., circuits of the form – sums of powers of polynomials) of 2 logO(1) n size. Thus they argued that a 2 ω(poly log n) “functional” lower bound for an explicit polynomial Q against Σ∧ΣΠ circuits would imply a lower bound for the “corresponding Boolean function” of Q against non-uniform ACC0 . In their work, they ask if their lower bound be extended to Σ∧ΣΠ circuits. In this paper, for large integers n and d such that ω(log2 n) ≤ d ≤ n 0.01, we show that any Σ∧ΣΠ circuit of bounded individual degree at most O d k2
that functionally computes Iterated Matrix Multiplication polynomial IMMn,d (∈ VP) over {0, 1} n 2d must have size n Ω(k) . Since Iterated Matrix Multiplication IMMn,d over {0, 1} n 2d is functionally in GapL, improvement of the afore mentioned lower bound to hold for quasipolynomially large values of individual degree would imply a fine-grained separation of ACC0 from GapL. For the sake of completeness, we also show a syntactic size lower bound against any Σ∧ΣΠ circuit computing IMMn,d (for the same regime of d) which is tight over large fields. Like Forbes, Kumar and Saptharishi [CCC, 2016], we too prove lower bounds against circuits of bounded formal degree which functionally compute IMMn,d, for a slightly larger range of individual degree. 2012 ACM Subject Classification Theory of computation → Circuit complexity; Theory of computation → Algebraic complexity theory Keywords and phrases Functional Lower

Abstract

The Internet of Things (IoT) plays a key role in real-time monitoring at different stages of the power generation system, assisting to achieve better efficiency, minimize load on the grids by analysing usage patterns, provide faster resolutions to power outages, and so on. In this paper, we present a novel energy monitoring approach employing LoRaWAN-enabled smart energy meters and a oneM2M-based platform for collecting and analysing the data. The energy meters transmit data at 15-minutes intervals, i.e., 96 data points per day. A novel format has been developed for the LoRaWAN Protocol Data Unit (PDU) to transmit the values of phase currents and voltages, and data related to power and energy comsumption. This results in a high-resolution dataset containing more than 10,000 instances per meter, accumulated over the last four months. The data can be visualised in a live dashboard enabling the signal parameters such as Received Signal Strength Index (RSSI) and Signal to Noise Ratio (SNR) to be monitored in addition to the electrical parameters, to ensure proper data transmission. Finally, the trends in power and energy consumption of the load have been analysed, which can result in improved efficiency of building management, and early detection of electrical faults and failures