A Topdown Algorithm for Computation of Level Line Trees

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 eff...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on image processing 2007-08, Vol.16 (8), p.2107-2116
1. Verfasser:	Song, Yuqing
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Artificial Intelligence Biomedical imaging Computation Contour tree Crystallography Exact sciences and technology Geographic Information Systems Image coding Image Enhancement - methods Image Interpretation, Computer-Assisted - methods Image processing Image representation Information Storage and Retrieval - methods Information, signal and communications theory Layout level line tree Level set Merging monotonic line tree Optimization Pattern Recognition, Automated - methods Reproducibility of Results Running Sensitivity and Specificity Signal and communications theory Signal processing Signal representation. Spectral analysis Signal, noise Telecommunications and information theory Topology Trees X-ray imaging
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1057-7149 1941-0042
DOI:	10.1109/TIP.2007.899616