Anisotropic Interpolation on Graphs: The Combinatorial Dirichlet Problem
| Data(s) |
14/11/2011
14/11/2011
01/07/2003
|
|---|---|
| Resumo |
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. Office of Naval Research (N00014-01-1-0624) |
| Identificador | |
| Idioma(s) |
en_US |
| Publicador |
Boston University Center for Adaptive Systems and Department of Cognitive and Neural Systems |
| Relação |
BU CAS/CNS Technical Reports;CAS/CNS-TR-2003-014 |
| Direitos |
Copyright 2003 Boston University. Permission to copy without fee all or part of this material is granted provided that: 1. The copies are not made or distributed for direct commercial advantage; 2. the report title, author, document number, and release date appear, and notice is given that copying is by permission of BOSTON UNIVERSITY TRUSTEES. To copy otherwise, or to republish, requires a fee and / or special permission. Boston University Trustees |
| Tipo |
Technical Report |
