International Journal of Computer Vision
Minimal Surfaces Based Object Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Flux Maximizing Geometric Flows
IEEE Transactions on Pattern Analysis and Machine Intelligence
Regularized Laplacian Zero Crossings as Optimal Edge Integrators
International Journal of Computer Vision
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
An Algorithm for Total Variation Minimization and Applications
Journal of Mathematical Imaging and Vision
What Metrics Can Be Approximated by Geo-Cuts, Or Global Optimization of Length/Area and Flux
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Globally Minimal Surfaces by Continuous Maximal Flows
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Global Minimization of the Active Contour/Snake Model
Journal of Mathematical Imaging and Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
A hamilton-jacobi-bellman approach to high angular resolution diffusion tractography
MICCAI'05 Proceedings of the 8th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
IEEE Transactions on Image Processing
Dense 3D reconstruction of symmetric scenes from a single image
DAGM'11 Proceedings of the 33rd international conference on Pattern recognition
Hi-index | 0.00 |
We present a continuous and convex formulation for Finsler active contours using seed regions or utilizing a regional bias term. The utilization of general Finsler metrics instead of Riemannian metrics allows the segmentation boundary to favor appropriate locations (e.g. with strong image discontinuities) and suitable directions (e.g. aligned with dark to bright image gradients). Strong edges are not required everywhere along the desired segmentation boundary due to incorporation of a regional bias. The resulting optimization procedure is simple and efficient, and leads to binary segmentation results regardless of the underlying continuous formulation. We demonstrate the proposed method in several examples.