Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
A fast level set method for propagating interfaces
Journal of Computational Physics
Region Tracking via Level Set PDEs without Motion Computation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convergence analysis of active contours
Image and Vision Computing
An Efficient Morphological Active Surface Model for Volumetric Image Segmentation
ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
A stability approach to convergence of curve evolution methods
Pattern Recognition Letters
Maritime surveillance: Tracking ships inside a dynamic background using a fast level-set
Expert Systems with Applications: An International Journal
Evaluating isosurfaces with level-set-based information maps
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
Hi-index | 0.10 |
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability and convergence have always been neglected in most of the level set implementations. This often leads to either complete breakdown or premature/delayed termination of the curve evolution process, resulting in unsatisfactory results. We present a generic convergence criterion and also a means of determining the optimal time-step involved in the numerical solution of the level set equation. The significant improvement in the performance of level set algorithms, as a result of the proposed changes, is demonstrated using object tracking and shape-contour extraction results.