资源论文Measuring Distance Between Unordered Sets of Different Sizes

Measuring Distance Between Unordered Sets of Different Sizes

2019-12-11 | |  62 |   41 |   0

Abstract

We tackle the problem of optimizing over all possible positive defifinite radial kernels on Riemannian manifolds for classifification. Kernel methods on Riemannian manifolds have recently become increasingly popular in computer vision. However, the number of known positive defifi- nite kernels on manifolds remain very limited. Furthermore, most kernels typically depend on at least one parameter that needs to be tuned for the problem at hand. A poor choice of kernel, or of parameter value, may yield signifificant performance drop-off. Here, we show that positive defifinite radial kernels on the unit n-sphere, the Grassmann manifold and Kendalls shape manifold can be expressed in a simple form whose parameters can be automatically optimized within a support vector machine framework. We demonstrate the benefifits of our kernel learning algorithm on object, face, action and shape recognition

上一篇:Diffuse Mirrors: 3D Reconstruction from Diffuse Indirect Illumination Using Inexpensive Time-of-Flight Sensors

下一篇:Optimizing Over Radial Kernels on Compact Manifolds

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...