Graph Regularisation Using Gaussian Curvature
From MaRDI portal
Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Machine vision and scene understanding (68T45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)
Recommendations
Cites work
- A general framework for low level vision
- Digitized PDE method for data restoration
- Geometric partial differential equations and image analysis
- scientific article; zbMATH DE number 1189353 (Why is no real title available?)
- scientific article; zbMATH DE number 1796938 (Why is no real title available?)
- Images as embedded maps and minimal surfaces: Movies, color, texture, and volumetric medical images
- Spectral embedding of graphs.
- Structural, Syntactic, and Statistical Pattern Recognition
- The digital TV filter and nonlinear denoising
- Variational problems and partial differential equations on implicit surfaces
- Variational restoration of nonflat image features: Models and algorithms
Cited in
(5)- Heat kernel embeddings, differential geometry and graph structure
- Global graph curvature
- An Operator-Splitting Method for the Gaussian Curvature Regularization Model with Applications to Surface Smoothing and Imaging
- SCORE: approximating curvature information under self-concordant regularization
- A Riemannian approach to graph embedding
This page was built for publication: Graph Regularisation Using Gaussian Curvature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637703)