Topological models for boundary representation: a comparison with n-dimensional generalized maps
Computer-Aided Design - Beyond solid modelling
A multiscale algorithm for image segmentation by variational method
SIAM Journal on Numerical Analysis
Variational methods in image segmentation
Variational methods in image segmentation
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
A Comparative Evaluation of Length Estimators of Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
Contains and inside relationships within combinatorial pyramids
Pattern Recognition
Analysis and comparative evaluation of discrete tangent estimators
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
IEEE Transactions on Image Processing
Hi-index | 0.00 |
This paper defines the basis of a new hierarchical segmentation framework based on an energy minimization scheme. This new framework is based on two formal tools. First, a combinatorial pyramid encodes efficiently a hierarchy of partitions. Secondly, discrete geometric estimators measure precisely some important geometric parameters of the regions. These measures combined with photometrical and topological features of the partition allow to design energy terms based on discrete measures. Our segmentation framework exploits these energies to build a pyramid of image partitions with a minimization scheme. Some experiments illustrating our framework are shown and discussed.