Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
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
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
Global Minimum for Active Contour Models: A Minimal Path Approach
International Journal of Computer Vision
On the optimal detection of curves in noisy pictures
Communications of the ACM
Globally Optimal Regions and Boundaries as Minimum Ratio Weight Cycles
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Finding Shortest Paths on Surfaces Using Level Sets Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
Global Minimum for Active Contour Models: A Minimal Path Approach
CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Segmentation of Salient Closed Contours from Real Images
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Salient Closed Boundary Extraction with Ratio Contour
IEEE Transactions on Pattern Analysis and Machine Intelligence
Globally Optimal Geodesic Active Contours
Journal of Mathematical Imaging and Vision
Fast Constrained Surface Extraction by Minimal Paths
International Journal of Computer Vision
Local or Global Minima: Flexible Dual-Front Active Contours
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Variational Model for Capturing Illusory Contours Using Curvature
Journal of Mathematical Imaging and Vision
On the Measurement of Curvature in a Quantized Environment
IEEE Transactions on Computers
Automatic Lip Tracking: Bayesian Segmentation and Active Contours in a Cooperative Scheme
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
New Possibilities with Sobolev Active Contours
International Journal of Computer Vision
Curvature regularity for multi-label problems - standard and customized linear programming
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Curvature regularization for curves and surfaces in a global optimization framework
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Efficient image segmentation using weighted Pseudo-Elastica
CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
IEEE Transactions on Image Processing
Hi-index | 0.10 |
A new object segmentation method based on second-order energy minimisation is proposed. It is called pseudo-elastica as it relates to the classic Euler's elastica but resulting contours cannot be expected to converge towards continuous elastica if the resolution is increased. Comparing to prior works, our segmentation technique can be easily applied to both closed contours and open contours with fixed endpoints, and its computational complexity, O(NlogN), is significantly lower. The efficiency is increased by extending the idea of bidirectional Dijkstra-type search to second-order energies and incorporating heuristics with some sacrifice in exact energy minimisation. Our pseudo-elastica generalises the classic first-order path-based schemes to second-order energies while maintaining the same low complexity. Experiments suggest that it scores similar or better results and usually requires considerably less user input than the state-of-the-art approaches. The algorithm can be made anisotropic in order to allow corners in the contour.