← Search

Chandrajit Bajaj

9 accepted papers

2024

DeblurSR: Event-Based Motion Deblurring under the Spiking Representation

AAAI 2024technical

We present DeblurSR, a novel motion deblurring approach that converts a blurry image into a sharp video. DeblurSR utilizes event data to compensate for motion ambiguities and exploits the spiking representation to parameterize the sharp output video as a mapping from time to intensity. Our key contr…

2021

ARAPReg: An As-Rigid-As Possible Regularization Loss for Learning Deformable Shape Generators

ICCV 2021poster

This paper introduces an unsupervised loss for training parametric deformation shape generators. The key idea is to enforce the preservation of local rigidity among the generated shapes. Our approach builds on a local approximation of the as-rigid-as possible (or ARAP) deformation energy. We show ho…

Cited by 53PDFcodeScholar
2021

Scene Synthesis via Uncertainty-Driven Attribute Synchronization

ICCV 2021poster

Developing deep neural networks to generate 3D scenes is a fundamental problem in neural synthesis with immediate applications in architectural CAD, computer graphics, as well as in generating virtual robot training environments. This task is challenging because 3D scenes exhibit diverse patterns, r…

Cited by 39PDFcodeScholar
2019

Stein Variational Gradient Descent With Matrix-Valued Kernels

NeurIPS 2019poster

Stein variational gradient descent (SVGD) is a particle-based inference algorithm that leverages gradient information for efficient approximate inference. In this work, we enhance SVGD by leveraging preconditioning matrices, such as the Hessian and Fisher information matrix, to incorporate geometri…

2018

Dynamic Filtering with Large Sampling Field for ConvNets

ECCV 2018poster

We propose a dynamic filtering strategy with large sampling field for ConvNets (LS-DFN), where the position-specific kernels learn from not only the identical position but also multiple sampled neighbour regions. During sampling, residual learning is introduced to ease training and an attention mech…

Cited by 50SourcePDFScholar
2017

Translation Synchronization via Truncated Least Squares

NeurIPS 2017spotlight

In this paper, we introduce a robust algorithm, \textsl{TranSync}, for the 1D translation synchronization problem, in which the aim is to recover the global coordinates of a set of nodes from noisy measurements of relative coordinates along an observation graph. The basic idea of TranSync is to appl…

Cited by 45SourcePDFScholar