Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
Readings in computer vision: issues, problems, principles, and paradigms
Optimal shortest path queries in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Shape Modeling with Front Propagation: A Level Set Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
On piecewise linear approximation of planar Jordan curves
Journal of Computational and Applied Mathematics
Minimal Surfaces Based Object Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Global Minimum for Active Contour Models: A Minimal Path Approach
International Journal of Computer Vision
A note on minimal length polygonal approximation to a digitized contour
Communications of the ACM
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Curvature Flow and Its Application for Skeletonization
Journal of Mathematical Imaging and Vision
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Fast Constrained Surface Extraction by Minimal Paths
International Journal of Computer Vision
First results for 3D image segmentation with topological map
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
IEEE Transactions on Image Processing
Top-Down Segmentation of Histological Images Using a Digital Deformable Model
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Fully deformable 3D digital partition model with topological control
Pattern Recognition Letters
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Dynamic minimum length polygon
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Discrete Applied Mathematics
Recursive computation of minimum-length polygons
Computer Vision and Image Understanding
| Hi-index | 0.00 |
Deformable models are continuous energy-minimizing techniques that have been successfully applied to image segmentation and tracking since twenty years. This paper defines a novel purely digital deformable model (DDM), whose internal energy is based on the minimum length polygon (MLP). We prove that our combinatorial regularization term has "convex" properties: any local descent on the energy leads to a global optimum. Similarly to the continuous case where the optimum is a straight segment, our DDM stops on a digital straight segment. The DDM shares also the same behaviour as its continuous counterpart on images.