ML Anthology

Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching

Faguo Yang, Frithjof Kruggel
ICCV 2007 pp. 1-7
doi:10.1109/ICCV.2007.4409173 /iccv/2007/yang2007iccv-optimization/

Abstract

Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forward two optimization methods for graph matching and compare them in the context of brain sulcus identification. The first approach is based on a constraint search in a neighborhood; the second uses a genetic algorithm for optimization. Experiments demonstrate that both methods yield satisfactory identification rates, however, the second method is more general and easier to adapt to similar problems.

ICCV Semantic Scholar

Cite

Text

Yang and Kruggel. "Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching." IEEE/CVF International Conference on Computer Vision, 2007. doi:10.1109/ICCV.2007.4409173

Markdown

[Yang and Kruggel. "Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching." IEEE/CVF International Conference on Computer Vision, 2007.](https://mlanthology.org/iccv/2007/yang2007iccv-optimization/) doi:10.1109/ICCV.2007.4409173

BibTeX

@inproceedings{yang2007iccv-optimization,
  title     = {{Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching}},
  author    = {Yang, Faguo and Kruggel, Frithjof},
  booktitle = {IEEE/CVF International Conference on Computer Vision},
  year      = {2007},
  pages     = {1-7},
  doi       = {10.1109/ICCV.2007.4409173},
  url       = {https://mlanthology.org/iccv/2007/yang2007iccv-optimization/}
}