Search Results for author: Mayank Bansal

Found 9 papers, 2 papers with code

Learning to Drive by Observing the Best and Synthesizing the Worst

no code implementations ICLR 2019 Mayank Bansal, Alex Krizhevsky, Abhijit Ogale

Our goal is to train a policy for autonomous driving via imitation learning that is robust enough to drive a real vehicle.

Autonomous Driving Imitation Learning

MV2MAE: Multi-View Video Masked Autoencoders

no code implementations29 Jan 2024 Ketul Shah, Robert Crandall, Jie Xu, Peng Zhou, Marian George, Mayank Bansal, Rama Chellappa

We report state-of-the-art results on the NTU-60, NTU-120 and ETRI datasets, as well as in the transfer learning setting on NUCLA, PKU-MMD-II and ROCOG-v2 datasets, demonstrating the robustness of our approach.

Action Recognition Self-Supervised Learning +1

StopNet: Scalable Trajectory and Occupancy Prediction for Urban Autonomous Driving

no code implementations2 Jun 2022 Jinkyu Kim, Reza Mahjourian, Scott Ettinger, Mayank Bansal, Brandyn White, Ben Sapp, Dragomir Anguelov

A whole-scene sparse input representation allows StopNet to scale to predicting trajectories for hundreds of road agents with reliable latency.

Motion Forecasting

Attentional Bottleneck: Towards an Interpretable Deep Driving Network

no code implementations8 May 2020 Jinkyu Kim, Mayank Bansal

Deep neural networks are a key component of behavior prediction and motion generation for self-driving cars.

Self-Driving Cars

ChauffeurNet: Learning to Drive by Imitating the Best and Synthesizing the Worst

4 code implementations7 Dec 2018 Mayank Bansal, Alex Krizhevsky, Abhijit Ogale

Our goal is to train a policy for autonomous driving via imitation learning that is robust enough to drive a real vehicle.

Autonomous Driving Imitation Learning

Geometric Urban Geo-Localization

no code implementations CVPR 2014 Mayank Bansal, Kostas Daniilidis

We propose a purely geometric correspondence-free approach to urban geo-localization using 3D point-ray features extracted from the Digital Elevation Map of an urban environment.

Geometric Polynomial Constraints in Higher-Order Graph Matching

no code implementations24 May 2014 Mayank Bansal, Kostas Daniilidis

In this paper, we address the problem of finding correspondences in the absence of unary or pairwise constraints as it emerges in problems where unary appearance similarity like SIFT matches is not available.

Graph Matching

Joint Spectral Correspondence for Disparate Image Matching

no code implementations CVPR 2013 Mayank Bansal, Kostas Daniilidis

We address the problem of matching images with disparate appearance arising from factors like dramatic illumination (day vs. night), age (historic vs. new) and rendering style differences.

Cannot find the paper you are looking for? You can Submit a new open access paper.