Title :
A Topdown Algorithm for Computation of Level Line Trees
Author_Institution :
Michigan Univ., Dearborn
Abstract :
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.
Keywords :
computational complexity; computational geometry; image representation; trees (mathematics); 2-D intensity image; contour tree; image representation; level line trees; optimal topdown algorithm; Biomedical imaging; Crystallography; Geographic Information Systems; Image coding; Image representation; Layout; Level set; Merging; Topology; X-ray imaging; Contour tree; image representation; level line tree; level set; monotonic line tree; Algorithms; Artificial Intelligence; Image Enhancement; Image Interpretation, Computer-Assisted; Information Storage and Retrieval; Pattern Recognition, Automated; Reproducibility of Results; Sensitivity and Specificity;
Journal_Title :
Image Processing, IEEE Transactions on
DOI :
10.1109/TIP.2007.899616
