Image colorization by using graph bi-Laplacian
From MaRDI portal
Publication:2000533
DOI10.1007/s10444-019-09677-xzbMath1421.68180OpenAlexW2921089641MaRDI QIDQ2000533
Publication date: 28 June 2019
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10444-019-09677-x
Computing methodologies for image processing (68U10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inverse problems in linear algebra (15A29)
Related Items (2)
Graph Laplacian for image deblurring ⋮ Proximal gradient methods for general smooth graph total variation model in unsupervised learning
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear projection recovery in digital inpainting for color image restoration
- Wavelet inpainting by nonlocal total variation
- Image and video colorization using vector-valued reproducing kernel Hilbert spaces
- Multi-level biharmonic and bi-Helmholtz interpolation with application to the boundary element method
- On the eigenvectors of \(p\)-Laplacian
- Efficient graph-based image segmentation
- A Weighted Difference of Anisotropic and Isotropic Total Variation Model for Image Processing
- Variational Models for Image Colorization via Chromaticity and Brightness Decomposition
- Discrete Calculus
- Augmented Lagrangian Method, Dual Methods and Split Bregman Iteration for ROF Model
- Fast Numerical Solution of the Biharmonic Dirichlet Problem on Rectangles
- Luminance-Chrominance Model for Image Colorization
This page was built for publication: Image colorization by using graph bi-Laplacian