Login / Signup

Efficient partial shape matching using Smith-Waterman algorithm.

Longbin ChenRogério Schmidt FerisMatthew A. Turk
Published in: CVPR Workshops (2008)
Keyphrases
  • shape matching
  • matching algorithm
  • dynamic programming
  • lower bound
  • viewpoint
  • data mining
  • three dimensional
  • multiscale
  • k means
  • expectation maximization
  • low level image segmentation
  • smith waterman