Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
Using Dynamic Programming for Solving Variational Problems in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analytic properties of plane offset curves
Computer Aided Geometric Design
On active contour models and balloons
CVGIP: Image Understanding
A fast algorithm for active contours and curvature estimation
CVGIP: Image Understanding
Shape Modeling with Front Propagation: A Level Set Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
Global Minimum for Active Contour Models: A Minimal Path Approach
International Journal of Computer Vision
Region-Based 2D Deformable Generalized Cylinder for Narrow Structures Segmentation
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Efficient segmentation of piecewise smooth images
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
IEEE Transactions on Image Processing
A faster converging snake algorithm to locate object boundaries
IEEE Transactions on Image Processing
Localizing Region-Based Active Contours
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
The proposed method is related to parametric and geodesic active contours as well as minimal paths, in the context of image segmentation. Our geodesically linked active contour model consists in a set of vertices connected by paths of minimal cost. This makes up a closed piecewise defined curve, over which an edge or region energy functional is formulated. The greedy algorithm is used to move vertices towards a configuration minimizing the energy functional. This evolution technique ensures lower sensitivity to erroneous local minima than usual gradient descent of the energy. Our method intends to take advantage of explicit active contours, minimal paths and greedy evolution techniques.