Multi-kernel Regression For Graph Signal Processing

03/12/2018
by   Arun Venkitaraman, et al.
0

We develop a multi-kernel based regression method for graph signal processing where the target signal is assumed to be smooth over a graph. In multi-kernel regression, an effective kernel function is expressed as a linear combination of many basis kernel functions. We estimate the linear weights to learn the effective kernel function by appropriate regularization based on graph smoothness. We show that the resulting optimization problem is shown to be convex and pro- pose an accelerated projected gradient descent based solution. Simulation results using real-world graph signals show efficiency of the multi-kernel based approach over a standard kernel based approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2018

Extreme Learning Machine for Graph Signal Processing

In this article, we improve extreme learning machines for regression tas...
research
11/06/2018

Kernel Regression for Graph Signal Prediction in Presence of Sparse Noise

In presence of sparse noise we propose kernel regression for predicting ...
research
11/28/2017

Kernel-based Inference of Functions over Graphs

The study of networks has witnessed an explosive growth over the past de...
research
11/05/2018

Supervised Linear Regression for Graph Learning from Graph Signals

We propose a supervised learning approach for predicting an underlying g...
research
05/23/2016

Kernel-based Reconstruction of Graph Signals

A number of applications in engineering, social sciences, physics, and b...
research
02/21/2013

Nonparametric Basis Pursuit via Sparse Kernel-based Learning

Signal processing tasks as fundamental as sampling, reconstruction, mini...
research
04/13/2019

Maximum Correntropy Criterion with Variable Center

Correntropy is a local similarity measure defined in kernel space and th...

Please sign up or login with your details

Forgot password? Click here to reset