[JT17a] Reconstruction of Nearly Convex Colored Images

Conférence Internationale avec comité de lecture : Combinatorial Image Analysis: 18th International Workshop, IWCIA 2017, June 2017, Vol. 10256, pp.30-40, Plovdiv , Bulgaria,

Auteurs: F. Jarray , G. Tlig

motcle:

Résumé: This paper studies the problem of reconstructing hv-convex images with a small number of discrete colors from two projections for each color in horizontal and vertical directions. A new integer programming based method is proposed to reconstruct nearly hv- convex colored images. Firstly, we model the reconstruction problem by a quadratic binary program. Secondly, we linearize the program into two linear binary programs. Thirdly, we solve the continuous relaxation of these programs by using IBM ILOG Cplex.

BibTeX

@inproceedings {
	JT17a,
	title	=	"{Reconstruction of Nearly Convex Colored Images}",
	author	=	" F. Jarray and G. Tlig ",
	booktitle	=	"{Combinatorial Image Analysis: 18th International Workshop, IWCIA 2017}",
	year	=	2017,
	month	=	"June",
	volume	=	10256,
	pages	=	"30-40",
	address	=	"Plovdiv , Bulgaria",
}