Nonsmooth nonconvex regularization has remarkable advantages for the restoration of piecewise constant images. Constrained optimization can improve the image restoration using a priori information. In this paper, we study regularized nonsmooth nonconvex minimization with box constraints for image restoration. We present a computable positive constant θ for using nonconvex nonsmooth regularization, and show that the difference between each pixel and its four adjacent neighbors is either 0 or larger than θ in the recovered image. Moreover, we give an explicit form of θ for the box-constrained image restoration model with the non-Lipschitz nonconvex ℓp-norm (0 <; p <; 1) regularization. Our theoretical results show that any local minimizer of this imaging restoration problem is composed of constant regions surrounded by closed contours and edges. Numerical examples are presented to validate the theoretical results, and show that the proposed model can recover image restoration results very well.