A Performance Measure for Boundary Detection Algorithms

In this paper we discuss the issues involved when trying to compare the performance of algorithms which seek to find boundaries and boundary models between regions of differing mean gray-level value. The usefulness of such measures is not confined to comparing different approaches, but provides an i...

Full description

Saved in:
Bibliographic Details
Published in:Computer vision and image understanding 1996-05, Vol.63 (3), p.476-494
Main Authors: Palmer, P.L., Dabis, H., Kittler, J.
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Pattern recognition. Digital image processing. Computational geometry
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we discuss the issues involved when trying to compare the performance of algorithms which seek to find boundaries and boundary models between regions of differing mean gray-level value. The usefulness of such measures is not confined to comparing different approaches, but provides an important step to building self-optimizing vision systems that automatically adjust algorithm parameters at each level of the system to improve performance. We discuss the issues that such a performance measure should address, and then present a theoretical framework for the performance measure we proposed. We demonstrate the power of the measure by characterizing the performance of a three-stage medium level vision system for detecting straight line boundaries. Both synthetic imagery, for which ground truth is known, and real imagery are used to test the ability of the criterion to characterize the output of the system.
ISSN:1077-3142
1090-235X
DOI:10.1006/cviu.1996.0036