Edge-preserving reconstruction of compressed images using projections and a divide-and-conquer strategy
In this paper we present a new non-linear image recovery algorithm which is based on the theory of projections onto convex sets (POCS) to reconstruct compressed images. We introduce a new family of convex smoothness constraint sets. These sets are based on the concept of the line process which models explicitly the edge structure of images and thus can eliminate both ringing and blocking coding artifacts. We also introduce a divide-and-conquer (DAC) strategy to compute the projections onto the new smoothness sets efficiently. Finally, we present experiments that demonstrate the effectiveness of the new smoothness constraint sets.<<ETX>>