Robust matching and recognition using context-dependent kernels

Hichem Sahbi, Jean-Yves Audibert, Jaonary Rabarisoa, Renaud Keriven · 2008

The success of kernel methods including support vector machines (SVMs) strongly depends on the design of appropriate kernels. While initially kernels were designed in order to handle fixed-length data, their extension to unordered, variable-length data became more than necessary for real pattern recognition problems such as object recognition and bioinformatics.

Read the paper · More papers on PaperTik