The Eikonal equation: some results applicable to computer vision
Shape from shading
A viscosity solutions approach to shape-from-shading
SIAM Journal on Numerical Analysis
High-Order WENO Schemes for Hamilton-Jacobi Equations on Triangular Meshes
SIAM Journal on Scientific Computing
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Learning a Classification Model for Segmentation
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Weighted distance maps computation on parametric three-dimensional manifolds
Journal of Computational Physics
A Fast Iterative Method for Eikonal Equations
SIAM Journal on Scientific Computing
Local and Nonlocal Discrete Regularization on Weighted Graphs for Image and Mesh Processing
International Journal of Computer Vision
Adaptation of Eikonal Equation over Weighted Graph
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
TurboPixels: Fast Superpixels Using Geometric Flows
IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
IEEE Transactions on Pattern Analysis and Machine Intelligence
A unified approach to noise removal, image enhancement, and shape recovery
IEEE Transactions on Image Processing
Fast 3d surface reconstruction from point clouds using graph-based fronts propagation
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV
Hi-index | 0.00 |
In this paper we propose an adaptation of the static eikonal equation over weighted graphs of arbitrary structure using a framework of discrete operators. Based on this formulation, we provide explicit solutions for the L1,L2 and L∞ norms. Efficient algorithms to compute the explicit solution of the eikonal equation on graphs are also described. We then present several applications of our methodology for image processing such as superpixels decomposition, region based segmentation or patchbased segmentation using non-local configurations. By working on graphs, our formulation provides an unified approach for the processing of any data that can be represented by a graph such as high-dimensional data.