Approximate Correspondences in High Dimensions
Pyramid intersection is an efficient method for computing an approximate partial matching between two sets of feature vectors. We introduce a novel pyramid embedding based on a hierarchy of non-uniformly shaped bins that takes advantage of the underlying structure of the feature space and remains ac...
Main Authors: | , |
---|---|
Other Authors: | |
Language: | en_US |
Published: |
2006
|
Online Access: | http://hdl.handle.net/1721.1/33002 |