Deterministic Annealing Algorithm

A Deterministic Annealing Algorithm is an annealing algorithm that ...

• See: Bayesian Model Averaging.

---

---

References

2011

• (Li, 2011) ⇒ Xin Li. (2011). “Image Recovery via Hybrid Sparse Representations: A Deterministic Annealing Approach." Selected Topics in Signal Processing, IEEE Journal of 5, no. 5 doi:10.1109/JSTSP.2011.2138676
  • ABSTRACT: Local smoothness and nonlocal similarity have both led to sparsity prior useful to image recovery applications. In this paper, we propose to combine the strengths of local and nonlocal sparse representations by Bayesian model averaging (BMA) where sparsity offers a plausible approximation of model posterior probabilities. An iterative thresholding-based image recovery algorithm using hybrid sparse representations is developed and its convergence property is analyzed using the theory of fixed point. Since nonlocal sparsity based on clustering relationship is nonconvex, we have borrowed the powerful idea of deterministic annealing (DA) to optimize the algorithm performance. It can be shown that as temperature decreases, our algorithm is capable of traversing different states of image structures (e.g., smooth regions, regular edges and textures). Fully reproducible experimental results are reported to support the effectiveness of the proposed image recovery algorithm.

1998

• (Rose, 1998) ⇒ Kenneth Rose. (1998). “Deterministic Annealing for Clustering, Compression, Classification, Regression, and Related Optimization Problems." Proceedings of the IEEE 86, no. 11
• (Ueda & Nakano, 1998) ⇒ Naonori Ueda, and Ryohei Nakano. (1998). “Deterministic Annealing EM Algorithm." Neural Networks 11, no. 2

---