Self Annealing: Unifying Deterministic Annealing and Relaxation Labelling

@inproceedings{Rangarajan1997SelfAU,
  title={Self Annealing: Unifying Deterministic Annealing and Relaxation Labelling},
  author={Anand Rangarajan},
  booktitle={EMMCVPR},
  year={1997}
}
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach—self annealing—is introduced to bring deterministic annealing and relaxation labeling into accord. Self annealing results in an emergent linear schedule for winner-take-all and linear assignment problems. Self annihilation, a generalization of self annealing is capable of performing the useful function of symmetry breaking. The original relaxation labeling… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 43 references

Mathematical Programming Formulations for Neural Combinatorial Optimization Algorithms

  • K. Urahama
  • Journal of Artificial Neural Networks
  • 1996
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…