Optimization Approaches to the Problem of Edge Linking With a Focus on Parallel Processing
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Vision. Pages 1003-1008.
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 theinherent complexity of the problem will not be reduced, thetechniques presented below will allow for a partialdecomposition of the solution algorithm. Furthermore, the approach which will be presented appears to have certain advantages over existing line tracking and graph searching algorithms.
@inproceedings{ijcai1983p232,
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 = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {1003--1008},
year = {1983},
note = {Vision},
url = {https://ijcai.org/proceedings/1983/232},
}
TY - CPAPER TI - Optimization Approaches to the Problem of Edge Linking With a Focus on Parallel Processing AU - Diamond, M. D. AU - Narasimhamurthi, N. AU - Ganapathy, S. T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 1003 EP - 1008 UR - https://ijcai.org/proceedings/1983/232 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
