• DocumentCode
    2959584
  • Title

    N-best maximal decoders for part models

  • Author

    Park, Dennis ; Ramanan, Deva

  • Author_Institution
    UC Irvine, Irvine, CA, USA
  • fYear
    2011
  • fDate
    6-13 Nov. 2011
  • Firstpage
    2627
  • Lastpage
    2634
  • Abstract
    We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We extend previous N-best algorithms from the speech community to incorporate non-maximal suppression cues, such that pixel-shifted copies of a single configuration are not returned. We use approximate algorithms that perform nearly identical to their exact counterparts, but are orders of magnitude faster. Our approach outperforms standard methods for generating multiple object configurations in an image. We use our method to generate multiple pose hypotheses for the problem of human pose estimation from video sequences. We present quantitative results that demonstrate that our framework significantly improves the accuracy of a state-of-the-art pose estimation algorithm.
  • Keywords
    approximation theory; image sequences; pose estimation; video signal processing; approximate algorithms; human pose estimation; n-best configuration generation; n-best maximal decoders; nonmaximal suppression cues; part-based models; speech community; video sequences; Accuracy; Approximation algorithms; Decoding; Dynamic programming; Heuristic algorithms; Inference algorithms; Partitioning algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Vision (ICCV), 2011 IEEE International Conference on
  • Conference_Location
    Barcelona
  • ISSN
    1550-5499
  • Print_ISBN
    978-1-4577-1101-5
  • Type

    conf

  • DOI
    10.1109/ICCV.2011.6126552
  • Filename
    6126552