Fast pose estimation with parameter-sensitive hashing

By Gregory Shakhnarovich, Paul A. Viola, Trevor Darrell. 2003

953 citations recorded by the source corpus.

Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensional problems such as pose estimation, the number of required examples and the computational complexity rapidly become prohibitively high. We introduce a new algorithm that learns a set of hashing functions that efficiently index examples relevant to a particular estimation task. Our algorithm extends locality-sensitive hashing, a recently developed method to find approximate neighbors in time sublinear in the number of examples. This method depends critically on the choice of hash functions that are optimally relevant to a particular estimation problem. Experiments demonstrate that the resulting algorithm, which we call parameter-sensitive hashing, can rapidly and accurately estimate the articulated pose of human figures from a large database of example images.

Subfields: Computer Vision and Pattern Recognition, 3D Vision & Pose

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Jitendra Malik
  3. Dacheng Tao
  4. Xiaogang Wang
  5. Andrew Zisserman
  6. Ming-Hsuan Yang
  7. Trevor Darrell
  8. Cordelia Schmid

In 3D Vision & Pose

  1. Jitendra Malik
  2. Michael J. Black
  3. Matthias Nießner
  4. Josh Tenenbaum
  5. Jiajun Wu
  6. Christian Theobalt
  7. Angela Dai
  8. Andreas Geiger

Citations in the corpus