Grey scale convex hulls: definition, implementation and application
Pierre Soille · 1998
The convex hull of a set is the smallest convex set containing this set. An equivalent definition consists in intersecting all half-planes containing the set. We show that this latter definition is nothing but an algebraic closing that can be applied to grey scale images. An implementation of this definition leading to a decreasing family of convex hulls with increasing precision is proposed. Finally, an application of grey scale convex hulls to the direct grey scale extraction of features for character recognition is presented.