Local Isomorphism to Solve the Pre-Image Problem in Kernel Methods

Abstract

Kernel methods have been popular over the last decade to solve many computer vision, statistics and machine learning problems. An important, both theoretically and practically, open problem in kernel methods is the pre-image problem. The pre-image problem consists of finding a vector in the input space whose mapping is known in the feature space induced by a kernel. To solve the pre-image problem, this paper proposes a framework that computes an isomorphism between local Gram matrices in the input and feature space. Unlike existing methods that rely on analytic properties of kernels, our framework derives closed-form solutions to the pre-image problem in the case of non-differentiable and application-specific kernels. Experiments on the pre-image problem for visualizing cluster centers computed by kernel k-means and denoising high-dimensional images show that our algorithm outperforms state-of-the-art methods.

Cite

Text

Huang et al. "Local Isomorphism to Solve the Pre-Image Problem in Kernel Methods." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011. doi:10.1109/CVPR.2011.5995685

Markdown

[Huang et al. "Local Isomorphism to Solve the Pre-Image Problem in Kernel Methods." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2011.](https://mlanthology.org/cvpr/2011/huang2011cvpr-local/) doi:10.1109/CVPR.2011.5995685

BibTeX

@inproceedings{huang2011cvpr-local,
  title     = {{Local Isomorphism to Solve the Pre-Image Problem in Kernel Methods}},
  author    = {Huang, Dong and Tian, Yuandong and De la Torre, Fernando},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2011},
  pages     = {2761-2768},
  doi       = {10.1109/CVPR.2011.5995685},
  url       = {https://mlanthology.org/cvpr/2011/huang2011cvpr-local/}
}