Optimization approaches to the problem of edge linking with a focus on parallel processing

Authors:
M. D. Diamond;N. Narasimhamurthi;S. Ganapathy
Affiliations:
Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI;Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI;Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 4
Cited 0

Synthesizing constraint expressions

Communications of the ACM
Computer Vision

Computer Vision
Cooperating Processes for Low-level Vision: A Survey

Cooperating Processes for Low-level Vision: A Survey
A Model-Based Vision System for Industrial Parts

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

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.