Robust relaxation method for structural matching under uncertainty

Probabilistic relaxation labeling processes have been widely used in many different fields including image processing, pattern recognition, and artificial intelligence. However it is impossible to express conviction degrees to be related to human subjectivity. We propose a novel relaxation scheme called “robust relaxation” for structural matching under uncertainty. Since this method is constructed on the Dempster-Shafer measure, the above problem can be solved