Edge-enhancing Filters with Negative Weights

DOI10.1109/GLOBALSIP.2015.7418197MaRDI QIDQ6265278zbMATH OpenFDO

Authors Andrew Knyazev

Publication date 8 September 2015

Full work available at URL https://doi.org/10.1109/GLOBALSIP.2015.7418197

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computing methodologies for image processing (68U10)

Abstract: In [DOI:10.1109/ICMEW.2014.6890711], a graph-based denoising is performed by projecting the noisy image to a lower dimensional Krylov subspace of the graph Laplacian, constructed using nonnegative weights determined by distances between image data corresponding to image pixels. We~extend the construction of the graph Laplacian to the case, where some graph weights can be negative. Removing the positivity constraint provides a more accurate inference of a graph model behind the data, and thus can improve quality of filters for graph-based signal processing, e.g., denoising, compared to the standard construction, without affecting the costs.

This page was built for publication: Edge-enhancing Filters with Negative Weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6265278)