Shape-based Invariant Texture Indexing
International Journal of Computer Vision
Computation of level lines of 4-/8-connectedness
Journal of Visual Communication and Image Representation
Hi-index | 0.01 |
We introduce an optimal topdown algorithm for computing and representing level line trees of 2-D intensity images. The running time of the algorithm is , where is the size of the input image and is the total length of all level lines. The properties of level line trees are also investigated. The efficiency of the algorithm is illustrated by experiments on images of different sizes and scenes.