← Search

Norbert Goertz

4 accepted papers

2017

Smooth graph signal recovery via efficient Laplacian solvers

ICASSP 2017accepted

We consider the problem of recovering a smooth graph signal from noisy samples observed at a small number of nodes. The signal recovery is formulated as a convex optimization problem using Tikhonov regularization based on the graph Laplacian quadratic form. The optimality conditions for this optimiz…

Cited by 0SourceScholar
2016

Graph signal recovery from incomplete and noisy information using approximate message passing

ICASSP 2016accepted

We consider the problem of recovering a graph signal from noisy and incomplete information. In particular, we propose an approximate message passing based iterative method for graph signal recovery. The recovery of the graph signal is based on noisy signal values at a small number of randomly select…

Cited by 0SourceScholar