A Lower Bound for Dilation of an Embedding.
R. Sundara RajanPaul D. ManuelIndra RajasinghN. ParthibanMirka MillerPublished in: Comput. J. (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- mathematical morphology
- worst case
- optimal solution
- np hard
- binary images
- lower and upper bounds
- objective function
- linear programming relaxation
- morphological filters
- morphological operators
- robust image watermarking
- morphological operations
- vector space
- neural network
- graph embedding
- competitive ratio
- sufficiently accurate
- vc dimension
- upper and lower bounds
- lagrangian relaxation
- scheduling problem
- nonlinear dimensionality reduction
- online algorithms
- constant factor
- image processing