A Fragile Watermarking Based on Knapsack Problem.
Hui HanHongxun YaoShaohui LiuYan LiuPublished in: PCM (3) (2004)
Keyphrases
- knapsack problem
- fragile watermarking
- optimal solution
- combinatorial optimization problems
- test problems
- optimization problems
- dynamic programming
- linear programming relaxation
- np hard
- greedy algorithm
- fragile watermarking scheme
- multidimensional knapsack problem
- exact algorithms
- np hard problems
- heuristic solution
- bicriteria
- multiple objectives
- cutting plane
- maximum profit
- worst case
- decision variables
- evolutionary algorithm
- greedy heuristic
- neural network
- probabilistic model
- vehicle routing problem
- maximum likelihood
- continuous relaxation
- linear program
- reinforcement learning
- combinatorial optimization