Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations
Journal of Computational Physics
CVGIP: Image Understanding
A fast level set method for propagating interfaces
Journal of Computational Physics
Direct Least Square Fitting of Ellipses
IEEE Transactions on Pattern Analysis and Machine Intelligence
Level set methods: an overview and some recent results
Journal of Computational Physics
Local Versus Nonlocal Computation of Length of Digitized Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Real-Time Tracking Using Level Sets
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
A Mumford-Shah model on lattice
Image and Vision Computing
ACIVS'07 Proceedings of the 9th international conference on Advanced concepts for intelligent vision systems
IEEE Transactions on Image Processing
Hi-index | 0.00 |
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly via level set function smoothing. We propose to incorporate standard curvature based regularization into fast level set methods and address the problem of efficiently estimating local curvature of a discretized interface in 2D or 3D based on local partial volume. We present two algorithms for incremental partial volume evaluation: the first is recommended for moderate neighborhood sizes, the second has an excellent asymptotic complexity and can be useful for very large neighborhoods. The performance of the proposed methods is compared experimentally with previous approaches.