|
 
|
[CDP05] A solvable case of image reconstruction in discrete tomography
Revue Internationale avec comité de lecture : Journal Discrete Applied Mathematics, vol. 148(3), pp. 240-245, 2005
motcle:
Résumé:
A graph-theoretical model is used to show that a special case of image
reconstruction problem (with 3 colors) can be solved in polynomial time.
For the general case with 3 colors, the complexity status is open. Here we
consider that among the three colors there is one for which the total number of
multiple occurrences in a same line (row or column) is bounded by a
fixed parameter. There is no assumption on the two remaining colors.
Commentaires:
note
BibTeX
| @article { | |||
| CDP05, | |||
| title | = | "{A solvable case of image reconstruction in discrete tomography}", | |
| author | = | "M.-C. Costa and D. de Werra and C. Picouleau and D. Schindl", | |
| journal | = | "Discrete Applied Mathematics", | |
| year | = | 2005, | |
| volume | = | 148, | |
| number | = | 3, | |
| pages | = | "240-245", | |
| note | = | "{note}", | |
| } | |||
