compSPI / reconstructSPI

inverse problem solvers
2 stars 3 forks source link

iterative ref: branch and bound #3

Open geoffwoollard opened 2 years ago

geoffwoollard commented 2 years ago
geoffwoollard commented 2 years ago

See discussion in

geoffwoollard commented 2 years ago

When implementing it would be useful to benchmark what are the bottlenecks

Depending on how things are parallelized, and if the ctf is included or not in the bayes factor computations, some things could be reused between particles like the (library of slices without the ctf applied.

How to decide how finely gridded to make the grid search? By what criteria? Perhaps heuristics based on how well the signal agrees in half_map_1, half_map_2 (Fourier voxels).

geoffwoollard commented 2 years ago

See comments on healpy and benchmarking in https://github.com/compSPI/reconstructSPI/issues/13