A Systematic Approach to Continuous Graph Labeling with Application to Computer Vision
Abstract
The discrete and continuous graph labeling problem are discussed. A basis for the continuous graph labeling problem is presented, in which an explicit connection between the discrete and continuous problems is made. The need for this basis is argued by noting conditions which must be satisfied before solutions can be pursued in a formal manner. Several cooperative solution algo-rithms based on the proposed formulation and results of the application of these algorithms to the problem of extracting line drawings are presented. I XHECIONTINlrnrlrGRAPHLAREXWGJzQRLEM A graph labeling problem is one in which a unique label, A from a set A of possible labels must be assigned to each vertex of a graph G = (V,E). The assignment
Cite
Text
Diamond et al. "A Systematic Approach to Continuous Graph Labeling with Application to Computer Vision." AAAI Conference on Artificial Intelligence, 1982.Markdown
[Diamond et al. "A Systematic Approach to Continuous Graph Labeling with Application to Computer Vision." AAAI Conference on Artificial Intelligence, 1982.](https://mlanthology.org/aaai/1982/diamond1982aaai-systematic/)BibTeX
@inproceedings{diamond1982aaai-systematic,
title = {{A Systematic Approach to Continuous Graph Labeling with Application to Computer Vision}},
author = {Diamond, M. D. and Narasimhamurthi, N. and Ganapathy, S.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1982},
pages = {50-54},
url = {https://mlanthology.org/aaai/1982/diamond1982aaai-systematic/}
}