Anisotropic Interpolation on Graphs: The Combinatorial Dirichlet Problem
MetadataShow full item record
The combinatorial Dirichlet problem is formulated, and an algorithm for solving it is presented. This provides an effective method for interpolating missing data on weighted graphs of arbitrary connectivity. Image processing examples are shown, and the relation to anistropic diffusion is discussed.