Change search
Link to record
Permanent link

Direct link
BETA
Venkitaraman, Arun
Publications (5 of 5) Show all publications
Venkitaraman, A., Frossard, P. & Chatterjee, S. (2019). KERNEL REGRESSION FOR GRAPH SIGNAL PREDICTION IN PRESENCE OF SPARSE NOISE. In: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP): . Paper presented at 44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), MAY 12-17, 2019, Brighton, ENGLAND (pp. 5426-5430). IEEE
Open this publication in new window or tab >>KERNEL REGRESSION FOR GRAPH SIGNAL PREDICTION IN PRESENCE OF SPARSE NOISE
2019 (English)In: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), IEEE , 2019, p. 5426-5430Conference paper, Published paper (Refereed)
Abstract [en]

In presence of sparse noise we propose kernel regression for predicting output vectors which are smooth over a given graph. Sparse noise models the training outputs being corrupted either with missing samples or large perturbations. The presence of sparse noise is handled using appropriate use of l(1)-norm along-with use of l(2)-norm in a convex cost function. For optimization of the cost function, we propose an iteratively reweighted least-squares (IRLS) approach that is suitable for kernel substitution or kernel trick due to availability of a closed form solution. Simulations using real-world temperature data show efficacy of our proposed method, mainly for limited-size training datasets.

Place, publisher, year, edition, pages
IEEE, 2019
Series
International Conference on Acoustics Speech and Signal Processing ICASSP, ISSN 1520-6149
Keywords
Kernel regression, graph signal processing, Sparse noise, graph-Laplacian, iteratively reweighted least squares
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
urn:nbn:se:kth:diva-261058 (URN)10.1109/ICASSP.2019.8682979 (DOI)000482554005132 ()2-s2.0-85068972923 (Scopus ID)978-1-4799-8131-1 (ISBN)
Conference
44th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), MAY 12-17, 2019, Brighton, ENGLAND
Note

QC 20191002

Available from: 2019-10-02 Created: 2019-10-02 Last updated: 2019-10-02Bibliographically approved
Venkitaraman, A. & Zachariah, D. (2019). Learning Sparse Graphs for Prediction of Multivariate Data Processes. IEEE Signal Processing Letters, 26(3), 495-499
Open this publication in new window or tab >>Learning Sparse Graphs for Prediction of Multivariate Data Processes
2019 (English)In: IEEE Signal Processing Letters, ISSN 1070-9908, E-ISSN 1558-2361, Vol. 26, no 3, p. 495-499Article in journal (Refereed) Published
Abstract [en]

We address the problem of prediction of multivariate data process using an underlying graph model. We develop a method that learns a sparse partial correlation graph in a tuning-free and computationally efficient manner. Specifically, the graph structure is learned recursively without the need for cross validation or parameter tuning by building upon a hyperparameter-free framework. Our approach does not require the graph to be undirected and also accommodates varying noise levels across different nodes. Experiments using real-world datasets show that the proposed method offers significant performance gains in prediction, in comparison with the graphs frequently associated with these datasets.

Place, publisher, year, edition, pages
IEEE, 2019
Keywords
Partial correlation graphs, multivariate process, sparse graphs, prediction, hyperparameter-free
National Category
Signal Processing
Identifiers
urn:nbn:se:kth:diva-245903 (URN)10.1109/LSP.2019.2896435 (DOI)000458852100005 ()2-s2.0-85061748115 (Scopus ID)
Note

QC 20190315

Available from: 2019-03-15 Created: 2019-03-15 Last updated: 2019-03-15Bibliographically approved
Venkitaraman, A., Chatterjee, S. & Händel, P. (2019). On Hilbert transform, analytic signal, and modulation analysis for signals over graphs. Signal Processing, 156, 106-115
Open this publication in new window or tab >>On Hilbert transform, analytic signal, and modulation analysis for signals over graphs
2019 (English)In: Signal Processing, ISSN 0165-1684, E-ISSN 1872-7557, Vol. 156, p. 106-115Article in journal (Refereed) Published
Abstract [en]

We propose Hilbert transform and analytic signal construction for signals over graphs. This is motivated by the popularity of Hilbert transform, analytic signal, and modulation analysis in conventional signal processing, and the observation that complementary insight is often obtained by viewing conventional signals in the graph setting. Our definitions of Hilbert transform and analytic signal use a conjugate symmetry-like property exhibited by the graph Fourier transform (GFT), resulting in a 'one-sided' spectrum for the graph analytic signal. The resulting graph Hilbert transform is shown to possess many interesting mathematical properties and also exhibit the ability to highlight anomalies/discontinuities in the graph signal and the nodes across which signal discontinuities occur. Using the graph analytic signal, we further define amplitude, phase, and frequency modulations for a graph signal. We illustrate the proposed concepts by showing applications to synthesized and real-world signals. For example, we show that the graph Hilbert transform can indicate presence of anomalies and that graph analytic signal, and associated amplitude and frequency modulations reveal complementary information in speech signals.

Place, publisher, year, edition, pages
Elsevier, 2019
Keywords
Graph signal processing, Analytic signal, Hilbert transform, Demodulation, Anomaly detection
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-240988 (URN)10.1016/j.sigpro.2018.10.016 (DOI)000453494200011 ()2-s2.0-85056192636 (Scopus ID)
Note

QC 20190110

Available from: 2019-01-10 Created: 2019-01-10 Last updated: 2019-06-11Bibliographically approved
Venkitaraman, A. (2018). Graph Signal Processing Meets Machine Learning. (Doctoral dissertation). Stockholm: KTH Royal Institute of Technology
Open this publication in new window or tab >>Graph Signal Processing Meets Machine Learning
2018 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

Graph signal processing is an emerging paradigm in signal processing which took birth in the search for a set of consistent mathematical tools to analyze signals which occur over networks or graphs. The viewpoint of signals through graphs is universal and applicable to a large variety of diverse real-world problems. In this thesis, we make contributions to graph signal processing in two different settings: graph signal processing theory and graph signal processing with machine learning. In the first setting, we derive a novel Hilbert transform framework for graph signals in answering the question of whether amplitude and frequency modulations be defined for graph signals. We generalize Gabor’s analytic signal and define amplitude and phase modulations for graph signals via a Hilbert transform which is shown to demonstrate ability to highlight anomalies or singularities over graphs.

In the second setting, we bring together some of the popular machine learning approaches to graph signal processing, demonstrating how the two thought pro- cesses can be mutually coupled meaningfully for significant benefits. Specifically, we deal with the problem of predicting vector target signals which are graph signals over an associated graph. The input is taken to be a general quantity associated to the graph signal, but not necessarily the same physical quantity as that of the graph signal. In this way, we make graph signal output predictions with inputs which are agnostic to a graph structure. We apply this line of thought to extend some of the popular and powerful techniques in machine learning to graph signal setting: kernel regression, multi-kernel regression, Gaussian processes, and extreme learning machines. We show that our approach outperforms the conventional versions when the training samples are scarce and noisy: application to many real-world graph signal applications show that similar prediction performance as that of non-graph- aware versions is achieved with much less training data, and that too corrupted with noise. This also includes the extreme cases where data is partly missing or corrupted with large perturbations. This observation in turn points to the efficiency of our approach in terms of both availability of resources and computational complexity, which usually increases as datasize increases. Our approach stands out uniquely in being able to handle cases where the input and output are different physical quantities. It is also interesting to note that our approach performs reasonably well even in cases where the graph exists but is not known to the user.

We conclude by addressing the general problem of learning graphs from graph signals in two ways. First, we show that learning of connected graphs can be trans- formed into a convex optimization constraint which can be easily augmented to any of the existing graph learning techniques. Second, we propose a sparsity based approach to learn graphs in a hyperparameter-free manner which is computation- ally efficient. In our first contribution in the context of learning graphs, we are concerned with learning connected graphs which describe the data, whereas in the second part, we focus on learning graphs that are effective in making predictions for the signal value at the different nodes.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2018. p. 132
Series
TRITA-EECS-AVL ; 2018:77
Keywords
Signal processing; Graph signal; Machine learning; Estimation
National Category
Engineering and Technology
Research subject
Electrical Engineering
Identifiers
urn:nbn:se:kth:diva-237274 (URN)978-91-7729-981-3 (ISBN)
Public defence
2018-11-14, F3, Lindstedsvagen 26, Stockholm, 13:00 (English)
Opponent
Supervisors
Note

QC 20181026

Available from: 2018-10-26 Created: 2018-10-25 Last updated: 2018-10-26Bibliographically approved
Venkitaraman, A., Chatterjee, S. & Händel, P. (2018). MULTI-KERNEL REGRESSION FOR GRAPH SIGNAL PROCESSING. In: 2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP): . Paper presented at 2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP) (pp. 4644-4648). IEEE
Open this publication in new window or tab >>MULTI-KERNEL REGRESSION FOR GRAPH SIGNAL PROCESSING
2018 (English)In: 2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), IEEE, 2018, p. 4644-4648Conference paper, Published paper (Refereed)
Abstract [en]

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 propose 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.

Place, publisher, year, edition, pages
IEEE, 2018
Keywords
Graph signal processing, kernel regression, convex optimization
National Category
Signal Processing
Identifiers
urn:nbn:se:kth:diva-237154 (URN)10.1109/ICASSP.2018.8461643 (DOI)000446384604162 ()2-s2.0-85054280684 (Scopus ID)
Conference
2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)
Note

QC 20181025

Available from: 2018-10-25 Created: 2018-10-25 Last updated: 2019-08-20Bibliographically approved
Organisations

Search in DiVA

Show all publications