Generalized interpretation of optimization methods for labeling problems
説明
Various combinatorial optimization methods have been considered independently. The purpose of this study is to organize theoretically those optimization methods, which differ by their natures, and to indicate clearly what are common and what are different among those methods. The authors deal with a labeling problem in the optimization methods and propose a generalized algorithm to solve the problem. They show that the algorithm can derive the conventional optimization methods, such as the relaxation matching method, neural networks, and the dynamic programming matching method. >
収録刊行物
-
- Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93)
-
Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93) 6-9, 2002-12-30
IEEE Comput. Soc. Press
