Introduction to algorithms
On active contour models and balloons
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
Intelligent scissors for image composition
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
International Journal of Computer Vision
User-steered image segmentation paradigms: live wire and live lane
Graphical Models and Image Processing
Interactive segmentation with Intelligent Scissors
Graphical Models and Image Processing
Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Bayesian Object Localisation in Images
International Journal of Computer Vision
Geodesic Active Regions and Level Set Methods for Supervised Texture Segmentation
International Journal of Computer Vision
Real-Time Interactive Path Extraction with on-the-Fly Adaptation of the External Forces
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
A Bayesian Network Framework for Real-Time Object Selection
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 4 - Volume 04
Intrinsic Bayesian Active Contours for Extraction of Object Boundaries in Images
International Journal of Computer Vision
Boundaries as Contours of Optimal Appearance and Area of Support
EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Hi-index | 0.00 |
Original active contour formulations may become ill-posed especially for boundaries characterized by prominent features. Attempts to yield well-posed formulations lead to bias towards short contours. We provide a framework to unify existing bias correcting energy methods and propose a novel local bias correcting scheme similar to non-maximum suppression. Our method can be seen as an approximation to a well-known algorithm that transforms a graph with positive and negative weights to a graph with only positive weights while preserving the shortest paths among the nodes.