Dynamic measurement clustering (with Chris Kemp)

This work shows how measurements of a system state can be partitioned into rank-deficient sets in order to reduce computational complexity. This allows problems such as the 6 DoF pose problem to be solved hierarchically, replacing RANSAC with exhaustive sampling at each stage (made possible by the reduced dimensionality of each sub-problem). 

[2005 ICCV Paper]