Binary object representation and recognition using the Hilbert morphological skeleton transform

Essam A. El-Kwae, Mansur R. Kabuka

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

A binary shape representation called the Hilbert Morphological Skeleton Transform (HMST) is introduced. This representation combines the Morphological Skeleton Transform (MST) with the clustering capabilities of the Hilbert transform. The HMST preserves the skeleton properties including information preservation, progressive visualization and compact representation. Then, an object recognition algorithm, the Hilbert Skeleton Matching Algorithm (HSMA), is introduced. This algorithm performs a single sweep over the HMSTs and renders the similarity between them as a distance measure. Testing the HSMA against the Skeleton Matching algorithm (SMA) and invariant moments revealed that the HSMA algorithm achieves slightly better object recognition rates while substantially reducing the complexity. In an experiment of 14,400 shape matches, the HSMA achieved a 90.36% recognition rate as opposed to 89.76% for the SMA and 89.49% for invariant moments. On the other hand, the HSMA improved the SMA processing more than 40%.

Original languageEnglish
Pages (from-to)1621-1636
Number of pages16
JournalPattern Recognition
Volume33
Issue number10
DOIs
StatePublished - Oct 1 2000

Fingerprint

Object recognition
Mathematical transformations
Visualization
Testing
Processing
Experiments

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Binary object representation and recognition using the Hilbert morphological skeleton transform. / El-Kwae, Essam A.; Kabuka, Mansur R.

In: Pattern Recognition, Vol. 33, No. 10, 01.10.2000, p. 1621-1636.

Research output: Contribution to journalArticle

@article{e326aa1779a34e28bb2db19cff8587d5,
title = "Binary object representation and recognition using the Hilbert morphological skeleton transform",
abstract = "A binary shape representation called the Hilbert Morphological Skeleton Transform (HMST) is introduced. This representation combines the Morphological Skeleton Transform (MST) with the clustering capabilities of the Hilbert transform. The HMST preserves the skeleton properties including information preservation, progressive visualization and compact representation. Then, an object recognition algorithm, the Hilbert Skeleton Matching Algorithm (HSMA), is introduced. This algorithm performs a single sweep over the HMSTs and renders the similarity between them as a distance measure. Testing the HSMA against the Skeleton Matching algorithm (SMA) and invariant moments revealed that the HSMA algorithm achieves slightly better object recognition rates while substantially reducing the complexity. In an experiment of 14,400 shape matches, the HSMA achieved a 90.36{\%} recognition rate as opposed to 89.76{\%} for the SMA and 89.49{\%} for invariant moments. On the other hand, the HSMA improved the SMA processing more than 40{\%}.",
author = "El-Kwae, {Essam A.} and Kabuka, {Mansur R.}",
year = "2000",
month = "10",
day = "1",
doi = "10.1016/S0031-3203(99)00169-7",
language = "English",
volume = "33",
pages = "1621--1636",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",
number = "10",

}

TY - JOUR

T1 - Binary object representation and recognition using the Hilbert morphological skeleton transform

AU - El-Kwae, Essam A.

AU - Kabuka, Mansur R.

PY - 2000/10/1

Y1 - 2000/10/1

N2 - A binary shape representation called the Hilbert Morphological Skeleton Transform (HMST) is introduced. This representation combines the Morphological Skeleton Transform (MST) with the clustering capabilities of the Hilbert transform. The HMST preserves the skeleton properties including information preservation, progressive visualization and compact representation. Then, an object recognition algorithm, the Hilbert Skeleton Matching Algorithm (HSMA), is introduced. This algorithm performs a single sweep over the HMSTs and renders the similarity between them as a distance measure. Testing the HSMA against the Skeleton Matching algorithm (SMA) and invariant moments revealed that the HSMA algorithm achieves slightly better object recognition rates while substantially reducing the complexity. In an experiment of 14,400 shape matches, the HSMA achieved a 90.36% recognition rate as opposed to 89.76% for the SMA and 89.49% for invariant moments. On the other hand, the HSMA improved the SMA processing more than 40%.

AB - A binary shape representation called the Hilbert Morphological Skeleton Transform (HMST) is introduced. This representation combines the Morphological Skeleton Transform (MST) with the clustering capabilities of the Hilbert transform. The HMST preserves the skeleton properties including information preservation, progressive visualization and compact representation. Then, an object recognition algorithm, the Hilbert Skeleton Matching Algorithm (HSMA), is introduced. This algorithm performs a single sweep over the HMSTs and renders the similarity between them as a distance measure. Testing the HSMA against the Skeleton Matching algorithm (SMA) and invariant moments revealed that the HSMA algorithm achieves slightly better object recognition rates while substantially reducing the complexity. In an experiment of 14,400 shape matches, the HSMA achieved a 90.36% recognition rate as opposed to 89.76% for the SMA and 89.49% for invariant moments. On the other hand, the HSMA improved the SMA processing more than 40%.

UR - http://www.scopus.com/inward/record.url?scp=0034301713&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034301713&partnerID=8YFLogxK

U2 - 10.1016/S0031-3203(99)00169-7

DO - 10.1016/S0031-3203(99)00169-7

M3 - Article

AN - SCOPUS:0034301713

VL - 33

SP - 1621

EP - 1636

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

IS - 10

ER -