There is an increasing demand for a new measure of convexity fordiscrete sets for various applications. For example, the well- known measures for h-, v-, and hv-convexity of discrete sets in binary tomography pose rigorous criteria to be satisfied. Currently, there is no commonly accepted, unified view on what type of discrete sets should be considered nearly hv-convex, or to what extent a given discrete set can be considered convex, in case it does not satisfy the strict conditions. We propose a novel directional convexity measure for discrete sets based on various properties of the configuration of 0s and 1s in the set. It can be supported by proper theory, is easy to compute, and according to our experiments, it behaves intuitively. We expect it to become a useful alternative to other convexity measures in situations where the classical definitions cannot be used.

JF - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications PB - Springer Verlag CY - Berlin; Heidelberg UR - http://link.springer.com/chapter/10.1007%2F978-3-642-41827-3_2 N1 - ScopusID: 84893169866doi: 10.1007/978-3-642-41827-3_2 ER -