[CJP08] Approximating hv-convex binary matrices and images from discrete projections

Conférence Internationale avec comité de lecture : IAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery, January 2008, pp.413-422, Series LNCS 4992,

Auteurs: M.-C. Costa , F. Jarray , C. Picouleau

motcle:

Résumé: We study the problem of reconstructing hv-convex binary matrices from few projections. We solve a polynomial time case and we determine some properties of the hv-convex matrices. Since the problem is NP-complete, we provide an iterative approximation based on a longest path and a min-cost/max- ow model. The experimental results show that the reconstruction algorithm performs quite well.

BibTeX

@inproceedings {
	CJP08,
	title	=	"{Approximating hv-convex binary matrices and images from discrete projections}",
	author	=	" M.-C. Costa and F. Jarray and C. Picouleau ",
	booktitle	=	"{IAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery}",
	year	=	2008,
	month	=	"January",
	series	=	"LNCS 4992",
	pages	=	"413-422",
}