Implicit Component-Graph: A Discussion
Component-graphs are defined as the generalization of component-trees to images taking their values in partially ordered sets. Similarly to component-trees, component-graphs are a lossless image model, and can allow for the development of various image processing approaches (antiextensive filtering, segmentation by node selection). However, component-graphs are not trees, but directed acyclic graphs. This induces a structural complexity associated to a higher combinatorial cost. These properties make the handling of component-graphs a non-trivial task. We propose a preliminary discussion on a new way of building and manipulating component-graphs, with the purpose of reaching reasonable space and time costs. Tackling these complexity issues is indeed required for actually involving component-graphs in efficient image processing approaches.
KeywordsComponent-graph Algorithmics Data-structure
- 5.Passat, N., Naegel, B.: An extension of component-trees to partial orders. In: ICIP, 3981–3984. (2009)Google Scholar
- 9.Naegel, B., Passat, N.: Colour image filtering with component-graphs. In: ICPR, pp. 1621–1626 (2014)Google Scholar
- 12.Grossiord, É., Naegel, B., Talbot, H., Passat, N., Najman, L.: Shape-based analysis on component-graphs for multivalued image processing. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, pp. 446–457. Springer, Cham (2015). doi: 10.1007/978-3-319-18720-4_38 CrossRefGoogle Scholar