Universal covers, color refinement, and two-variable logic with counting quantifiers: Lower bounds for the depth.
Andreas KrebsOleg VerbitskyPublished in: CoRR (2014)
Keyphrases
- lower bound
- upper bound
- color images
- multi valued
- color information
- np hard
- branch and bound algorithm
- single shot
- objective function
- depth information
- upper and lower bounds
- lower and upper bounds
- classical logic
- color space
- book covers
- outdoor scenes
- optimal solution
- depth images
- image regions
- logic programming
- color features
- color constancy
- linear programming relaxation
- optimal cost