Graphs based methods for simultaneous smoothing and sharpening

Abstract

We present two new methods for simultaneous smoothing and sharpening of color images: the GMS3 (Graph Method for Simultaneous Smoothing and Sharpening) and the NGMS3(Normalized Graph-Method for Simultaneous Smoothing and Sharpening). They are based on analyzing the structure of local graphs computed at every pixel using their respective neighbors. On the one hand, we define a kernel-based filter for smoothing each pixel with the pixels associated to nodes in its same connected component. On the other hand, we modify each pixel by increasing their differences with respect to the pixels in the other connected components of those local graphs. Our approach is shown to be competitive with respect to other state-of-the-art methods that simultaneously manage both processes. • We provide two methods that carry out the process of smoothing and sharpening simultaneously. • The methods are based on the analysis of the structure of a local graph defined from the differences in the RGB space among the pixels in a 3 × 3 window. • The parameters of the method are adjusted using both observers opinion and the well-known reference image quality assessment BRISQUE (Blind/Referenceless images spatial quality Evaluator) score.

Keywords

• Color image processing
• Local graphs
• Simultaneous smoothing and sharpening