Block realizations of finite metrics and the tight-span construction I: The embedding theorem.
Andreas W. M. DressKatharina T. HuberJacobus H. KoolenVincent MoultonPublished in: Appl. Math. Lett. (2008)
Keyphrases
- lower bound
- upper bound
- worst case
- evaluation metrics
- nonlinear dimensionality reduction
- arbitrary size
- finite number
- data hiding
- construction process
- robust image watermarking
- neural network
- graph embedding
- von neumann
- watermarking algorithm
- vector space
- probability distribution
- learning algorithm
- information retrieval