| ||||||||||||||||||||||||||||||||||||||||||||||||
[JTb10] A simulated annealing approach for reconstructing convex matrices and images from four projectionsConférence Internationale avec comité de lecture : ISCO 2010 - International Symposium on Combinatorial Optimization ENDM, October 2010, Vol. 36, pp.447-454, Hammamet, , Tunisie, (DOI: http://dx.doi.org/10.1016/j.endm.2010.05.057)Mots clés: Discrete tomography; convex binary matrices; integer programming; simulatedannealing
Résumé:
We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulatedannealingapproach.
Equipe:
oc
BibTeX
|
||||||||||||||||||||||||||||||||||||||||||||||||