Hybrid lower bound on the MSE based on the Barankin and Weiss-Weinstein bounds.
Chengfang RenJérôme GalyEric ChaumettePascal LarzabalAlexandre RenauxPublished in: ICASSP (2013)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- branch and bound algorithm
- upper and lower bounds
- branch and bound
- worst case
- optimal solution
- lower bounding
- np hard
- linear programming relaxation
- objective function
- denoising
- sufficiently accurate
- randomized algorithm
- genetic algorithm
- vc dimension
- hybrid learning
- sample complexity
- visual quality
- lagrangian relaxation
- image quality
- search space
- optimal cost
- data sets