Image Representation Using 2D Gabor Wavelets
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Representation of Image Structures via Scale Space Entropy Conditions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometry of Digital Spaces
Total Variation Minimization by the Fast Level Sets Transform
VLSM '01 Proceedings of the IEEE Workshop on Variational and Level Set Methods (VLSM'01)
Level Lines Selection with Variational Models for Segmentation and Encoding
Journal of Mathematical Imaging and Vision
Geometric Description of Images as Topographic Maps
Geometric Description of Images as Topographic Maps
Two-Dimensional Polar Harmonic Transforms for Invariant Image Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constrained Nonnegative Matrix Factorization for Image Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast computation of a contrast-invariant image representation
IEEE Transactions on Image Processing
The finite ridgelet transform for image representation
IEEE Transactions on Image Processing
A Topdown Algorithm for Computation of Level Line Trees
IEEE Transactions on Image Processing
Computation of Level-Set Components From Level Lines
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
We present a topdown algorithm to compute level line trees of 4-/8-connectedness. As a boundary of a level set component, a level line of an image is a Jordan boundary of intensity value on instant interior greater/less than on instant exterior. The interior of a Jordan boundary assumes 4-connectedness and the exterior 8-connectedness, or the inverse. All level lines form a tree structure. The running time of the algorithm is O(n+t), where n is the size of the input image and t is the total length of all level lines. The efficiency of the algorithm is illustrated by experiments.