Optimization Approaches to the Problem of Edge Linking with a Focus on Parallel Processing
Abstract
An important problem in computer vision, that of edge linking for contour or line drawing extraction, is approached from the point of view of a graph labeling problem. A Lagrange dual approach to an integer programming formulation of this problem will be presented. Although the inherent complexity of the problem will not be reduced, the techniques presented below will allow for a partial decomposition of the solution algorithm. Furthermore, the approach which will be presented appears to have certain advantages over existing line tracking and graph searching algorithms.
Cite
Text
Diamond et al. "Optimization Approaches to the Problem of Edge Linking with a Focus on Parallel Processing." International Joint Conference on Artificial Intelligence, 1983.Markdown
[Diamond et al. "Optimization Approaches to the Problem of Edge Linking with a Focus on Parallel Processing." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/diamond1983ijcai-optimization/)BibTeX
@inproceedings{diamond1983ijcai-optimization,
title = {{Optimization Approaches to the Problem of Edge Linking with a Focus on Parallel Processing}},
author = {Diamond, M. D. and Narasimhamurthi, N. and Ganapathy, S.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {1003-1009},
url = {https://mlanthology.org/ijcai/1983/diamond1983ijcai-optimization/}
}