Edge-enhancing filters with negative weights

  title={Edge-enhancing filters with negative weights},
  author={Andrew V. Knyazev},
  journal={2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP)},
  • A. Knyazev
  • Published 2015
  • Computer Science, Mathematics
  • 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
In [D01: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… Expand
Graph Spectral Image Processing
This paper overviews recent graph spectral techniques in GSP specifically for image/video processing, including image compression, image restoration, image filtering, and image segmentation. Expand
Robust Semisupervised Graph Classifier Learning With Negative Edge Weights
This paper constructs a complete graph-based binary classifier given only samples’ feature vectors and partial labels and proposes an algorithm based on iterative reweighted least squares that solves the posed MAP problem efficiently. Expand
Signed Laplacian for spectral clustering revisited
This work revisits comparing the standard and signed Laplacians and argues that the former is more natural than the latter, also showing that the negative spectrum is actually beneficial, for spectral clustering of signed graphs. Expand
Signal reconstruction via operator guiding
  • A. Knyazev, A. Malyshev
  • Computer Science, Mathematics
  • 2017 International Conference on Sampling Theory and Applications (SampTA)
  • 2017
More general guiding operators are proposed, which increase signal components in the guiding subspace relative to those in a complementary subspace, e.g., iterative low-pass edge-preserving filters for super-resolution of images. Expand
Edge-Preserving Camera Trajectories for Improved Optical Character Recognition on Static Scenes With Text
Tuned edge-preserving trajectories are shown to result in higher recognition accuracy when compared to inverse error and linear trajectories, and simulation and experimental results provide quantitative measures to verify edge- Preservation and greater recognition performance. Expand
Power line detection via background noise removal
An accurate and robust power line detection method is proposed, wherein background noise is mitigated by an embedded convolution neural network (CNN) classifier before conducting the final power line extractions. Expand
Rating Prediction via Graph Signal Processing
New designs for recommendation systems inspired by recent advances in graph signal processing are developed, and it is demonstrated that linear latent factor models can be viewed as bandlimited interpolation algorithms that operate in a frequency domain given by the spectrum of a joint user and item network. Expand
On spectral partitioning of signed graphs
It is observed that negative eigenvalues are beneficial for spectral partitioning of signed graphs, making the Fiedler vector easier to compute. Expand


Chebyshev and conjugate gradient filters for graph image denoising
This paper proposes a graph-based image enhancement technique that uses a higher quality view to enhance a degraded view and discusses two graph spectral denoising methods: first using Chebyshev polynomials, and second using iterations of the conjugate gradient algorithm. Expand
Bilateral filter: Graph spectral interpretation and extensions
This paper shows that the bilateral filter proposed by Tomasi and Manduchi can be viewed as a spectral domain transform defined on a weighted graph and proposes new spectral designs of “bilateral-like” filters that can be implemented with k-iterative bilateral filtering operations and do not require expensive diagonalization of the Laplacian matrix. Expand
Localized iterative methods for interpolation in graph structured data
This paper presents two localized graph filtering based methods for interpolating graph signals defined on the vertices of arbitrary graphs from only a partial set of samples, and provides both a closed form solution and a computationally efficient iterative solution of the optimization problem. Expand
Edge Guided High Order Image Smoothing
An effective and practical image editing method which can sharply preserve the salient edges and at the same time smooths the continuous regions using high order smootherness prior to achieve the smoothing results different from the first order smoothness prior is presented. Expand
Graph spectral image smoothing using the heat kernel
A new method for smoothing both gray-scale and color images is presented that relies on the heat diffusion equation on a graph that has the effect of smoothing within regions, but does not blur region boundaries. Expand
Weighted Guided Image Filtering
Experimental results show that the resultant algorithms produce images with better visual quality and at the same time halo artifacts can be reduced/avoided from appearing in the final images with negligible increment on running times. Expand
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
This tutorial overview outlines the main challenges of the emerging field of signal processing on graphs, discusses different ways to define graph spectral domains, which are the analogs to the classical frequency domain, and highlights the importance of incorporating the irregular structures of graph data domains when processing signals on graphs. Expand
Fast matting using large kernel matting Laplacian matrices
  • Kaiming He, Jian Sun, Xiaoou Tang
  • Computer Science
  • 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
  • 2010
This paper derives an efficient algorithm to solve a large kernel matting Laplacian and uses adaptive kernel sizes by a KD-tree trimap segmentation technique to reduce running time. Expand
Bilateral filtering for gray and color images
  • Carlo Tomasi, R. Manduchi
  • Mathematics, Computer Science
  • Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271)
  • 1998
In contrast with filters that operate on the three bands of a color image separately, a bilateral filter can enforce the perceptual metric underlying the CIE-Lab color space, and smooth colors and preserve edges in a way that is tuned to human perception. Expand
An adaptive bilateral filter based framework for image denoising
The proposed image denoising framework mainly consists of an impulse noise detector (IND), an edge connection precedure and an adaptive bilateral filter (ABF), which switches between Gaussian and impulse noise depending on the impulse noise detection results. Expand