SVG rendering of real images using data dependent triangulation
Proceedings of the 20th spring conference on Computer graphics
Pattern Recognition Letters
An efficient algorithm for attention-driven image interpretation from segments
Pattern Recognition
Generating segmented meshes from textured color images
Journal of Visual Communication and Image Representation
Dense stereo by triangular meshing and cross validation
DAGM'06 Proceedings of the 28th conference on Pattern Recognition
Bayesian image segmentation using gaussian field priors
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
| Hi-index | 0.01 |
This paper introduces a novel adaptive image segmentation algorithm which represents images by polygonal segments. The algorithm is based on an intuitive generative model for pixel intensities and its associated cost function which can be effectively optimized by a hierarchical triangulation algorithm. A triangular mesh is iteratively refined and reorganized to extract a compact description of the essential image structure. After analyzing fundamental convexity properties of our cost function, we adapt an information-theoretic bound to assess the statistical significance of a given triangulation step. The bound effectively defines a stopping criterion to limit the number of triangles in the mesh, thereby avoiding undesirable overfitting phenomena. It also facilitates the development of a multiscale variant of the triangulation algorithm, which substantially improves its computational demands. The algorithm has various applications in contextual classification, remote sensing, and visual object recognition. It is particularly suitable for the segmentation of noisy imagery.