✦ LIBER ✦

Classification of pathological shapes using convexity measures

✍ Scribed by Paul L. Rosin

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 738 KB
Volume: 30
Category: Article
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2008.12.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chapman's classification of shapes a pro

Chapman's classification of shapes a proof using collapsing

✍ Larry Siebenmann 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 497 KB

Four fuzzy supervised classification met

Four fuzzy supervised classification methods for discriminating classes of non-convex shape

✍ A. Devillez 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 941 KB

On the classification of recall strings

On the classification of recall strings using lattice-theoretic measures

✍ Stephen C. Hirtle 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 902 KB

On the classification of recall strings

On the classification of recall strings using lattice-theoretic measures

✍ Stephen C. Hirtle 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 23 KB

Characterization of shapes for use in cl

Characterization of shapes for use in classification of starch grains images

✍ Chong-Sze Tong; Siu-Kai Choy; Sung-Nok Chiu; Zhong-Zhen Zhao; Zhi-Tao Liang 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

## Abstract As tradition Chinese herbal medicine becomes increasingly popular, there is an urgent need for efficient and accurate methods for the authentication of the Chinese Materia Medica (CMM) used in the herbal medicine. In this work, we present a denoising filter and introduce the use of chor

Hierarchical representation of 2-D shape

Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach

✍ O. El Badawy; M.S. Kamel 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 688 KB

A concavity tree is a data structure for hierarchically representing the shape of two-dimensional silhouettes using convex polygons. In this paper, we present a new algorithm for concavity tree extraction. The algorithm is fast, works directly on the pixel grid of the shape, and uses exact convex hu