RGBD Relocalisation Using Pairwise Geometry and Concise Key Point Sets (Source codes released!!!)

by Shuda Li and Andrew Calway.
University of Bristol, UK
publised in IEEE Intl. Conf. on Robotics and Automation (ICRA), 2015


We describe a novel RGBD relocalisation algorithm based on key point matching. It combines two components. First, a graph matching algorithm which takes into account the pairwise 3-D geometry amongst the key points, giving robust relocalisation. Second, a point selection process which provides an even distribution of the `most matchable’ points across the scene based on non-maximum suppression within voxels of a volumetric grid. This ensures a bounded set of matchable key points which enables tractable and scalable graph matching at frame rate. We present evaluations using a public dataset and our own more difficult dataset containing large pose changes, fast motion and non-stationary objects. It is shown that the method significantly out performs state-of-the-art methods.



About Shuda Li

Dr Shuda Li -------------------------------- Computer Vision Group Room 1.15 Merchant Venturers Building Woodland Road the University of Bristol Bristol BS8 1UB United Kingdom --------------------------------- Email: lishuda1980@gmail.com csxsl@bristol.ac.uk csxsl@compsci.bristol.ac.uk web: http://www.cs.bris.ac.uk/~csxsl/ Fax: +44 (0)117 954 5208 ---------------------------------
This entry was posted in Uncategorized and tagged , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s