دانلود گزارش کارورزی و کار آموزی

چکیده : 

The problem of reconstructing a special class of binary images from their horizontal and

vertical projections is considered. We present a general framework for analyzing the worst

case complexity of this task if the image consists of more than one pairwise disjoint

component. Applying the presented techniqueweanalyze the complexity of reconstructing

canonical hv-convex binary images. We also present parameterized complexity results on

general and so-called glued hv-convex images. Moreover, we study how our results are

related to the reconstruction of permutation matrices from four projections.