activity
20172022
most citedImproved Branch and Bound for Neural Network Verification via Lagrangian Decomposition

16 citations · 32 across the 9 of their papers we have counts for

collaborators
Showing cs.CVShow all

5 papers · 1 filter

cs.CV2020

Weakly Supervised Instance Segmentation by Learning Annotation Consistent Instances

Aditya Arun, C. V. Jawahar, M. Pawan Kumar

Recent approaches for weakly supervised instance segmentations depend on two components: (i) a pseudo label generation model that provides instances which are consistent with a giv…

cs.CV2018

Dissimilarity Coefficient based Weakly Supervised Object Detection

Aditya Arun, C. V. Jawahar, M. Pawan Kumar

We consider the problem of weakly supervised object detection, where the training samples are annotated using only image-level labels that indicate the presence or absence of an ob…

cs.CV2018

Learning Human Poses from Actions

Aditya Arun, C. V. Jawahar, M. Pawan Kumar

We consider the task of learning to estimate human pose in still images. In order to avoid the high cost of full supervision, we propose to use a diverse data set, which consists o…

cs.CV2018

Efficient Relaxations for Dense CRFs with Sparse Higher Order Potentials

Thomas Joy, Alban Desmaison, Thalaiyasingam Ajanthan +5

Dense conditional random fields (CRFs) have become a popular framework for modelling several problems in computer vision such as stereo correspondence and multi-class semantic segm…

cs.CV20177 cited

Coplanar Repeats by Energy Minimization

James Pritts, Denys Rozumnyi, M. Pawan Kumar +1

This paper proposes an automated method to detect, group and rectify arbitrarily-arranged coplanar repeated elements via energy minimization. The proposed energy functional combine…