A FAST ALGORITHM FOR SEQUENTIAL-MACHINES TO COMPUTE PATTERN SPECTRUM VIA CHESS-BOARD DISTANCE TRANSFORM

Authors
GHOSH P CHANDA B
Citation
P. Ghosh et B. Chanda, A FAST ALGORITHM FOR SEQUENTIAL-MACHINES TO COMPUTE PATTERN SPECTRUM VIA CHESS-BOARD DISTANCE TRANSFORM, Pattern recognition letters, 16(1), 1995, pp. 49-58
Citations number
11
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Artificial Intelligence
Journal title
Pattern recognition letters → ACNP
ISSN journal
01678655
Volume
16
Issue
1
Year of publication
1995
Pages
49 - 58
Database
ISI
SICI code
0167-8655(1995)16:1<49:AFAFST>2.0.ZU;2-C
Abstract
Computing pattern spectrum is one of the key methods for determining s hape-size distribution of objects in the image. Morphological algorith m for computing the pattern spectrum by successive opening and area co mputing is very costly on sequential machines. In this paper a fast al gorithm for the same using the chess-board distance transform is propo sed.