Abstract
Tree-based image representations are popular tools for many applications in mathematical morphology and image processing. Classically, one computes an attribute on each node of a tree and decides whether to preserve or remove some nodes upon the attribute function. This attribute function plays a key role for the good performance of tree-based applications. In this paper, we propose several algorithms to compute efficiently some attribute information. The first one is incremental computation of information on region, contour, and context. Then we show how to compute efficiently extremal information along the contour (e.g., minimal gradient’s magnitude along the contour). Lastly, we depict computation of extinction-based saliency map using tree-based image representations. The computation complexity and the memory cost of these algorithms are analyzed. To the best of our knowledge, except information on region, none of the other algorithms is presented explicitly in any state-of-the-art paper.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Berger, C., Géraud, T., Levillain, R., Widynski, N., Baillard, A., Bertin, E.: Effective component tree computation with application to pattern recognition in astronomical imaging. In: Proc. of IEEE ICIP., vol. 4, pp. 41–44 (2007)
Breen, E., Jones, R.: Attribute openings, thinnings, and granulometries. CVIU 64(3), 377–389 (1996)
Cao, F., Musé, P., Sur, F.: Extracting meaningful curves from images. JMIV 22, 159–181 (2005)
Carlinet, E., Géraud, T.: A comparative review of component tree computation algorithms. IEEE Transactions on Image Processing 23(9), 3885–3895 (2014)
Carlinet, E., Géraud, T.: A color tree of shapes with illustrations on filtering, simplification, and segmentation (submitted for publication, 2015)
Caselles, V., Monasse, P.: Geometric Description of Images as Topographic Maps, 1st edn. Springer Publishing Company, Incorporated (2009)
Desolneux, A., Moisan, L., Morel, J.: Edge detection by helmholtz principle. JMIV 14(3), 271–284 (2001)
Géraud, T., Carlinet, E., Crozet, S., Najman, L.: A quasi-linear algorithm to compute the tree of shapes of nD images. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 98–110. Springer, Heidelberg (2013)
Monasse, P., Guichard, F.: Fast computation of a contrast-invariant image representation. IEEE Trans. on Image Processing 9(5), 860–872 (2000)
Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Trans. on Image Processing 15(11), 3531–3539 (2006)
Nistér, D., Stewénius, H.: Linear time maximally stable extremal regions. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part II. LNCS, vol. 5303, pp. 183–196. Springer, Heidelberg (2008)
Ouzounis, G.K., Wilkinson, M.H.F.: A parallel implementation of the dual-input max-tree algorithm for attribute filtering. In: ISMM, pp. 449–460 (2007)
Salembier, P., Oliveras, A., Garrido, L.: Antiextensive connected operators for image and sequence processing. ITIP 7(4), 555–570 (1998)
Salembier, P., Wilkinson, M.H.F.: Connected operators. IEEE Signal Processing Mag. 26(6), 136–157 (2009)
Song, Y.: A topdown algorithm for computation of level line trees. IEEE Transactions on Image Processing 16(8), 2107–2116 (2007)
Vachier, C., Meyer, F.: Extinction values: A new measurement of persistence. In: IEEE Workshop on Non Linear Signal/Image Processing, pp. 254–257 (1995)
Westenberg, M.A., Roerdink, J.B.T.M., Wilkinson, M.H.F.: Volumetric attribute filtering and interactive visualization using the max-tree representation. ITIP 16(12), 2943–2952 (2007)
Wilkinson, M.H.F.: A fast component-tree algorithm for high dynamic-range images and second generation connectivity. In: Proc. of ICIP, pp. 1021–1024 (2011)
Wilkinson, M.H.F., Gao, H., Hesselink, W.H., Jonker, J.E., Meijster, A.: Concurrent computation of attribute filters on shared memory parallel machines. PAMI 30(10), 1800–1813 (2008)
Xu, Y.: Tree-based shape spaces: Definition and applications in image processing and computer vision. Ph.D. thesis, Université Paris Est, Marne-la-Vallée, France (December 2013)
Xu, Y., Géraud, T., Najman, L.: Context-based energy estimator: Application to object segmentation on the tree of shapes. In: ICIP, pp. 1577–1580. IEEE (2012)
Xu, Y., Géraud, T., Najman, L.: Two applications of shape-based morphology: Blood vessels segmentation and a generalization of constrained connectivity. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 390–401. Springer, Heidelberg (2013)
Xu, Y., Géraud, T., Najman, L.: Morphological Filtering in Shape Spaces: Applications using Tree-Based Image Representations. In: ICPR, pp. 485–488 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Xu, Y., Carlinet, E., Géraud, T., Najman, L. (2015). Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations. In: Benediktsson, J., Chanussot, J., Najman, L., Talbot, H. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2015. Lecture Notes in Computer Science(), vol 9082. Springer, Cham. https://doi.org/10.1007/978-3-319-18720-4_58
Download citation
DOI: https://doi.org/10.1007/978-3-319-18720-4_58
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18719-8
Online ISBN: 978-3-319-18720-4
eBook Packages: Computer ScienceComputer Science (R0)