We analyze the problem of inverse half-toning. This problem is a particular case of a class of difficult-to-solve problems: inverse problems for reconstructing piece-wise smooth images. We show that this general problem is NP-hard. We also propose a new idea for solving problems of this type, including the inverse halftoning problem.
Published in Proceedings of the 39th Conference on Information Sciences and Systems CISS'2005, John Hopkins University, March 16-18, 2005, Paper 164.