Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
Feature-oriented image enhancement using shock filters
SIAM Journal on Numerical Analysis
High-order essentially nonsocillatory schemes for Hamilton-Jacobi equations
SIAM Journal on Numerical Analysis
Computing interface motion in compressible gas dynamics
Journal of Computational Physics
Sub-pixel distance maps and weighted distance transforms
Journal of Mathematical Imaging and Vision - Special issue on topology and geometry in computer vision
International Journal of Computer Vision
Minimal Surfaces Based Object Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analyzing and Synthesizing Images by Evolving Curves with theOsher-Sethian Method
International Journal of Computer Vision
Global Minimum for Active Contour Models: A Minimal Path Approach
International Journal of Computer Vision
Deformable Pedal Curves and Surfaces: Hybrid Geometric Active Models for Shape Recovery
International Journal of Computer Vision
Time-minimal paths amidst moving obstacles in three dimensions
Theoretical Computer Science
Multiple Contour Finding and Perceptual Grouping using Minimal Paths
Journal of Mathematical Imaging and Vision
Optimal Algorithm for Shape from Shading and Path Planning
Journal of Mathematical Imaging and Vision
Motion of curves constrained on surfaces using a level-set approach
Journal of Computational Physics
ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part I
Tracking and Characterization of Highly Deformable Cloud Structures
ECCV '00 Proceedings of the 6th European Conference on Computer Vision-Part II
Hybrid Geometric Active Models for Shape Recovery in Medical Images
IPMI '99 Proceedings of the 16th International Conference on Information Processing in Medical Imaging
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Geodesic Path Based Interpolation Using Level Sets Propagation
CAIP '99 Proceedings of the 8th International Conference on Computer Analysis of Images and Patterns
Deformed distance fields for simulation of non-penetrating flexible bodies
Proceedings of the Eurographic workshop on Computer animation and simulation
Curves Matching Using Geodesic Paths
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
3D brain surface matching based on geodesics and local geometry
Computer Vision and Image Understanding - Special issue on nonrigid image registration
Journal of Mathematical Imaging and Vision
A 4-geometry maze router and its application on multiterminal nets
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Distance and nearest neighbor transforms on gray-level surfaces
Pattern Recognition Letters
Geometric curve flows on parametric manifolds
Journal of Computational Physics
Brain MR Image Segmentation Using Local and Global Intensity Fitting Active Contours/Surfaces
MICCAI '08 Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I
An Implicit Method for Interpolating Two Digital Closed Curves on Parallel Planes
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Active contours driven by local Gaussian distribution fitting energy
Signal Processing
Shortest routes on varying height surfaces using gray-level distance transforms
Image and Vision Computing
Seeking chances through interface design: the role of abduction
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Shortest route on gray-level map using distance transform on curved space
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Medical image segmentation using active contour driven by local energy and minimal variance
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
Distance regularized level set evolution and its application to image segmentation
IEEE Transactions on Image Processing
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Split Bregman method for minimization of region-scalable fitting energy for image segmentation
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Parametric representation of a surface pencil with a common line of curvature
Computer-Aided Design
Heuristically driven front propagation for geodesic paths extraction
VLSM'05 Proceedings of the Third international conference on Variational, Geometric, and Level Set Methods in Computer Vision
Level set segmentation based on local gaussian distribution fitting
ACCV'09 Proceedings of the 9th Asian conference on Computer Vision - Volume Part I
A local modified chan–vese model for segmenting inhomogeneous multiphase images
International Journal of Imaging Systems and Technology
Robust and efficient object segmentation using pseudo-elastica
Pattern Recognition Letters
Geodesic voting for the automatic extraction of tree structures. Methods and applications
Computer Vision and Image Understanding
Fast Path Re-planning Based on Fast Marching and Level Sets
Journal of Intelligent and Robotic Systems
Medical image segmentation schemes for the analysis of gynaecological malignancies
International Journal of Knowledge-based and Intelligent Engineering Systems
Hi-index | 0.15 |
We present a new algorithm for determining minimal length paths between two regions on a three dimensional surface. The numerical implementation is based on finding equal geodesic distance contours from a given area. These contours are calculated as zero sets of a bivariate function designed to evolve so as to track the equal distance curves on the given surface. The algorithm produces all paths of minimal length between the source and destination areas on the surface given as height values on a rectangular grid.