From binary to grey scale convex hulls

• Autorzy: Soille P.
• Języki publikacji: EN

Abstrakty

EN

The convex hull of a set is the smallest convex set containing this set. In IR2, this definition is equivalent to the intersection of all half-planes containing the set. We show that this latter definition is nothing but an algebraic closing that can be applied to 2-D grey scale images. The resulting grey scale image is convex, in the sense that all its cross-sections are convex. An efficient translation-invariant implementation, leading to a decreasing family of convex sets that converges to an exact discrete convex hull, is proposed.

Słowa kluczowe

EN

convex hull; pattern recognition; shape description; image analysis; discrete geometry; mathematical morphology; algorithms; half-plane closing

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2000
• Tom: Vol. 41, Nr 1,2
• Strony: 131--146
• Opis fizyczny: wykr., bibliogr. 33 poz.

Twórcy

autor

Soille P.

• Advances Methods Sector JRC-Space Applications Institute TP 441, I-21020 Ispra, Italy,