---
title: "Optimization Approaches to the Problem of Edge Linking With a Focus on Parallel Processing"
authors:
  - "M. D. Diamond"
  - "N. Narasimhamurthi"
  - "S. Ganapathy"
doi: ""
url: "https://ijcai.org/proceedings/1983/232"
pdf: "https://ijcai.org/proceedings/1983/0232.pdf"
venue: "Proceedings of the Eighth International Joint Conference on Artificial Intelligence"
year: 1983
pages: "1003-1008"
track: "Vision"
keywords:
---

# Optimization Approaches to the Problem of Edge Linking With a Focus on Parallel Processing

M. D. Diamond, N. Narasimhamurthi, S. Ganapathy

*Proceedings of the Eighth International Joint Conference on Artificial Intelligence*, 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.