We study the problem of rounding a real-valued matrix into an integer-valued matrix to minimize an Lp-discrepancy measure between them. To define the Lp-discrepancy measure, we introduce a family F of regions (rigid submatrices) of the matrix and consider a hypergraph defined by the family. The difficulty of the problem depends on the choice of the region family F . We first investigate the rounding problem by using integer programming problems with convex piecewiselinear objective functions and give some nontrivial upper bounds for the Lp discrepancy. We propose "laminar family" for constructing a practical and well-solvable class of F . Indeed, we show that the problem is solvable in polynomial time if F is the union of two laminar families. Finally, we show that the matrix rounding using L 1 discrepancy for the union of two laminar families is suitable for developing a high-quality digital-halftoning software.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.