Abstract
In previous work,1,2 we presented algorithms for the analysis of maps and line-drawing images which are based on the processing of directional edge planes by directional morphological operations. This paper discusses the problem of efficient morphological processing of directional edge planes on a serial computer, where it is assumed that arbitrary kernels may be used. The proposed approach is based on a compact representation of the edge planes, which is obtained by using directional interval coding, where the direction of the intervals is adapted individually in each directional edge plane. In a broader sense, the proposed approach provides a general framework for efficient processing of binary images which is based on a directional interval coding. This framework supports basic morphological operations with arbitrary kernels and basic logical operations between any number of images.
Original language | English |
---|---|
Pages (from-to) | 41-51 |
Number of pages | 11 |
Journal | Proceedings of SPIE - The International Society for Optical Engineering |
Volume | 3168 |
DOIs | |
State | Published - 1 Dec 1997 |
Event | Vision Geometry VI - San Diego, CA, United States Duration: 28 Jul 1997 → 28 Jul 1997 |
Keywords
- Directional decomposition
- Directional interval coding
- Directional scanning
- Document analysis
- Graphics recognition
- Mathematical morphology
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering