A RKHS Interpolator-Based Graph Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-bayesian Graph Matching without Explicit Compatibility Calculations
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
On different facets of regularization theory
Neural Computation
Reproducing Kernel Hilbert space methods to reduce pulse compression sidelobes
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
| Hi-index | 35.68 |
A generalized framework for deriving multiscale and hybrid functionally expanded approximators that are linear in the adjustable weights is presented. The basic idea here is to define one or more appropriate function spaces and then to impose a geometric structure on these to obtain reproducing kernel Hilbert spaces (RKHSs). The weight identification problem is formulated as a minimum norm optimization problem that produces an approximation network structure that comprises a linear weighted sum of displaced reproducing kernels fed by the input signals. Examples of the application of this framework are discussed. Results of numerical experiments are presented.