University of Groningen Institute of Mathematics and Computing Science Universitá degli Studi di Roma Tre Dipartimento di Elettronica Applicata Well Posed.

Slides:



Advertisements
Similar presentations
3-D Computer Vision CSc83020 / Ioannis Stamos  Revisit filtering (Gaussian and Median)  Introduction to edge detection 3-D Computater Vision CSc
Advertisements

Linear Filtering – Part I Selim Aksoy Department of Computer Engineering Bilkent University
Spatial Filtering (Chapter 3)
Image Processing Lecture 4
Chapter 3 Image Enhancement in the Spatial Domain.
Lecture 6 Sharpening Filters
Sliding Window Filters and Edge Detection Longin Jan Latecki Computer Graphics and Image Processing CIS 601 – Fall 2004.
CS 4487/9587 Algorithms for Image Analysis
Digital Image Processing
Digital Image Processing In The Name Of God Digital Image Processing Lecture3: Image enhancement M. Ghelich Oghli By: M. Ghelich Oghli
5. 1 Model of Image degradation and restoration
Chih-Hsing Lin, Jia-Shiuan Tsai, and Ching-Te Chiu
Lecture 4 Linear Filters and Convolution
Computer Vision Group Edge Detection Giacomo Boracchi 5/12/2007
Digital Image Processing
MSU CSE 803 Stockman Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute.
1 Image Filtering Readings: Ch 5: 5.4, 5.5, 5.6,5.7.3, 5.8 (This lecture does not follow the book.) Images by Pawan SinhaPawan Sinha formal terminology.
CS443: Digital Imaging and Multimedia Filters Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Spring 2008 Ahmed Elgammal Dept.
Image Enhancement.
1 Image filtering Images by Pawan SinhaPawan Sinha.
Artistic Edge and Corner Enhancing Smoothing
Lecture 2: Image filtering
Image Analysis Preprocessing Arithmetic and Logic Operations Spatial Filters Image Quantization.
Linear filtering.
Linear Filtering About modifying pixels based on neighborhood. Local methods simplest. Linear means linear combination of neighbors. Linear methods simplest.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Smoothing Techniques in Image Processing
CSCE 441: Computer Graphics Image Filtering Jinxiang Chai.
September 10, 2012Introduction to Artificial Intelligence Lecture 2: Perception & Action 1 Boundary-following Robot Rules 1  2  3  4  5.
Neighborhood Operations
Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5.
1 Chapter 8: Image Restoration 8.1 Introduction Image restoration concerns the removal or reduction of degradations that have occurred during the acquisition.
DIGITAL IMAGE PROCESSING Instructors: Dr J. Shanbehzadeh M.Gholizadeh M.Gholizadeh
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Image Processing Edge detection Filtering: Noise suppresion.
Image processing Fourth lecture Image Restoration Image Restoration: Image restoration methods are used to improve the appearance of an image.
Digital Image Processing Lecture 10: Image Restoration March 28, 2005 Prof. Charlene Tsai.
Chapter 5: Neighborhood Processing
Linear filtering. Motivation: Noise reduction Given a camera and a still scene, how can you reduce noise? Take lots of images and average them! What’s.
Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5.
Digital Image Processing Lecture 10: Image Restoration
Spatial Filtering (Applying filters directly on Image) By Engr. Muhammad Saqib.
Ch5 Image Restoration CS446 Instructor: Nada ALZaben.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Intelligent Vision Systems ENT 496 Image Filtering and Enhancement Hema C.R. Lecture 4.
CS 691B Computational Photography
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Linear filtering. Motivation: Image denoising How can we reduce noise in a photograph?
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Filtering (II) Dr. Chang Shu COMP 4900C Winter 2008.
Sliding Window Filters Longin Jan Latecki October 9, 2002.
Filters– Chapter 6. Filter Difference between a Filter and a Point Operation is that a Filter utilizes a neighborhood of pixels from the input image to.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Image Subtraction Mask mode radiography h(x,y) is the mask.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Digital Image Processing Lecture 10: Image Restoration
Image Pre-Processing in the Spatial and Frequent Domain
A Gentle Introduction to Bilateral Filtering and its Applications
IMAGE PROCESSING INTENSITY TRANSFORMATION AND SPATIAL FILTERING
- photometric aspects of image formation gray level images
Image filtering Images by Pawan Sinha.
Image filtering Images by Pawan Sinha.
Digital Image Processing Week IV
Non-local Means Filtering
Lecture 2: Image filtering
Image Filtering Readings: Ch 5: 5. 4, 5. 5, 5. 6, , 5
Lecture 7 Spatial filtering.
Image Enhancement in Spatial Domain: Neighbourhood Processing
Presentation transcript:

University of Groningen Institute of Mathematics and Computing Science Universitá degli Studi di Roma Tre Dipartimento di Elettronica Applicata Well Posed non-Iterative Edge and Corner Preserving Smoothing For Artistic Imaging Giuseppe Pápari, Nicolai Petkov, Patrizio Campisi

Photographical image

Output of the proposed operator

Smoothing out texture while preserving edges Input imageGaussian smoothingProposed operator Co ntents Kuwahara Filter and Generalizations Limitations Proposed Operator Results and Comparison Discussion

Kuwahara Filter and Generalizations Four local averages: Four local standard deviations: Kuwahara output For each pixel, value of m i that corresponds to the minimum standard deviation Generic pixel of the input image

Kuwahara Filter and Generalizations Edge  Only the most homogeneous region is taken into account. No smoothing across the edge  (x,y) = 1 Central pixel on the white side of the edge  (x,y) = 0 Central pixel on the black side of the edge

Kuwahara Filter and Generalizations Local averaging  Smoothing Flipping due to Minimum Variance Criterion  Edge Preserving

Kuwahara Filter and Generalizations An example Input image Kuwahara output Artifacts on texture

Kuwahara Filter and Generalizations Generalizations Number and shape of the sub-regions »Pentagons, hexagons, circles »Overlapping Weighted local averages (reducing the Gibbs phenomenon) »Gaussian-Kuwahara New class of filters (Value and criterion filter structure) »N local averages and local standard deviations (computed as convolutions) »Criterion: minimum standard deviation Connections with the PDEs theory and morphological analysis

Kuwahara Filter and Generalizations LimitationsLimitations Proposed Operator Results and Comparison Discussion

Limitations Artifacts (partially eliminable with weighted averages) Not mathematically well defined Equal standard deviations s i   Devastating instability in presence of noise

Limitations Simple one-dimensional example Input signal I(t) I(t) = kt Local averages I  t tTtTt+T Negative offset 1D Kuwahara filtering  Two sub-windows w 1 and w 2 t w2w2 t*t* I(t)I(t) w1w1

Limitations Simple one-dimensional example Input signal I(t) I(t) = kt Local averages I  t tTtTt+T Negative offset Positive offset 1D Kuwahara filtering  Two sub-windows w 1 and w 2 t w2w2 t*t* I(t)I(t) w1w1

I(t) = kt Local standard deviations Equal standard deviations I  t tTtTt+TLimitations Simple one-dimensional example Local averages m 1 (t), m 2 (t) Input signal I(t) Local std. dev. s 1 (t), s 2 (t) 1D Kuwahara filtering  Two sub-windows w 1 and w 2 t w2w2 t*t* I(t)I(t) w1w1

Limitations Input imageKuwahara filtering Proposed approach Synthetic two-dimensional example

KuwaharaLimitations Natural image example Input image Gauss-Kuwahara Shadowed area Depleted edge Our approach

Limitations Ill-posedness of the minimum variance criterion. Devastating effects in presence of noisy shadowed areas. We propose Different weighting windows w i A different selection criterion instead of the minimum standard deviation

Kuwahara Filter and Generalizations Limitations Proposed OperatorProposed Operator Results and Comparison Discussion

Proposed Operator Gaussian mask divided in N sectors  N weighting windows N local averages and local standard deviations computed as convolutions Weighting windows

Proposed Operator Selection criterion q  Only the minimum s i survives  Criterion and value Output: » Weighted average of m i » Weights equal to proportional to (s i )  q (q is a parameter) Normalization High variance  small coefficient (s i )  q  No undetermination in case of equal standard deviations!

Proposed Operator Particular cases Equal standard deviations: s 1 = s 2 = … = s N Gaussian smoothing One standard deviation is equal to zero: s k = 0 Several values of s i are equal to zero  = Arithmetic mean of the corresponding values of m i.

Proposed Operator Edge Half of the sectors have s i = 0. The other ones are not considered An example Edgeless areas: All std. dev. similar  Gaussian smoothing (no Gibbs phenomenon) Corner preservation  Automatic selection of the prominent sectors

Proposed Operator Color images 3 sets of local averages and local standard deviations, one for each color component with Same combination rule Not equivalent to apply the operator to each color component separately

Proposed Operator Independence on the color space Input imageRGBYC r C b L*a*b*

Proposed Operator Why independence? Linear transform.  independent Nonlinear transf.  almost independent for homogeneous regions Local averages

Proposed Operator Why independence? Linear transform.  independent Nonlinear transf.  almost independent for homogeneous regions Local averages Low for homogeneous regions. The degree of homogeneity of a region does not depend on the color space. Local standard deviations

Kuwahara Filter and Generalizations Limitations Proposed Operator Results and ComparisonResults and Comparison Discussion

Results and comparison Existing algorithm for comparison Kuwahara filter and generalizations Bilateral filtering Morphological filters Median filters

Input image

Proposed approach

Gauss-Kuwahara filter

Input image (blurred)

Proposed approach (deblurred)

Bilateral filtering (not deblurred)

Input image

Proposed approach

Morphological closing (Struct. elem.: Disk of radius 5px)

Morphological area open-closing

Input image

Morphological area open-closing

Proposed approach

Input image

Proposed approach

Kuwahara Filter

Morphological area open-closing

Input image

Proposed approach

Bilateral Filtering

Input image

proposed aproach

5  5 median filter

Results and comparison Larger set of results and Matlab implementation available at Graphical interface

Kuwahara Filter and Generalizations Limitations Proposed Operator Results and Comparison DiscussionDiscussion

Discussion Edge/corner preserving smoothing Undetermination for equal standard deviation » Instability in presence of noise » Discontinuities in presence of shadowed areas Criterion and value filter structure » Local averaging  Smoothing » Minimum variance criterion  Edge preserving

Discussion Proposed approach » Different windows » Different criterion  Mathematically well defined operator  Adaptive choice of the most appropriate sub-regions. Our approachGauss-KuwaharaKuwahara

Discussion Limitations » Lines are thinned » Small objects are not preserved

References G. Papari, N. Petkov, P. Campisi Artistic Edge and Corned Preserving Smoothing To appear on IEEE Transactions on Image Processing, 2007 G. Papari, N. Petkov, P. Campisi Edge and Corned Preserving Smoothing for Artistic Imaging Proceedings SPIE 2007 Image Processing: Algorithms and Systems, San Jose, CA