Topological data analysis offers a rich source of valuable information to
study vision problems. Yet, so far we lack a theoretically sound connection to
popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In
this work, we establish such a connection by designing a multi-scale kernel for
persistence diagrams, a stable summary representation of topological features
in data. We show that this kernel is positive definite and prove its stability
with respect to the 1-Wasserstein distance. Experiments on two benchmark
datasets for 3D shape classification/retrieval and texture recognition show
considerable performance gains of the proposed method compared to an
alternative approach that is based on the recently introduced persistence
landscapes.

通过设计稳定表现拓扑特征的多尺度核，我们在理论上将拓扑数据分析与流行的基于核的学习技术建立了联系，并证明了该核对于 1-Wasserstein 距离的稳定性。在 3D 形状分类 / 检索和纹理识别的两个基准数据集上的实验证明，与基于持久景观的替代方法相比，所提出的方法具有相当的性能优势。