Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

A minimum entropy approach to adaptive image polygonization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Hermes, L. ; Dept. of Comput. Sci. III, Rheinische Friedrich-Wilhelms-Univ., Bonn, Germany ; Buhmann, J.M.

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.

Published in:

Image Processing, IEEE Transactions on  (Volume:12 ,  Issue: 10 )