2D Grey-Level Convex Hull Computation: A Discrete 3D Approach
We compute discrete convex hulls in 2D grey-level images, where we interpret grey-level values as heights in 3D landscapes. For these 3D objects, using a 3D binary method, we compute approximations of their convex hulls. Differently from other grey-level convex hull algorithms, producing results convex only in the geometric sense, our convex hull is convex also in the grey-level sense.
Keywordsshape representation grey-level morphology concavity analysis convex deficiency
- 2.G. Borgefors, I. Nyström, and G. Sanniti di Baja. Computing covering polyhedra of non-convex objects. In Proc. of 5th British Machine Vision Conference, York, UK, pages 275–284, 1994.Google Scholar
- 4.R. C. Gonzalez and R. E. Woods. Digital Image Processing. Prentice Hall, Inc, Upper Saddle River, New Jersey, 2nd ed., 2002.Google Scholar
- 6.F. P. Preparata and M. I. Shamos. Computational Geometry an Introduction, Ch. 3. Springer-Verlag, New York, 1985.Google Scholar
- 8.P. Soille. Grey scale convex hulls: Definition, implementation, and application. In H. Heijmans and J. Roerdink, eds, Proc. of ISMM’98. Computational Imaging and Vision, Vol. 12, pages 83–90. Kluwer Academic Publishers, 1998.Google Scholar