Finding the Minimal Set of Maximum Disks for Binary Objects

A two-dimensional binary object can be totally covered by a set of disks. From this follows that any object might be represented by these disks rather than by the pixels. This paper deals with the problem of finding the most efficient version of this representation which is called the minimal set of...

Full description

Saved in:
Bibliographic Details
Published inGraphical models and image processing Vol. 59; no. 1; pp. 55 - 60
Main Authors Nilsson, Frederik, Danielsson, Per-Erik
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 01.01.1997
Academic Press
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Artificial intelligence
Computer science; control theory; systems
Exact sciences and technology
Pattern recognition. Digital image processing. Computational geometry
Theoretical computing
Algorithm performance
Image processing
Binary image
Euclidean space
Experimental study
Algorithm
Modeling
Distance
Pattern extraction
Circular shape
Online AccessGet full text

Cover

More Information
Summary:A two-dimensional binary object can be totally covered by a set of disks. From this follows that any object might be represented by these disks rather than by the pixels. This paper deals with the problem of finding the most efficient version of this representation which is called the minimal set of maximum disks (MSD). The proposed algorithm picks candidate disks from the local maxima in the Euclidean distance transform. Then a relation table for the pixel coverage of these disks is estabished, but only for the border pixels which makes the table size reasonable. Three basic table reduction steps are executed to extract and include necessary disks to MSD while eliminating and excluding the unnecessary disks.
ISSN:1077-3169
1090-2481
DOI:10.1006/gmip.1996.0412