Premium
Multi‐Scale Kernels Using Random Walks
Author(s) -
Sinha A.,
Ramani K.
Publication year - 2014
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12264
Subject(s) - embedding , random walk , polygon mesh , mathematics , kernel (algebra) , invariant (physics) , moment (physics) , heat kernel , probabilistic logic , computer science , tessellation (computer graphics) , scale (ratio) , algorithm , discrete mathematics , artificial intelligence , mathematical analysis , geometry , statistics , physics , classical mechanics , quantum mechanics , mathematical physics
We introduce novel multi‐scale kernels using the random walk framework and derive corresponding embeddings and pairwise distances. The fractional moments of the rate of continuous time random walk (equivalently diffusion rate) are used to discover higher order kernels (or similarities) between pair of points. The formulated kernels are isometry, scale and tessellation invariant, can be made globally or locally shape aware and are insensitive to partial objects and noise based on the moment and influence parameters. In addition, the corresponding kernel distances and embeddings are convergent and efficiently computable. We introduce dual Green's mean signatures based on the kernels and discuss the applicability of the multi‐scale distance and embedding. Collectively, we present a unified view of popular embeddings and distance metrics while recovering intuitive probabilistic interpretations on discrete surface meshes.