Complexity issues in color-preserving graph embeddings.
Gaëlle BrevierRomeo RizziStéphane VialettePublished in: Theor. Comput. Sci. (2010)
Keyphrases
- color images
- color information
- random walk
- computational issues
- graph representation
- graph matching
- weighted graph
- graph theory
- directed graph
- worst case
- bipartite graph
- computational cost
- computational complexity
- directed acyclic graph
- causal graph
- space complexity
- image processing
- graph based algorithm
- polynomial time complexity
- graph theoretic
- graph partitioning
- spanning tree
- color constancy
- graph model
- low dimensional
- distance measure
- image segmentation