AI Chat AI Image Generator AI Video Text to Speech

Diffuse optical tomography by simulated annealing via a spin Hamiltonian

12/24/2019

∙

by Yu Jiang, et al.

∙

∙

The inverse problem of diffuse optical tomography is solved by the Markov-chain Monte Carlo. The Metropolis algorithm or single-component Metropolis-Hastings algorithm is used. The value of the unknown parameter is disretized and a spin Hamiltonian is introduced in the cost function. Then an initial random spin configuration is brought to a converged configuration by simulated annealing.

Yu Jiang
46 publications
Manabu Machida
3 publications
Norikazu Todoroki
1 publication

research

∙ 08/01/2020

Ergodic Annealing

Simulated Annealing is the crowning glory of Markov Chain Monte Carlo Me...

0 Carlo Baldassi, et al. ∙

research

∙ 12/03/2017

Simulated Annealing Algorithm for Graph Coloring

The goal of this Random Walks project is to code and experiment the Mark...

0 Alper Kose, et al. ∙

research

∙ 08/16/2022

Quantifying Gerrymandering With Simulated Annealing

Gerrymandering is the perversion of an election based on manipulation of...

0 Stuart Wayland, et al. ∙

research

∙ 08/28/2023

Exploring the likelihood surface in multivariate Gaussian mixtures using Hamiltonian Monte Carlo

Multimodality of the likelihood in Gaussian mixtures is a well-known pro...

0 Francesca Azzolini, et al. ∙

research

∙ 10/01/2020

Analysis of the weighted kappa and its maximum with Markov moves

In this paper the notion of Markov move from Algebraic Statistics is use...

0 Fabio Rapallo, et al. ∙

research

∙ 03/15/2022

ergm 4: Computational Improvements

The ergm package supports the statistical analysis and simulation of net...

0 Pavel N. Krivitsky, et al. ∙

research

∙ 09/10/2003

Using Simulated Annealing to Calculate the Trembles of Trembling Hand Perfection

Within the literature on non-cooperative game theory, there have been a ...

0 Stuart McDonald, et al. ∙