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 O(n + t), where n is the size of the input image and t is the total length of all level lines. The properties of level line trees are also investiga...
| Publié dans: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1997. - 16(2007), 8 vom: Aug., Seite 2107-16 |
|---|---|
| Auteur principal: | |
| Format: | Article |
| Langue: | English |
| Publié: |
2007
|
| Accès à la collection: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Sujets: | Journal Article |