scispace - formally typeset
A

Andrew J. Davison

Researcher at Imperial College London

Publications -  226
Citations -  34155

Andrew J. Davison is an academic researcher from Imperial College London. The author has contributed to research in topics: Computer science & Augmented reality. The author has an hindex of 66, co-authored 197 publications receiving 28572 citations. Previous affiliations of Andrew J. Davison include University of Oxford.

Papers
More filters
Proceedings ArticleDOI

KinectFusion: Real-time dense surface mapping and tracking

TL;DR: A system for accurate real-time mapping of complex and arbitrary indoor scenes in variable lighting conditions, using only a moving low-cost depth camera and commodity graphics hardware, which fuse all of the depth data streamed from a Kinect sensor into a single global implicit surface model of the observed scene in real- time.
Journal ArticleDOI

MonoSLAM: Real-Time Single Camera SLAM

TL;DR: The first successful application of the SLAM methodology from mobile robotics to the "pure vision" domain of a single uncontrolled camera, achieving real time but drift-free performance inaccessible to structure from motion approaches is presented.
Proceedings ArticleDOI

KinectFusion: real-time 3D reconstruction and interaction using a moving depth camera

TL;DR: Novel extensions to the core GPU pipeline demonstrate object segmentation and user interaction directly in front of the sensor, without degrading camera tracking or reconstruction, to enable real-time multi-touch interactions anywhere.
Proceedings ArticleDOI

DTAM: Dense tracking and mapping in real-time

TL;DR: It is demonstrated that a dense model permits superior tracking performance under rapid motion compared to a state of the art method using features; and the additional usefulness of the dense model for real-time scene interaction in a physics-enhanced augmented reality application is shown.
Book ChapterDOI

Active Matching

TL;DR: This paper shows that the dramatically different approach of using priors dynamically to guide a feature by feature matching search can achieve global matching with much fewer image processing operations and lower overall computational cost.