← Search

RICHARD HARTLEY

34 accepted papers

2026

DTO-KD: Dynamic Trade-off Optimization for Effective Knowledge Distillation

ICLR 2026oral

Knowledge Distillation (KD) is a widely adopted framework for compressing large models into compact student models by transferring knowledge from a high-capacity teacher. Despite its success, KD presents two persistent challenges: (1) the trade-off between optimizing for the primary task loss and mi…

Cited by 0SourceScholar
2025

FlashMo: Geometric Interpolants and Frequency-Aware Sparsity for Scalable Efficient Motion Generation

NeurIPS 2025poster

Diffusion models have recently advanced 3D human motion generation by producing smoother and more realistic sequences from natural language. However, existing approaches face two major challenges: high computational cost during training and inference, and limited scalability due to reliance on U-Net…

Cited by 0SourcecodeScholar
2025

Probability Density Geodesics in Image Diffusion Latent Space

CVPR 2025poster

Diffusion models indirectly estimate the probability density over a data space, which can be used to study its structure. In this work, we show that geodesics can be computed in diffusion latent space, where the norm induced by the spatially-varying inner product is inversely proportional to the pro…

2024

Adversarial Purification with the Manifold Hypothesis

AAAI 2024technical

In this work, we formulate a novel framework for adversarial robustness using the manifold hypothesis. This framework provides sufficient conditions for defending against adversarial examples. We develop an adversarial purification method with this framework. Our method combines manifold learning wi…

2024

IMPUS: Image Morphing with Perceptually-Uniform Sampling Using Diffusion Models

ICLR 2024poster

We present a diffusion-based image morphing approach with perceptually-uniform sampling (IMPUS) that produces smooth, direct and realistic interpolations given an image pair. The embeddings of two images may lie on distinct conditioned distributions of a latent diffusion model, especially when they…

2024

LDP: Language-driven Dual-Pixel Image Defocus Deblurring Network

CVPR 2024poster

Recovering sharp images from dual-pixel (DP) pairs with disparity-dependent blur is a challenging task. Existing blur map-based deblurring methods have demonstrated promising results. In this paper we propose to the best of our knowledge the first framework to introduce the contrastive language-imag…

Cited by 12SourcePDFScholar
2024

Motion Mamba: Efficient and Long Sequence Motion Generation

ECCV 2024poster

"Human motion generation stands as a significant pursuit in generative computer vision, while achieving long-sequence and efficient motion generation remains challenging. Recent advancements in state space models (SSMs), notably Mamba, have showcased considerable promise in long sequence modeling wi…

2024

NF-SLAM: Effective, Normalizing Flow-supported Neural Field representations for object-level visual SLAM in automotive applications

IROS 2024poster

We propose a novel, vision-only object-level SLAM framework for automotive applications representing 3D shapes by implicit signed distance functions. Our key innovation consists of augmenting the standard neural representation by a normalizing flow network. As a result, achieving strong representati…

Cited by 0SourceScholar
2024

Neural SDF Flow for 3D Reconstruction of Dynamic Scenes

ICLR 2024poster

In this paper, we tackle the problem of 3D reconstruction of dynamic scenes from multi-view videos. Previous dynamic scene reconstruction works either attempt to model the motion of 3D points in space, which constrains them to handle a single articulated object or require depth maps as input. By con…

2021

Calibration of Neural Networks using Splines

ICLR 2021poster

Calibrating neural networks is of utmost importance when employing them in safety-critical applications where the downstream decision making depends on the predicted probabilities. Measuring calibration error amounts to comparing two empirical distributions. In this work, we introduce a binning-free…

2021

Dual Pixel Exploration: Simultaneous Depth Estimation and Image Restoration

CVPR 2021poster

The dual-pixel (DP) hardware works by splitting each pixel in half and creating an image pair in a single snapshot. Several works estimate depth/inverse depth by treating the DP pair as a stereo pair. However, dual-pixel disparity only occurs in image regions with the defocus blur. The heavy defocus…

Cited by 43PDFScholar
2021

Learning To Estimate Hidden Motions With Global Motion Aggregation

ICCV 2021poster

Occlusions pose a significant challenge to optical flow algorithms that rely on local evidences. We consider an occluded point to be one that is imaged in the first frame but not in the next, a slight overloading of the standard definition since it also includes points that move out-of-frame. Estima…

Cited by 408PDFcodeScholar
2020

Intra Order-preserving Functions for Calibration of Multi-Class Neural Networks

NeurIPS 2020poster

Predicting calibrated confidence scores for multi-class deep networks is important for avoiding rare but costly mistakes. A common approach is to learn a post-hoc calibration function that transforms the output of the original network into calibrated confidence scores while maintaining the network's…

2020

Pairwise Similarity Knowledge Transfer for Weakly Supervised Object Localization

ECCV 2020poster

Weakly Supervised Object Localization (WSOL) methods only require image level labels as opposed to expensive bounding box annotations required by fully supervised algorithms. We study the problem of learning localization model on target classes with weakly supervised image labels, helped by a fully…

2019

Bringing a Blurry Frame Alive at High Frame-Rate With an Event Camera

CVPR 2019oral

Event-based cameras can measure intensity changes (called 'events') with microsecond accuracy under high-speed motion and challenging lighting conditions. With the active pixel sensor (APS), the event camera allows simultaneous output of the intensity frames. However, the output images are captured…

Cited by 312PDFScholar
2019

Learning to Find Common Objects Across Few Image Collections

ICCV 2019poster

Given a collection of bags where each bag is a set of images, our goal is to select one image from each bag such that the selected images are from the same object class. We model the selection as an energy minimization problem with unary and pairwise potential functions. Inspired by recent few-shot…

Cited by 8PDFcodeScholar
2019

Phase-Only Image Based Kernel Estimation for Single Image Blind Deblurring

CVPR 2019poster

The image motion blurring process is generally modelled as the convolution of a blur kernel with a latent image. Therefore, the estimation of the blur kernel is essentially important for blind image deblurring. Unlike existing approaches which focus on approaching the problem by enforcing various pr…

Cited by 80PDFScholar
2019

Proximal Mean-Field for Neural Network Quantization

ICCV 2019poster

Compressing large Neural Networks (NN) by quantizing the parameters, while maintaining the performance is highly desirable due to reduced memory and time complexity. In this work, we cast NN quantization as a discrete labelling problem, and by examining relaxations, we design an efficient iterative…

Cited by 24PDFcodeScholar
2018

Deep Unsupervised Saliency Detection: A Multiple Noisy Labeling Perspective

CVPR 2018poster

The success of current deep saliency detection methods heavily depends on the availability of large-scale supervision in the form of per-pixel labeling. Such supervision, while labor-intensive and not always possible, tends to hinder the generalization ability of the learned models. By contrast, tra…

Cited by 219SourcePDFScholar
2018

Face Super-resolution Guided by Facial Component Heatmaps

ECCV 2018poster

State-of-the-art face super-resolution methods use deep convolutional neural networks to learn a mapping between low-resolution (LR) facial patterns and their corresponding high-resolution (HR) counterparts by exploring local information. However, most of them do not account for face structure and s…

Cited by 267SourcePDFScholar
2018

Non-Linear Temporal Subspace Representations for Activity Recognition

CVPR 2018poster

Representations that can compactly and effectively capture the temporal evolution of semantic content are important to computer vision and machine learning algorithms that operate on multi-variate time-series data. We investigate such representations motivated by the task of human action recognition…

Cited by 51SourcePDFScholar
2018

Super-Resolving Very Low-Resolution Face Images With Supplementary Attributes

CVPR 2018poster

Given a tiny face image, conventional face hallucination methods aim to super-resolve its high-resolution (HR) counterpart by learning a mapping from an exemplar dataset. Since a low-resolution (LR) input patch may correspond to many HR candidate patches, this ambiguity may lead to erroneous HR faci…

Cited by 204SourcePDFScholar
2017

Joint Dimensionality Reduction and Metric Learning: A Geometric Take

ICML 2017poster

To be tractable and robust to data noise, existing metric learning algorithms commonly rely on PCA as a pre-processing step. How can we know, however, that PCA, or any other specific dimensionality reduction technique, is the method of choice for the problem at hand? The answer is simple: We cannot!…

Cited by 80SourcePDFScholar
2016

Memory Efficient Max Flow for Multi-Label Submodular MRFs

CVPR 2016poster

Multi-label submodular Markov Random Fields (MRFs) have been shown to be solvable using max-flow based on an encoding of the labels proposed by Ishikawa, in which each variable X_i is represented by l nodes (where l is the number of labels) arranged in a column. However, this method in general requi…

Cited by 9PDFcodeScholar
2015

Iteratively Reweighted Graph Cut for Multi-Label MRFs With Non-Convex Priors

CVPR 2015poster

While widely acknowledged as highly effective in computer vision, multi-label MRFs with non-convex priors are difficult to optimize. To tackle this, we introduce an algorithm that iteratively approximates the original energy with an appropriately weighted surrogate energy that is easier to minimize.…

Cited by 14SourcePDFScholar