In previous work, 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 interval as 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 as based on a directional interval coding. This framework supports basic morphological operations with arbitrary kernels and basic logical operations between any number of images.
|