Estimating graph topology from sparse graph signals with an application to image denoising

No abstract is available for this paper.

• Publication year

  2017

• Venue

  IEEE International Workshop on Multimedia Signal Processing

• Publication date

  2017-10-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/MMSP.2017.8122233
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Network topology identification from spectral templates

  2016cited by this paper
• Graph Signal Processing – A Probabilistic Framework

  2016cited by this paper
• Signal Processing on Graphs: Causal Modeling of Unstructured Data

  2015cited by this paper
• Learning Laplacian Matrix in Smooth Graph Signal Representations

  2014cited by this paper
• Depth map denoising using graph-based transform and group sparsity

  2013influential reference
• Discrete Signal Processing on Graphs

  2012influential reference
• The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains

  2012cited by this paper
• BM3D Frames and Variational Image Deblurring

  2011cited by this paper
• Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

  2011cited by this paper
• Statistical Analysis of Network Data

  2009cited by this paper
• Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems

  2007cited by this paper
• An Iterative Regularization Method for Total Variation-Based Image Restoration

  2005cited by this paper
• Ideal spatial adaptation by wavelet shrinkage

  1994cited by this paper

• A Particle Gibbs Sampling Approach to Topology Inference in Gene Regulatory Networks

  2020cites this paper