Abstract
We present a hierarchical implementation of an edge-preserving smoothing algorithm on the 2 × 2 pyramid structure. The smoothed pixel values are chosen from the first three levels of the pyramid and the original image. The reduced resolution representations are analyzed in a top-down fashion by comparing the local variances with the corresponding global noise variance estimates. The global estimates are also computed in the pyramid. Close to edges the pixel values are obtained by adaptive least squares. The artifacts of region-based smoothing are eliminated by pixelwise averaging over a set of outputs obtained with the input image shifted within the 8 × 8 block of the level three parent.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
