Advertisement

Component-Graph Construction

  • Nicolas PassatEmail author
  • Benoît Naegel
  • Camille Kurtz
Article
  • 8 Downloads

Abstract

Component-trees are classical tree structures for grey-level image modelling. Component-graphs are defined as a generalization of component-trees to images taking their values in any (totally or partially) ordered sets. Similar to component-trees, component-graphs are a lossless image model; then, they can allow for the development of various image processing approaches. However, component-graphs are not trees, but directed acyclic graphs. This makes their construction non-trivial, leading to nonlinear time cost and resulting in nonlinear space data structures. In this theoretical article, we discuss the notion(s) of component-graph, and we propose a strategy for their efficient building and representation, which are necessary conditions for further involving them in image processing approaches.

Keywords

Component-graph Algorithmics Mathematical morphology Multivalued images 

Notes

Acknowledgements

The research leading to these results was funded by the French Agence Nationale de la Recherche (Grant Agreements ANR-15-CE23-0009 and ANR-18-CE45-0018).

Supplementary material

References

  1. 1.
    Najman, L., Talbot, H. (eds.): Mathematical Morphology: From Theory to Applications. ISTE/J. Wiley & Sons (2010)Google Scholar
  2. 2.
    Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Transactions on Image Processing 7, 555–570 (1998)CrossRefGoogle Scholar
  3. 3.
    Monasse, P., Guichard, F.: Scale-space from a level lines tree. Journal of Visual Communication and Image Representation 11, 224–236 (2000)CrossRefGoogle Scholar
  4. 4.
    Salembier, P., Garrido, L.: Binary partition tree as an efficient representation for image processing, segmentation and information retrieval. IEEE Transactions on Image Processing 9, 561–576 (2000)CrossRefGoogle Scholar
  5. 5.
    Passat, N., Naegel, B.: Component-hypertrees for image segmentation. In: ISMM, International Symposium on Mathematical Morphology, Proceedings, Lecture Notes in Computer Science, vol. 6671, pp. 284–295. Springer (2011)Google Scholar
  6. 6.
    Perret, B., Cousty, J., Tankyevych, O., Talbot, H., Passat, N.: Directed connected operators: asymmetric hierarchies for image filtering and segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 37(6), 1162–1176 (2015)CrossRefGoogle Scholar
  7. 7.
    Naegel, B., Passat, N.: Component-trees and multi-value images: a comparative study. In: International Symposium on Mathematical Morphology (ISMM), Lecture Notes in Computer Science, vol. 5720, pp. 261–271. Springer (2009)Google Scholar
  8. 8.
    Passat, N., Naegel, B.: An extension of component-trees to partial orders. In: International Conference on Image Processing (ICIP), pp. 3981–3984 (2009)Google Scholar
  9. 9.
    Passat, N., Naegel, B.: Component-trees and multivalued images: structural properties. J. Math. Imaging Vis. 49, 37–50 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kurtz, C., Naegel, B., Passat, N.: Connected filtering based on multivalued component-trees. IEEE Trans. Image Process. 23, 5152–5164 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Naegel, B., Passat, N.: Toward connected filtering based on component-graphs. In: International Symposium on Mathematical Morphology (ISMM), Lecture Notes in Computer Science, vol. 7883, pp. 350–361. Springer (2013)Google Scholar
  12. 12.
    Naegel, B., Passat, N.: Colour image filtering with component-graphs. In: International Conference on Pattern Recognition (ICPR), pp. 1621–1626 (2014)Google Scholar
  13. 13.
    Carlinet, E., Géraud, T.: MToS: a tree of shapes for multivariate images. IEEE Trans. Image Process. 24, 5330–5342 (2015)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Xu, Y., Géraud, T., Najman, L.: Connected filtering on tree-based shape-spaces. IEEE Trans. Pattern Anal. Mach. Intell. 38, 1126–1140 (2016)CrossRefGoogle Scholar
  15. 15.
    Grossiord, É., Naegel, B., Talbot, H., Passat, N., Najman, L.: Shape-based analysis on component-graphs for multivalued image processing. In: International Symposium on Mathematical Morphology (ISMM), Lecture Notes in Computer Science, vol. 9082, pp. 446–457. Springer (2015)Google Scholar
  16. 16.
    Grossiord, É., Naegel, B., Talbot, H., Passat, N., Najman L.: Shape-based analysis on component-graphs for multivalued image processing. 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 (2015)Google Scholar
  17. 17.
    Passat, N., Naegel, B., Kurtz, C.: Implicit component-graph: a discussion. In: International Symposium on Mathematical Morphology (ISMM), Lecture Notes in Computer Science, vol. 10225, pp. 235–248. Springer (2017)Google Scholar
  18. 18.
    Salembier, P., Serra, J.: Flat zones filtering, connected operators, and filters by reconstruction. IEEE Trans. Image Process. 4, 1153–1160 (1995)CrossRefGoogle Scholar
  19. 19.
    Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vis. Graph. Image Process. 48, 357–393 (1989)CrossRefGoogle Scholar
  20. 20.
    Adams, R., Bischof, L.: Seeded region growing. IEEE Trans. Pattern Anal. Mach. Intell. 16, 641–647 (1994)CrossRefGoogle Scholar
  21. 21.
    Jones, R.: Connected filtering and segmentation using component trees. Comput. Vis. Image Underst. 75, 215–228 (1999)CrossRefGoogle Scholar
  22. 22.
    Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1, 131–137 (1972)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.CReSTICUniversité de Reims Champagne-ArdenneReimsFrance
  2. 2.CNRS, ICubeUniversité de StrasbourgStrasbourgFrance
  3. 3.LIPADEUniversité Paris-DescartesParisFrance

Personalised recommendations