• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

DS*: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems.

Florian BernardChristian TheobaltMichael Möller
Published in: CVPR (2018)
Keyphrases
  • convex relaxation
  • upper bound
  • multiscale
  • convex optimization
  • machine learning
  • decision trees
  • feature extraction
  • training data
  • lower bound
  • pairwise
  • multi objective
  • dynamic programming
  • markov random field